By Topic

Serially concatenated joint source-channel coding for binary Markov sources

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiaobo Zhou ; Sch. of Inf. Sci., Japan Adv. Inst. of Sci. & Technol., Ishikawa, Japan ; Anwar, K. ; Matsumoto, T.

In this paper, we propose a joint design of serially concatenated source channel coding for binary Markov sources over AWGN channels. To exploit the memory structure inherent within the sequence output from the source, modifications are made on the BCJR algorithm. To decode the outer code, the modified version of the BCJR algorithm is used, while the inner code by the standard version of the algorithm. Since optimal design of serially concatenated convolutional code falls into the problem of curve matching between the extrinsic information transfer (EXIT) curves of the inner and outer codes, we first evaluate the EXIT curve of the outer code decoded by the modified BCJR algorithm. It is then shown that the EXIT curve obtained by the modified BCJR algorithm is better matched with short memory inner convolutional code, which significantly reduces coding/decoding complexity. Numerical results demonstrate significant gains over the systems in which source statistics are not exploited (i.e., the standard BCJR algorithm is used for the both codes), and thereby narrowing the performance gap to the Shannon limit. We also compare in this paper the performance of the proposed design with the algorithm presented in [1], designed also for transmission of binary Markov source using parallel concatenated convolutional code (the authors of Ref. [1] refer the technique as Joint Source Channel Turbo Code (JSCTC)). It is shown that our proposed system is superior in both system complexity and BER performance to the JSCTC technique presented in [1].

Published in:

Communications and Networking in China (CHINACOM), 2011 6th International ICST Conference on

Date of Conference:

17-19 Aug. 2011