New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality

An (N, K) codebook C is a set of N unit-norm complex vectors in \BBCK. Optimal codebooks meeting the Welch bound with equality are desirable in a number of areas. However, it is very difficult to construct such optimal codebooks. There have been a number of attempts to construct codebooks nearly meeting the Welch bound with equality, i.e., the maximal cross-correlation amplitude Imax(C) is slightly higher than the Welch bound equality, but asymptotically achieves it for large enough N. In this paper, using difference sets and the product of Abelian groups, we propose new constructions of codebooks nearly meeting the Welch bound with equality. Our methods yield many codebooks with new parameters. In some cases, our constructions are comparable to known constructions.

[1]  Nam Yul Yu,et al.  A Construction of Codebooks Associated With Binary Sequences , 2012, IEEE Transactions on Information Theory.

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

[3]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[4]  Robert W. Heath,et al.  Grassmannian beamforming for multiple-input multiple-output wireless systems , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[5]  J. Massey,et al.  Welch’s Bound and Sequence Sets for Code-Division Multiple-Access Systems , 1993 .

[6]  Cunsheng Ding,et al.  Complex Codebooks From Combinatorial Designs , 2006, IEEE Transactions on Information Theory.

[7]  Jelena Kovacevic,et al.  An Introduction to Frames , 2008, Found. Trends Signal Process..

[8]  Michael Elad,et al.  Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Joseph M. Renes,et al.  Symmetric informationally complete quantum measurements , 2003, quant-ph/0310075.

[10]  Alexander Pott,et al.  Finite Geometry and Character Theory , 1995 .

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

[12]  Solomon W. Golomb.  Cyclic Hadamard Difference Sets - Constructions and Applications , 1998, SETA.

[13]  J. Seidel,et al.  SPHERICAL CODES AND DESIGNS , 1991 .

[14]  Keqin Feng,et al.  Construction of cyclotomic codebooks nearly meeting the Welch bound , 2012, Des. Codes Cryptogr..

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

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

[17]  L. D. Baumert.  Cyclic Difference Sets , 1971 .

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

[19]  Cunsheng Ding,et al.  Codebooks from almost difference sets , 2008, Des. Codes Cryptogr..

[20]  A. Calderbank,et al.  Z4‐Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line‐Sets , 1997 .

[21]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

[22]  N. J. A. Sloane,et al.  Packing Lines, Planes, etc.: Packings in Grassmannian Spaces , 1996, Exp. Math..

[23]  Dustin G. Mixon,et al.  Steiner equiangular tight frames , 2010, 1009.5730.

[24]  Hanfried Lenz,et al.  Design theory , 1985 .

[25]  Guang Gong,et al.  Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar , 2005 .

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