| 摘要 |
<p>A set of minimal polynomials for generating a multidimensional array for decoding algebraic geometric codes is derived at a high speed. In order to obtain a set of minimal polynomials F for generating a given multidimensional array, when sequentially updating a set of polynomials F, dfn<(i)> are not directly calculated, and a newly introduced set of polynomials B and the set of polynomials F are updated using the highest-degree coefficient di of polynomials which belong to the set of polynomials B. An array memory for storing a given multidimensional array u, and first and second polynomial memories for storing the set of polynomials F to be obtained and a set of auxiliary polynomials G, respectively, are provided. In the calculation of polynomials f<(k)> and dfn+1<(k)> , accessing operations for respective memories and accessed addresses are controlled in parallel depending on the degrees of polynomials f<(k)>. <IMAGE></p> |
