Silver Space-Time Trellis-Coded Modulation

Silver Code (SilC) was originally discovered in [1-4] for 2×2 multiple-input multiple-output (MIMO) transmission. It has non-vanishing minimum determinant 1/7, slightly lower than Golden code, but is fast-decodable, i.e., it allows reduced-complexitymaximum likelihood decoding [5-7]. In this paper, we present a multidimensional trellis-coded modulation scheme for MIMO systems [11] based on set partitioning of the Silver Code, named Silver Space-Time Trellis Coded Modulation (SST-TCM). This lattice set partitioning is designed specifically to increase the minimum determinant. The branches of the outer trellis code are labeled with these partitions. Viterbi algorithm is applied for trellis decoding, while the branch metrics are computed by using a sphere-decoding algorithm. It is shown that the proposed SST-TCM performs very closely to the Golden Space-Time Trellis Coded Modulation (GST-TCM) scheme, yet with a much reduced decoding complexity thanks to its fast-decoding property.

[1]  G. David Forney,et al.  Coset codes-II: Binary lattices and related codes , 1988, IEEE Trans. Inf. Theory.

[2]  Olav Tirkkonen,et al.  Combined information and performance optimization of linear MIMO modulations , 2002, Proceedings IEEE International Symposium on Information Theory,.

[3]  A. Robert Calderbank,et al.  Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction , 1998, IEEE Trans. Inf. Theory.

[4]  Mohammad Gharavi-Alkhansari,et al.  A 2×2 Space-Time Code with Non-Vanishing Determinants and Fast Maximum Likelihood Decoding , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[5]  Yi Hong,et al.  On Fast-Decodable Space–Time Block Codes , 2007, IEEE Transactions on Information Theory.

[6]  G. David Forney,et al.  Coset codes-I: Introduction and geometrical classification , 1988, IEEE Trans. Inf. Theory.

[7]  Siavash M. Alamouti,et al.  A simple transmit diversity technique for wireless communications , 1998, IEEE J. Sel. Areas Commun..

[8]  J. Belfiore,et al.  Partitionning the Golden Code : A framework to the design of Space-Time coded modulation , 2005 .

[9]  Emanuele Viterbo,et al.  A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.

[10]  S. Sirianunpiboon,et al.  Fast Decoding of the Golden Code by Diophantine Approximation , 2007, 2007 IEEE Information Theory Workshop.

[11]  Olav Tirkkonen,et al.  Multi-Antenna Transceiver Techniques for 3G and Beyond: Hottinen/Multi-antenna , 2003 .

[12]  Emanuele Viterbo,et al.  The golden code: a 2×2 full-rate space-time code with nonvanishing determinants , 2004, IEEE Trans. Inf. Theory.

[13]  Ezio Biglieri,et al.  Coding for Wireless Channels , 2005 .

[14]  Emanuele Viterbo,et al.  The golden code: a 2 x 2 full-rate space-time code with non-vanishing determinants , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[15]  Ari Hottinen,et al.  Precoder designs for high rate spacetime block codes , 2004 .

[16]  Naofal Al-Dhahir,et al.  A New Information Lossless STBC for 2 Transmit Antennas with Reduced-Complexity ML Decoding , 2007, 2007 IEEE 66th Vehicular Technology Conference.

[17]  G. Ungerboeck,et al.  Trellis-coded modulation with redundant signal sets Part II: State of the art , 1987, IEEE Communications Magazine.

[18]  Camilla Hollanti,et al.  On the algebraic structure of the Silver code: A 2 × 2 perfect space-time block code , 2008, 2008 IEEE Information Theory Workshop.

[19]  N. J. A. Sloane,et al.  New trellis codes based on lattices and cosets , 1987, IEEE Trans. Inf. Theory.

[20]  W. Fischer,et al.  Sphere Packings, Lattices and Groups , 1990 .

[21]  Yi Hong,et al.  Golden Space–Time Trellis Coded Modulation , 2007, IEEE Transactions on Information Theory.

[22]  Ari Hottinen,et al.  Square-matrix embeddable space-time block codes for complex signal constellations , 2002, IEEE Trans. Inf. Theory.

[23]  H. Luetkepohl The Handbook of Matrices , 1996 .