OPTIMAL SOFT DECISION BLOCK DECODERS BASED ON FAST HADAMARD-TRANSFORM

被引：62
作者：
BEERY, Y
SNYDERS, J
机构：
[1] Tel-Aviv Univ, Isr, Tel-Aviv Univ, Isr
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1986年 / 32卷 / 03期
关键词：
INFORMATION THEORY - MATHEMATICAL TRANSFORMATIONS;
D O I：
10.1109/TIT.1986.1057189
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
An approach for efficient utilization of the fast Hadamard transform in decoding binary linear block codes is presented. Computational gain is obtained by using various types of concurring codewords, and memory reduction is also achieved by appropriately selecting rows for the generator matrix. The availability of these codewords in general, and particularly in some of the most frequently encountered codes, is discussed.
引用
收藏
页码：355 / 364
页数：10
相关论文
共 23 条
[1]  
BEERY Y, UNPUB RECURSIVE HADA
[2]   THE CONSTRUCTION OF FAST, HIGH-RATE, SOFT DECISION BLOCK DECODERS [J].
BERLEKAMP, ER .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :372-377
[3]  
BLAHUT RE, 1983, THEORY PRACTICE ERRO, P392
[4]  
CLARK GC, 1969 IEEE INT S INF
[5]   FAST M-SEQUENCE TRANSFORMS [J].
COHN, M ;
LEMPEL, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (01) :135-137
[6]  
DUFFY JO, 1967, JPL SPACE PROGRAM SU, V3, P263
[7]  
ELLIOT DF, 1982, FAST TRANSFORMS ALGO, P313
[8]  
Green R. R., 1966, JPL SPACE PROGRAMS S, V4, P247
[9]  
GREEN RR, 1968, JPL SPACE PROGRAM SU, V3, P185
[10]   OPTIMUM SYMBOL-BY-SYMBOL DECODING RULE FOR LINEAR CODES [J].
HARTMANN, CRP ;
RUDOLPH, LD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (05) :514-517
123