150results about "Error correction/detection using turbo 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.

Disclosed is a method and communication device for suppressing interference. The method comprises performing, with a turbo decoder (314), at least one turbo decoding attempt (1106) on a received signal (1104). The turbo decoding attempt generates at least one whole word code bit therefrom (1108). The whole word code bit (1108) corresponds to a group of bits comprising a transmitted symbol. The method determines if the whole word code bit (1108) has a confidence level exceeding a given threshold (1110). If the whole word code bit (1108) does have a confidence level exceeding the given threshold, the whole code word bit is selected for use in data symbol recovery (1114).

IPHD (Iterative Parallel Hybrid Decoding) of various MLC (Multi-Level Code) signals. Various embodiments are provided by which IPHD may be performed on MLC LDPC (Multi-Level Code Low Density Parity Check) coded modulation signals mapped using a plurality of mappings. This IPHD may also be performed on MLC LDPC coded modulation signals mapped using only a singe mapping as well. In addition, various embodiments are provided by which IPHD may be performed on ML TC (Multi-Level Turbo Code) signals. These principles of IPHD, shown with respect to various embodiments IPHD of MLC LDPC coded modulation signals as well as the IPHD of ML TC signals, may be extended to performing IPHD of other signal types as well. Generally speaking, based on the degree of the MLC signal, a corresponding number of parallel paths operate in cooperation to decode the various levels of the MLC signal.

In iterative-diversity (ID) transmission systems for signals with concatenated convolutional coding (CCC), paired iterative diversity signals each have ½ the code rate of the 8VSB DTV signals prescribed by the 1995 ATSC Digital Television Broadcast Standard. Known serial concatenated convolutional coding (SCCC) or novel parallel concatenated convolutional coding (PCCC) is used in such system. Pairs of CCC signals code data bits and ones' complemented data bits respectively, using similar coding algorithms. Receivers for this transmission system use respective turbo decoders for turbo decoding the earlier-transmitted and later-transmitted CCC signals. Turbo decoding of the earlier-transmitted portions of iterative diversity signals is delayed to be contemporaneous with turbo decoding of the later-transmitted portions of iterative diversity signals. This facilitates the turbo decoders exchanging information concerning confidence levels of data bits during the turbo decoding procedures.

A method for determining a transport block size and a signal transmission method using the same are disclosed. When the signal transmission method constructs a transport block size combination by predetermining the transport block size, it prevents the insertion of any dummy bits in consideration of the limitation of an input bit length of an encoder during an encoding step. If a CRC is attached to the transport block and the transport block is segmented into a plurality of code blocks, the signal transmission method can establish a length of the transport block in consideration of a length of the CRC attached to each code block.

Iterative metric updating when decoding LDPC (Low Density Parity Check) coded signals and LDPC coded modulation signals. A novel approach is presented for updating the bit metrics employed when performing iterative decoding of LDPC coded signals. This bit metric updating is also applicable to decoding of signals that have been generated using combined LDPC coding and modulation encoding to generate LDPC coded modulation signals. In addition, the bit metric updating is also extendible to decoding of LDPC variable code rate and/or variable modulation signals whose code rate and/or modulation may vary as frequently as on a symbol by symbol basis. By ensuring that the bit metrics are updated during the various iterations of the iterative decoding processing, a higher performance can be achieved than when the bit metrics remain as fixed values during the iterative decoding processing.

The outer convolutional coding of the signals used to transmit mobile-handheld (M/H) service data within digital-television (DTV) signals is subjected to anti-Gray coding, either before or after its interleaving, but before its inner convolutional coding. In a receiver for such M/H-service data, portions of the trellis decoded DTV signal containing soft decisions concerning symbol-interleaved convolutionally coded M/H-service data are recoded for a Gray-code mapping of symbols to modulation levels. This is done either before or after symbol de-interleaving, but before decoding the outer convolutional coding. Soft decisions concerning extrinsic information to be fed back to the ⅔ trellis decoder to close a turbo decoding loop are derived from soft decisions as to the M/H-service data, which derivation includes re-coding for a binary-code mapping of symbols to modulation levels. Each re-coding procedure can be performed using ROM, but preferably is performed using simple digital logic.

