Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/72816
Title: On algorithms searching for quasi-optimal subfamilies of GMW sequences suitable for CDMA applications
Authors: Chen, X.H. 
Lang, T.
Oksman, J.
Issue Date: 1997
Source: Chen, X.H.,Lang, T.,Oksman, J. (1997). On algorithms searching for quasi-optimal subfamilies of GMW sequences suitable for CDMA applications. Proceedings - IEEE INFOCOM 2 : 642-648. ScholarBank@NUS Repository.
Abstract: This paper studies several algorithms for constructing quasi-optimal GMW 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 applied 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 to construct the GMW quasi-optimal sub-families.
Source Title: Proceedings - IEEE INFOCOM
URI: http://scholarbank.nus.edu.sg/handle/10635/72816
ISSN: 0743166X
Appears in Collections:Staff Publications

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

Page view(s)

20
checked on Dec 9, 2017

Google ScholarTM

Check


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