Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/72779
Title: New algorithms for constructing quasi-optimal subfamilies of GMW sequences for the applications in finite CDMA systems
Authors: Chen, X.H. 
Lang, T.
Oksman, J.
Issue Date: 1996
Source: Chen, X.H.,Lang, T.,Oksman, J. (1996). New algorithms for constructing quasi-optimal subfamilies of GMW sequences for the applications in finite CDMA systems. IEEE International Symposium on Spread Spectrum Techniques & Applications 2 : 672-674. ScholarBank@NUS Repository.
Abstract: GMW sequence possesses desirable 2-valued auto-correlation functions however with less well controlled cross-correlation functions. This paper studies several algorithms for constructing those quasi-optimal sub-families in terms of minimized bit error rate under co-channel interference. The results show that performance of resultant sub-families is very sensitive to the algorithms and sub-family sizes. A new criterion based on combinational (even plus odd) maximum cross-correlation is introduced for code selection and the resultant highest-peak-deleting and most-peak-deleting algorithms are effective.
Source Title: IEEE International Symposium on Spread Spectrum Techniques & Applications
URI: http://scholarbank.nus.edu.sg/handle/10635/72779
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

23
checked on Dec 9, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.