Arrays over roots of unity with perfect autocorrelation and good ZCZ cross-correlation

  title={Arrays over roots of unity with perfect autocorrelation and good ZCZ cross-correlation},
  author={Samuel T. Blake and Thomas E. Hall and Andrew Z. Tirkel},
  journal={Adv. Math. Commun.},
We present a new construction for two-dimensional, perfect autocorrelation arrays over roots of unity. These perfect arrays are constructed from a block of perfect column sequences. Other blocks are constructed from the first block, to generate a block-circulant structure. The columns are then multiplied by a perfect sequence over roots of unity, which, when folded into an array commensurate with our block width has the array orthogonality property. The size of the arrays is commensurate… 

Tables from this paper

A new family of arrays with low autocorrelation

For an integer n≥1, an array is called n-perfect if it has size nu×v and if its autocorrelation array has only n nonzero entries, namely nuvλi in position (iu,0) for i=0,1,…,n−1, where λ is a primitive n-th root of unity.

Construction of Perfect Auto-correlation Arrays and Zero Cross-correlation Arrays from Discrete Projections

This paper presents a new method by which sets of discrete 1D projections can be used to construct large families of 2D discrete arrays. These compact arrays have targeted, specific periodic

A multi-dimensional block-circulant perfect array construction

Both constructions use a perfect autocorrelation sequence with the array orthogonality property (AOP) and the families of $N-dimensional arrays possess pairwise zero correlation zone (ZCZ) cross-correlation.

Perfect Sequences and Arrays of Unbounded Lengths and Sizes over the Basic Quaternions

The aim of this Thesis is to provide new understanding of the existence of perfect sequences and arrays over the alphabets of quaternions and complex numbers, and multi-dimensional arrays with

Families of Multidimensional Arrays with Good Autocorrelation and Asymptotically Optimal Cross-correlation

A construction for families of 2n-dimensional arrays with asymptotically optimal pairwise cross-correlation with application to high-capacity digital watermarking of images and video is introduced.

Array Orthogonality in Higher Dimensions

The generalized array orthogonality property is used to derive a number of $n$-dimensional perfect array constructions.

Diffuse arrays that autocorrelate and project as delta-like points

Diffuse two-dimensional integer-valued arrays are demonstrated that have delta-like aperiodic autocorrelation and, simultaneously, the array sums form delta-like projections along several directions.

Necessary Conditions for the Existence of Group-Invariant Butson Matrices and a New Family of Perfect Arrays.

Let $G$ be a finite abelian group and let $\exp(G)$ denote the least common multiple of the orders of all elements of $G$. A $BH(G,h)$ matrix is a $G$-invariant $|G|\times |G|$ matrix $H$ whose

Necessary conditions for the existence of group-invariant Butson Hadamard matrices and a new family of perfect arrays

It is shown that new classes of G-invariant matrices constructed using bilinear forms over abelian groups can be used to construct a new family of perfect polyphase arrays.

Embedded Blockchains: A Synthesis of Blockchains, Spread Spectrum Watermarking, Perceptual Hashing & Digital Signatures

A scheme for detecting manipulated audio and video by using the blockchain for its data structure of a cryptographically linked list, cryptographic hashing for absolute comparisons, perceptual hashing for flexible comparisons, and digital signatures for proof of ownership to embed the blockchain into the background noise of the media.



Two-dimensional perfect quaternary arrays

Two-dimensional arrays of fourth roots of unity which have all out-of-phase periodic autocorrelations equal to zero are studied, generalizing the concept of a perfect binary array and are called perfect quaternary arrays.

Pseudo-random sequences and arrays

A simple description of pseudo-random sequences, or maximal-length shift-register sequences, and two-dimensional arrays of area n = 2lm- 1 with the same property.

Sequences and arrays with perfect periodic correlation

Properties and methods for synthesizing sequences with perfect periodic autocorrelation functions and good energy efficiency are discussed. The construction is extended to two-dimensional perfect

On non-existence of perfect and nearly perfect sequences

We study the complex p-ary perfect and nearly perfect sequences where p is an odd prime and show that the existence of such sequences is equivalent to the existence of certain kinds of difference

Infinite families of perfect binary arrays

The author constructs four infinite families of perfect binary arrays. Jedwab and Mitchell have constructed some small perfect binary arrays using quasiperfect binary arrays and doubly quasiperfect

Perfect N-Phase Sequences and Arrays

It is shown that perfect sequences and arrays have periodic autocorrelation functions whose out-of-phase values are zero and time-discrete N-phase sequences have complex elements of magnitude one.

Polyphase codes with good nonperiodic correlation properties

  • R. Frank
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1963
N -phase Codes are described which have an autocorrelation function with one main peak and very small side peaks and doppler shift effects appear to be similar to those of linear FM radar pulse compression.

Phase shift pulse codes with good periodic correlation properties

A method of generating phase shift pulse codes of arbitrarily long length with zero periodic correlation except for the peak for zero shift is presented. The codes are of length p^2 where p is any