Title :
New
-Ary Sequence Families With Low Correlation and Large Size
Author :
Han, Yun Kyoung ; Yang, Kyeongcheol
Author_Institution :
Dept. of Electron. & Electr. Eng., Pohang Univ. of Sci. & Technol. (POSTECH), Pohang
fDate :
4/1/2009 12:00:00 AM
Abstract :
In this paper, we construct four M-ary sequence families from a power residue sequence of odd prime period p and its constant multiple sequences using the shift-and-add method, when M is a divisor of p-1. We show that the maximum correlation values of the proposed sequence families are upper-bounded by 2radicp +5 or 3radicp +4. In addition, we prove that the linear complexity of each sequence in the proposed families is either p-1 or p-[(p-1)/(M)]-1 . We also construct an M-ary sequence family from Sidel´nikov sequences of period p m-1 by applying the same method, when M is a divisor of p m-1. The proposed sequence family F tilde s has larger size than the known M-ary Sidel´nikov sequence families, whereas they all have the same upper bound on the maximum correlation.
Keywords :
code division multiple access; computational complexity; M-ary sequence families; Sidel´nikov sequences; linear complexity; maximum correlation; power residue sequence; shift-and-add method; Adaptive systems; Autocorrelation; Binary sequences; Information technology; Knowledge engineering; Mobile communication; Multiaccess communication; Multiple access interference; Upper bound; Wireless communication; Linear complexity; Sidel´nikov sequences; Weil´s theorem; low correlation; multiplicative character; polyphase sequences; power residue sequences;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2009.2013040