An encoding device in a data transmission/reception system includes a first convolutional encoder that encodes an outer code, an interleaver that permutes input data, a second convolutional encoder that encodes an inner code, and a muti-level modulation mapping circuit that performs signal-point mapping based on eight-phase shift keying. When the encoding device uses the second convolutional encoder having two or more memories, the first convolutional encoder uses, as the outer code, a code with a minimum output distance greater than the maximum input distance at which the minimum-distance inner code is generated.

A method for processing a dual transport stream (TS) which is multiplexed from a normal stream and a turbo stream is provided for a digital broadcasting transmission/reception system. The digital broadcasting signal processing method includes encoding a dual transport stream (TS) which is multiplexed from a normal steam and a turbo stream; interleaving the encoded dual transport stream (TS); turbo-processing by detecting the turbo stream from the interleaved dual transport stream (TS), encoding the detected turbo stream, stuffing the encoded turbo stream into the dual transport stream (TS), and compensating a parity corresponding to the encoded turbo stream; and trellis-encoding the turbo-processed dual transport stream (TS). Accordingly, the digital broadcasting reception performance can be improved in diverse environments.

The present invention provides a design framework that is used to develop new types of constrained turbo block convolutional (CTBC) codes that have higher performance than was previously attainable. The design framework is applied to design both random and deterministic constrained interleavers. Vectorizable deterministic constrained interleavers are developed and used to design parallel architectures for real time SISO decoding of CTBC codes. A new signal mapping technique called constrained interleaved coded modulation (CICM) is also developed. CICM is then used to develop rate matching, spatial modulation, and MIMO modulation subsystems to be used with CTBC codes and other types of codes. By way of example, embodiments are primarily provided for improved 5G LTE and optical transport network (OTN) communication systems.

A turbo encoding section 102 turbo-encodes transmission data, outputs systematic bit data to a first modulation section 103a and outputs parity bit data to a second modulation section 104. The first modulation section 103a always QPSK-modulates systematic bit data. The second modulation section 103b adaptively modulates parity bit data. The control section 101 outputs a control signal for carrying out 16 QAM modulation to the second modulation section 103b when the RSSI value is equal to or higher than a threshold and outputs a control signal for carrying out QPSK modulation to the second modulation section 103b when the RSSI signal value is less than the threshold. In this way, it is possible to further make the error rate characteristic compatible with the transmission efficiency.

A method for optimising a coded modulation scheme with a given spectral efficiency for communication over a fading channel represented/identified by B fading gains, wherein B is an integer number expressing the ratio between a code word duration and the duration over which the fading remains constant. The fading gains belong to a B-dimensional space of fading gains.

New capabilities will allow conventional broadcast transmission to be available to mobile devices. A method of decoding a bitstream is described including receiving a demodulated bitstream, the demodulated bitstream encoded using a byte-code encoding process, arranging a portion of the demodulated bitstream into a subset of bits, reordering the subset of bits, and decoding the subset of bits based on a property of the subset of bits and the encoding process. An apparatus includes means for decoding a bitstream based on a property of the subset of bits and the encoding process.

A method and apparatus for Turbo encoding uses a set of rate-compatible Turbo Codes optimized at high code rates and derived from a universal constituent code. The Turbo Codes have rate-compatible puncturing patterns. The method comprises: encoding a signal at a first and second encoder using a best rate 1/2 constituent code universal with higher code rates, the first encoder and the second encoder each producing a respective plurality of parity bits for each information bit; puncturing the respective plurality of parity bits at each encoder with a higher rate best puncturing patterns; and puncturing the respective plurality of parity bits at each encoder with a lower rate best puncturing pattern. In a variation, the best rate 1/2 constituent code represents a concatenation of polynomials 1+D²+D³ (octal 13) and 1+D+D³ (octal 15), D a data bit. A Turbo Encoder is provided which has hardware to implement the method.

