1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/81613
DC FieldValue
dc.titleNovel algorithms to construct quasi-optimal GMW & m-sequence subfamilies
dc.contributor.authorChen, X.H.
dc.contributor.authorLang, T.
dc.contributor.authorOksman, J.
dc.date.accessioned2014-10-07T03:10:11Z
dc.date.available2014-10-07T03:10:11Z
dc.date.issued1996
dc.identifier.citationChen, 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.
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/81613
dc.description.abstractGMW 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.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL ENGINEERING
dc.description.sourcetitleProceedings of the International Symposium on Signal Processing and its Applications, ISSPA
dc.description.volume2
dc.description.page521-522
dc.description.coden266
dc.identifier.isiutNOT_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.