Suboptimum decoding of decomposable block codes
Suboptimum decoding of decomposable block codes
复制标题
可分解块码的次优解码
DOI:
10.1109/18.333856
复制
发表时间:
1994
期刊:
影响因子:
--
通讯作者:
Shu Lin
中科院分区:
文献类型:
--
作者:
T. Takata;Y. Yamashita;T. Fujiwara;T. Kasami;Shu Lin
To decode a long block code with a large minimum distance by maximum likelihood decoding is practically impossible because the decoding complexity is simply enormous. However, if a code can be decomposed into constituent codes with smaller dimensions and simpler structure, it is possible to devise a practical and yet efficient scheme to decode the code. This paper investigates a class of decomposable codes, their distance and structural properties. It is shown that this class includes several classes of well-known and efficient codes as subclasses. Several methods for constructing decomposable codes or decomposing codes are presented. A two-stage (soft-decision or hard-decision) decoding scheme for decomposable codes, their translates or unions of translates is devised, and its error performance is analyzed for an AWGN channel. The two-stage soft-decision decoding is suboptimum. Error performances of some specific decomposable codes based on the proposed two-stage soft-decision decoding are evaluated. It is shown that the proposed two-stage suboptimum decoding scheme provides an excellent trade-off between the error performance and decoding complexity for codes of moderate and long block length. >
DOI:
--
发表时间:
--
期刊:
影响因子:
--
作者:
通讯作者:
--
影响因子:
2.5
作者:
UNGERBOECK, G
通讯作者:
UNGERBOECK, G