Achieving the Welch bound with difference sets

Pengfei Xia, Shengli Zhou, Georgios B. Giannakis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

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 (Imax) is often desirable. Relying on tools from combinatorial design theory, we construct analytically optimal codebooks meeting, in certain cases, Welch's lower bound. When analytical constructions are not available, we develop an efficient numerical search method based on Lloyd's algorithm, which leads to considerable improvement on the achieved Imax over existing alternatives. We also derive a composite lower bound on the minimum achievable Imax that is effective for any N.

Original languageEnglish (US)
Title of host publication2005 IEEE International Conference on Acoustics, Speech, and Signal Processing,ICASSP '05 - Proceedings - Audio and ElectroacousticsSignal Processing for Communication
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1057-1060
Number of pages4
ISBN (Print)0780388747, 9780780388741
DOIs
StatePublished - 2005
Event2005 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP '05 - Philadelphia, PA, United States
Duration: Mar 18 2005Mar 23 2005

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
VolumeIII
ISSN (Print)1520-6149

Other

Other2005 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP '05
CountryUnited States
CityPhiladelphia, PA
Period3/18/053/23/05

Fingerprint Dive into the research topics of 'Achieving the Welch bound with difference sets'. Together they form a unique fingerprint.

Cite this