A Systematic Construction for Radar Arrays

The radar array problem arises from the need to design frequency hopping sequences with small out-of-phase autocorrelations. It assumes the reflected signals have negligible Doppler shifts, so the correlations are calculated along the time axis only. In this correspondence, a systematic construction for radar arrays is provided by means of homogeneous uniform difference matrices. A systematic construction for properly centered permutation matrices, a special kind of homogeneous uniform difference matrices, is also provided, which partially solves the open problems posed by Zhang and Tu.

[1]  John P. Robinson Golomb rectangles , 1985, IEEE Trans. Inf. Theory.

[2]  Gennian Ge,et al.  On (g, 4;1)-difference matrices , 2005, Discret. Math..

[3]  James B. Shearer,et al.  Some New Optimum Golomb Rectangles , 1995, Electron. J. Comb..

[4]  C. Colbourn,et al.  Mutually orthogonal latin squares (MOLS) , 2006 .

[5]  R. Julian R. Abel,et al.  Some progress on (v, 4, 1) difference families and optical orthogonal codes , 2004, J. Comb. Theory, Ser. A.

[6]  Rudolf Mathon,et al.  Constructions for Cyclic Steiner 2-designs , 1987 .

[7]  Clement W. H. Lam,et al.  Difference Families , 2001, Des. Codes Cryptogr..

[8]  Zhen Zhang,et al.  New bounds for the sizes of radar arrays , 1994, IEEE Trans. Inf. Theory.

[9]  Solomon W. Golomb,et al.  Two-dimensional synchronization patterns for minimum ambiguity , 1982, IEEE Trans. Inf. Theory.

[10]  Aart Blokhuis,et al.  Bounds for the size of radar arrays , 1988, IEEE Trans. Inf. Theory.

[11]  Jon Hamkins,et al.  Improved bounds on maximum size binary radar arrays , 1997, IEEE Trans. Inf. Theory.