By Topic

A Modified Iterative Joint Source-Channel Decoding Algorithm Based on LDPC Codes and HMMs

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
$33 $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)
Rongke Liu ; Dept. of Electronic Engineering, Beijing University of Aeronautics & Astronautics, Beijing, P.R. China, 100083. E-mail: ; Jie Gao ; Xiaolin Zhang

A modified joint source-channel decoding (JSCD) algorithm based on low-density parity-check (LDPC) codes and hidden Markov estimation has been presented and extended to applying over Rayleigh fading channels. The proposed algorithm utilizes the source residual redundancy lack of any priori information of the source parameters, and the modifications employ the self-checking and convergence mechanisms of LDPC codes in adjusting the error probability of the hidden Markov model (HMM). To show the validation of the proposed JSCD methods, we also give a framework for the density evolution analysis for JSCD. Simulation results show that the joint decoding scheme on Rayleigh fading channels greatly reduces the number of iterations and improves the system performance more than 0.7 dB. Moreover, the modified JSCD algorithm leads to the joint decoder to converge at least 10% faster than the unmodified method without any degradation in the decoding performance

Published in:

2006 IEEE Information Theory Workshop - ITW '06 Chengdu

Date of Conference:

22-26 Oct. 2006