Patent classifications
H03M13/2975
Low-complexity syndrom based decoding apparatus and method thereof
The present disclosure relates to a low-complexity syndrome based decoding apparatus and method and a low-complexity syndrome based decoding apparatus includes: a hard decision unit which performs hard decision on a current input value to output a hard decision vector; a syndrome calculator which performs a syndrome operation on the hard decision vector and determines an error type of the hard decision vector based on the syndrome operation result; and a decoder which selects a predetermined decoding algorithm in accordance with the error type to perform the decoding, and the error type includes at least one of no error, a single error, and a double error.
MEMORY SYSTEM WITH LOW-COMPLEXITY DECODING AND METHOD OF OPERATING SUCH MEMORY SYSTEM
Memory controllers, decoders and methods to selectively perform bit-flipping (BF) decoding and min-sum (MS) decoding on codewords of an irregular low-density parity-check (LDPC) code. Bit-flipping (BF) decoding is executed with respect to variable nodes having relatively high column weights. MS decoding is executed with respect to variable nodes having relatively low column weights. A column-weight threshold is used to group the variable nodes into the higher and lower column weight groups. The two decoding techniques exchange results during the overall decoding process.
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.
LPWAN COMMUNICATION PROTOCOL DESIGN WITH TURBO CODES
A method and a decoder for receiving a message encoded in Turbo Codes and modulated for transmission as an analog signal includes: (a) demodulating the analog signal to recover the Turbo Codes; and (b) decoding the Turbo Codes to recover the message using an iterative Turbo Code decoder, wherein the decoding includes performing an error detection after a predetermined number of iterations of the Turbo Code decoder to determine whether or not an error has occurred during the transmission. The predetermined number of iterations may be, for example, two. Depending on the result of the error detection, the decoding may stop, a request for retransmission of the message may be sent, or further iterations of decoding in the Turbo Code decoder may be carried out.
LOW-COMPLEXITY SYNDROM BASED DECODING APPARATUS AND METHOD THEREOF
The present disclosure relates to a low-complexity syndrome based decoding apparatus and method and a low-complexity syndrome based decoding apparatus includes: a hard decision unit which performs hard decision on a current input value to output a hard decision vector; a syndrome calculator which performs a syndrome operation on the hard decision vector and determines an error type of the hard decision vector based on the syndrome operation result; and a decoder which selects a predetermined decoding algorithm in accordance with the error type to perform the decoding, and the error type includes at least one of no error, a single error, and a double error.
Stopping criteria for turbo decoder
This disclosure relates to providing negative stopping criteria for turbo decoding for a wireless device. A device may wirelessly receive turbo coded data. Turbo decoding may be performed on the turbo coded data. Performing turbo decoding may use one or more negative stopping criteria for early termination of the turbo decoding for each code block of the turbo coded data. The negative stopping criteria may be selected to terminate the turbo decoding of a code block early under poor wireless medium conditions. Turbo decoding of a code block may be terminated early if the one or more negative stopping criteria for the code block are met.
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.
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.
Device and method of controlling an iterative decoder
A receiving device comprises an iterative decoder, a first determination unit and a control unit. The iterative decoder is 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. The first determination unit is for determining whether the plurality of decoded signals diverge, to generate a first determination result. The control unit is 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.