OFDM系统低PMEPR高码率多相互补集的直接广义构造
A Direct and Generalized Construction of Polyphase Complementary Set with Low PMEPR and High Code-Rate for OFDM System
摘要：
正交频分复用（OFDM）系统的一个主要缺点是其高的峰均包络功率比（PMEPR）。PMEPR问题可以通过采用由具有低PMEPR的互补序列组成的大码本来解决。提出了一种利用广义布尔函数（GBF）构造多相互补集（CS）的新方法，它推广了Schmidt在2007年的构造、Paterson在2000年的构造以及Davis和Jedwab在1999年给出的Golay互补对（GCPs）.与Schmidt的方法相比，我们提出的CS导致更低的PMEPR与更高的码率从高阶（$\geq 3$）GBF构造的序列。我们得到多相互补序列的最大PMEPR的$2^{k+1}$和$2^{k+2}-2M$，其中$k,M$是非负整数，可以很容易地从GBF与CS。
英文摘要：
A major drawback of orthogonal frequency division multiplexing (OFDM) systems is their high peak-to-mean envelope power ratio (PMEPR). The PMEPR problem can be solved by adopting large codebooks consisting of complementary sequences with low PMEPR. In this paper, we present a new construction of polyphase complementary sets (CSs) using generalized Boolean functions (GBFs), which generalizes Schmidt's construction in 2007, Paterson's construction in 2000 and Golay complementary pairs (GCPs) given by Davis and Jedwab in 1999. Compared with Schmidt's approach, our proposed CSs lead to lower PMEPR with higher code-rate for sequences constructed from higher-order ($\geq 3$) GBFs. We obtain polyphase complementary sequences with maximum PMEPR of $2^{k+1}$ and $2^{k+2}-2M$ where $k,M$ are non-negative integers that can be easily derived from the GBF associated with the CS.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
