Cart (Loading....) | Create Account
Close category search window

New algorithms for constructing quasi-optimal subfamilies of GMW sequences for the applications in finite CDMA systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chen, X.H. ; Dept. of Electr. Eng., Nat. Univ. of Singapore, Singapore ; Lang, T. ; Oksman, J.

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. 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

Published in:

Spread Spectrum Techniques and Applications Proceedings, 1996., IEEE 4th International Symposium on  (Volume:2 )

Date of Conference:

22-25 Sep 1996

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.