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

Moment-Based Bound on Peak-to-Average Power Ratio and Reduction with Unitary Matrix
复制标题

DOI:
10.1109/wcncw.2019.8902899
复制
发表时间:
2019-02
期刊:
2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)
影响因子:
--
通讯作者:
H. Tsuda
H. Tsuda
中科院分区:
其他
文献类型:
--
作者:
H. Tsuda

文献摘要

相似文献

降低峰均功率比(PAPR)是OFDM系统中的一项重要任务。为了评估PAPR降低方法的有效性,通常使用PAPR的互补累积分布函数(CCDF)。在中心极限定理可以应用的情况下,得到了CCDF的近似形式。另一方面,在一般情况下,在一定的假设条件下得到了CCDF的界。在本文中,我们推导出的CCDF的界没有假设的调制方案。因此,我们的界限可以应用于任何码字,我们的界限是用码字的四阶矩来写的。此外,我们提出了一种方法来减少与酉矩阵的界限。利用这种方法,我们的界限是密切相关的峰均功率比的CCDF。
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.