Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/72807
Title: Novel algorithms to construct quasi-optimal GMW & m-sequence subfamilies
Authors: Chen, X.H. 
Lang, T.
Oksman, J.
Issue Date: 1996
Source: Chen, X.H.,Lang, T.,Oksman, J. (1996). Novel algorithms to construct quasi-optimal GMW & m-sequence subfamilies. Proceedings of the International Symposium on Signal Processing and its Applications, ISSPA 2 : 521-522. ScholarBank@NUS Repository.
Abstract: GMW and m-sequences possess 2-valued auto-correlation function but their cross-correlation functions are not well controlled. This paper studies algorithms constructing their quasi-optimal sub-families. The results show that both highest-peak-deleting and most-peak-deleting algorithms are effective in terms of minimized bit error rate under co-channel interference.
Source Title: Proceedings of the International Symposium on Signal Processing and its Applications, ISSPA
URI: http://scholarbank.nus.edu.sg/handle/10635/72807
Appears in Collections:Staff Publications

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

Page view(s)

19
checked on Dec 9, 2017

Google ScholarTM

Check


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