Moment-Based Bound on Peak-to-Average Power Ratio and Reduction with Unitary Matrix

H. Tsuda
{"title":"Moment-Based Bound on Peak-to-Average Power Ratio and Reduction with Unitary Matrix","authors":"H. Tsuda","doi":"10.1109/WCNCW.2019.8902899","DOIUrl":null,"url":null,"abstract":"Reducing Peak-to-Average Power Ratio (PAPR) is a significant task in OFDM systems. To evaluate the efficiency of PAPR-reducing methods, the complementary cumulative distribution function (CCDF) of PAPR is often used. In the situation where the central limit theorem can be applied, an approximate form of the CCDF has been obtained. On the other hand, in general situations, the bound of the CCDF has been obtained under some assumptions. In this paper, we derive the bound of the CCDF with no assumption about modulation schemes. Therefore, our bound can be applied with any codewords and that our bound is written with fourth moments of codewords. Further, we propose a method to reduce the bound with unitary matrices. With this method, it is shown that our bound is closely related to the CCDF of PAPR.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNCW.2019.8902899","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Reducing Peak-to-Average Power Ratio (PAPR) is a significant task in OFDM systems. To evaluate the efficiency of PAPR-reducing methods, the complementary cumulative distribution function (CCDF) of PAPR is often used. In the situation where the central limit theorem can be applied, an approximate form of the CCDF has been obtained. On the other hand, in general situations, the bound of the CCDF has been obtained under some assumptions. In this paper, we derive the bound of the CCDF with no assumption about modulation schemes. Therefore, our bound can be applied with any codewords and that our bound is written with fourth moments of codewords. Further, we propose a method to reduce the bound with unitary matrices. With this method, it is shown that our bound is closely related to the CCDF of PAPR.
基于矩的峰均功率比定界及酉矩阵约简
降低峰均功率比(PAPR)是OFDM系统中的一个重要课题。为了评价减少PAPR方法的效率,通常使用PAPR的互补累积分布函数(CCDF)。在中心极限定理适用的情况下,得到了CCDF的近似形式。另一方面,在一般情况下,在一定的假设条件下得到了CCDF的界。在本文中,我们推导了在没有调制方式假设的情况下CCDF的界。因此,我们的界可以应用于任何码字,并且我们的界是用码字的四阶矩来表示的。进一步,我们提出了一种用酉矩阵约简界的方法。用这种方法证明了我们的界与PAPR的CCDF密切相关。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信