Min-sum based hybrid non-binary low density parity check decoder
An apparatus for decoding data includes a variable node processor, a check node processor, and a field transformation circuit. The variable node processor is operable to generate variable node to check node messages and to calculate perceived values based on check node to variable node messages. The check node processor is operable to generate the check node to variable node messages and to calculate checksums based on variable node to check node messages. The variable node processor and the check node processor comprise different Galois fields. The field transformation circuit is operable to transform the variable node to check node messages from a first of the different Galois fields to a second of the Galois fields.
1. An apparatus for decoding data comprising:
a variable node processor, wherein the variable node processor is operable to generate variable node to check node messages and to calculate perceived values based on check node to variable node messages;
a check node processor, wherein the check node processor is operable to generate the check node to variable node messages and to calculate checksums based on variable node to check node messages, wherein the variable node processor and the check node processor comprise different Galois fields; and
a field transformation circuit operable to transform the variable node to check node messages from a first of the different Galois fields to a second of the Galois fields.
2. The apparatus of claim 1 , wherein the apparatus comprises a non-binary low density parity check data decoder.
3. The apparatus of claim 1 , wherein the check node processor comprises:
a minimum and next minimum finder circuit operable to process a plurality of sub-messages in each of the variable node to check node messages; and
a select and combine circuit operable to combine an output of the minimum and next minimum finder circuit to generate the check node to variable node messages.
4. The apparatus of claim 3 , wherein the variable node to check node messages and the check node to variable node messages are in the first of the different Galois fields, and wherein the minimum and next minimum finder circuit and the select and combine circuit are in the second of the different Galois fields.
5. The apparatus of claim 4 , wherein the second of the different Galois fields is larger than the first of the different Galois fields.
6. The apparatus of claim 1 , wherein the field transformation circuit is operable to transform the variable node to check node messages using at least one linear group.
7. The apparatus of claim 1 , wherein the field transformation circuit is operable to transform the variable node to check node messages using two linear groups.
8. The apparatus of claim 1 , wherein the field transformation circuit is operable to transform the variable node to check node messages by defining a parity check matrix in a linear group and mapping between parity check matrix elements and linear group members.
9. The apparatus of claim 1 , wherein the field transformation circuit is operable to transform the variable node to check node messages at least in part by converting a codeword containing elements of a first of the Galois fields to a binary image codeword and performing a syndrome calculation using the binary image codeword and a binary image of a parity check matrix.
10. The apparatus of claim 1 , wherein the apparatus is incorporated in a storage device.
11. The apparatus of claim 10 , wherein the storage device comprises:
a storage medium maintaining a data set; and
a read/write head assembly operable to sense the data set on the storage medium and to provide an analog output corresponding to the data set, wherein the variable node processor is operable to receive a signal derived from the analog output.
12. The apparatus of claim 1 , wherein the apparatus is incorporated in a data transmission device.
13. A method for decoding non-binary low density parity check encoded data, the method comprising:
generating a variable node to check node message vector in a variable node processor based at least in part on a plurality of check node to variable node message vectors, the variable node to check node message vector and the check node to variable node message vectors comprising elements of a first Galois field;
transforming the variable node to check node message vector from the first Galois field to a second Galois field, wherein the second Galois field is larger than the first Galois field;
calculating a check sum and hard decision in a check node processor in a check node processor based at least in part on a plurality of variable node to check node message vectors in the second Galois field;
calculating minimum, index of minimum and sub-minimum values in the check node processor based on the plurality of variable node to check node message vectors; and
generating a check node to variable node message vector in the check node processor by combining the minimum, index of minimum and sub-minimum values, wherein the check node to variable node message vector is generated with elements of the first Galois field.
14. The method of claim 13 , wherein transforming the variable node to check node message vector from the first Galois field to the second Galois field comprises mapping elements of the first Galois field using at least one linear group.
15. The method of claim 14 , wherein transforming the variable node to check node message vector from the first Galois field to the second Galois field comprises performing a plurality of mappings from elements of the first Galois field using a series of linear groups.
16. The method of claim 13 , wherein transforming the variable node to check node message vector from the first Galois field to the second Galois field comprises defining a parity check matrix in a linear group and mapping between parity check matrix elements and linear group members.
17. The method of claim 13 , wherein transforming the variable node to check node message vector from the first Galois field to the second Galois field comprises converting a codeword containing elements of the first Galois field to a binary image codeword and performing a syndrome calculation using the binary image codeword and a binary image of a parity check matrix.
18. A data decoding circuit, the circuit comprising:
a variable node processor, wherein the variable node processor is operable to generate variable node to check node message vectors and to calculate perceived values based on check node to variable node message vectors, and wherein the perceived values may take any of a plurality of values from elements of a first Galois field; and
a check node processor, wherein the check node processor is operable to generate the check node to variable node message vectors and to calculate checksums based on the variable node to check node message vectors, wherein the check node processor operates with a second Galois field that is larger than the first Galois field, and wherein the check node processor is operable to transform messages between the first Galois field and the second Galois field.
19. The data decoding circuit of claim 18 , wherein the check node processor comprises:
a minimum and subminimum finder circuit operable to process a plurality of sub-messages in each of the variable node to check node message vectors, wherein the minimum and subminimum finder circuit is operable to identify a minimum log likelihood ratio, an index of the minimum log likelihood ratio, and a sub-minimum log likelihood ratio for each of the elements of the first Galois Field from each of the variable node to check node message vectors, wherein the minimum and subminimum finder circuit operates in a domain of the second Galois field; and
a select and combine circuit operable to combine an output of the minimum and subminimum finder circuit to generate the check node to variable node message vectors in a domain of the first Galois field.
20. The data decoding circuit of claim 18 , wherein the check node processor is operable to transform messages between the first Galois field and the second Galois field by defining a parity check matrix in a linear group and mapping between parity check matrix elements and linear group members.