公开(公告)号：US5926489A

公开(公告)日：1999-07-20

申请号：US754875

申请日：1996-11-22

Applicant: Daniel A. Luthi ,  Ravi Bhaskaran ,  Dojun Rhee ,  Advait M. Mogre

Inventor： Daniel A. Luthi ,  Ravi Bhaskaran ,  Dojun Rhee ,  Advait M. Mogre

IPC: H03M13/00 ,  H03M13/15 ,  H03M13/27 ,  H04L1/00 ,  H04L1/20 ,  H03M13/22

CPC classification number: H04L1/0057 ,  H03M13/00 ,  H03M13/151 ,  H03M13/2703 ,  H04L1/0071

Abstract: A communications receiver system is presented for detecting burst errors and providing erasure information to a block decoder, thereby effectively doubling the conventional correction capability of the block decoder with only a minimal increase in complexity. In one embodiment, the receiver includes a demodulator which includes circuitry to detect error bursts in the received symbol sequence. Once detected, the locations of symbols in error are marked in the form of erasure flags. An error correction decoder is then able to correct up to twice as many errors with the additional information provided by the erasure flags.

Abstract translation: 提出了一种用于检测突发错误并向块解码器提供擦除信息的通信接收机系统，从而仅以最小的复杂度增加来有效地加倍了块解码器的常规校正能力。 在一个实施例中，接收机包括解调器，其包括检测接收到的符号序列中的错误突发的电路。 一旦被检测到，错误的符号的位置被标记为擦除标志的形式。 然后纠错解码器能够利用擦除标志提供的附加信息来纠正多达两倍的错误。

公开(公告)号：US5781569A

公开(公告)日：1998-07-14

申请号：US738261

申请日：1996-10-28

Applicant: Marc P. C. Fossorier ,  Shu Lin ,  Dojun Rhee

Inventor： Marc P. C. Fossorier ,  Shu Lin ,  Dojun Rhee

IPC: H03M13/23 ,  H03M13/39 ,  H04L1/00 ,  H03M13/12

CPC classification number: H03M13/23 ,  H03M13/39 ,  H04L1/0054

Abstract: A differential trellis decoding method for convolutional codes is provided which eliminates from candidacy half of the transitions in each round that it is used, thereby obviating the need for weight calculations for the eliminated transitions. The method is based on a decomposition of the code trellis into fully connected bipartite graphs and the observation that the symmetry of the bipartite graphs of the trellis permits the comparison and selection process for one state to influence the comparison and selection process for other states in the bipartite graph. This method results in a reduced number of operations and hence a reduced complexity for convolutional decoding.

Abstract translation: 提供了一种用于卷积码的差分网格解码方法，其消除了使用它的每轮中的候选资格一半的转移，从而避免了对消除的转换的权重计算的需要。 该方法基于将代码网格分解为完全连接的二分图，并且观察到网格的二分图的对称性允许一个状态的比较和选择过程影响其中的其他状态的比较和选择过程 二分图。 该方法导致减少的操作数量并因此降低卷积解码的复杂度。