TRUNCATION LENGTH FOR VITERBI DECODING

被引：23

作者：

ONYSZCHUK, IM

机构：

[1] Jet Propulsion Laboratory, Pasadena, CA 91109

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 1991年 / 39卷 / 07期

基金：

美国国家航空航天局;

关键词：

CONVOLUTIONAL-CODES;

D O I：

10.1109/26.87203

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

A bound is derived and analyzed for the bit error rate (BER) of a Viterbi decoder with survivor truncation. Estimates of the SNR loss on the AWGN channel, due to truncation are obtained for convolutional codes. Larger truncation lengths are required than the smallest value that does not effectively decrease the code's free distance, especially at low E(b)/N0.

引用

页码：1023 / 1026

页数：4

共 7 条

[1] DECISION DEPTHS OF CONVOLUTIONAL-CODES
ANDERSON, JB
BALACHANDRAN, K
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (02) : 455 - 459
[2] PUNCTURED CONVOLUTIONAL CODES OF RATE (N-1)-N AND SIMPLIFIED MAXIMUM LIKELIHOOD DECODING
CAIN, JB
CLARK, GC
GEIST, JM
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (01) : 97 - 100
[3] TRUNCATION ERROR PROBABILITY IN VITERBI DECODING
HEMMATI, F
COSTELLO, DJ
[J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1977, 25 (05) : 530 - 532
[4] MCELIECE RJ, 1989, P MILCOM 89, V2
[5] MEMORY MANAGEMENT IN A VITERBI DECODER
RADER, CM
[J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1981, 29 (09) : 1399 - 1401
[6] ROUANNE M, 1989, IEEE J SEL AREA COMM, V21, P881
[7] Viterbi A. J., 1979, Principles of Digital Communication and Coding

← 1 →