2-D quasi m-arrays and Gold code arrays

1 March 1991

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory

Vol. 37 (2) , 385-388
https://doi.org/10.1109/18.75260

Abstract

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

Keywords

This publication has 9 references indexed in Scilit:

Linear Recurrences over Finite Fields
Published by Springer Nature ,1987
Sets of One and Higher Dimensional Welti Codes and Complementary Codes
IEEE Transactions on Aerospace and Electronic Systems, 1985
Coding for bandwidth spreading
Published by Institution of Engineering and Technology (IET) ,1985
Human Factors and Behavioral Science: Textons, The Fundamental Elements in Preattentive Vision and Perception of Textures
Bell System Technical Journal, 1983
Two-dimensional synchronization patterns for minimum ambiguity
IEEE Transactions on Information Theory, 1982
Crosscorrelation properties of pseudorandom and related sequences
Proceedings of the IEEE, 1980
An advanced coded imaging without side lobes
Optics Communications, 1978
Pseudo-random sequences and arrays
Proceedings of the IEEE, 1976
A theory of two-dimensional linear recurring arrays
IEEE Transactions on Information Theory, 1972