LDPC (Low Density Parity Check) coded modulation symbol decoding using non-Gray code maps for improved performance. Symbol decoding is supported by appropriately modifying an LDPC tripartite graph to eliminate the bit nodes thereby generating an LDPC bipartite graph (such that symbol nodes are appropriately mapped directly to check nodes thereby obviating the bit nodes). The edges that communicatively couple the symbol nodes to the check nodes are labeled appropriately to support symbol decoding of the LDPC coded modulation signal. In addition, the LDPC coded modulation symbol decoding can be employed to decode a signal that has been encoded using LDPC-BICM (Low Density Parity Check-Bit Interleaved Coded Modulation) encoding with non-Gray code mapping. By using the non-Gray code mapping, a performance improvement over such a system using only Gray code mapping may be achieved.

A turbo coded communication system includes a gray scale mapper in a transmitter for generating a symbol constellation of modulated signals points that can be separated by boundary lines in the constellation space into bitwise groups of zero bits and one bits where the shortest distance from a boundary line to received value in the constellation space indicates the bitwise soft metrics that is computed using a set of bitwise soft metric equations are a function of the minimum distance using closed form algebraic equations in turbo decoding receiver. In the case of quadrature amplitude modulation (QAM), the bit boundary lines are predetermined by a minimum distance in the constellation space for a specified M-ary modulation, so that, the soft metric equations are only a function of the received signal value for providing efficient computation of the bitwise soft metric.

To carry out error correction coding and decoding according to a serially concatenated coded modulation system with a small circuit scale and high performance. A coding apparatus 1 is designed so that an interleaver 20 interleaves order of bits so that all weights are coded by a convolutional coder 30 with respect to data comprising a series of 3 bits supplied from a convolutional coder 10; the convolutional coder 30 makes as small as possible the total value of the hamming distance of input bit between passes to be the minimum Euclidean distance with respect to data of 3 bits supplied from the interleaver 20; and a multi-value modulation mapping circuit 40 causes the hamming distance of input bits in the convolutional coder 30 as the distance between signal point on the I/Q plane is smaller to subject data of 3 bits supplied from the convolutional coder 30 to mapping.

LDPC (Low Density Parity Check) coded modulation hybrid decoding using non-Gray code maps for improved performance. Check node updating and symbol node updating are successively and alternatively performed on bit edge messages for a predetermined number of decoding iterations or until sufficient degree of precision is achieved. The symbol node updating of the bit edge messages uses symbol metrics corresponding to the symbol being decoded and the bit edge messages most recently updated by check node updating. The check node updating of the bit edge messages uses the bit edge messages most recently updated by symbol node updating. The symbol node updating computes possible soft symbol estimates. LDPC coded modulation hybrid decoding can decode an LDPC-BICM (Low Density Parity Check-Bit Interleaved Coded Modulation) signal having a symbol mapped using non-Gray code mapping. By using the non-Gray code mapping, a performance improvement is achieved over an only Gray code mapping system.

Turbo-coded data are transmitted using quadrature amplitude modulation (QAM) of COFDM carrier waves in digital television (DTV) broadcast systems. The QAM symbol constellations map the parity bits of the turbo coded data so as to be de-mapped with higher confidence levels than the data bits, facilitating turbo decoding. A preferred DTV receiver delays the first transmissions of time-slices of a service selected for iterative-diversity reception to concur with second transmissions of those time-slices. The complex coordinates of QAM constellations in the delayed first transmission and the second transmission of the same time-slice are combined by a maximal-ratio QAM combiner after COFDM demodulation, but before de-mapping QAM constellations and turbo decoding. In a less-preferred DTV receiver, QAM constellations in the delayed first transmission of each time-slice and in the second transmission of the same time-slice are de-mapped separately. A maximal-ratio code combiner then combines de-mapping results before turbo decoding.