arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2109.07433cs.ITmath.IT
收藏

低PAPR OFDM的分块互补序列编解码

Encoding and Decoding with Partitioned Complementary Sequences for Low-PAPR OFDM

Alphan Sahin

摘要:

在这项研究中,我们提出了分区互补序列(CS)的集群之间的间隙编码信息比特,以实现低峰均功率比(PAPR)的正交频分复用(OFDM)符号。我们表明,分区规则,而不会失去的功能,是一个CS符合非挤压分区的正整数,并导致一个对称的集群分离。我们解析推导出的分区CS的数量为给定的带宽和最小距离约束,并获得相应的递归方法枚举的分离的值。我们表明,分区可以增加频谱效率(SE),而不改变字母表的非零元素的CS,即,标准CS依赖于Reed-Muller(RM)码。我们还开发了一个编码器的分区CS和基于最大似然递归解码器的加性高斯白噪声(AWGN)和衰落信道。我们的研究结果表明,分区CS下的最小距离约束可以执行类似的标准CS的平均块出错率(BLER),并提供了更高的SE在有限的信噪比(SNR)损失的代价。

英文摘要:

In this study, we propose partitioned complementary sequences (CSs) where the gaps between the clusters encode information bits to achieve low peak-to-average-power ratio (PAPR) orthogonal frequency division multiplexing (OFDM) symbols. We show that the partitioning rule without losing the feature of being a CS coincides with the non-squashing partitions of a positive integer and leads to a symmetric separation of clusters. We analytically derive the number of partitioned CSs for given bandwidth and a minimum distance constraint and obtain the corresponding recursive methods for enumerating the values of separations. We show that partitioning can increase the spectral efficiency (SE) without changing the alphabet of the nonzero elements of the CS, i.e., standard CSs relying on Reed-Muller (RM) code. We also develop an encoder for partitioned CSs and a maximum-likelihood-based recursive decoder for additive white Gaussian noise (AWGN) and fading channels. Our results indicate that the partitioned CSs under a minimum distance constraint can perform similar to the standard CSs in terms of average block error rate (BLER) and provide a higher SE at the expense of a limited signal-to-noise ratio (SNR) loss.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