Journal of information and communication convergence engineering

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지

Complexity Reduction for Space-Time Block Codes Decoder in MIMO OFDM Systems

  • Pham Van-Su (students in Communication and Electronics Lab(CEL), Information and Communications University(ICU)) ;
  • Le Minh-Tuan (students in Communication and Electronics Lab(CEL), Information and Communications University(ICU)) ;
  • Mai Linh (students in Communication and Electronics Lab(CEL), Information and Communications University(ICU)) ;
  • Yoon Giwan (Information and Communications University(ICU))
  • Published : 2005.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is aided with the intersection of approximate polygon of searching circle and disk of constellation. Therefore, the proposed scheme can reduce the searching boundary while can avoid missing searching points. The performance of the proposed scheme is verified by computer simulation that consolidates our scheme.

Keywords

References

  1. Foschini, G. J. et al., 'On limits of wireless communications in fading environment when using multiple antennas,' Wireless Personal Communications, Vol. 6, pp. 311-335,1998 https://doi.org/10.1023/A:1008889222784
  2. Richard Van Nee et al., OFDM for wireless multimedia communications, Artech House, 2000
  3. Ham, S.; Prasad, R., 'Overview of multicarrier CDMA,' IEEE Communications Magazine, Volume: 35 Issue: 12, pp. 126-130, Dec. 1997
  4. Leonard J. Cimini, 'Analysis and simulationof a Digital mobile channel using Orthogonal Frequency Division Multiplexing,' IEEE Transaction on Communication Magazine, pp. 665-675, No.7, 1995
  5. Lizhong Zheng et aI., 'Diversity and Multiplexing: A fundamental Tradeoff in Multiple Antenna Channels,' IEEE Trans. on Information Theory, Vol. 49, No.5, pp. 1073-1096, May 2003 https://doi.org/10.1109/TIT.2003.810646
  6. Alamouti, S. M., 'A Simple Transmit Diversity Technique for Wireless Communications,' IEEE Journal Select. Areas Com., Vol. 16, No.8, pp. 1451-1458, Oct. 1998 https://doi.org/10.1109/49.730453
  7. Branka Vucetic et al., Space Time Coding, Wiley 2003
  8. Mohinder Jankiraman, Space Time codes and MIMO systems, Artech House 2004
  9. Tarokh, V. H. et aI., 'Space-Time Block Codes from Orthogonal Design,' IEEE Trans. Infor. Theorys, Vol. 45, No.5, pp. 1456-1467, July 1999 https://doi.org/10.1109/18.771146
  10. Damen, M. O., et al., 'Lattice code decoder for spacetime codes,' IEEE Com. Lett., pp. 161-163, May 2000
  11. Hochwald, B. M. et aI., 'Achieving near-capacity on a Multiple-Antenna Channel,' IEEE Trans. on Com., Vol. 51, No.3, pp. 389-399, Mar. 2003 https://doi.org/10.1109/TCOMM.2003.809789
  12. Damen, M. O., et aI., 'On Maximum-likelihood Detection and Search for the Closest Lattice Point', IEEE Trans. on Infor. Theory., Vol. 49, No. 10, pp. 2389-2401, Oct. 2003 https://doi.org/10.1109/TIT.2003.817444
  13. Ernesto Zimmermann et al., 'On the complexity of Sphere Decoding,' 7th International Symposium on Wireless Personal Multimedia Communications (WPMC04), Abano Terme, Italy 2004
  14. Babak Hassibi et al., 'On the expected complexity of sphere decoding,' Signals, Systems and Computers, 2001. Conference Record ofthe Thirty-Fifth Asilomar Conference on Vol. 2, pp. 1051-1055,pp. 4-7, Nov. 2001 https://doi.org/10.1109/ACSSC.2001.987655
  15. David Pham et al., 'An Improved Complex Sphere Decoder for VBLAST systems,' IEEE Signal Processing Letters, Vol. 11, No.9, pp. 748-751, Sept. 2004 https://doi.org/10.1109/LSP.2004.833522
  16. Golden, G. D., et al., 'Detection Algorithm and Initial Laboratory Results Using VBLAST Space Time Communication,' Elect. Lett., Vol. 35, No.1, pp. 1416, Jan. 1999 https://doi.org/10.1049/el:19991386