Abstract:
The present invention is related to systems and methods for branch metric calculation based on multiple data streams in a data processing circuit.
Abstract:
The present inventions are related to systems and methods for data processing, and more particularly to systems and methods for performing data decoding.
Abstract:
The present inventions are related to systems and methods for data processing, and more particularly to systems and methods for governing a data processing system.
Abstract:
The present inventions are related to systems and methods for data processing, and more particularly to systems and methods for performing data decoding.
Abstract:
A data processing circuit includes a long magnet identification circuit operable to identify long magnet bits in data to be processed, the long magnet bits comprising bits having a same value as a number of preceding and subsequent bits, an error calculation circuit operable to subtract an ideal version of the long magnet bits from the long magnet bits to yield an error signal, an adjacent track interference metric calculation circuit operable to calculate an adjacent track interference metric based on the error signal, and a comparator circuit operable to compare the adjacent track interference metric with a threshold value and to assert a refresh signal when the adjacent track interference metric is greater than the threshold value.
Abstract:
A system is described for constructing maximum transition run modulation code based upon a multi-level run-length limited finite state machine. A processor is configured to receive information from a hard disk drive via a read channel and recover data from the hard disk drive using maximum transition run modulation code. A memory has computer executable instructions configured for execution by the processor to model a magnetic recording channel as a partial response channel, model a source of information to the magnetic recording channel to provide an optimized Markov source, and construct a maximum transition run modulation code to mimic the optimized Markov source based upon a finite state machine having a limited transition run length and a multi-level periodic structure.
Abstract:
The present inventions are related to systems and methods for data processing, and more particularly to systems and methods for performing data decoding.
Abstract:
A method for finding a valid codeword based on a near codeword trapping in a low-density parity-check decoding process includes identifying trapping set configurations and applying corrections to produce trapping sets with a limited number of invalid checks. Trapping set configurations are corrected in order to produce a trapping set in a table of trapping sets, the table associating each corrected trapping set with a valid codeword.
Abstract:
Various embodiments of the present invention provide systems and methods for data processing that includes selectively reporting results out of order or in order.
Abstract:
A data processing system is disclosed including a decoder circuit, syndrome calculation circuit and hash calculation circuit. The decoder circuit is operable to apply a decoding algorithm to a decoder input based on a first portion of a composite matrix to yield a codeword. The syndrome calculation circuit is operable to calculate a syndrome based on the codeword and on the first portion of the composite matrix. The hash calculation circuit is operable to calculate a hash based on a second portion of the composite matrix. The decoder circuit is also operable to correct the codeword on the hash when the syndrome indicates that the codeword based on the first portion of the composite matrix is correct but a second test indicates that the codeword is miscorrected.