Suboptimum decoding of decomposable block codes

Suboptimum decoding of decomposable block codes
复制标题

可分解块码的次优解码

DOI:
10.1109/18.333856
复制
发表时间:
1994
期刊:
IEEE Trans. Inf. Theory
影响因子:
--
通讯作者:
Shu Lin
Shu Lin
中科院分区:
--
文献类型:
--
作者:
T. Takata;Y. Yamashita;T. Fujiwara;T. Kasami;Shu Lin

文献摘要

参考文献

被引文献

相似文献

由于译码复杂度巨大,用最大似然译码来解码具有较大最小距离的长分组码实际上是不可能的。然而,如果一个码可以被分解成具有更小尺寸和更简单结构的组成码,就有可能设计出一个实用而有效的解码方案。本文研究了一类可分解码及其距离和结构性质。结果表明,该类包含了几个众所周知的高效码类作为子类。提出了几种构造可分解码或分解码的方法。针对AWGN信道,设计了可分解码、译码或译码联合的两阶段(软判决或硬判决)译码方案,并对其误差性能进行了分析。两阶段软判决解码是次优的。对基于所提出的两阶段软判决译码的具体可分解码的错误性能进行了评价。结果表明,所提出的两阶段次优译码方案在中等和较长的码块长度的误码性能和译码复杂度之间提供了很好的平衡。>
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. >
Tadao KASAMI:IEEE Trans.on 信息论。
DOI: --
发表时间: --
期刊:
影响因子: --
作者:
通讯作者: --
DOI: 10.1109/tit.1982.1056454
发表时间: 1982-01-01
影响因子: 2.5
作者:
UNGERBOECK, G
通讯作者: UNGERBOECK, G