On Cosets of the Generalized First-Order Reed-Muller Code with Low PMEPR
Kai-Uwe Schmidt

TL;DR
This paper introduces a general method for constructing cosets of the generalized first-order Reed-Muller code with low PMEPR, expanding the family of sequences suitable for OFDM and unifying previous results.
Contribution
A new construction technique for cosets of RM_q(1,m) with low PMEPR, including near-complementary sequences, and a unified framework explaining previously unexplained phenomena.
Findings
Constructed cosets with PMEPR between 2 and 4.
Proved a lower bound on PMEPR for these cosets.
Showed upper bounds on PMEPR also apply to PAPR under Walsh-Hadamard transform.
Abstract
Golay sequences are well suited for the use as codewords in orthogonal frequency-division multiplexing (OFDM), since their peak-to-mean envelope power ratio (PMEPR) in q-ary phase-shift keying (PSK) modulation is at most 2. It is known that a family of polyphase Golay sequences of length 2^m organizes in m!/2 cosets of a q-ary generalization of the first-order Reed-Muller code, RM_q(1,m). In this paper a more general construction technique for cosets of RM_q(1,m) with low PMEPR is established. These cosets contain so-called near-complementary sequences. The application of this theory is then illustrated by providing some construction examples. First, it is shown that the m!/2 cosets of RM_q(1,m) comprised of Golay sequences just arise as a special case. Second, further families of cosets of RM_q(1,m) with maximum PMEPR between 2 and 4 are presented, showing that some previously…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPAPR reduction in OFDM · Advanced Wireless Communication Techniques · graph theory and CDMA systems
