DocumentCode
3568343
Title
Searching for quasi-optimal subfamilies of m-sequences for CDMA systems
Author
Chen, X.H. ; Lang, T. ; Oksman, J.
Author_Institution
Dept. of Electr. Eng., Nat. Univ. of Singapore, Singapore
Volume
1
fYear
1996
Firstpage
113
Abstract
This paper studies several algorithms for constructing quasi-optimal m-sequence subfamilies in terms of minimized BER under co-channel interference. The results show that the performance of resultant sub-families is sensitive to the sub-family sizes and the algorithms employed. A new criterion based on combinational (even plus odd) maximum cross-correlation for the code selection is introduced, based on which both highest-peak-deleting and most-peak-deleting algorithms are effective to construct the quasi-optimal subfamilies
Keywords
binary sequences; cochannel interference; code division multiple access; correlation methods; error statistics; pseudonoise codes; spread spectrum communication; BER; CDMA systems; co-channel interference; code selection; combinational maximum cross-correlation; highest-peak-deleting algorithm; m-sequences; most-peak-deleting algorithm; quasi-optimal subfamilies; Bit error rate; Equations; Interference; Laboratories; Linear feedback shift registers; Multiaccess communication; Noise measurement; Polynomials; Shift registers; Signal to noise ratio;
fLanguage
English
Publisher
ieee
Conference_Titel
Personal, Indoor and Mobile Radio Communications, 1996. PIMRC'96., Seventh IEEE International Symposium on
Print_ISBN
0-7803-3692-5
Type
conf
DOI
10.1109/PIMRC.1996.567527
Filename
567527
Link To Document