Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Quasi-orthogonal sequences for code-division multiple-access 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)
Kyeongcheol Yang ; Dept. of Electron. & Electr. Eng., Pohang Inst. of Sci. & Technol., South Korea ; Young-Ky Kim ; Kumar, P.V.

The notion of quasi-orthogonal sequence (QOS) as a means of increasing the number of channels in synchronous code-division multiple-access (CDMA) systems that employ Walsh sequences for spreading information signals and separating channels is introduced. It is shown that a QOS sequence may be regarded as a class of Bent (almost Bent) functions possessing, in addition, a certain window property. Such sequences while increasing the system capacity, minimize interference to the existing set of Walsh sequences. The window property gives the system the ability to handle variable data rates. A general procedure of constructing QOSs from well-known families of binary sequences with good correlation, including the Kasami and Gold (1967) sequence families, as well as from the binary Kerdock code is provided. Examples of QOSs are presented for small lengths. Some examples of quaternary QOSs drawn from Family A are also included

Published in:

Information Theory, IEEE Transactions on  (Volume:46 ,  Issue: 3 )