Back to Search
Start Over
Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping.
- Source :
- IEEE Transactions on Information Theory; Jun2014, Vol. 60 Issue 6, p3698-3705, 8p
- Publication Year :
- 2014
-
Abstract
- In this paper, a new class of (N,K) near-optimal partial Hadamard codebooks is proposed. The construction of the proposed codebooks from Hadamard matrices is based on binary row selection sequences, which are generated by quadratic residue mapping of p -ary m -sequences. The proposed codebooks have parameters and K=({p-1}/{2p})(N+\sqrt{N})+1 for an odd prime p$ and an even positive integer $n$ . We prove that the maximum magnitude of inner products between the code vectors of the proposed codebooks asymptotically achieves the Welch bound equality for sufficiently large $p$ and derive their inner product distribution. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 60
- Issue :
- 6
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 96119514
- Full Text :
- https://doi.org/10.1109/TIT.2014.2314298