Orthogonal structured linear dispersion code for fast sphere decoding

ABSTRACT

In this paper, an orthogonal structure of Linear Dispersion Codes (LDCs) is proposed for fast Sphere Decoding (SD) in MIMO systems transmitting high level modulation. Monte Carlo simulation results show that the optimum LDCs with this orthogonal structure have nearly identical bit-error-rate (BER) performances to those of other optimal LDCs. A simplified Sphere Decoding (SD) algorithm for LDCs with the new orthogonal structure is developed to significantly reduce the decoding complexity. Computer simulation is used to study the complexity reduction of the proposed SD algorithm in a 2x4 MIMO system transmitting different numbers of QPSK, 16QAM and 64QAM symbols. Results show that the complexity reduction is more significant for the MIMO system transmitting higher level modulation.

References

1. Heath, R., and A. Paulraj, "Linear Dispersion Codes for MIMO Systems Based on Frame Theory", IEEE Trans. Sig. Proc., vol. 50, no. 10, pp. 2429--2441, October, 2002.
2. Tarokh, V., et al., "Space-Time Codes for High Data Rate Wireless Communication: Performance Criteria in the Presence of Channel Estimation Errors, Mobility, and Multiple Paths," IEEE Trans. Commun., vol. 47, no. 2, pp. 199--207, February, 1999.
3. G. D. Golden, G. J. Foschini, R. A. Valenzuela and P. W. Wolniansky, "Detection algorithm and initial laboratory results using the V-BLAST space--time communication architecture", Electronics Letters, vol. 35, no. 1, pp. 14--15, January, 1999.
4. Alamouti, S. M., "A Simple Transmit Diversity Technique for Wireless Communications", IEEE Journal Select. Areas Commun., vol. 16, no. 8, pp. 1451--1458, October, 1998.
5. V. Tarokh, H. Jafarkhani, and A. R. Calderbank, "Space-time block codes from orthogonal designs," IEEE Trans. on Information Theory, vol. 45, no. 5, pp. 1456--1467, July 1999.
6. O. Tirkkonen and A. Hottinen, "Square-matrix embeddable space--time block codes for complex signal constellations", IEEE Trans. Inf. Theory, vol. 48, no. 2, pp. 384--395, February 2002.
7. H. Jafarkhani, "A quasi-orthogonal space--time block code", IEEE Commun. Letters, vol. 49, no. 1, pp. 1--4, January, 2001.
8. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in lattice, including a complexity analysis", Math. Comput., vol. 44, no. 170, pp. 463--471, April, 1985.
9. Jalden J. and Ottersten B., "On the complexity of sphere decoding in digital communications", IEEE Trans. Sig., vol. 53, no. 4, pp. 1474--1484, April, 2005.
10. Ghaderipoor A. and Tellambura C., "A Statistical Pruning Strategy for Schnorr-Euchner Sphere Decoding," IEEE Communications Letters, vol. 12, Issue 2, pp. 121--123, February, 2008
11. Su K., Wassell I. J., "A New Ordering for Efficient Sphere Decoding," IEEE International Conference on Communications, 2005. vol. 3, pp. 1906--1910, May, 2005
12. J. Paredes, A. B. Gershman, and M. G. Alkhanari, "A 2x2 space--time code with non-vanishing determinants and fast maximum likelihood decoding", Proc. ICASSP., vol. 2, pp. 877--880, April, 2007.
13. Ezio Biglieri Yi Hong Emanuele Viterbo, "A Fast-Decodable, Quasi-Orthogonal Space-Time Block Code for 4x2 MIMO", Annual Allerton Conference on Communication, Control and Computing, Illinois, Sep. 26--28, 2007.
14. X. G. Dai, S. W. Cheung and T. I. Yuk, "A New Family of Linear Dispersion Code For Fast Sphere Decoding", Canadian Conference on Electrical and Computer Engineering, St. John's, May. 3--6, 2009.

Index Terms

• Hardware

  • Communication hardware, interfaces and storage

• Networks