Analysis of low density codes and improved designs using irregular graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Modern Coding Theory
Joint source-channel turbo coding for binary Markov sources
IEEE Transactions on Wireless Communications
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
IEEE Transactions on Information Theory
Universal Algorithms for Channel Decoding of Uncompressed Sources
IEEE Transactions on Information Theory
The source-channel separation theorem revisited
IEEE Transactions on Information Theory
Joint turbo decoding and estimation of hidden Markov sources
IEEE Journal on Selected Areas in Communications
Joint source-channel turbo decoding of entropy-coded sources
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In this paper a scheme for joint source-channel coding based on low-density-parity-check (LDPC) codes is investigated. Two concatenated independent LDPC codes are used in the transmitter: one for source coding and the other for channel coding, with a joint belief propagation decoder. The asymptotic behavior is analyzed using EXtrinsic Information Transfer (EXIT) charts and this approximation is corroborated with illustrative experiments. The optimization of the degree distributions for our sparse code to maximize the information transmission rate is also considered.