A low complexity PAPR reduction scheme based on radix-II IFFT

M. Kazemian, P. Varahram, B. Ali, S. Mohammady
{"title":"A low complexity PAPR reduction scheme based on radix-II IFFT","authors":"M. Kazemian, P. Varahram, B. Ali, S. Mohammady","doi":"10.1109/ICCE.2015.7066469","DOIUrl":null,"url":null,"abstract":"Due to no feedback process and simplicity in searching algorithm, conventional selected mapping (CSLM) is an efficient crest factor reduction (CFR) technique in orthogonal frequency division multiplexing (OFDM) systems. However high number of inverse fast Fourier transform (IFFT) block is required to achieve the desired PAPR reduction performance. In this paper a PAPR reduction method based on N point radix-2 IFFT is proposed in which the number of IFFTs is reduced to one. The gist of the proposed method is based on storing a part of calculations and using them for the next searching operation results in elimination of the redundant calculations. Simulation results show at least 46.8% complexity reduction compared to CSLM by comparable PAPR performance.","PeriodicalId":169402,"journal":{"name":"2015 IEEE International Conference on Consumer Electronics (ICCE)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Consumer Electronics (ICCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCE.2015.7066469","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Due to no feedback process and simplicity in searching algorithm, conventional selected mapping (CSLM) is an efficient crest factor reduction (CFR) technique in orthogonal frequency division multiplexing (OFDM) systems. However high number of inverse fast Fourier transform (IFFT) block is required to achieve the desired PAPR reduction performance. In this paper a PAPR reduction method based on N point radix-2 IFFT is proposed in which the number of IFFTs is reduced to one. The gist of the proposed method is based on storing a part of calculations and using them for the next searching operation results in elimination of the redundant calculations. Simulation results show at least 46.8% complexity reduction compared to CSLM by comparable PAPR performance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种基于基数- ii IFFT的低复杂度PAPR约简方案
传统选择映射(CSLM)由于没有反馈过程和搜索算法简单,是正交频分复用(OFDM)系统中一种有效的波峰因子降低(CFR)技术。然而,为了达到理想的PAPR降噪性能,需要大量的快速傅里叶反变换(IFFT)块。本文提出了一种基于N点基数-2 IFFT的PAPR减少方法,该方法将IFFT的个数减少到1。该方法的要点是存储部分计算结果并将其用于下一个搜索操作,从而消除冗余计算。仿真结果表明,与CSLM相比,在相同的PAPR性能下,复杂度至少降低了46.8%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Lua-based self-management framework for Internet of Things Indoor location technique based on visible light communications and ultrasound emitters LDA-based face recognition using multiple distance training face images with low user cooperation Fast and efficient haze removal Fast and robust camera's auto exposure control using convex or concave model
×
引用
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