Tradeoff between PAPR reduction and decoding complexity in transformed OFDM systems

Vijay Ahirwar, B. Rajan
{"title":"Tradeoff between PAPR reduction and decoding complexity in transformed OFDM systems","authors":"Vijay Ahirwar, B. Rajan","doi":"10.1109/ISIT.2005.1523543","DOIUrl":null,"url":null,"abstract":"It is known that in an OFDM system using Hadamard transform or phase alteration before the IDFT operation can reduce the peak-to-average power ratio (PAPR). Both these techniques can be viewed as constellation preceding for PAPR reduction. In general, using non-diagonal transforms, like Hadamard transform, increases the ML decoding complexity. In this paper we propose the use of block-IDFT matrices and show that appropriate block-IDFT matrices give lower PAPR as well as lower decoding complexity compared to using Hadamard transform. Moreover, we present a detailed study of the tradeoff between PAPR reduction and the ML decoding complexity when using block-IDFT matrices with various sizes of the blocks","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"103 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2005.1523543","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

It is known that in an OFDM system using Hadamard transform or phase alteration before the IDFT operation can reduce the peak-to-average power ratio (PAPR). Both these techniques can be viewed as constellation preceding for PAPR reduction. In general, using non-diagonal transforms, like Hadamard transform, increases the ML decoding complexity. In this paper we propose the use of block-IDFT matrices and show that appropriate block-IDFT matrices give lower PAPR as well as lower decoding complexity compared to using Hadamard transform. Moreover, we present a detailed study of the tradeoff between PAPR reduction and the ML decoding complexity when using block-IDFT matrices with various sizes of the blocks
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
变换OFDM系统中PAPR降低与译码复杂度的权衡
众所周知,在OFDM系统中,在IDFT操作之前使用Hadamard变换或相位变换可以降低峰均功率比(PAPR)。这两种技术都可以看作是减少PAPR的星座前兆。一般来说,使用非对角线变换(如Hadamard变换)会增加ML解码的复杂性。在本文中,我们提出使用块idft矩阵,并表明适当的块idft矩阵与使用Hadamard变换相比具有更低的PAPR和更低的解码复杂度。此外,我们详细研究了当使用具有不同大小块的块- idft矩阵时,PAPR降低和ML解码复杂性之间的权衡
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Upper bounds on the rate of LDPC codes as a function of minimum distance A wireless network can achieve maximum throughput without each node meeting all others Optimal linear decentralized estimation in a bandwidth constrained sensor network Near BER optimal partial response codes Bounds on mutual information rates of noisy channels with timing errors
×
引用
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