A trellis-based recursive maximum-likelihood decoding algorithm for binary linear block codes

被引：33
作者：
Fujiwara, T [1 ]
Yamamoto, H
Kasami, T
Lin, S
机构：
[1] Osaka Univ, Grad Sch Engn Sci, Osaka 560, Japan
[2] Nara Inst Sci & Technol, Grad Sch Informat Sci, Nara 63001, Japan
[3] Univ Hawaii Manoa, Dept Elect Engn, Honolulu, HI 96822 USA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1998年 / 44卷 / 02期
基金：
美国国家航空航天局; 美国国家科学基金会;
关键词：
linear block code; maximum-likelihood decoding; trellis diagram;
D O I：
10.1109/18.661515
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper presents an efficient trellis-based maximum-likelihood decoding algorithm for binary linear block codes, This algorithm is recursive in nature and is devised based on the structural properties and optimum sectionalization of a code trellis. The complexity of the proposed decoding algorithm is analyzed. Numerical results show that the proposed decoding algorithm significantly-reduces the decoding complexity. A recursive method for finding the optimum sectionalization of a trellis in terms of computational complexity is given.
引用
收藏
页码：714 / 729
页数：16
相关论文
共 18 条
[1]  
BAASE S, 1978, COMPUTER ALGORITHMS
[2]   COSET CODES .2. BINARY LATTICES AND RELATED CODES [J].
FORNEY, GD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) :1152-1187
[3]   DIMENSION LENGTH PROFILES AND TRELLIS COMPLEXITY OF LINEAR BLOCK-CODES [J].
FORNEY, GD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (06) :1741-1752
[4]   EFFICIENT PRIORITY-FIRST SEARCH MAXIMUM-LIKELIHOOD SOFT-DECISION DECODING OF LINEAR BLOCK-CODES [J].
HAN, YSS ;
HARTMANN, CRP ;
CHEN, CC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (05) :1514-1523
[5]  
KASAMI T, 1993, IEICE T FUND ELECTR, VE76A, P1411
[6]  
KASAMI T, 1993, IEEE T INFORM THEORY, V39, P1057, DOI 10.1109/18.256515
[7]   ON THE OPTIMUM BIT ORDERS WITH RESPECT TO THE STATE COMPLEXITY OF TRELLIS DIAGRAMS FOR BINARY LINEAR CODES [J].
KASAMI, T ;
TAKATA, T ;
FUJIWARA, T ;
LIN, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (01) :242-245
[8]  
KASAMI T, 1994, IEICE T FUND ELECTR, VE77A, P1058
[9]  
KASAMI T, 1997, UNPUB IEICE T FUNDAM
[10]  
KOMURA T, 1996, P 1996 INT S INF THE, P709
12