Joint turbo decoding and estimation of hidden Markov sources

被引:56
作者
Garcia-Frias, J [1 ]
Villasenor, JD
机构
[1] Univ Delaware, Dept Elect & Comp Engn, Newark, DE 19716 USA
[2] Univ Calif Los Angeles, Dept Elect Engn, Los Angeles, CA 90024 USA
关键词
Baum-Welch algorithm; hidden Markov sources; iterative decoding; joint source-channel coding; turbo codes;
D O I
10.1109/49.947032
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We describe a joint source-channel scheme for modifying a turbo decoder in order to exploit the statistical characteristics of hidden Markov sources. The basic idea is to treat the trellis describing the hidden Markov source as another constituent decoder which exchanges information with the other constituent decoder blocks. The source block uses as extrinsic information the probability of the input bits that is provided by the constituent decoder blocks. On the other hand, it produces a new estimation of such a probability which will be used as extrinsic information by the constituent turbo decoders. The proposed joint source-channel decoding technique leads to significantly improved performance relative to systems in which source statistics are not exploited and avoids the need to perform any explicit source coding prior to transmission. Lack of a priori knowledge of the source parameters does not degrade the performance of the system, since these parameters can be jointly estimated with turbo decoding.
引用
收藏
页码:1671 / 1679
页数:9
相关论文
共 13 条
[1]   Channel codes that exploit the residual redundancy in CELP-encoded speech [J].
Alajaji, FI ;
Phamdo, NC ;
Fuja, TE .
IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING, 1996, 4 (05) :325-336
[2]   OPTIMAL DECODING OF LINEAR CODES FOR MINIMIZING SYMBOL ERROR RATE [J].
BAHL, LR ;
COCKE, J ;
JELINEK, F ;
RAVIV, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (02) :284-287
[3]   GROWTH TRANSFORMATIONS FOR FUNCTIONS ON MANIFOLDS [J].
BAUM, LE ;
SELL, GR .
PACIFIC JOURNAL OF MATHEMATICS, 1968, 27 (02) :211-&
[4]   STATISTICAL INFERENCE FOR PROBABILISTIC FUNCTIONS OF FINITE STATE MARKOV CHAINS [J].
BAUM, LE ;
PETRIE, T .
ANNALS OF MATHEMATICAL STATISTICS, 1966, 37 (06) :1554-&
[5]   A Soft-Input Soft-Output APP Module for Iterative Decoding of Concatenated Codes [J].
Benedetto, S. ;
Divsalar, D. ;
Montorsi, G. ;
Pollara, F. .
IEEE COMMUNICATIONS LETTERS, 1997, 1 (01) :22-24
[6]   Near optimum error correcting coding and decoding: Turbo-codes [J].
Berrou, C ;
Glavieux, A .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1996, 44 (10) :1261-1271
[7]  
BERROU C, P ICC 93, P1064
[8]   Turbo decoding of hidden Markov sources with unknown parameters [J].
Garcia-Frias, J ;
Villasenor, JD .
DCC '98 - DATA COMPRESSION CONFERENCE, 1998, :159-168
[9]   Combining Hidden Markov Source Models and Parallel Concatenated Codes [J].
Garcia-Frias, Javier ;
Villasenor, John D. .
IEEE COMMUNICATIONS LETTERS, 1997, 1 (04) :111-113
[10]  
GARCIAFRIAS J, 1999, P 50 IEEE VEH TECHN, P1580