Chien search device, storage device, and chien search method
First Claim
1. A chien search device configured to perform chien searches of n (n is a natural number of 2 or more) bits in parallel on a basis of coefficients of terms of an error location polynomial calculated by an error location polynomial operation, the chien search device comprising:
- for each of the coefficients,n operation units configured to perform first exclusive-OR operations on a basis of a primitive polynomial of a Galois field;
a first register configured to hold results obtained by a highest order operation unit, the highest order operation unit being among the n operation units, the highest order operation unit being configured to perform the first exclusive-OR operations, the first exclusive-OR operations corresponding to operations multiplying α
to a power of highest order;
an exclusive-OR operation unit configured to perform second exclusive-OR operations of the results of the first exclusive-OR operations, the results of the first exclusive-OR operations being obtained by the highest order operation unit; and
a second register configured to hold results obtained by the exclusive-OR operation unit,wherein each of the n operation units inputs first register values obtained from the first register and second register values obtained from the second register, and reduces a number of stages of the first exclusive-OR operations by using the second register values.
1 Assignment
0 Petitions
Accused Products
Abstract
According to one embodiment, a chien search device includes n operation units configured to perform exclusive-OR operations, for each of the coefficients. Further, the chien search device includes first register configured to hold operation results of a highest order operation unit, for each of the coefficients. Furthermore, the chien search device includes exclusive-OR operation unit configured to perform exclusive-OR operations of the results of the first exclusive-OR operations of the highest order operation unit, for each of the coefficients. Moreover, the chien search device includes second register configured to hold operation results of the exclusive-OR operation unit, for each of the coefficients. The respective operation units reduce the number of stages of exclusive-OR operations by using the second register values.
8 Citations
18 Claims
-
1. A chien search device configured to perform chien searches of n (n is a natural number of 2 or more) bits in parallel on a basis of coefficients of terms of an error location polynomial calculated by an error location polynomial operation, the chien search device comprising:
-
for each of the coefficients, n operation units configured to perform first exclusive-OR operations on a basis of a primitive polynomial of a Galois field; a first register configured to hold results obtained by a highest order operation unit, the highest order operation unit being among the n operation units, the highest order operation unit being configured to perform the first exclusive-OR operations, the first exclusive-OR operations corresponding to operations multiplying α
to a power of highest order;an exclusive-OR operation unit configured to perform second exclusive-OR operations of the results of the first exclusive-OR operations, the results of the first exclusive-OR operations being obtained by the highest order operation unit; and a second register configured to hold results obtained by the exclusive-OR operation unit, wherein each of the n operation units inputs first register values obtained from the first register and second register values obtained from the second register, and reduces a number of stages of the first exclusive-OR operations by using the second register values. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A storage device comprising:
-
a memory unit configured to store code words generated by performing error correction encoding processing; an error location polynomial operation unit configured to perform an error location polynomial operation on a basis of a syndrome calculated on a basis of code words read from the memory unit; a chien search unit configured to perform chien searches on a basis of coefficients of terms of an error location polynomial calculated by the error location polynomial operation; and a decoding control unit configured to perform error correction on a basis of results of the chien searches, wherein, when the chien searches of n (n is a natural number of 2 or more) bits are performed in parallel, the chien search unit includes for each of the coefficients, n operation units configured to perform first exclusive-OR operations on a basis of a primitive polynomial of a Galois field, a first register configured to hold results obtained by a highest order operation unit, the highest order operation unit being among the n operation units, the highest order operation unit being configured to perform the first exclusive-OR operations, the first exclusive-OR operations corresponding to operations multiplying α
to a power of highest order;an exclusive-OR operation unit configured to perform second exclusive-OR operations of the results of the first exclusive-OR operations, the results of the first exclusive-OR operations being obtained by the highest order operation unit; and a second register configured to hold results obtained by the exclusive-OR operation unit, wherein each of the n operation units inputs first register values obtained from the first register and second register values obtained from the second register, and reduces a number of stages of the first exclusive-OR operations by using the second register values. - View Dependent Claims (8, 9, 10, 11, 12)
-
-
13. A chien search method of a chien search device configured to perform chien searches of n (n is a natural number of 2 or more) bits in parallel on a basis of coefficients of terms of an error location polynomial calculated by an error location polynomial operation, the chien search method comprising:
-
for each of the coefficients, performing first exclusive-OR operations on a basis of a primitive polynomial of a Galois field; holding results of the first exclusive-OR operations as first register values, the first exclusive-OR operations corresponding to operations multiplying α
to a power of highest order;performing second exclusive-OR operations of the results of the first exclusive-OR operations of multiplying α
to the power of the highest order;holding results of the second exclusive-OR operations as second register values; and inputting the first register values and the second register values, and reducing a number of stages of the first exclusive-OR operations by using the second register values. - View Dependent Claims (14, 15, 16, 17, 18)
-
Specification