| 摘要 |
Process and device to decode a shortened cyclic binary code, able to correct single errors bursts of given length t or shorter, specially for an F(n-b,k-b) shortened fire code. It is based on the calculation of two syndrome polynomials, s1(x) and s2(x), in two specific registers (SR1, SR2), on the shifting in a first direction of the polynomial s1(x) <SIGN> 1 times until the errors burst is trapped in the t less significant positions of the first (SR1) register and on the shifting of the syndrome polynomial s2(x) <SIGN> 2 times in an opposite second direction in a third (MEL) register until it becomes equal to the t less significant positions of the first (SR1) register. Alternatively the second register can be a bidirectional shift register (SRb) where the shifting takes place also in the second direction. Moreover all computations in the process are made as simple as possible. |
