LDPC-based channel coding of correlated sources with iterative joint decoding

This letter considers low-density parity-check (LDPC) coding of correlated binary sources and a novel iterative joint channel decoding without communication of any side information. We demonstrate that depending on the extent of the source correlation, additional coding gains can be obtained. Two st...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2006-04, Vol.54 (4), p.577-582
Main Authors: Daneshgaran, F., Laddomada, M., Mondin, M.
Format: Article
Language:English
Subjects:
Analytical models
Applied sciences
Bit error rate
Channel coding
Channels
Coding
Coding, codes
Correlated sources
Correlation
Decoders
Decoding
Exact sciences and technology
Gain
Image coding
Information, signal and communications theory
Iterative decoding
joint decoding
low-density parity-check (LDPC) codes
Mathematical analysis
Parity check codes
Performance analysis
Signal and communications theory
Simulation
Slepian-Wolf
soft decoding
Source coding
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Timing
Transmission and modulation (techniques and equipments)
Turbo codes
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This letter considers low-density parity-check (LDPC) coding of correlated binary sources and a novel iterative joint channel decoding without communication of any side information. We demonstrate that depending on the extent of the source correlation, additional coding gains can be obtained. Two stages of iterative decoding are employed. During global iterations, updated estimates of the source correlation are obtained and passed on to the sum-product decoder that performs local iterations with a predefined stopping criterion and/or a maximum number of local decoding iterations. Simulation results indicate that very few global iterations (2-5) are sufficient to reap significant benefits from implicit knowledge of source correlation. Finally, we provide analytical performance bounds for our iterative joint decoder and comparisons with sample simulation results.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2006.873062