초록 ▼

Systems and methods are provided for implementing list decoding in a Reed-Solomon (RS) error-correction system. A detector can provide a decision-codeword from a channel and can also provide soft-information for the decision-codeword. The soft-information can be organized into an order of combinatio

Systems and methods are provided for implementing list decoding in a Reed-Solomon (RS) error-correction system. A detector can provide a decision-codeword from a channel and can also provide soft-information for the decision-codeword. The soft-information can be organized into an order of combinations of error events for list decoding. An RS decoder can employ a list decoder that uses a pipelined list decoder architecture. The list decoder can include one or more syndrome modification circuits that can compute syndromes in parallel. A long division circuit can include multiple units that operate to compute multiple quotient polynomial coefficients in parallel. The list decoder can employ iterative decoding and a validity test to generate error indicators. The iterative decoding and validity test can use the lower syndromes.

대표청구항 ▼

What is claimed is: 1. A Reed-Solomon decoder capable of decoding an n-symbol decision-codeword to produce a k-symbol dataword where the number of symbol errors in the decision-codeword is greater than t=(n-k)/2, the decoder comprising: a syndrome computation circuit that performs a recursive compu

What is claimed is: 1. A Reed-Solomon decoder capable of decoding an n-symbol decision-codeword to produce a k-symbol dataword where the number of symbol errors in the decision-codeword is greater than t=(n-k)/2, the decoder comprising: a syndrome computation circuit that performs a recursive computation to generate a plurality of values eαi·j, said syndrome computation circuit adding said plurality of values to existing syndromes to produce a plurality of modified syndromes, where j is a symbol position, e is an error value corresponding to the symbol position, and i is a non-negative integer. 2. The Reed-Solomon decoder of claim 1, wherein the syndrome computation circuit comprises: a clock signal that indicates a plurality of clock intervals, where the recursive computation is performed once for each clock interval; a multiplier for producing the plurality of values eαi·j; an input interface that receives the existing syndromes; and an adder that computes a sum of one of the existing syndromes and a corresponding one of the plurality of values eαi·j. 3. The Reed-Solomon decoder of claim 2, wherein the syndrome computation circuit further comprises: a multiplexor; and a storage component, wherein the multiplexor, the storage component, and the multiplier form a recursion loop that performs the recursive computation. 4. The Reed-Solomon decoder of claim 3, wherein the multiplexor comprises: a first input connection that is in communication with the error value e; a second input connection that is in communication with the multiplier; an output connection that is in communication with the storage component; and a control connection that is in communication with an initialize signal, wherein the initialize signal causes the multiplexor to couple its first input connection to its output connection during an initial iteration and causes the multiplexor to couple its second input connection to its output connection after the initial iteration. 5. The Reed-Solomon decoder of claim 3, wherein the storage component comprises: an input connection that is in communication with the multiplexor; an output connection that is in communication with the multiplier and the adder; and a clock connection that is in communication with the clock signal, where the storage component corresponds to one of: a latch, a flip-flop, an edge-triggered latch, and an edge-triggered flip-flop. 6. The Reed-Solomon decoder of claim 3, wherein the multiplier comprises: a first input connection that is in communication with a multiplier factor; a second input connection that is in communication with the storage component; and an output connection that is in communication with the multiplexor. 7. The Reed-Solomon decoder of claim 1, further comprising: at least one other syndrome computation circuit that performs a recursive computation to generate a plurality of values eαi·j, where values of i that are associated with the at least one other syndrome computation circuit are different from values of i associated with the syndrome computation circuit. 8. The Reed-Solomon decoder of claim 7, further comprising a clock signal that indicates a plurality of clock intervals. 9. The Reed-Solomon decoder of claim 8, wherein the syndrome computation circuit produces a modified syndrome in a same clock interval that it receives an existing syndrome. 10. The Reed-Solomon decoder of claim 8, wherein the values of i associated with the syndrome computation circuit and the at least one other syndrome computation circuit are consecutive during a clock interval. 11. A read path comprising the Reed-Solomon decoder of claim 1. 12. A disk drive comprising the read path of claim 11.