Special Property of Multiple-Trellis-Coded-Modulation Utilized for its Decoding

Author

Yang, Cheng ; Zhou, Zheng ; Zou, Weixia ; Ye, Yabin

Author_Institution

Key Lab. of Universal Wireless Commun., Beijing Univ. of Posts & Telecommun., Beijing

fYear

2008

fDate

12-14 Oct. 2008

Firstpage

1

Lastpage

4

Abstract

Channel coding always plays an important role in communication systems. Decoding complexity is one factor which needs to be considered in its implementation. In this paper the decoding algorithm for MTCM is studied. Viterbi decoding algorithm for MTCM contains much more computations per trellis state transition. A most applicable decoding scheme for MTCM is proposed, which can achieve reduced computational complexity. The BER performance can approach that of the maximum likelihood decoding algorithm quickly by increasing the value of one parameter of MTCM.

Keywords

channel coding; maximum likelihood decoding; trellis coded modulation; channel coding; communication systems; decoding complexity; maximum likelihood decoding algorithm; multiple-trellis-coded-modulation; Bit error rate; Channel coding; Euclidean distance; MIMO; Maximum likelihood decoding; Performance analysis; Signal processing algorithms; Viterbi algorithm; Wireless communication; Wireless networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on

Conference_Location

Dalian

Print_ISBN

978-1-4244-2107-7

Electronic_ISBN

978-1-4244-2108-4

Type

conf

DOI

10.1109/WiCom.2008.350

Filename

4678259