EFFICIENT SYNDROME COMPUTATION FOR BINARY BCH CODES
Original Publication Date: 1992-Aug-01
Included in the Prior Art Database: 2002-Jan-14
This paper presents an e&ient method of comput- ing the syndrome of a binary BCH code which takes advantage of the fact that consecutive integer powers of a' are needed in the syndrome computations and uses the post increment by N and module addressing capa- baities of the DSP56001 to perform the arithmetic over a Galois field. The method presented here is an improve- ment over the obvious implementation because it, in effect, performs the exponent multiplication, modulo checking, and element fetching all in one. step.