On the Construction of 64-QAM Golay Complementary Sequences
Author:
- 1 July 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Abstract
The construction of 64-QAM Golay sequences is discussed based on extensions of Lee and Golomb's construction. On length n = 2m sequences, Lee and Golomb reported 496, 808, and 976 first order offset pairs for m=2, 3, 4. We found 724, 972, and 1224 offset pairs from computer search over all first order offset pairs. Some additional pairs can be obtained by adding w = 1 to Case III in Lee and Golomb's offset pair descriptions, others are new and only exist for w>3. The descriptions of new offset pairs and the enumeration of all first order offset pairs are proposed as conjectures. The number of first order offset pairs, [240(m + 1) + 4 + 2(m - 2)(m + 1)], agrees with computer results for ;m=2~6. The peak envelope power upper bound is shown to remain as 4.6667n. An example shows that other 64-QAM Golay sequences not within this construction can be generated using QPSK Golay sequences with third order algebraic normal form.Keywords
This publication has 7 references indexed in Scilit:
- A multi-dimensional approach to the construction and enumeration of Golay complementary sequencesJournal of Combinatorial Theory, Series A, 2008
- How Do More Golay Sequences Arise?IEEE Transactions on Information Theory, 2006
- On cosets of the generalized first-order reed-muller code with low PMEPRIEEE Transactions on Information Theory, 2006
- A new construction of 64-QAM golay complementary sequencesIEEE Transactions on Information Theory, 2006
- More Golay SequencesIEEE Transactions on Information Theory, 2005
- A new construction of 16-QAM golay complementary sequencesIEEE Transactions on Information Theory, 2003
- Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codesIEEE Transactions on Information Theory, 1999