基于星座扩展的OFDM系统峰均功率比降低新算法

Y. J. Kou, Wu Lu, A. Antoniou
{"title":"基于星座扩展的OFDM系统峰均功率比降低新算法","authors":"Y. J. Kou, Wu Lu, A. Antoniou","doi":"10.1109/PACRIM.2005.1517339","DOIUrl":null,"url":null,"abstract":"New peak-to-average power-ratio reduction (PAPR) algorithms for orthogonal frequency-division multiplexing systems are investigated in a probabilistic framework. Specifically, two de-randomization algorithms for PAPR reduction are developed by applying the so-called conditional probability method. Our simulations demonstrate that the proposed algorithms outperform several existing algorithms and the computational complexity of the proposed algorithms is found to be significantly less than that of existing algorithms.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"New peak-to-average power-ratio reduction algorithms for OFDM systems using constellation extension\",\"authors\":\"Y. J. Kou, Wu Lu, A. Antoniou\",\"doi\":\"10.1109/PACRIM.2005.1517339\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"New peak-to-average power-ratio reduction (PAPR) algorithms for orthogonal frequency-division multiplexing systems are investigated in a probabilistic framework. Specifically, two de-randomization algorithms for PAPR reduction are developed by applying the so-called conditional probability method. Our simulations demonstrate that the proposed algorithms outperform several existing algorithms and the computational complexity of the proposed algorithms is found to be significantly less than that of existing algorithms.\",\"PeriodicalId\":346880,\"journal\":{\"name\":\"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM.2005.1517339\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2005.1517339","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在概率框架下研究了正交频分复用系统的峰值平均功率比降低算法。具体地说,利用所谓的条件概率方法开发了两种减少PAPR的去随机化算法。我们的仿真表明,所提出的算法优于几种现有算法,并且所提出算法的计算复杂度明显低于现有算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
New peak-to-average power-ratio reduction algorithms for OFDM systems using constellation extension
New peak-to-average power-ratio reduction (PAPR) algorithms for orthogonal frequency-division multiplexing systems are investigated in a probabilistic framework. Specifically, two de-randomization algorithms for PAPR reduction are developed by applying the so-called conditional probability method. Our simulations demonstrate that the proposed algorithms outperform several existing algorithms and the computational complexity of the proposed algorithms is found to be significantly less than that of existing algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信