Near-Complementary Sequences With Low PMEPR for Peak Power Control in Multicarrier Communications

Abstract

New families of near-complementary sequences are presented for peak power control in mul- of 24, 28, 30, 34, 36, 48, 56, 60, 62, 66, 68, 72, and 96 where no Golay pairs have been reported. The sequence families can find the potential applications for peak power control requiring codewords or sequences of various lengths as well as low PMEPRs.

Low-PMEPR Preamble Sequence Design for Dynamic Spectrum Allocation in OFDMA Systems

“…Therefore, we have H ≤ i , j ≤ 3H − 1. According to (10) and (11), we have (B 6 (i) − B 6 (j)) − (B 6 (i ) − B 6 (j )) = (A 6 (i) − A 6 (j)) − (A 6 (i ) − A 6 (j )) ≡ q 2 (mod q).…”

“…PROPOSED LOW-PMEPR PREAMBLE SEQUENCES FOR CONTIGUOUS SPECTRUMALLOCATIONIn this section, we introduce two classes of preamble sequences with good PMEPR properties of the subsequences for the OFDMA system of contiguous frequency bands allocation.A. Preamble Sequences with PMEPRs of Contiguous Subsequences Upper Bounded by10 Let m ≥ 2 be a positive integer and q be an even integer. Let…”

Improved PMEPR bound on near‐complementary sequences constructed by Yu and Gong

“…where addition is computed mudulo-H and 1 = (1, 1, …, 1) of length N. For any integer t satisfying 0 ≤ t ≤ m, the sequence s (t) of length 2 m N is obtained from the 2 t × (2 m−t N) matrix In [13], the authors proved that the shortened or extended Actually, the bound can be improved to 2k + 2 + 4 k √ /(k + 1) , (note that k is the length of the Golay sequences, not the shortened or extended Golay sequences here) which is asymptotically equivalent to 2 as the length of seed sequences k ± 1→∞. Proof: Let A(z) = k−1 i=0 j ai z i and B(z) = k−1 i=0 j bi z i be the associated polynomials of sequences a and b, respectively.…”

“…To solve the drawback that the code rate of known Golay sequences is low, near-complementary sequences of which PMEPR is bounded by a finite value c > 2 were studied in [6,[10][11][12]. Recently, Yu and Gong [13] proposed a family of near-complementary sequences of PMEPR<4 by employing shortened and extended Golay complementary pairs as the seeds.…”

New complementary sets of length $2^m$ and size 4

“…Paterson [11] extended the theory, and Chen et al [2] gave a tighter upper bound on the PMEPR of all the cosets of the generalized first Reed-Muller codes RM q (1, m). In [19], Yu and Gong proposed a method to construct near-complementary sequences, and gave several classes of near-complementary sequences with PMEPR≤ 4 by using shortened and extended Golay pairs as the seed pairs. In [16,18], the PMEPR bound of these near-complementary sequences were improved to asymptotically equivalent to 2, and new near-complementary sequences constructed by other seed pairs were also proposed.…”