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

2-D quasi m-arrays and Gold code arrays

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

2 Author(s)
Kuo, C.J. ; Dept. of Electr. Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan ; Rigas, Harriett B.

Two-dimensional quasi-maximal-area arrays (quasi-m-arrays) are proposed. These quasi-m-arrays are so named because their cyclic correlation properties are very close to those of the m-arrays. These arrays are generated by modulo-2 addition of maximal length sequences. The cyclic autocorrelation of any quasi-m-array is close to the delta-function. In addition, the cyclic cross-correlation is small compared with the cyclic autocorrelation peak. Two-dimensional Gold code arrays generated by the same construction method are also studied. Correlation properties of these Gold code arrays are similar to those of the quasi-m-arrays. The Gold code arrays provide families of arrays in which any two arrays have the bound on their cyclic cross-correlation. These arrays are also shown to have the quasi-orthogonal property

Published in:

Information Theory, IEEE Transactions on  (Volume:37 ,  Issue: 2 )

Date of Publication:

Mar 1991

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.