Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/72779
DC Field | Value | |
---|---|---|
dc.title | New algorithms for constructing quasi-optimal subfamilies of GMW sequences for the applications in finite CDMA systems | |
dc.contributor.author | Chen, X.H. | |
dc.contributor.author | Lang, T. | |
dc.contributor.author | Oksman, J. | |
dc.date.accessioned | 2014-06-19T05:11:54Z | |
dc.date.available | 2014-06-19T05:11:54Z | |
dc.date.issued | 1996 | |
dc.identifier.citation | 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. | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/72779 | |
dc.description.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. | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | ELECTRICAL ENGINEERING | |
dc.description.sourcetitle | IEEE International Symposium on Spread Spectrum Techniques & Applications | |
dc.description.volume | 2 | |
dc.description.page | 672-674 | |
dc.description.coden | 85QWA | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.