The minimum aperiodic crosscorrelation of binary sequences of size M and length n over the alphabet E={1, -1} has been obtained by Levenshtein for M≥4 and n≥2 These bounds improve a long standing bound giv...The minimum aperiodic crosscorrelation of binary sequences of size M and length n over the alphabet E={1, -1} has been obtained by Levenshtein for M≥4 and n≥2 These bounds improve a long standing bound given by Welch. In this paper, the Sarwate bounds for codes over the p th roots of unity with the same parameters M and n are discussed, that is,the lower bounds and trade off are established for the maximum magnitude of the aperiodic crosscorrelation function and the maximum magnitude of the out of phase aperiodic autocorrelation function for the sets of periodic sequences with the same parameters M and n by using the modified Levenshtein method. The results show that new bounds are tighter than Sarwate bounds and Levenshtein bounds.展开更多
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 crosscorre...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.展开更多
文摘The minimum aperiodic crosscorrelation of binary sequences of size M and length n over the alphabet E={1, -1} has been obtained by Levenshtein for M≥4 and n≥2 These bounds improve a long standing bound given by Welch. In this paper, the Sarwate bounds for codes over the p th roots of unity with the same parameters M and n are discussed, that is,the lower bounds and trade off are established for the maximum magnitude of the aperiodic crosscorrelation function and the maximum magnitude of the out of phase aperiodic autocorrelation function for the sets of periodic sequences with the same parameters M and n by using the modified Levenshtein method. The results show that new bounds are tighter than Sarwate bounds and Levenshtein bounds.
基金supported by the National Natural Science Foundation of China(NSFC)the Research Grants Council of Hong Kong(RGC)joint research scheme(Grant No.60218001)+1 种基金the NSFC project(Grant No.69931050)the National Key Laboratory of Communications(UESTC),and the Royal Society,UK.
文摘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.
