A Generalized Construction of OFDM M-QAM Sequences With Low Peak-to-Average Power Ratio

A construction of $2^{2n}$-QAM sequences is given and an upper bound of the peak-to-mean envelope power ratio (PMEPR) is determined. Some former works can be viewed as special cases of this construction.Comment: published by Advances in Mathematics of Communication

Large Zero Autocorrelation Zone of Golay Sequences and 4q4^q-QAM Golay Complementary Sequences

Sequences with good correlation properties have been widely adopted in modern communications, radar and sonar applications. In this paper, we present our new findings on some constructions of single $H$-ary Golay sequence and $4^q$-QAM Golay complementary sequence with a large zero autocorrelation zone, where $H\ge 2$ is an arbitrary even integer and $q\ge 2$ is an arbitrary integer. Those new results on Golay sequences and QAM Golay complementary sequences can be explored during synchronization and detection at the receiver end and thus improve the performance of the communication system

A Systematic Framework for the Construction of Optimal Complete Complementary Codes

The complete complementary code (CCC) is a sequence family with ideal correlation sums which was proposed by Suehiro and Hatori. Numerous literatures show its applications to direct-spread code-division multiple access (DS-CDMA) systems for inter-channel interference (ICI)-free communication with improved spectral efficiency. In this paper, we propose a systematic framework for the construction of CCCs based on $N$-shift cross-orthogonal sequence families ($N$-CO-SFs). We show theoretical bounds on the size of $N$-CO-SFs and CCCs, and give a set of four algorithms for their generation and extension. The algorithms are optimal in the sense that the size of resulted sequence families achieves theoretical bounds and, with the algorithms, we can construct an optimal CCC consisting of sequences whose lengths are not only almost arbitrary but even variable between sequence families. We also discuss the family size, alphabet size, and lengths of constructible CCCs based on the proposed algorithms