论文部分内容阅读
In order to reduce or eliminate the multiple access interference in code division multiple access (CDMA) systems, we need to design a set of spreading sequences with good autocorrelation functions (ACF) and crosscorrelation functions (CCF). The importance of the spreading codes to CDMA systems cannot be overemphasized, for the type of the code used, its length, and its chip rate set bounds on the capability of the system that can be changed only by changing the code. Several new lower bounds which are stronger than the well-known Sarwate bounds, Welch bounds and Levenshtein bounds for binary sequence set with respect to the spreading sequence length, family size, maximum aperiodic autocorrelation sidelobe and maximum aperiodic crosscorrelation value are established.
In order to reduce or eliminate the multiple access interference in code division multiple access (CDMA) systems, we need to design a set of spreading sequences with good autocorrelation functions (ACF) and crosscorrelation functions (CCF). The importance of the spreading codes to CDMA systems can not be overemphasized, for the type of the code used, its length, and its chip rate set bounds on the capability of the system that can be changed only by changing the code. Several new lower bounds which are stronger than the well- known Sarwate bounds, Welch bounds and Levenshtein bounds for binary sequence set with respect to the spreading sequence length, family size, maximum aperiodic autocorrelation sidelobe and maximum aperiodic crosscorrelation value are established.