On The Construction Of 64-Qam Golay Complementary Sequences

PROCEEDINGS OF THE 2007 IEEE INFORMATION THEORY WORKSHOP ON INFORMATION THEORY FOR WIRELESS NETWORKS(2007)

引用 63|浏览1
暂无评分
摘要
The construction of 64-QAM Golay sequences is discussed based on extensions of Lee and Golomb's construction. On length n = 2(m) 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 m >= 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 similar to 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.
更多
查看译文
关键词
upper bound,boolean functions,ofdm,quadrature amplitude modulation,sequences,qpsk,algebraic normal form,first order
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要