摘要:
Communication decoder employing single trellis to support multiple code rates and/or multiple modulations. A single trellis is employed by the decoder to decode a plurality of encoded symbols. Each of the plurality of encoded symbols is governed by a rate control. A rate control sequence, having a period, is used to decode the plurality of encoded symbols that may be arranged within a frame. Various parameters of the plurality of encoded symbols may vary on a symbol by symbol basis; these parameters may include modulation, constellation, mapping, and/or bandwidth efficiency. For example, various symbols may be encoded differently, yet they may all be decoded using the same trellis. The functionality of this decoder may be implemented within a variety of different decoder embodiments including a trellis code modulation (TCM) decoder, a turbo trellis code modulation (TTCM) decoder, and/or a parallel concatenated turbo code modulation (PC-TCM) decoder.
摘要:
Method and apparatus for performing calculations for forward (alpha) and reverse (beta) metrics in a map decoder. The method includes using a min star (min*) operation to receive the metrics and a priori values as well as forming min star structures from individual min star operations. Two separate outputs from the min star operation may be maintained separately throughout all calculations and combined only when a final value is required. In addition input to the min star operators that are available prior to a particular decoder iteration may be combined separately to allow an increase in speed within decoding iterations. The same principals apply to the more popular max star operation.
摘要:
A method for parallel concatenated (Turbo) encoding and decoding. Turbo encoders receive a sequence of input data tuples and encode them. The input sequence may correspond to a sequence of an original data source, or to an already coded data sequence such as provided by a Reed-Solomon encoder. A turbo encoder generally comprises two or more encoders separated by one or more interleavers. The input data tuples may be interleaved using a modulo scheme in which the interleaving is according to some method (such as block or random interleaving) with the added stipulation that the input tuples may be interleaved only to interleaved positions having the same modulo-N (where N is an integer) as they have in the input data sequence. If all the input tuples are encoded by all encoders then output tuples can be chosen sequentially from the encoders and no tuples will be missed. If the input tuples comprise multiple bits, the bits may be interleaved independently to interleaved positions having the same modulo-N and the same bit position. This may improve the robustness of the code. A first encoder may have no interleaver or all encoders may have interleavers, whether the input tuple bits are interleaved independently or not. Modulo type interleaving also allows decoding in parallel.
摘要:
A bandwidth-efficient concatenated trellis-coded modulation (TCM) decoder which is realized by combining turbo codes having an advantage of coping effectively with a fading channel with TCM having an advantage of bandwidth efficiency, and a decoding method thereof are provided. A conventional TCM method has high bandwidth efficiency suitable for transmitting information at high speed. However, it is very sensitive to InterSymbol interference (ISI) so it is usually applied to a wire communication system rather than to a wireless communication system. A turbo code method is an error correction encoding method showing steadiness in a channel having severe ISI and having an excellent error correction ability, but has drawbacks of low data transmission rate and low bandwidth efficiency due to a low code rate. Bandwidth-efficient concatenated TCM is provided for enhancing the steadiness against ISI and-improving power and bandwidth efficiency by applying the turbo code method to a TCM having a code rate of m/(m+1) to compensate for the drawbacks of the conventional TCM and turbo codes. A newly provided decoding method in bandwidth-efficient concatenated TCM uses a SOVA algorithm, thereby reducing decoder complexity and path memory. In addition, bandwidth-efficient concatenated TCM encoder and decoder are provided such to have parallel transition, thereby reducing the complexity of the bandwidth-efficient concatenated TCM decoder. Therefore, the Bandwidth-efficient concatenated TCM is applied to a high speed wireless communication system and can increase bandwidth efficiency and coding gain.
摘要:
To implement plural types of interleaving for decoding each of various codes in an adaptively suitable manner for the code by a simple circuit construction, an interleaver (100) in an element decoder includes a plurality of data storage circuits (407), and in addition, a control circuit (400) which generates address data for use to write data to the storage circuits (407) and address data for use to read date from the storage circuits (400), an address data selection circuit (405) which selects address data to be distributed to the plurality of storage circuits (407) according to a mode indicating the configuration of a code including the type of an interleaving to be done, an input data selection circuit (406) which selects data to be distributed to the plurality of storage circuits (407) according to the mode, and an output data selection circuit (408) which selects data to be outputted according to the mode. Of the plural storage circuits (407), a one to be used is selected.
摘要:
A Viterbi decoder including an Add-Select-Compare unit with a new butterfly unit (300) having only two adders (310, 320), compared with a conventional butterfly unit's four adders, for processing a trellis transition having branch metric of zero. The new butterfly unit (300) is thus of reduced complexity (saving 8% of the total Viterbi decoder complexity in a typical example). Methods are also disclosed for producing suitable metrics for use with the new butterfly unit, and for optimizing these metrics by dynamic scaling (particularly suitable for OFDM applications) and adaptation for additive noise. The invention is particularly suitable for high speed, low-power implementations for broadband communications applications, and may be implemented in software or hardware.
摘要:
Method and apparatus for Soft In Soft Out Turbo Code Decoder. Metrics are received by a decoder having SISO unit(s). The SISO unit computes all the alpha values corresponding to a block of data. Of the alpha values computed some alpha values, for example alpha values selected at regular intervals, corresponding to checkpoint values are pushed on a checkpoint stack. Alpha values are computed with some being saved as checkpoint values and some being discarded are computed until the computation reaches a predetermined distance from the end of the block of data. Once the predetermined distance is reached all alpha values are pushed on a computation stack. Once all the values corresponding to the values between the predetermined end of the block and the end of the block have been computed and placed in the computation stack they may be combined with beta values to produce extrinsic values. Once all the values have been used from the computation stack the next checkpoint value can be used to compute another computation stack of alpha values. The alpha values can then be combined with beta values to form extrinsic values and the process continued.
摘要:
Parallel concatenated trellis-coding modulation is accomplished by producing coded bits (21) from uncoded bits and also producing an interleaved version (22) of the coded bits from the uncoded bits. A first coded bits-to-signal mapping (mapping 1) is applied to the coded bits to produce a first output signal (S11), and a second coded bits-to-signal mapping (mapping 2) is applied to the interleaved version of the coded bits to produce a second output signal (S22), wherein the second coded bits-to-signal mapping differs from the first coded bits-to-signal mapping.
摘要:
A method and apparatus are used for determining a metric in a decoding algorithm, such as a Viterbi algorithm, using an n-bit processing module, on the basis of plural m-bit soft input words, wherein n≧2×m. The technique comprises: receiving plural m-bit soft input words; assembling at least two of the plural m-bit soft input words into a single n-bit composite soft input word; computing the respective distances between the at least two soft input words in the composite soft input word and expected codeword values to produce a composite distance word; summing the respective distances together to produce the metric; and extracting the metric. The n-bit processing module may comprise a 16-bit processing module employing 16-bit words, and the m-bit soft input words may each comprise a 4-bit word. Processing the plural soft input words en bloc increases the speed and information transfer rate of the decoder, and reduces the memory requirements of the decoder.
摘要:
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.