An approach to fast maximum likelihood decoding of some binary codes is presented. The binary codewords are regarded as images of some C/sub g/ group code, called the projected code, defined over an Abelian group A. The neighbourhood of z, z/spl isin/A/sup N/, the vector of symbol-by-symbol soft decoding, is examined to identify the most likely codeword of C/sub g/. A small list of candidate codewords is prepared by employing certain elimination rules. A substantial reduction of computational complexity is achieved by this method.
展开▼
机译：介绍了一些二进制代码的快速最大似然解码的方法。二进制码字被视为一些C / SUB G /组代码的图像，称为投影代码，在abelian组A上定义。z，z / spl isin / a / sup n /，符号向量的邻居 - 逐个符号软解码，被检查以识别C / SUB G /的最可能码字。通过采用某些淘汰规则来编制一小部分候选码字列表。通过该方法实现计算复杂性的大幅降低。
展开▼
