52 results about "Turbo product codes" patented technology

A method and apparatus for decoding a linear block encoded string of information bits comprising: converting the string into a plurality of codewords. Performing hard and soft decisions on each codeword to generate a hard and soft decision vector. Computing the syndrome and finding the location of the two minimum values by Galois Field Arithmetic. Designating these values LOW1 and LOW2 and xoring with a Nc1, thus generating Nc2. Swapping Nc1 with Nc2 and determining the lowest soft decision value, Min1 and a next lowest value, Min2. The two bit locations creating Min1 are designated as MinA and MinB. MinA being replaced with Min2 minus the value MinA. MinB being replaced with Min2 minus the value at MinB. Generating an output codeword by subtracting Min1 from all other bit locations values and 2's complementing all soft values with 0 in their location. Creating the new soft value vector. Some embodiments include a system and method that organizes an encoded codeword. The encoded codeword has several codeword bits. The method receives the encoded codeword, assigns multiple codeword bits to at least one memory address in a plurality of memory addresses, and iteratively decodes the received codeword by utilizing the plurality of memory addresses in a predetermined order. The predetermined order is based on a dimension of the received codeword.

An integrated maximum a posteriori equalization and turbo product coding (IMAP-TPC) system for optical fiber communications systems (OFCS) is provided that uses probabilistic characterization of the electrical current in the presence of inter-symbol interference (ISI) and noise to compensate their effects and improve the bit error rate. In the IMAP-TPC system, turbo product code (TPC) decoding is integrated with a symbol-by-symbol maximum a posteriori (MAP) detector. The MAP detector calculates the log-likelihood ratio of a received symbol using the conditional electrical probability density information, and hence obtains a much more accurate reliability measure than the traditional measure used in the TPC decoder.

A method of encoding data in a data block includes generating a first XOR parity from an XOR of all data bits in the data block and an XOR of all row parities of all rows in the data block besides a last row, storing the first XOR parity in the last row, and generating a second XOR parity from an XOR of all column parities of all columns in the data block and an XOR of a parity of the last row.

Decoding associated with a second error correction code and a first error correction code is performed. Ns first and second-corrected segments of data, first sets of parity information, and second sets of parity information are intersegment interleaved to obtain intersegment interleaved data, where the Ns segments of data, the Ns first sets of parity information, and the Ns second sets of parity information have had decoding associated with the first and the second error correction code performed on them (Ns is the number of segments interleaved together). Decoding associated with a third error correction code is performed on the intersegment interleaved data and interleaved parity information to obtain at least third-corrected interleaved data. The third-corrected interleaved data is de-interleaved.

Architecture for enhancing the encoding/decoding of information of a channel. A stream of incoming information bits are arranged into a first array of information bits. The first array of information bits are processed into a first code of bits, which bits form a plurality of first code words having a minimum distance to neighboring error events. Selected bits of the first code are rearranged into a second array of bits by intermittent successive rotations of the selected bits of the first code. A second code is then generated from the second array of bits to increase the minimum distance to the neighboring error events.

The invention provides a self-adaptive iterative decoding method for Turbo product codes. The self-adaptive iterative decoding method comprises the steps as follows: channel environment values obtained through simulation and simulation samples of corresponding iterative factors are stored in a storer; the channel environment values S are estimated according to soft information R output by a demodulation terminal; corresponding groups of most suitable iterative factors are selected according to different channel environment values S; then the soft information R and the selected iterative factors are sent into a Turbo code soft-input soft-output (SISO) iterative decoder to be decoded; a code word of the current time of decoding is detected by an iterative stopping judging unit and compared with a code word of the last time of decoding; and when the distance between the code word of the current time of decoding and the last time of decoding is smaller than or equal to an iterative threshold, the decoding is stopped and the code words are output, otherwise iterative decoding is continued. The self-adaptive iterative decoding method has the advantages that suitable iterative factors can be selected according to different channel environments to realize optimal decoding, the iterative times are selected in a self-adaptive manner, and power consumption of a receiver is effectively reduced.

A set of one or more component syndromes associated with a turbo product code (TPC) codeword is obtained from a component syndrome buffer. Component decoding is performed on the set of one or more component syndromes.

Decoding using miscorrection detection is disclosed. A measure indicative of the number of proposed corrections included in a set of proposed corrections corresponding to one or more of a plurality of read values is received. The plurality of read values corresponds to a codeword. It is determined whether the number of proposed corrections is a permitted number of corrections.

The present invention discloses a modified soft-input soft-output decoding method for Turbo product codes. The method includes the following steps that: the code word matrix r and an outer information matrix [W (m)] of the turbo product codes are calculated, so that soft-input information [R(m) is obtained; a Chase2 algorithm is utilized to decode the soft-input information [R(m), so that soft-output information [R '(m)] is obtained; the code word matrix r is subtracted from the soft-output information [R '(m)], so that a new outer information matrix [W (m+1)] is obtained; and the new outer information matrix [W (m+1)] is transferred to a next decoder and is adopted as priori information for the next decoder to perform decoding. With the method adopted, the complexity of decoding can be reduced.

Disclosed is a three-dimensional TPC decoding apparatus. A three-dimensional TPC decoding apparatus includes an X decoder which decodes an X axis of an m-th upper half layer based on decoding results of a Y axis and a Z axis of an m−1-th upper half layer; a Y decoder which decodes a Y axis of an m-th lower half layer based on decoding results of an X axis and a Z axis of an m−1-th lower half layer; and a Z decoder which decodes a Z axis based on a decoding result of the Y axis of an m-th upper half layer and a decoding result of the X axis of an m-th lower half layer.

There is provided an ultra-light decoder for high speed digital communications based on block codes such as turbo product codes (TPCs). The new decoder can perform soft decision decoding without an algebraic hard decision decoder, which is the core of conventional soft decision decoders. The elimination of algebraic decoder significantly reduces the number of computations required per codeword, consequently, it reduces the decoding delay and processing power. However, reducing the decoding delay would immediately enable increasing the transmission speed, and minimize the need for large buffers at the receiver. Moreover, reducing the complexity and delay would enable using codes with high code rates to increase the system capacity, or use powerful codes with low code rates to reduce the transmission power. Such benefits can be achieved for about 1 dB loss in coding gain. There is also provided a receiver comprising the ultra-light decoder, as well as a decoding process.

An apparatus for a turbo product codes includes a codeword generator and an interleaver. The codeword generator receives a data in a matrix, and generate a turbo product code (TPC) codeword including the data, row parities and column parities. The interleaver interleaves the TPC codeword by assigning at least one bit in at least one row-column intersection of the TPC codeword to at least one master code, and outputs the interleaved TPC codeword.

The embodiment of the invention discloses a decoding method of a Turbo product code, which comprises the following steps of: obtaining a receiving code word of the Turbo product code, and carrying outiterative decoding on the receiving code word for a set first iterative decoding frequency; judging a decoding result of iterative decoding of the first iteration times according to a first decodingrule to obtain a decoding identifier for representing the decoding result; and carrying out error correction processing on the Turbo product code after iterative decoding of the first number of iterations according to the decoding identifier. The embodiment of the invention further discloses a decoding device of the Turbo product code, a decoder and a computer storage medium.