Codebooks from almost difference sets
Designs, Codes and Cryptography
Foundations and Trends in Signal Processing
Large Code Set for Double User Capacity and Low PAPR Level in Multicarrier Systems
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
QAM and PSK codebooks for limited feedback MIMO beamforming
IEEE Transactions on Communications
Bit-interleaved coded multiple beamforming with imperfect CSIT
IEEE Transactions on Communications
Limited feedback beamforming over temporally-correlated channels
IEEE Transactions on Signal Processing
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
DFT structured codebook design with finite alphabet for high speed wireless communications
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Diversity techniques for single-carrier packet retransmissions over frequency-selective channels
EURASIP Journal on Wireless Communications and Networking - 3GPP LTE and LTE Advanced
On reducing the complexity of tone-reservation based PAPR reduction schemes by compressive sensing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
New bounds on the total-squared-correlation of quaternary signature sets and optimal designs
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Event-driven optimal feedback control for multiantenna beamforming
IEEE Transactions on Signal Processing
IEEE Transactions on Information Theory
Beamforming in MISO systems: empirical results and EVM-based analysis
IEEE Transactions on Wireless Communications
Large-girth nonbinary QC-LDPC codes of various lengths
IEEE Transactions on Communications
Optimal fingerprinting strategies with one-sided error
Quantum Information & Computation
Unit time-phase signal sets: Bounds and constructions
Cryptography and Communications
Gauss periods and codebooks from generalized cyclotomic sets of order four
Designs, Codes and Cryptography
| Hi-index | 754.90 |
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 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 Imax over existing alternatives. We also derive a composite lower bound on the minimum achievable Imax that is effective for any codebook size N.