On the probability of symbol error in Viterbi decoders

被引:9
作者
Lapidoth, A
机构
[1] STANFORD UNIV, INFORMAT SYST LAB, STANFORD, CA 94305 USA
[2] AT&T BELL LABS, MURRAY HILL, NJ 07974 USA
关键词
concatenated codes; convolutional codes; interleavers; Reed-Solomon codes; transfer function; trellis codes; Viterbi decoding;
D O I
10.1109/26.554361
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
An upper bound is derived on the probability that at least one of a sequence of B consecutive bits at the output of a Viterbi decoder is in error. Such a bound is useful for the analysis of concatenated coding schemes employing an outer block code over GF(2(B)) (typically a Reed-Solomon (RS) code), an inner convolutional code, and a symbol (GF(2(B))) interleaver separating the two codes. The bound demonstrates that in such coding schemes a symbol interleaver is preferable to a bit interleaver, It also suggests a nem criterion for good inner convolutional codes.
引用
收藏
页码:152 / 155
页数:4
相关论文
共 10 条
[1]  
BERMAN T, 1992, P IPCCC 92
[2]  
Burnashev M. V., 1990, PROBLEMS INF TRANSMI, V26, P3
[3]  
FAZEL K, P GLOBECOM 89, P1528
[4]   PROBABILITY OF ERROR, EQUIVOCATION, AND CHERNOFF BOUND [J].
HELLMAN, ME ;
RAVIV, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1970, 16 (04) :368-+
[5]   ROBUSTLY OPTIMAL RATE ONE-HALF BINARY CONVOLUTIONAL CODES [J].
JOHANNESSON, R .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (04) :464-468
[6]   THE PERFORMANCE OF CONVOLUTIONAL-CODES ON THE BLOCK ERASURE CHANNEL USING VARIOUS FINITE INTERLEAVING TECHNIQUES [J].
LAPIDOTH, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (05) :1459-1473
[7]  
MASSEY J, 1994, APPL DIGITAL INFORMA
[8]   AN ALGORITHM FOR COMPUTING THE DISTANCE SPECTRUM OF TRELLIS CODES [J].
ROUANNE, M ;
COSTELLO, DJ .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1989, 7 (06) :929-940
[9]  
Viterbi A. J., 1979, PRINCIPLES DIGITAL C
[10]   ON THE PERFORMANCE EVALUATION OF TRELLIS CODES [J].
ZEHVI, E ;
WOLF, JK .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1987, 33 (02) :196-202