{"title":"基于矩的峰均功率比定界及酉矩阵约简","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":"{\"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}","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}
Moment-Based Bound on Peak-to-Average Power Ratio and Reduction with Unitary Matrix
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.