Patent classifications
H03M13/2975
Error correction circuit, operating method thereof and data storage device including the same
An error correction circuit includes a control unit suitable for receiving a data chunk including a plurality of data blocks, each of the data blocks being included in a corresponding codeword of a first direction and a corresponding codeword of a second direction; and a decoder suitable for performing a decoding operation on a codeword, which is selected by the control unit, in the data chunk, wherein the control unit calculates a first reference value by applying a correction capability value of the first direction to a flag of the first direction, calculates a second reference value by applying a correction capability value of the second direction to a flag of the second direction, selects a priority direction from the first direction and the second direction based on the first reference value and the second reference value, and preferentially selects codewords of the priority direction for decoding operations.
ERROR CORRECTION CIRCUIT, OPERATING METHOD THEREOF AND DATA STORAGE DEVICE INCLUDING THE SAME
An error correction circuit includes a control unit suitable for receiving a data chunk including a plurality of data blocks, each of the data blocks being included in a corresponding codeword of a first direction and a corresponding codeword of a second direction; and a decoder suitable for performing a decoding operation on a codeword, which is selected by the control unit, in the data chunk, wherein the control unit calculates a first reference value by applying a correction capability value of the first direction to a flag of the first direction, calculates a second reference value by applying a correction capability value of the second direction to a flag of the second direction, selects a priority direction from the first direction and the second direction based on the first reference value and the second reference value, and preferentially selects codewords of the priority direction for decoding operations.
Techniques for low complexity soft decoder for turbo product codes
Techniques are described for decoding a message. In one example, the techniques include obtaining a first message comprising a plurality of information bits and a plurality of parity bits, decoding the first message using an iterative decoding algorithm to generate a first bit sequence, generating a miscorrection metric based at least on the first bit sequence and one or more reliability values corresponding to one or more bits in the first message, determining whether a miscorrection happened in the decoder by comparing the miscorrection metric with a first threshold, and upon determining that a miscorrection did not happen, outputting the first bit sequence as a decoded message.
Vertical Layered Finite Alphabet Iterative Decoding
This invention presents a method and apparatus for vertical layered finite alphabet iterative decoding of low-density parity-check codes (LDPC) which operate on parity check matrices that consist of blocks of sub-matrices. The iterative decoding involves passing messages between variable nodes and check nodes of the Tanner graph that associated with one or more sub-matrices constitute decoding blocks, and the messages belong to a finite alphabet. Various embodiments for the method and apparatus of the invention are presented that can achieve very high throughputs with low hardware resource usage and power.
EARLY-TERMINATION OF DECODING CONVOLUTIONAL CODES
A decoder having an input configured to receive a sequence of softbits presumed to correspond to a convolutionally-encoded codeword; and a decoding circuit configured to: determine, as part of a decoding process, a Maximum Likelihood (ML) survivor path in a trellis representation of the codeword; determine whether the presumed convolutionally-encoded codeword meets an early-termination criteria; and abort the decoding process if the presumed convolutionally-encoded codeword meets the early-termination criteria, continue the decoding process if the presumed convolutionally-encoded codeword fails to meet the early-termination criteria.
Systems and methods for on-demand exchange of extrinsic information in iterative decoders
Systems and methods are provided for decoding a codeword using an iterative decoding process. The systems and methods include receiving a codeword comprising a plurality of symbols, and concurrently processing the received codeword with a detector and a decoder based in part on extrinsic information associated with the plurality of symbols to obtain updated extrinsic information. The systems and methods further include modifying the extrinsic information associated with the plurality of symbols based on the updated extrinsic information, and repeating the processing and modifying steps until a stopping criterion is met.
GLDPC soft decoding with hard decision inputs
A decoder includes circuitry and a soft decoder. The circuitry is configured to receive channel hard decisions for respective bits of a Generalized Low-Density Parity Check (GLDPC) code word that includes multiple component code words, including first and second component code words having one or more shared bits, to schedule decoding of the GLDPC code word, and following the decoding, to output the decoded GLDPC code word. The soft decoder is configured to receive the channel hard decisions corresponding to the first component code word, to further receive soft reliability measures that were assigned to the shared bits in decoding the second component code word, and to decode the first component code word based on the channel hard decisions and the soft reliability measures.
Device and Method of Controlling an Iterative Decoder
A receiving device comprises an iterative decoder, for receiving at least one coded signal and for performing an iterative decoding on the at least one coded signal, to generate a plurality of decoded signals, wherein the plurality of decoded signals comprise a first decoded signal from a first iteration, a second decoded signal from a second iteration and a third decoded signal from a third iteration; a first determination unit, coupled to the iterative decoder, for determining whether the plurality of decoded signals diverge, to generate a first determination result; and a control unit, coupled to the first determination unit, for generating a control signal according to at least the first determination result, wherein the control signal indicates the iterative decoder whether to stop performing the iterative decoding on the at least one coded signal.
VIRTUALIZED RADIO ACCESS POINT, VRAP, AND METHOD OF OPERATING THE SAME
A method of operating a virtualized radio access point (vRAP) is provided. Transport blocks (TBs) are encoded/decoded by using iterative codes that exchange extrinsic information in each iteration. The exchanged extrinsic information is exploited to infer information about decodability of the data of the TBs.
Decoding of product codes
In one embodiment, a method includes receiving data and in an iterative process until decoded data is output or a predetermined number of full iterations have occurred: C1 decoding all first subsets of the data, determining whether to stop decoding the data after the C1 decoding, incrementing a half iteration counter to indicate completion of a half iteration, C2 decoding all second subsets of the data two or more times in each half iteration using two or more C2-decoding methods in response to a determination that a second subset is not decoded successfully using a first C2-decoding method, determining whether to stop decoding the data after the C2 decoding, incrementing the half iteration counter to indicate completion of another half iteration, and outputting the set of decoded data in response to a determination that all subsets of the data are decoded successfully.