Please use this identifier to cite or link to this item:
|Title:||Searching for quasi-optimal subfamilies of m-sequences for CDMA systems|
|Authors:||Chen, X.H. |
|Citation:||Chen, X.H.,Lang, T.,Oksman, J. (1996). Searching for quasi-optimal subfamilies of m-sequences for CDMA systems. IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 1 : 113-117. ScholarBank@NUS Repository.|
|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 sub-families.|
|Source Title:||IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 3, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.