On Meeting the Peak Correlation Bounds

In this paper, we study the problem of meeting peak periodic or aperiodic correlation bounds for complex-valued sets of sequences. To this end, the Welch, Levenstein, and Exponential bounds on the peak inner-product of sequence sets are considered and used to provide compound peak correlation bounds in both periodic and aperiodic cases. The peak aperiodic correlation bound is further improved by using the intrinsic dimension deficiencies associated with its formulation. In comparison to the compound bound, the new aperiodic bound contributes an improvement of more than 35% for some specific values of the sequence length n and set cardinality m. We study the tightness of the provided bounds by using both analytical and computational tools. In particular, novel algorithms based on alternating projections are devised to approach a given peak periodic or aperiodic correlation bound. Several numerical examples are presented to assess the tightness of the provided correlation bounds as well as to illustrate the effectiveness of the proposed methods for meeting these bounds.

[1]  Georgios B. Giannakis,et al.  Achieving the Welch bound with difference sets , 2005, IEEE Transactions on Information Theory.

[2]  Jonathan Jedwab,et al.  The peak sidelobe level of families of binary sequences , 2006, IEEE Transactions on Information Theory.

[3]  Lloyd R. Welch,et al.  Lower bounds on the maximum cross correlation of signals (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[4]  Massimo Fornasier,et al.  Compressive Sensing and Structured Random Matrices , 2010 .

[5]  J. Kovacevic,et al.  Life Beyond Bases: The Advent of Frames (Part II) , 2007, IEEE Signal Processing Magazine.

[6]  Robert W. Heath,et al.  Designing structured tight frames via an alternating projection method , 2005, IEEE Transactions on Information Theory.

[7]  Thomas Strohmer,et al.  GRASSMANNIAN FRAMES WITH APPLICATIONS TO CODING AND COMMUNICATION , 2003, math/0301135.

[8]  Jian Li,et al.  Joint Design of the Receive Filter and Transmit Sequence for Active Sensing , 2013, IEEE Signal Processing Letters.

[9]  Hao He,et al.  Designing Unimodular Sequence Sets With Good Correlations—Including an Application to MIMO Radar , 2009, IEEE Transactions on Signal Processing.

[10]  Joseph J. Rushanan.  Weil Sequences: A Family of Binary Sequences with Good Correlation Properties , 2006, 2006 IEEE International Symposium on Information Theory.

[11]  Dimitris A. Pados,et al.  New Bounds and Optimal Binary Signature Sets - Part II: Aperiodic Total Squared Correlation , 2011, IEEE Transactions on Communications.

[12]  Petre Stoica,et al.  Designing Unimodular Codes Via Quadratic Optimization , 2013, IEEE Transactions on Signal Processing.

[13]  Dominic C. O'Brien,et al.  Optimizing Polyphase Sequences for Orthogonal Netted Radar , 2006, IEEE Signal Processing Letters.

[14]  Dilip V. Sarwate.  Meeting the Welch Bound with Equality , 1998, SETA.

[15]  Stephen D. Howard,et al.  Geometry of the Welch Bounds , 2009, ArXiv.

[16]  Ruizhong Wei,et al.  Aperiodic Correlation of Complex Sequences from Difference Sets , 2008, 2008 IEEE International Conference on Communications.

[17]  Pedram Pad,et al.  Constructing and decoding GWBE codes using Kronecker products , 2010, IEEE Communications Letters.

[18]  Hao He,et al.  Sequence Sets With Optimal Integrated Periodic Correlation Level , 2010, IEEE Signal Processing Letters.

[19]  Pingzhi Fan,et al.  Construction and comparison of periodic digital sequence sets , 1997 .

[20]  Cunsheng Ding,et al.  Signal Sets From Functions With Optimum Nonlinearity , 2007, IEEE Transactions on Communications.

[21]  T. Strohmer,et al.  On the design of optimal spreading sequences for CDMA systems , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[22]  T. Kasami.  WEIGHT DISTRIBUTION FORMULA FOR SOME CLASS OF CYCLIC CODES , 1966 .

[23]  Petre Stoica,et al.  Computational Design of Sequences With Good Correlation Properties , 2012, IEEE Transactions on Signal Processing.

[24]  Cunsheng Ding,et al.  A Generic Construction of Complex Codebooks Meeting the Welch Bound , 2007, IEEE Transactions on Information Theory.

[25]  Tohru Kohda,et al.  Chip-Asynchronous Version of Welch Bound: Gaussian Pulse Improves BER Performance , 2006, SETA.

[26]  Dimitris A. Pados,et al.  New Bounds and Optimal Binary Signature Sets - Part I: Periodic Total Squared Correlation , 2011, IEEE Trans. Commun..

[27]  Guang Gong,et al.  New designs for signal sets with low cross correlation, balance property, and largelinear span: GF(p) case , 2002, IEEE Trans. Inf. Theory.

[28]  Keqin Feng,et al.  Two Classes of Codebooks Nearly Meeting the Welch Bound , 2012, IEEE Transactions on Information Theory.

[29]  Hao He,et al.  On Aperiodic-Correlation Bounds , 2010, IEEE Signal Processing Letters.

[30]  Petre Stoica,et al.  Perfect Root-Of-Unity Codes with prime-size alphabet , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[31]  R. Gold,et al.  Optimal binary sequences for spread spectrum multiplexing (Corresp.) , 1967, IEEE Trans. Inf. Theory.

[32]  John Marcus,et al.  On the size of binary MWBE sequence sets , 2011, 2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks.