New Constructions of Zero-Correlation Zone Sequences

In this paper, we propose three classes of systematic approaches for constructing zero correlation zone (ZCZ) sequence families. In most cases, these approaches are capable of generating sequence families that achieve the upper bounds on the family size ($K$) and the ZCZ width ($T$) for a given sequence period ($N$). Our approaches can produce various binary and polyphase ZCZ families with desired parameters $(N,K,T)$ and alphabet size. They also provide additional tradeoffs amongst the above four system parameters and are less constrained by the alphabet size. Furthermore, the constructed families have nested-like property that can be either decomposed or combined to constitute smaller or larger ZCZ sequence sets. We make detailed comparisons with related works and present some extended properties. For each approach, we provide examples to numerically illustrate the proposed construction procedure.Comment: 37 pages, submitted to IEEE Transactions on Information Theor

Bounds on the Sum Capacity of Synchronous Binary CDMA Channels

In this paper, we obtain a family of lower bounds for the sum capacity of Code Division Multiple Access (CDMA) channels assuming binary inputs and binary signature codes in the presence of additive noise with an arbitrary distribution. The envelope of this family gives a relatively tight lower bound in terms of the number of users, spreading gain and the noise distribution. The derivation methods for the noiseless and the noisy channels are different but when the noise variance goes to zero, the noisy channel bound approaches the noiseless case. The behavior of the lower bound shows that for small noise power, the number of users can be much more than the spreading gain without any significant loss of information (overloaded CDMA). A conjectured upper bound is also derived under the usual assumption that the users send out equally likely binary bits in the presence of additive noise with an arbitrary distribution. As the noise level increases, and/or, the ratio of the number of users and the spreading gain increases, the conjectured upper bound approaches the lower bound. We have also derived asymptotic limits of our bounds that can be compared to a formula that Tanaka obtained using techniques from statistical physics; his bound is close to that of our conjectured upper bound for large scale systems.Comment: to be published in IEEE Transactions on Information Theor

Construction of pp-ary Sequence Families of Period (pn−1)/2(p^n-1)/2 and Cross-Correlation of pp-ary m-Sequences and Their Decimated Sequences

학위논문 (박사)-- 서울대학교 대학원 : 전기·컴퓨터공학부, 2015. 2. 노종선.This dissertation includes three main contributions: a construction of a new family of $p$-ary sequences of period $\frac{p^n-1}{2}$ with low correlation, a derivation of the cross-correlation values of decimated $p$-ary m-sequences and their decimations, and an upper bound on the cross-correlation values of ternary m-sequences and their decimations. First, for an odd prime $p = 3 \mod 4$ and an odd integer $n$, a new family of $p$-ary sequences of period $N = \frac{p^n-1}{2}$ with low correlation is proposed. The family is constructed by shifts and additions of two decimated m-sequences with the decimation factors 2 and $d = N-p^{n-1}$. The upper bound on the maximum value of the magnitude of the correlation of the family is shown to be $2\sqrt{N+1/2} = \sqrt{2p^n}$ by using the generalized Kloosterman sums. The family size is four times the period of sequences, $2(p^n-1)$. Second, based on the work by Helleseth \cite{Helleseth1}, the cross-correlation values between two decimated m-sequences by 2 and $4p^{n/2}-2$ are derived, where $p$ is an odd prime and $n = 2m$ is an integer. The cross-correlation is at most 4-valued and their values are $\{\frac{-1\pm p^{n/2}}{2}, \frac{-1+3p^{n/2}}{2}, \frac{-1+5p^{n/2}}{2}\}$. As a result, for $p^m \neq 2 \mod 3$, a new sequence family with the maximum correlation value $\frac{5}{\sqrt{2}} \sqrt{N}$ and the family size $4N$ is obtained, where $N = \frac{p^n-1}{2}$ is the period of sequences in the family. Lastly, the upper bound on the cross-correlation values of ternary m-sequences and their decimations by $d = \frac{3^{4k+2}-3^{2k+1}+2}{4}+3^{2k+1}$ is investigated, where $k$ is an integer and the period of m-sequences is $N = 3^{4k+2}-1$. The magnitude of the cross-correlation is upper bounded by $\frac{1}{2} \cdot 3^{2k+3}+1 = 4.5 \sqrt{N+1}+1$. To show this, the quadratic form technique and Bluher's results \cite{Bluher} are employed. While many previous results using quadratic form technique consider two quadratic forms, four quadratic forms are involved in this case. It is proved that quadratic forms have only even ranks and at most one of four quadratic forms has the lowest rank $4k-2$.Abstract i Contents iii List of Tables vi List of Figures vii 1. Introduction 1 1.1. Background 1 1.2. Overview of Dissertation 9 2. Sequences with Low Correlation 11 2.1. Trace Functions and Sequences 11 2.2. Sequences with Low Autocorrelation 13 2.3. Sequence Families with Low Correlation 17 3. A New Family of p-ary Sequences of Period (p^n−1)/2 with Low Correlation 21 3.1. Introduction 22 3.2. Characters 24 3.3. Gaussian Sums and Kloosterman Sums 26 3.4. Notations 28 3.5. Definition of Sequence Family 29 3.6. Correlation Bound 30 3.7. Size of Sequence Family 35 3.8. An Example 38 3.9. Related Work 40 3.10. Conclusion 41 4. On the Cross-Correlation between Two Decimated p-ary m-Sequences by 2 and 4p^{n/2}−2 44 4.1. Introduction 44 4.2. Decimated Sequences of Period (p^n−1)/2 49 4.3. Correlation Bound 53 4.4. Examples 59 4.5. A New Sequence Family of Period (p^n−1)/2 60 4.6. Discussions 61 4.7. Conclusion 67 5. On the Cross-Correlation of Ternary m-Sequences of Period 3^{4k+2} − 1 with Decimation (3^{4k+2}−3^{2k+1}+2)/4 + 3^{2k+1} 69 5.1. Introduction 69 5.2. Quadratic Forms and Linearized Polynomials 71 5.3. Number of Solutions of x^{p^s+1} − cx + c 78 5.4. Notations 79 5.5. Quadratic Form Expression of the Cross-Correlation Function 80 5.6. Ranks of Quadratic Forms 83 5.7. Upper Bound on the Cross-Correlation Function 89 5.8. Examples 93 5.9. Related Works 94 5.10. Conclusion 94 6. Conclusions 96 Bibliography 98 초록 109Docto