Achieving the Welch Bound With Difference Sets
Top Cited Papers
- 25 April 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 51 (5) , 1900-1907
- https://doi.org/10.1109/tit.2005.846411
Abstract
Consider a codebook containing N unit-norm complex vectors in a K-dimensional space. In a number of applications, the codebook that minimizes the maximal cross-correlation amplitude (I/sub max/) is often desirable. Relying on tools from combinatorial number theory, we construct analytically optimal codebooks meeting, in certain cases, the Welch lower bound. When analytical constructions are not available, we develop an efficient numerical search method based on a generalized Lloyd algorithm, which leads to considerable improvement on the achieved I/sub max/ over existing alternatives. We also derive a composite lower bound on the minimum achievable I/sub max/ that is effective for any codebook size N.Keywords
This publication has 19 references indexed in Scilit:
- The Maximum Squared Correlation, Sum Capacity, and Total Asymptotic Efficiency of Minimum Total-Squared-Correlation Binary Signature SetsIEEE Transactions on Information Theory, 2005
- On the Karystinos-Pados Bounds and Optimal Binary DS-CDMA Signature EnsemblesIEEE Communications Letters, 2004
- Grassmannian beamforming for multiple-input multiple-output wireless systemsIEEE Transactions on Information Theory, 2003
- On beamforming with finite rate feedback in multiple-antenna systemsIEEE Transactions on Information Theory, 2003
- New bounds on the total squared correlation and optimum design of ds-cdma binary signature setsIEEE Transactions on Communications, 2003
- Systematic design of unitary space-time constellationsIEEE Transactions on Information Theory, 2000
- Efficient use of side information in multiple-antenna data transmission over fading channelsIEEE Journal on Selected Areas in Communications, 1998
- Packing Lines, Planes, etc.: Packings in Grassmannian SpacesExperimental Mathematics, 1996
- Optimum sequence multisets for synchronous code-division multiple-access channelsIEEE Transactions on Information Theory, 1994
- Lower bounds on the maximum cross correlation of signals (Corresp.)IEEE Transactions on Information Theory, 1974