栅格因子搜索PTS降低OFDM的PAPR

Bingyang Wu, Shixin Cheng, Haifeng Wang
{"title":"栅格因子搜索PTS降低OFDM的PAPR","authors":"Bingyang Wu, Shixin Cheng, Haifeng Wang","doi":"10.1109/PIMRC.2005.1651896","DOIUrl":null,"url":null,"abstract":"OFDM symbols exhibit a property of high peak-to-average power ratios (PAPR), which degrades system performance. Partial transmit sequence (PTS) is a kind of methods to depress the PAPR effectively. To obtain good trade-offs between complexity and performance on PAPR reduction using PTS schemes, a trellis structure based PTS factor search method is proposed and investigated in this paper. The trellis search is with a variant constraint length LC, 1lesLClesV-1, where V is the number of PTS sub-blocks. The method is to decide a PTS factor by searching all possible paths obtained by varying LC consecutive factors. Using different constraint length, trellis factor search PTS exhibits different PAPR reduction performance with different computation burden. The trellis search can be viewed as a general PTS factor search model including the full search and the iterative search appeared in previous papers","PeriodicalId":248766,"journal":{"name":"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Trellis factor search PTS for PAPR reduction in OFDM\",\"authors\":\"Bingyang Wu, Shixin Cheng, Haifeng Wang\",\"doi\":\"10.1109/PIMRC.2005.1651896\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"OFDM symbols exhibit a property of high peak-to-average power ratios (PAPR), which degrades system performance. Partial transmit sequence (PTS) is a kind of methods to depress the PAPR effectively. To obtain good trade-offs between complexity and performance on PAPR reduction using PTS schemes, a trellis structure based PTS factor search method is proposed and investigated in this paper. The trellis search is with a variant constraint length LC, 1lesLClesV-1, where V is the number of PTS sub-blocks. The method is to decide a PTS factor by searching all possible paths obtained by varying LC consecutive factors. Using different constraint length, trellis factor search PTS exhibits different PAPR reduction performance with different computation burden. The trellis search can be viewed as a general PTS factor search model including the full search and the iterative search appeared in previous papers\",\"PeriodicalId\":248766,\"journal\":{\"name\":\"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.2005.1651896\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2005.1651896","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

OFDM符号具有较高的峰均功率比(PAPR),这降低了系统性能。部分传输序列(PTS)是一种有效抑制PAPR的方法。为了在PTS方案的复杂性和性能之间取得良好的平衡,本文提出并研究了一种基于网格结构的PTS因子搜索方法。网格搜索具有可变约束长度LC, 1lesLClesV-1,其中V是PTS子块的数量。该方法是通过搜索由不同LC连续因子得到的所有可能路径来确定PTS因子。在约束长度不同的情况下,网格因子搜索PTS在计算量不同的情况下表现出不同的PAPR降低性能。网格搜索可以看作是一种通用的PTS因子搜索模型,包含了前人提出的全搜索和迭代搜索
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Trellis factor search PTS for PAPR reduction in OFDM
OFDM symbols exhibit a property of high peak-to-average power ratios (PAPR), which degrades system performance. Partial transmit sequence (PTS) is a kind of methods to depress the PAPR effectively. To obtain good trade-offs between complexity and performance on PAPR reduction using PTS schemes, a trellis structure based PTS factor search method is proposed and investigated in this paper. The trellis search is with a variant constraint length LC, 1lesLClesV-1, where V is the number of PTS sub-blocks. The method is to decide a PTS factor by searching all possible paths obtained by varying LC consecutive factors. Using different constraint length, trellis factor search PTS exhibits different PAPR reduction performance with different computation burden. The trellis search can be viewed as a general PTS factor search model including the full search and the iterative search appeared in previous papers
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Experimental investigation of undersampling for adjacent channel interference cancellation scheme Uplink Pre-Equalization Using MMSE Prediction for TDDIMC-CDMA Systems Split multi-path routing protocol with load balancing policy (SMR-LB) to improve TCP performance in mobile ad hoc networks Influence of sampling jitter on discrete time receiver OVSF code allocation and two-stage combining method to reduce inter-code interference in OFCDM system
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1