Iterative source coded modulation: Exit charts, complexity comparisons and new index assignments

Author

Clevorn, Thorsten ; Vary, Peter

Author_Institution

Inst. of Commun. Syst. & Data Process., RWTH Aachen Univ., Aachen, Germany

fYear

2005

fDate

4-8 Sept. 2005

Firstpage

1

Lastpage

4

Abstract

Iterative source coded modulation (ISCM) improves the error concealment for source codec parameters without increasing the transmitted bit rate by combining iterative demodulation of higher order modulations and the usage of residual source redundancy in a Turbo process. In this paper we present the enhanced capabilities of ISCM when novel index assignments are applied. A doubling of the previously achievable logarithmic gains [1] is possible. Furthermore, the convergence properties of ISCM are analyzed by EXIT charts and the computational complexity is compared to a rate-1 iterative source-channel decoding (ISCD) system [2]. ISCM exhibits a competitive performance in relation to an equally complex ISCD system.

Keywords

combined source-channel coding; computational complexity; convergence; iterative decoding; redundancy; turbo codes; EXIT charts; ISCD system; ISCM; ISCM capability enhancement; complexity comparisons; computational complexity; convergence properties; error concealment improvement; higher order modulations; index assignments; iterative demodulation; iterative source coded modulation; logarithmic gains; rate-1 iterative source-channel decoding system; residual source redundancy usage; source codec parameters; transmitted bit rate; turbo process; AWGN; Abstracts; Complexity theory; Indexes; Modulation; Niobium; Signal to noise ratio;

fLanguage

English

Publisher

ieee

Conference_Titel

Signal Processing Conference, 2005 13th European

Conference_Location

Antalya

Print_ISBN

978-160-4238-21-1

Type

conf

Filename

7077889