Joint source-channel turbo decoding of entropy-coded sources

IEEE Journal on Selected Areas in Communications

Volumn 19, Issue 9, 2001, Pages 1680-1696

  Guyader, A ^a   Fabre, E ^a   Guillemot, C ^a   Robert, M ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

Bayesian network; Data compression; Entropy coding; Iterative decoding; Joint source channel decoding; Probabilistic inference; Soft decoding; Turbo code; Variable length code

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); CONVOLUTIONAL CODES; DECODING; ITERATIVE METHODS; MARKOV PROCESSES; MATHEMATICAL MODELS; TURBO CODES;

BAYESIAN NETWORK; ENTROPY CODING; JOINT SOURCE CHANNEL DECODING; SOFT DECODING;

SIGNAL THEORY;

EID: 0035440571     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.947033     Document Type: Article

References (28)

1. Use of residual redundancy in the design of joint source-channel coders
2. Channel codes that exploit the residual redundancy in celp-encoded speech
3. Optimal detection of discrete Markov sources over discrete memoryless channels-Applications to combine source-channel coding
4. A constrained joint source-channel coder design
5. Joint source-channel decoding of entropy coded Markov sources over binary symmetric channels
6. A sequence-based approximate MMSE decoder for source coding over noisy channels using discrete hidden Markov models
7. Decoding entropy-coded symbols over noisy channels by MAP sequence estimation for asynchronous HMMs
8. Joint source-channel decoding of variable length encoded sources
9. Joint source-channel coding for variable length codes
10. Iterative source-channel decoding using reversible variable length codes
11. Turbo fec/vlc decoding and its application to text compression
12. Iterative source/channel decoding based on a trellis representation for variable length codes
13. Symbol-by-symbol map decoding of variable length codes
14. Near optimum error correcting coding and decoding: Turbo-codes
15. A revolution: Belief propagation in graphs with cycles
16. Turbo decoding as an instance of pearl's belief propagation algorithm
17. Graphical models
18. Fusion, propagation, and structuring in belief networks
19. New fast smoothers for multiscale systems
20. Optimal decoding of linear codes for minimizing symbol error rate
21. A calculus of stochastic systems: Specification, simulation, and hidden state estimation
22. Codes and decoding on general graphs
23. The generalized distributive law
24. From hmm to segment models: A unified view of stochastic modeling for speech recognition
25. Good error-correcting codes based on very sparse matrices
26. Iterative decoding of compound codes by probability propagation in graphical models
27. Reversible variable length codes
28. Joint source-channel soft decoding of Huffman codes with turbo codes