On the existence and construction of good codes with low peak-to-average power ratios
On the existence and construction of good codes with low peak-to-average power ratios
复制标题
DOI：
10.1109/isit.2000.866515
复制
发表时间：
2000-09
期刊：
影响因子：
--
通讯作者：
K. Paterson;V. Tarokh
中科院分区：
文献类型：
--
作者：
K. Paterson;V. Tarokh
代码/SPL CSCR/的峰值功率比（/SPL CSCR/）是该代码在OFDM Communications中使用时的重要特征。我们在可实现的三元组（r，d，papr（/spl cscr/））的区域上建立界限，其中r是代码速率，d是代码的最小欧几里得距离。在R和D方面，我们证明了PAPR的下限，并表明存在渐近的良好代码，其PAPR最多是8logn。我们通过在Galois字段和环上采用混合指数总和的界限来提供具有低PAPR的错误校正代码的明确结构。
The peak-to-average power ratio PAPR(/spl Cscr/) of a code /spl Cscr/ is an important characteristic of that code when it is used in OFDM communications. We establish bounds on the region of achievable triples (R, d, PAPR(/spl Cscr/)) where R is the code rate and d is the minimum Euclidean distance of the code. We prove a lower bound on PAPR in terms of R and d and show that there exist asymptotically good codes whose PAPR is at most 8logn. We give explicit constructions of error-correcting codes with low PAPR by employing bounds for hybrid exponential sums over Galois fields and rings.