Generalized silver codes

Pavan Srinath, K. ; Sundar Rajan, B. (2011) Generalized silver codes IEEE Transactions on Information Theory, 57 (9). pp. 6134-6147. ISSN 0018-9448

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/document/6006602/

Related URL: http://dx.doi.org/10.1109/TIT.2011.2162276

Abstract

For an nt transmit, nr receive antenna system (nt × nt system), a full-rate space time block code (STBC) transmits at least nmin = min(nt,nr) complex symbols per channel use. The well-known Golden code is an example of a full-rate, full-diversity STBC for two transmit antennas. Its ML-decoding complexity is of the order of M2.5 for square M-QAM. The Silver code for two transmit antennas has all the desirable properties of the Golden code except its coding gain, but offers lower ML-decoding complexity of the order of M2. Importantly, the slight loss in coding gain is negligible compared to the advantage it offers in terms of lowering the ML-decoding complexity. For higher number of transmit antennas, the best known codes are the Perfect codes, which are full-rate, full-diversity, information lossless codes (for nr ≥ nt) but have a high ML-decoding complexity of the order of Mntnmin (for nr ≥ nt, the punctured Perfect codes are considered). In this paper, a scheme to obtain full-rate STBCs for 2a transmit antennas and any nr with reduced ML-decoding complexity of the order of Mnt(nmin-3/4)-0.5 is presented. The codes constructed are also information lossless for nr ≥ nt, like the Perfect codes, and allow higher mutual information than the comparable punctured Perfect codes for nr ≥ nt. These codes are referred to as the generalized Silver codes, since they enjoy the same desirable properties as the comparable Perfect codes (except possibly the coding gain) with lower ML-decoding complexity, analogous to the Silver code and the Golden code for two transmit antennas. Simulation results of the symbol error rates for four and eight transmit antennas show that the generalized Silver codes match the punctured Perfect codes in error performance while offering lower ML-decoding complexity.

Item Type:Article
Source:Copyright of this article belongs to Institute of Electrical and Electronics Engineers.
Keywords:Low ML- Decoding Complexity; Anticommuting Matrices; Ergodic Capacity; Full-Rate Space-Time Block Codes; Information Losslessness
ID Code:106879
Deposited On:08 Dec 2017 10:06
Last Modified:08 Dec 2017 10:06

Repository Staff Only: item control page