US20030097633A1  High speed turbo codes decoder for 3G using pipelined SISO LogMap decoders architecture  Google Patents
High speed turbo codes decoder for 3G using pipelined SISO LogMap decoders architecture Download PDFInfo
 Publication number
 US20030097633A1 US20030097633A1 US10065408 US6540802A US20030097633A1 US 20030097633 A1 US20030097633 A1 US 20030097633A1 US 10065408 US10065408 US 10065408 US 6540802 A US6540802 A US 6540802A US 20030097633 A1 US20030097633 A1 US 20030097633A1
 Authority
 US
 Grant status
 Application
 Patent type
 Prior art keywords
 decoder
 data
 memory
 log
 map
 Prior art date
 Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
 Abandoned
Links
Images
Classifications

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L1/00—Arrangements for detecting or preventing errors in the information received
 H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
 H04L1/0045—Arrangements at the receiver end
 H04L1/0047—Decoding adapted to other signal detection operation
 H04L1/005—Iterative decoding, including iteration between signal detection and decoding operation

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
 H03M13/2957—Turbo codes and decoding

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03  H03M13/35
 H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
 H03M13/3905—Maximum a posteriori probability [MAP] decoding and approximations thereof based on trellis or lattice decoding, e.g. forwardbackward algorithm, logMAP decoding, maxlogMAP decoding; MAP decoding also to be found in H04L1/0055

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03  H03M13/35
 H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
 H03M13/3905—Maximum a posteriori probability [MAP] decoding and approximations thereof based on trellis or lattice decoding, e.g. forwardbackward algorithm, logMAP decoding, maxlogMAP decoding; MAP decoding also to be found in H04L1/0055
 H03M13/3922—AddCompareSelect [ACS] operation in forward or backward recursions

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03  H03M13/35
 H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
 H03M13/3961—Arrangements of methods for branch or transition metric calculation

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/65—Purpose and implementation aspects
 H03M13/6577—Representation or format of variables, register sizes or wordlengths and quantization

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L1/00—Arrangements for detecting or preventing errors in the information received
 H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
 H04L1/0045—Arrangements at the receiver end
 H04L1/0052—Realisations of complexity reduction techniques, e.g. pipelining or use of lookup tables

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L1/00—Arrangements for detecting or preventing errors in the information received
 H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
 H04L1/0045—Arrangements at the receiver end
 H04L1/0055—MAPdecoding

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L1/00—Arrangements for detecting or preventing errors in the information received
 H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
 H04L1/0056—Systems characterized by the type of code used
 H04L1/0071—Use of interleaving
Abstract
The invention encompasses several improved Turbo Codes Decoder method and apparatus to provide a more suitable, practical and simpler method for implementation a Turbo Codes Decoder in ASIC or DSP codes. (1) Two pipelined LogMAP decoders are used for iterative decoding of received data. (2) A Sliding Window of Block N data are used on the input Memory for pipeline operations. (3) The output block N data from the first decoder A are stored in the RAM memory A, and the second decoder B stores output data in the RAM memory B, such that in pipeline mode Decoder A decodes block N data from the RAM memory B while the Decoder B decodes block N data from the RAM memory A at the same clock cycle. (4) LogMAP decoders are simpler to implement in ASIC and DSP codes with, only Adder circuits, and are lowpower consumption. (5) Pipelined LogMAP decoders architecture provides high speed data throughput, one output per clock cycle.
Description
 [0001]This is a continuation of patent application Ser. No. 09/681,093 filed Jan. 2, 2001.
 [0002]1. Field of the Invention
 [0003]This invention relates to Wireless Baseband Processor and Forward ErrorCorrection (FEC) Codes for 3G Wireless Mobile Communications; and more particularly, to a very high speed Turbo Codes Decoder using pipelined LogMAP decoders architecture for 3G CDMA2000 and 3G WCDMA.
 [0004]2. Description of Prior Art
 [0005]Turbo Codes is based upon the classic forward error correction concepts that include the use of recursive systematic constituent Encoders (RSC) and Interleaver to reduce E_{b}/N_{0 }for powerlimited wireless applications such as digital 3G Wireless Mobile Communications.
 [0006]A Turbo Codes Decoder is an important baseband processor of the digital wireless communication Receiver, which was used to reconstruct the corrupted and noisy received data and to improve BER (10^{−6}) throughput. The FIG. 1. shows an example of a 3G Receiver with a Turbo Codes Decoder 13 which decodes data from the Demodulator 11 and Demapping 12 modules, and sends decoded data to the MAC layer 14.
 [0007]A most widely used FEC is the Viterbi Algorithm Decoder in both wired and wireless application. The drawback is that it would requires a long waiting for decisions until the whole sequence has been received. A delay of six time the memory of the received data is required for decoding. One of the more effective FEC, with higher complexity, a MAP algorithm used to decode received message has comprised the steps of very computational complex, requiring many multiplications and additions per bit to compute the posteriori probability. The major difficulty with the use of MAP algorithm has been the implementation in semiconductor ASIC devices, the complexity the multiplications and additions which will slow down the decoding process and reducing the throughput data rates. Furthermore, even under the best conditions, each multiplication will be used in the MAP algorithm, that would create a large circuits in the ASIC. The result is costly, and low performance in bit rates throughput.
 [0008]Recently introduced by the 3GPP organization a new class of error correction codes using parallel concatenated codes (PCCC) that include the use of the classic recursive systematic constituent Encoders (RSC) and Interleaver as shown in FIG. 3. offers great improvement. An example of the 3GPP Turbo Codes PCCC with 8states and rate ⅓ is shown in FIG. 3., data enters the two systematic encoders 31 33 separated by an interleaver 32. An output codeword consists of the source data bit followed by the output bits of the two encoders.
 [0009]Other prior work of error correction codes was done by Berrou et al. describing a parallel concatenated codes which is much complex encoding structure which is not suitable for portable wireless device. Another patent U.S. Pat. No. 6,023,783 by Divsalar and Pollara et al. describes a more improved encoding method than Berrou and mathematical concepts of parallel concatenated codes. However, patents by Berrou et al., Divsalar et al., and others only described the concept of parallel concatenated codes using mathematical equations which are good for research in deep space communications and other government projects but are not feasible, economical, and suitable for consumers' portable wireless device. The encoding of data is simple and can be easily implemented with a few xor and flipflop logic gates. But the decoding the Turbo Codes is much more difficult to implement in ASIC or software. The prior arts describe briefly the implementation of the Turbo Codes Decoder which are mostly for deep space communications and requires much more hardware, powers and costs.
 [0010]Another prior art example of a 16states Superorthogonal Turbo Codes (SOTC) is shown in FIG. 2. It is identical to the previous 3GPP Turbo Codes PCCC except a Walsh Code Generator substitutes for the XOR binary adder. Data enters the two systematic encoders 21 23 separated by an interleaver 22. An output codeword consists of the two Walsh Codes output of the two encoders.
 [0011]All the prior arts of Turbo Codes fail to provide a simpler and suitable method and architecture for a Turbo Codes Decoder as it is required and desired for 3G cellular phones and 3G personal communication devices including high speed data throughput, low power consumption, lower costs, limited bandwidth, and limited power transmitter in noisy environment.
 [0012]The present invention concentrates only on the Turbo Codes Decoder to implement a more efficient, practical and suitable architecture and method to achieve the requirements for 3G cellular phones and 3G personal communication devices including higher speed data throughput, lower power consumptions, lower costs, and suitable for implementation in ASIC or DSP codes. The present invention encompasses improved and simplified Turbo Codes Decoder method and apparatus to deliver higher speed and lower power especially for 3G applications. As shown in FIG. 5., and FIG. 4., our invention Turbo Codes Decoder utilizes two pipelined and serially concatenated SISO LogMAP Decoders. The two decoders function in a pipelined scheme; while the first decoder is decoding data in the seconddecoderMemory, the second decoder performs decoding data in the firstdecoderMemory, which produces a decoded output every clock cycle in results. As shown in FIG. 6., our invention Turbo Codes Decoder utilizes a Sliding Window of Block N on the input buffer memory to decode per block N data for improvement processing efficiency. Accordingly, several objects and advantages of our Turbo Codes Decoder are:
 [0013]To deliver higher speed throughput and lower power consumption
 [0014]To utilize SISO LogMAP decoder for faster decoding and simplified implementation in ASIC and DSP codes with the use of binary adders for computation.
 [0015]To perform reiterative decoding of data backandforth between the two LogMAP decoders in a pipelined scheme until a decision is made. In such pipelined scheme, a decoded output data is produced each clock cycle.
 [0016]To utilize a Sliding Window of Block N on the input buffer memory to decode per block N data for improvement pipeline processing efficiency
 [0017]To improve higher performance in term of symbol error probability and low BER (10^{−6})for 3G applications such as 3G WCDMA, and 3G CDMA2000 operating at very high bitrate up to 100 Mbps in a low power noisy environment.
 [0018]To utilize an simplified and improved architecture of SISO LogMAP decoder including branchmetric (BM) calculations module, recursive statemetric (SM) forward/backward calculations module, AddCompareSelect (ACS) circuit, LogMAP posteriori probability calculations module, and output decision module.
 [0019]To reduce complexity of multiplier circuits in MAP algorithm by perform the entire MAP algorithm in Log Max approximation with the uses of binary adder circuits which are more suitable for ASIC and DSP codes implementation while still maintain a high level of performance output.
 [0020]To design an improve LogMAP Decoder using high level design language (HDL) such as Verilog, systemC and VHDL which can be synthesized into custom ASIC and FPGA devices.
 [0021]To implement an improve LogMAP Decoder in DSP (digital signal processor) using optimized high level language C, C++, or assembly language.
 [0022]Still further objects and advantages will become apparent to one skill in the art from a consideration of the ensuing descriptions and accompanying drawings.
 [0023][0023]FIG. 1. is a typical 3G Receiver Functional Block Diagram which use Turbo Codes Decoder for errorcorrection. (Prior Art).
 [0024][0024]FIG. 2. is an example of an 16states Superorthogonal Turbo Code (SOTC) Encoder with Walsh code generator. (Prior Art).
 [0025][0025]FIG. 3. is a block diagram of the 8states 3GPP Parallel Concatenated Convolutional Codes. (Prior Art).
 [0026][0026]FIG. 4. is the Turbo Codes Decoder System Block Diagram showing LogMAP Decoders, Interleavers, Memory Buffers, and control logics.
 [0027][0027]FIG. 5. is a Turbo Codes Decoder State Diagram.
 [0028][0028]FIG. 6. is the Block N Sliding Window Diagram.
 [0029][0029]FIG. 7. is a block diagram of the SISO LogMAP Decoder showing Branch Metric module, State Metric module, LogMAP module, am State and Branch Memory modules.
 [0030][0030]FIG. 8a. is the 8States Trellis Diagram of a SISO LogMAP Decoder using for the 3GPP 8state PCCC Turbo codes.
 [0031][0031]FIG. 8b. is the 16States Trellis Diagram of a SISO LogMAP Decoder using for the superorthogonal Turbo codes (SOTC).
 [0032][0032]FIG. 9. is a block diagram of the BRANCH METRIC COMPUTING module.
 [0033][0033]FIG. 10a. is a block diagram of the LogMAP computing for u=0.
 [0034][0034]FIG. 10b. is a block diagram of the LogMAP computing for u=1.
 [0035][0035]FIG. 11. is a block diagram of the LogMAP Compare & Select I maximum logic for each state.
 [0036][0036]FIG. 12. is a block diagram of the Soft Decode module.
 [0037][0037]FIG. 13. is a block diagram of the Computation of Forward Recursion of State Metric module (FACS).
 [0038][0038]FIG. 14. is a block diagram of the Computation of Backward Recursion of State Metric module (BACS).
 [0039][0039]FIG. 15. showing State Metric Forward computing of Trellis state transitions.
 [0040][0040]FIG. 16. showing State Metric Backward computing of Trellis state transitions.
 [0041][0041]FIG. 17. is a block diagram of the State Machine operations of LogMAP Decoder.
 [0042][0042]FIG. 18. is a block diagram of the BM dualport Memory Module.
 [0043][0043]FIG. 19. is a block diagram of the SM dualport Memory Module.
 [0044][0044]FIG. 20. is a block diagram of the DeInterleaver dualport RAM Memory Memory Module for interleaved input R2.
 [0045][0045]FIG. 21. is a block diagram of the dual RAM Memory Module for input R0,R1.
 [0046][0046]FIG. 24. is a block diagram of the intrinsic feedback Adder of the Turbo Codes Decoder.
 [0047][0047]FIG. 23. is a block diagram of the Iterative decoding feedback control.
 [0048]Turbo Codes Decoder
 [0049]An exhibition of a 3GPP 8state Parallel Concatenated Convolutional Code (PCCC), with coding rate ⅓, constraint length K=4, using SISO LogMAP Decoders is provided for simplicity in descriptions of the invention. As shown in FIG. 4, a Turbo Codes Decoder has two concatenated LogMAP SISO Decoders A 42 and B 44 connected in a feedback loop with dualport Memory 43 and dualport Memory 45 in between. An input interleaver Memory 41, shown in details FIG. 20, has one interleaver 201, and dualport RAM memory 202. Input Memory blocks 48 49, shown in details FIG. 21, have dualport RAM memory 202. A control logic module (CLSM) 47, consists of various statemachines, which control all the operations of the Turbo Codes Decoder. The harddecoder module 46 outputs the final decoded data. Signals R2, R1, R0 are the received soft decision data from the system receiver. Signal XO1, and XO2 are the output soft decision of the LogMAP Decoders A 42 and B 44 respectively, which are stored in the buffer Memory 43 and Memory 45 module. Signal Z2 and Z1 are the output of the buffer Memory 43 and Memory 45 where the Z2 is feed into LogMAP decoder B 44, and Z1 is feedback into an Adder 231 then into LogMAP decoder A 42 for iterative decoding.
 [0050]More particularly, the R0 is the data bit corresponding to the the transmit data bit u, R1 is the first parity bit corresponding to the output bit of the first RSC encoder, and R2 is interleaved second parity bit corresponding to the output bit of the second RSC encoder as reference to FIG. 3.
 [0051]In accordance with the invention, the R0 data is added to the feedback Z1 data then feed into the decoder A, and R1 is also fed into decoder A for decoding the first stage of decoding output X01. The Z2 and R2 are fed into decoder B for decoding the second stage of decoding output X02.
 [0052]In accordance with the invention, as shown in FIG. 6., the Turbo Codes Decoder utilizes a Sliding Window of Block N 61 on the input buffers 62 to decode one block N data at a time, the next block N of data is decoded after the previous block N is done in a circular wraparound scheme for pipeline operations.
 [0053]In accordance with the invention, the Turbo Codes Decoder decodes an 8state Parallel Concatenated Convolutional Code (PCCC), and also decodes a 16states Superorthogonal Turbo Codes SOTC with different code rates.
 [0054]As shown in FIG. 4. the Turbo Codes Decoder functions effectively as follows:
 [0055]Received soft decision data (RXData[2:0]) are stored in three input buffers Memory 48 49 41 to produce R0, R1, and R2 output data words. Each output data word R0, R1, R2 contains a number of binary bits.
 [0056]A Sliding Window of Block N is imposed onto each input memory to produce R0, R1, and R2 output data words.
 [0057]When a block of N input data is ready, the Turbo Decoder starts the LogMAP Decoder A to decode the N input data based on the softvalues of R0, Z1 and R1, then stores the outputs in the buffer Memory A.
 [0058]The Turbo Decoder also starts the LogMAP Decoder B at the same time to decode the N input data based on the softvalues of R2 and Z2, then store the outputs in the DeInterleaver Memory.
 [0059]The Turbo Decoder will do the iterative decoding for L number of times (L=1,2, . . . M). The LogMAP Decoder A uses the sum of Z1 and R1 and R0 as inputs. The LogMAP Decoder B uses the data Z2 and R2 as inputs.
 [0060]When the iterative decoding sequences are done, the Turbo Decoder starts the harddecision operations to compute and produce softdecision outputs.
 [0061]SISO LogMAP Decoder
 [0062]As shown in FIG. 7., an SISO LogMAP Decoder42 44 comprises of a Branch Metric (BM) computation module 71, a State Metric (SM) computation module 72, a LogMAP computation module 73, a BM Memory module 74, a SM Memory module 75, and a Control Logic State Machine module 76. Softvalues inputs enter the Branch Metric (BM) computation module 71, where Euclidean distance is calculated for each branch, the output branch metrics are stored in the BM Memory module 74. The State Metric (SM) computation module 72 reads branch metrics from the BM Memory 74 and compute the state metric for each state, the output statemetrics are stored in the SM Memory module 75. The LogMAP computation module 73 reads both branchmetrics and statemetrics from BM memory 74 and SM memory 75 modules to compute the Log Maximum a Posteriori probability and produce softdecision output. The Control Logic Statemachine module 76 provides the overall operations of the decoding process.
 [0063]As shown in FIG. 7. and primary example of 3GPP Turbo Codes, the LogMAP Decoder 42 44 functions effectively as follows:
 [0064]The LogMAP Decoder 42 44 reads each softvalues (SD) data pair input, then computes branchmetric (BM) values for all paths in the Turbo Codes Trellis 80 as shown in FIG. 8a. (and Trellis 85 in 8 b.), then stores all BM data into BM Memory 74. It repeats computing BM values for each input data until all N samples are calculated and stored in BM Memory 74.
 [0065]The LogMAP Decoder 42 44 reads BM values from BM Memory 74 and SM values from SM Memory 75, and computes the forward statemetric (SM) for all states in the Trellis 80 as shown in FIG. 8a. (and Trellis 85 in 8 b.), then store all forward SM data into SM Memory 75. It repeats computing forward SM values for each input data until all N samples are calculated and stored in SM Memory 75.
 [0066]The LogMAP Decoder 42 44 reads BM values from BM Memory 74 and SM values from SM Memory 75, and computes the backward statemetric (SM) for all states in the Trellis 80 as shown in FIG. 8a. (and Trellis 85 in 8 b.), then store all backward SM data into the SM Memory 75. It repeats computing backward SM values for each input data until all N samples are calculated and stored in SM Memory 75.
 [0067]The LogMAP Decoder 42 44 then computed LogMAP posteriori probability for u=0 and u=1 using BM values and SM values from BM Memory 74 and SM Memory 75. It repeats computing LogMAP posteriori probability for each input data until all N samples are calculated. The LogMAP Decoder then decodes data by making soft decision based on the posteriori probability for each stage and produce softdecision output, until all N inputs are decoded.
 [0068]Branch Metric Computation module
 [0069]The Branch Metric (BM) computation module 71 computes the Euclidean distance for each branch in the 8states Trellis 80 as shown in the FIG. 8a. based on the following equations:
 Local Euclidean distances values=SD 0*G 0+SD 1*G 1
 [0070]The SD0 and SD1 are softvalues input data, G0 and G1 are the expected input for each path in the Trellis 80. G0 and G1 are coded as signed antipodal values, meaning that 0 corresponds to +1 and 1 corresponds to −1. Therefore, the local Euclidean distances for each path in the Trellis 80 are computed by the following equations:
 M 1=SD 0+SD 1
 M 2=−M 1
 M3=M2
 M4=M1
 M 5=−SD 0+SD 1
 M 6=−M 5
 M7=M6
 M8=M5
 M9=M6
 M10=M5
 M11=M5
 M12=M6
 M13=M2
 M14=M1
 M15=M1
 M16=M2
 [0071]As shown in FIG. 9., the Branch Metric Computing module comprise of one Lbit Adder 91, one Lbit Subtracter 92, and a 2′complemeter 93. It computes the Euclidean distances for path M1 and M5. Path M2 is 2′complement of path M1. Path M6 is 2′complement of M5. Path M3 is the same path M2, path M4 is the same as path M1, path M7 is the same as path M6, path M8 is the same as path M5, path M9 is the same as path M6, path M10 is the same as path M5, path M11 is the same as path M5, path M12 is the same as path M6, path M13 is the same as path M2, path M14 is the same as path M1, path M15 is the same as path M1, and path M16 is the same as path M2.
 [0072]State Metric Computing Module
 [0073]The State Metric Computing module 72 calculates the probability A(k) of each state transition in forward recursion and the probability B(k) in backward recursion. FIG. 13. shows the implementation of statemetric in forward recursion with AddCompareSelect (ACS) logic, and FIG. 14. shows the implementation of statemetric in backward recursion with AddCompareSelect (ACS) logic. The calculations are performed at each node in the Turbo Codes Trellis 80 (FIG. 8a.) in both forward and backward recursion. The FIG. 15. shows the forward state transitions in the Turbo Codes Trellis 80 (FIG. 8a.), and FIG. 16. show the backward state transitions in the Turbo Codes Trellis 80 (FIG. 8a.). Each node in the Trellis 80 as shown in FIG. 8a. has two entering paths: onepath 84 and zeropath 83 from the two nodes in the previous stage.
 [0074]The ACS logic comprises of an Adder 132, an Adder 134, a Comparator 131, and a Multiplexer 133. In the forward recursion, the Adder 132 computes the sum of the branch metric and state metric in the onepath 84 from the state s(k−1) of previous stage (k−1). The Adder 134 computes the sum of the branch metric and state metric in the zeropath 83 from the state (k−1) of previous stage (k−1). The Comparator 131 compares the two sums and the Multiplexer 133 selects the larger sum for the state s (k) of current stage (k). In the backward recursion, the Adder 142 computes the sum of the branch metric and state metric in the onepath 84 from the state s(j+1) of previous stage (J+1). The Adder 144 computes the sum of the branch metric and state metric in the zeropath 83 from the state s(j+1) of previous stage (J+1). The Comparator 141 compares the two sums and the Multiplexer 143 selects the larger sum for the state s(j) of current stage (j).
 [0075]The Equations for the ACS are shown below:
 A(k)=MAX [(bm 0+sm 0(k−1)), (bm 1+sm 1(k−1)]
 B(j)=MAX [(bm 0+sm 0(j+1)), (bm 1+sm 1(j+1)]
 [0076]Time (k−1) is the previous stage of (k) in forward recursion as shown in FIG. 15., and time (j+1) is the previous stage of (j) in backward recursion as shown in FIG. 16.
 [0077]LogMAP Computing Module
 [0078]The LogMAP computing module calculates the posteriori probability for u=0 and u=1, for each path entering each state in the Turbo Codes Trellis 80 corresponding to u=0 and u=1 or referred as zeropath 83 and onepath 84. The accumulated probabilities are compared and selected the u with larger probability. The softdecision are made based on the final probability selected for each bit. FIG. 10a. shows the implementation for calculating the posteriori probability for u=0. FIG. 10b. shows the implementation for calculate the posteriori probability for u=1. FIG. 11. shows the implementation of compareandselect the u with larger probability. FIG. 12. shows the implementation of the softdecode compare logic to produce output bits based on the posteriori probability of u=0 and u=1. The equations for calculation the accumulated probabilities for each state and compareandselect are shown below:
 sum_{—} s 00=sm 0 i+bm 1+sm 0 j
 sum_{—} s 01=sm 3 i+bm 7+sm 1 j
 sum_{—} s 02=sm 4 i+bm 9+sm 2 j
 sum_{—} s 03=sm 7 i+bm 15+sm 3 j
 sum_{—} s 04=sm 1 i+bm 4+sm 4 j
 sum_{—} s 05=sm 2 i+bm 6+sm 5 j
 sum_{—} s 06=sm 5 i+bm 12+sm 6 j
 sum_{—} s 07=sm 6 i+bm 14+sm 7 j
 sum_{—} s 10=sm 1 i+bm 3+sm 0 j
 sum_{—} s 11=sm 2 i+bm 5+sm 1 j
 sum_{—} s 12=sm 5 i+bm 11+sm 2 j
 sum_{—} s 13=sm 6 i+bm 13+sm 3 j
 sum_{—} s 14=sm 0 i+bm 2+sm 4 j
 sum_{—} s 15=sm 3 i+bm 8+sm 5 j
 sum_{—} s 16=sm 4 i+bm 10+sm 6 j
 sum_{—} s 17=sm 7 i+bm 16+sm 7 j
 s 00sum=MAX[sum_{—} s 00, 0]
 s 01sum=MAX[sum_{—} s 01, s 00sum]
 s 02sum=MAX[sum_{—} s 02, s 01sum]
 s 03sum=MAX[sum_{—} s 03, s 02sum]
 s 04sum=MAX[sum_{—} s 04, s 03sum]
 s 05sum=MAX[sum_{—} s 05, s 04sum]
 s 06sum=MAX[sum_{—} s 06, s 05sum]
 s 07sum=MAX[sum_{—} s 07, s 06sum]
 s 10sum=MAX[sum_{—} s 10, 0]
 s 11sum=MAX[sum_{—} s 11, s 10sum]
 s 12sum=MAX[sum_{—} s 12, s 11sum]
 s 13sum=MAX[sum_{—} s 13, s 12sum]
 s 14sum=MAX[sum_{—} s 14, s 13sum]
 s 15sum=MAX[sum_{—} s 15, s 14sum]
 s 16sum=MAX[sum_{—} s 16, s 15sum]
 s 17sum=MAX[sum_{—} s 17, s 16sum]
 [0079]Control Logics—State Machine (CLSM) Module
 [0080]As shown in FIG. 7. the Control Logics module controls the overall operations of the LogMAP Decoder. The control logic state machine 171, referred as CLSM, is shown in FIG. 17. The CLSM module 171 (FIG. 17.) operates effectively as the followings. Initially, it stays in IDLE state 172. When the decoder is enable, the CLSM transitions to CALCBM state 173, it then starts the Branch Metric (BM) module operations and monitor for completion. When Branch Metric calculations are done, referred as bmdone the CLSM transitions to CALCFWDSM state 174, it then tarts the State Metric module (SM) in forward recursion operation. When the forward SM state metric calculations are done, referred as fwdsm, the CLSM transitions to CALCBWDSM state 175, it then starts the State Metric module (SM) in backward recursion operations. When backward SM state metric calculations are done, referred as bwdsmdone the CLSM transitions to CALCLogMAP state 176, it then starts the LogMAP computation module to calculate the maximum a posteriori probability to produce soft decode output. When LogMAP calculations are done, referred as logmapdone, it transitions back to IDLE state 172.
 [0081]BM Memory and SM Memory
 [0082]The BranchMetric Memory 74 and the StateMetric Memory 75 are shown in FIG. 7. as the data storage components for BM module 71 and SM module 72. The Branch Metric Memory module is a dualport RAM contains Mbit of N memory locations as shown in FIG. 18. The State Metric Memory module is a dualport RAM contains Kbit of N memory locations as shown in FIG. 19. Data can be written into one port while reading at the other port.
 [0083]Buffer Memory
 [0084]As shown in FIG. 4., the buffer Memory A 43 stores data for the first decoder A 42, and buffer Memory B 45 stores data for the second decoder B 44. In an iterative pipelined decoding, the decoder A 42 reads data from buffer memory B 45 and writes results data into buffer memory B 43, the decoder B 44 reads data from buffer memory A 43 and write results into buffer memory B 45.
 [0085]As shown in FIG. 20., the DeInterleaver memory 41 comprises of an DeInterleaver module 201 and a dualport RAM 202 contains Mbit of N memory locations. The Interleaver is a Turbo code internal interleaver as defined by 3GPP standard ETSI TS 125 222 V3.2.1 (200005), or other source. The Interleaver permutes the address input port A for all write operations into dualport RAM module. Reading data from output port B are done with normal address input.
 [0086]As shown in FIG. 21., the buffer memory 43 45 comprises of a dualport RAM 212 contains Mbit of N memory locations.
 [0087]Turbo Codes Decoder Control Logics—State Machine (TDCLSM)
 [0088]As shown in FIG. 4. the Turbo Decoder Control Logics module 47, referred as TDCLSM, controls the overall operations of the Turbo Codes Decoder. LogMAP A 42 starts the operations of data in Memory B 45. At the same time, LogMAP B starts the operations in Memory A 43. When LogMAP A 42 and LogMAP B 44 are done for a block N data, the TDCLSM 47 starts the iterative decoding for L number of times. When the iterative decoding sequences are done, the TDCLSM 47 transitions to HARDDEC to generate the harddecode outputs. Then the TDCLSM 47 transitions to start decoding another block of data.
 [0089]Iterative Decoding
 [0090]Turbo Codes decoder performs iterative decoding L times by feeding back the output Z1 of the second LogMAP decoder B into the first LogMAP decoder A, before making decision for harddecoding output. As shown in FIG. 23., the Counter 233 count the preset number L times.
Claims (14)
 1. An apparatus of turbo codes decoder used as a baseband processor subsystem for iterative decoding a plurality of sequences of received data R_{n }representative of coded data X_{n }generated by a turbo codes encoder from a source of original data u_{n }into decoded data Y_{n }comprising of:(a) two pipelined SISO LogMAP Decoders each decoding input data from the other output data in an iterative mode.(b) the first SISO LogMAP Decoder A having three inputs: R_{0}, R_{1 }connecting from the two Input Memory modules 48 49, and Z_{1 }feedingback from the buffer Memory B module 45 output; the output of the Adder 231 of two input values R_{0 }and Z_{1 }is connected to Decoder A 42; and the first Decoder output is connected to a buffer Memory A module 43.(c) the second SISO LogMAP Decoder B having two inputs: R_{2 }connecting from the Input Memory module 41, and Z_{2 }connecting from the buffer Memory A module output; and the second Decoder output is connected to a buffer Memory B module 45.(d) a buffer Memory A module 43 storing decoded data from the first LogMAP Decoder A 42, feeding data to the second LogMAP Decoder B 44.(e) a buffer Memory B module 45 storing decoded data from the second LogMAP Decoder B 44, feedingback data to the first LogMAP Decoder A 42.(f) an Adder 231 to produce a sum values of the two inputs R_{0 }and Z_{1 }output for the first LogMAP Decoder A 42.(g) Three Input Buffer Memory modules 48 49 41 storing input soft decision received data, and feeding data to the two LogMAP Decoders.(h) a Control logic state machine 47 controlling the overall operations of the Turbo Codes Decoder.(i) a harddecoder logic 46 producing a final decision of either logic zero 0 or logic one 1 at the end of the iterations.
 2. The Decoder system of
claim 1 , wherein each LogMAP decoder uses the logarithm maximum a posteriori probability algorithm. The Decoder system ofclaim 1 , wherein each LogMAP decoder uses the softinput and softoutput (SISO) method maximum a posteriori probability algorithm.The Decoder system ofclaim 1 , wherein each LogMAP decoder uses the Log Max approximation algorithm.  3. The Decoder system of
claim 1 , wherein the two serially connected SISO LogMAP Decoders each decoding input data from the other output data in pipeline mode to produce soft decoded data each clock cycle.  4. The Decoder system of
claim 1 , wherein the Memory modules use dualport memory RAM.The Decoder system ofclaim 1 , wherein the input buffer Interleaver Memory module uses an interleaver to generate the writeaddress sequences of the Memory core in writemode. In readmode, the memory core readaddress are normal sequences.  5. The Decoder system of
claim 1 , wherein a Sliding Window of Block N is used on the input buffer Memory so that each block N data is decoded at a time one block after another in a pipeline scheme.The Decoder system ofclaim 1 , wherein the a Sliding Window of Block N is used on the input buffer Memory in a continuous circular wraparound scheme for pipeline operations.  6. A method for iterative decoding a plurality of sequences of received data R_{n }representative of coded data X_{n }generated by a Turbo Codes Encoder from a source of original data u_{n }into decoded data Y_{n }comprising the steps of:(a) coupling two pipelined LogMAP decoders serially connected, having buffer Memory A and buffer Memory B for storing decoded output and providing feedback input for the decoders.(b) applying feedback signal from the output of the buffer Memory B to the first decoder A, by adding the intrinsic values Z1 with the received signal R0 input, to generate a first decoded output XO1.(c) applying the first decoded output to the buffer Memory A, and feeding the data with the received signal R2 input into the second decoder B to generate a second decoded output XO2.(d) applying the second decoded output XO2 to the buffer Memory B and feeding back the data to the first decoder A.(e) executing operations in both LogMAP Decoders at the same time such that each decoder use the other's output as an input in iterative decoding.(f) applying a Sliding Window of Block N on the input buffer Memory so that each block N data is decoded at a time one block after another in a pipeline scheme.(g) applying an iterative decoding on each input data for L times until a desire soft decision is achieved and a hard decode output is generated.
 7. An apparatus of SISO LogMAP Decoder for decoding a plurality of sequences of softinput data SD_{0 }and SD_{1 }generated by a receiver to produce decoded softoutput data Y comprising of:(a) a Branch Metric module computing the two softinput data SD_{0 }and SD_{1 }into branch metric values for each branch in the trellis.(b) a Branch Metric Memory module storing the branch metric values for each stage k=0 . . . N.(c) a State Metric module computing state metric values for each state in the trellis using branch metric values. A State Metric Computing module calculates the probability A(k) of each state transition in forward recursion and the probability B(k) in backward recursion.(d) an AddCompareSelect (ACS) circuit to compute state metric values at each node in the Trellis.(e) a State Metric Memory module storing state metric values for each stage k=0 . . . N.(f) a LogMAP module computing the soft decision output based on the branch metric values and state metric values using log maximum a posteriori probability algorithm.(g) a Control Logic state machine module controlling the overall operations of the LogMAP decoder.
 8. The Decoder system of
claim 7 , wherein the decoder uses the logarithm maximum a posteriori probability algorithm.The Decoder system ofclaim 7 , wherein each LogMAP decoder uses the Log Max approximation algorithm.The Decoder system ofclaim 7 , wherein the decoder uses the softinput and softoutput (SISO) method Log maximum a posteriori probability algorithm.  9. The Decoder system of
claim 7 , wherein the decoder implements statemetric in forward recursion with AddCompareSelect (ACS).The Decoder system ofclaim 7 , wherein the decoder implements statemetric in backward recursion with AddCompareSelect (ACS).  10. The Decoder system of
claim 7 , wherein the decoder uses an 8states Trellis state transition diagram for 3GPP PCCC Turbo Codes.The Decoder system ofclaim 7 , wherein the decoder uses an 16states Trellis state transition diagram for Superorthogonal Turbo Codes SOTC.The Decoder system ofclaim 7 , wherein the decoder uses an Nstates trellis state transition diagram for higher order Superorthogonal Turbo Codes SOTC.  11. The Decoder system of
claim 7 , wherein the the branch metric module uses a binary adder, a binary Subtracter, and two binary twocomplementers logic.The Decoder system ofclaim 7 , wherein the the state metric module uses a binary adder, a comparator, a Mux selector logic.The Decoder system ofclaim 7 , wherein the the logmap module uses binary adders, binary maximum selectors logic.The Decoder system ofclaim 7 , wherein the the branch metric memory module uses dualport memory RAM.The Decoder system ofclaim 7 , wherein the soft decoder module uses soft decision algorithm.  12. A method for LogMap decoding a plurality of sequences of received data SD_{0 }and SD_{1 }generated by a receiver to produce decoded softoutput data Y comprising the steps of:(a) computing the branch metric for each input data in a block N data for the branches entering each state in the Trellis, then storing the results into the BM Memory.(b) computing the forward recursion state metric with ACS for each data in BM Memory, for a block N data, for the each state in the Trellis, then storing the results into the SM Memory.(c) computing the backward recursion state metric with ACS for each data in BM Memory, for a block N data, for the each state in the Trellis, then storing the accumulated results into the SM Memory.(d) computing the LogMap values from each data in BM Memory and SM Memory, for a block N data, for the each state in the Trellis.(e) applying soft decision algorithm for each state and generate soft decoded outputs.
 13. An apparatus of an ACS (addcompareselect) for computing a plurality of sequences of sm0, bm0, sm1, bm1 data to select max output data A comprising of:(a) an Adder0 to compute the sum of state metric sm0 and branch metric bm0 data,(b) an Adder1 to compute the sum of state metric sm1 and branch metric bm1 data,(c) a Comparator to compares the two sums,(d) and a Multiplexer selects the larger sum for the state s(k).
 14. An apparatus of Super Orthogonal Turbo Codes (SOTC) Decoder used as a baseband processor subsystem for iterative decoding a plurality of sequences of received Walsh code data RW_{i }and RW^{−} _{i }representative of Walsh coded data W_{i }and W^{−} _{j }generated by a Super Orthogonal Turbo Codes (SOTC) Encoder from a source of original data u_{n }into decoded data Y_{n }comprising of:(a) two pipelined SISO LogMAP Decoders each decoding input data from the other output data in an iterative mode.(d) a buffer Memory A module storing decoded data from the first LogMAP Decoder A, feeding data to the second LogMAP Decoder B.(e) a buffer Memory B module storing decoded data from the second LogMAP Decoder B, feedingback data to the first LogMAP Decoder A.(f) an Adder to produce a sum values of the two inputs RW_{i }and Z_{1 }output for the first LogMAP Decoder A.(g) The Input Buffer Memory modules storing input soft decision received data, and feeding data to the two LogMAP Decoders.(h) a Control logic state machine controlling the overall operations of the Turbo Codes Decoder.(i) a harddecoder logic producing a final decision of either logic zero 0 or logic one 1 at the end of the iterations.
Priority Applications (2)
Application Number  Priority Date  Filing Date  Title 

US09681093 US6813742B2 (en)  20010102  20010102  High speed turbo codes decoder for 3G using pipelined SISO logmap decoders architecture 
US10065408 US20030097633A1 (en)  20010102  20021015  High speed turbo codes decoder for 3G using pipelined SISO LogMap decoders architecture 
Applications Claiming Priority (2)
Application Number  Priority Date  Filing Date  Title 

US10065408 US20030097633A1 (en)  20010102  20021015  High speed turbo codes decoder for 3G using pipelined SISO LogMap decoders architecture 
US10248245 US6799295B2 (en)  20010102  20021230  High speed turbo codes decoder for 3G using pipelined SISO logmap decoders architecture 
Related Parent Applications (1)
Application Number  Title  Priority Date  Filing Date  

US09681093 Continuation US6813742B2 (en)  20010102  20010102  High speed turbo codes decoder for 3G using pipelined SISO logmap decoders architecture 
Publications (1)
Publication Number  Publication Date 

US20030097633A1 true true US20030097633A1 (en)  20030522 
Family
ID=24733789
Family Applications (2)
Application Number  Title  Priority Date  Filing Date 

US09681093 Active 20211215 US6813742B2 (en)  20010102  20010102  High speed turbo codes decoder for 3G using pipelined SISO logmap decoders architecture 
US10065408 Abandoned US20030097633A1 (en)  20010102  20021015  High speed turbo codes decoder for 3G using pipelined SISO LogMap decoders architecture 
Family Applications Before (1)
Application Number  Title  Priority Date  Filing Date 

US09681093 Active 20211215 US6813742B2 (en)  20010102  20010102  High speed turbo codes decoder for 3G using pipelined SISO logmap decoders architecture 
Country Status (1)
Country  Link 

US (2)  US6813742B2 (en) 
Cited By (10)
Publication number  Priority date  Publication date  Assignee  Title 

US20020048329A1 (en) *  20000912  20020425  Tran Hau Thien  Method and apparatus for min star calculations in a map decoder 
US20040068744A1 (en) *  20001114  20040408  Claussen Paul J.  Proximity detection using wireless connectivity in a communications system 
US20050278603A1 (en) *  20020905  20051215  Stmicroelectronics N.V.  Combined turbocode/convolutional code decoder, in particular for mobile radio systems 
US20060282712A1 (en) *  20050518  20061214  Seagate Technology Llc  Low complexity pseudorandom interleaver 
US20070177696A1 (en) *  20060127  20070802  Pei Chen  Map decoder with bidirectional sliding window architecture 
US7266757B1 (en) *  20040129  20070904  Xilinx, Inc.  Pipelined architecture implementing recursion processes for forward error correction 
US20110134969A1 (en) *  20091208  20110609  Samsung Electronics Co., Ltd.  Method and apparatus for parallel processing turbo decoder 
US20120106683A1 (en) *  20090618  20120503  Zte Corporation  Method and apparatus for parallel turbo decoding in long term evolution system (lte) 
US20160315638A1 (en) *  20150421  20161027  National Tsing Hua University  Iterative decoding device, iterative signal detection device and information update method for the same 
US9973217B2 (en) *  20150421  20180515  National Tsing Hua University  SISO (soft input soft output) system for use in a wireless communication system and an operational method thereof 
Families Citing this family (27)
Publication number  Priority date  Publication date  Assignee  Title 

JP2004519886A (en) *  20010223  20040702  コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィＫｏｎｉｎｋｌｉｊｋｅ Ｐｈｉｌｉｐｓ Ｅｌｅｃｔｒｏｎｉｃｓ Ｎ．Ｖ．  Turbo decoder system with a parallel decoder 
US20030123563A1 (en) *  20010711  20030703  Guangming Lu  Method and apparatus for turbo encoding and decoding 
KR100438537B1 (en) *  20010719  20040703  엘지전자 주식회사  Decoder in mobile communication apparatus and control method thereof 
US6996767B2 (en) *  20010803  20060207  Combasis Technology, Inc.  Memory configuration scheme enabling parallel decoding of turbo codes 
KR100703307B1 (en) *  20020806  20070403  삼성전자주식회사  Turbo decoding apparatus and method 
US20100278287A1 (en) *  20030327  20101104  Nokia Corporation  List Output Viterbi Deconder with Blockwise ACS and Traceback 
US7246295B2 (en) *  20030414  20070717  Agere Systems Inc.  Turbo decoder employing simplified logmap decoding 
US7496164B1 (en) *  20030502  20090224  At&T Mobility Ii Llc  Systems and methods for interference cancellation in a radio receiver system 
USRE43791E1 (en)  20030502  20121106  At&T Mobility Ii Llc  Systems and methods for interference cancellation in a radio receiver system 
JP4217887B2 (en) *  20030722  20090204  日本電気株式会社  The receiving device 
KR20050042869A (en) *  20031104  20050511  삼성전자주식회사  MAP decoder having a simple design and a method decoding thereof 
US7702968B2 (en) *  20040227  20100420  Qualcomm Incorporated  Efficient multisymbol deinterleaver 
KR20070029744A (en) *  20040518  20070314  코닌클리즈케 필립스 일렉트로닉스 엔.브이.  Turbo decoder input reordering 
CN100369403C (en) *  20060220  20080213  东南大学  Parallel realizing method accepted by iterative detection decoding of wireless communication system 
US7761772B2 (en) *  20061018  20100720  Trellisware Technologies, Inc.  Using norefresh DRAM in error correcting code encoder and decoder implementations 
US7743287B2 (en) *  20061018  20100622  Trellisware Technologies, Inc.  Using SAM in error correcting code encoder and decoder implementations 
US8583983B2 (en) *  20061101  20131112  Qualcomm Incorporated  Turbo interleaver for high data rates 
US8271858B2 (en) *  20090903  20120918  Telefonaktiebolget L M Ericsson (Publ)  Efficient soft value generation for coded bits in a turbo decoder 
US20110202819A1 (en) *  20100212  20110818  Yuan Lin  Configurable Error Correction Encoding and Decoding 
US8862971B1 (en) *  20110301  20141014  Sk Hynix Memory Solutions Inc.  Intertrack interference (ITI) correlation and cancellation for disk drive applications 
US9143166B1 (en)  20110323  20150922  Sk Hynix Memory Solutions Inc.  Adaptive scheduling of turbo equalization based on a metric 
US8843812B1 (en) *  20110323  20140923  Sk Hynix Memory Solutions Inc.  Buffer management in a turbo equalization system 
US9003266B1 (en) *  20110415  20150407  Xilinx, Inc.  Pipelined turbo convolution code decoder 
US8843807B1 (en)  20110415  20140923  Xilinx, Inc.  Circular pipeline processing system 
US9385756B2 (en) *  20120607  20160705  Avago Technologies General Ip (Singapore) Pte. Ltd.  Data processing system with retained sector reprocessing 
KR20150061253A (en) *  20131127  20150604  한국전자통신연구원  Half pipelined turbo decoder and method for controlling thereof 
US20150236717A1 (en) *  20140214  20150820  Samsung Electronics Co., Ltd.  System and methods for low complexity list decoding of turbo codes and convolutional codes 
Family Cites Families (10)
Publication number  Priority date  Publication date  Assignee  Title 

FR2675968B1 (en)  19910423  19940204  France Telecom  Method for decoding a convolution code has maximum likelihood and weighting decisions, and corresponding decoder. 
FR2675971B1 (en)  19910423  19930806  France Telecom  error correction coding method at least two systematic convolutional codings in parallel, DECODING METHOD iterative decoding module and corresponding decoder. 
FR2712760B1 (en)  19931119  19960126  France Telecom  A method for transmitting information bits by applying codes concatenated blocks. 
US5721745A (en)  19960419  19980224  General Electric Company  Parallel concatenated tailbiting convolutional code and decoder therefor 
US6023783A (en)  19960515  20000208  California Institute Of Technology  Hybrid concatenated codes and iterative decoding 
US6000054A (en)  19971103  19991207  Motorola, Inc.  Method and apparatus for encoding and decoding binary information using restricted coded modulation and parallel concatenated convolution codes 
US6292918B1 (en) *  19981105  20010918  Qualcomm Incorporated  Efficient iterative decoding 
JP3670520B2 (en) *  19990623  20050713  富士通株式会社  Turbo decoder and a turbo decoder 
US6516437B1 (en) *  20000307  20030204  General Electric Company  Turbo decoder control for use with a programmable interleaver, variable block length, and multiple code rates 
US6307901B1 (en) *  20000424  20011023  Motorola, Inc.  Turbo decoder with decision feedback equalization 
Cited By (17)
Publication number  Priority date  Publication date  Assignee  Title 

US20020048329A1 (en) *  20000912  20020425  Tran Hau Thien  Method and apparatus for min star calculations in a map decoder 
US7023934B2 (en) *  20000912  20060404  Broadcom Corporation  Method and apparatus for min star calculations in a map decoder 
US20040068744A1 (en) *  20001114  20040408  Claussen Paul J.  Proximity detection using wireless connectivity in a communications system 
US7191377B2 (en) *  20020905  20070313  Stmicroelectronics N.V.  Combined turbocode/convolutional code decoder, in particular for mobile radio systems 
US20050278603A1 (en) *  20020905  20051215  Stmicroelectronics N.V.  Combined turbocode/convolutional code decoder, in particular for mobile radio systems 
US7266757B1 (en) *  20040129  20070904  Xilinx, Inc.  Pipelined architecture implementing recursion processes for forward error correction 
US20080215831A1 (en) *  20050518  20080904  Seagate Technology Llc  Interleaver With Linear Feedback Shift Register 
US20060282712A1 (en) *  20050518  20061214  Seagate Technology Llc  Low complexity pseudorandom interleaver 
US7788560B2 (en)  20050518  20100831  Seagate Technology Llc  Interleaver with linear feedback shift register 
US7395461B2 (en)  20050518  20080701  Seagate Technology Llc  Low complexity pseudorandom interleaver 
US20070177696A1 (en) *  20060127  20070802  Pei Chen  Map decoder with bidirectional sliding window architecture 
US7929646B2 (en) *  20060127  20110419  Qualcomm Incorporated  Map decoder with bidirectional sliding window architecture 
US20120106683A1 (en) *  20090618  20120503  Zte Corporation  Method and apparatus for parallel turbo decoding in long term evolution system (lte) 
US20110134969A1 (en) *  20091208  20110609  Samsung Electronics Co., Ltd.  Method and apparatus for parallel processing turbo decoder 
US8811452B2 (en) *  20091208  20140819  Samsung Electronics Co., Ltd.  Method and apparatus for parallel processing turbo decoder 
US20160315638A1 (en) *  20150421  20161027  National Tsing Hua University  Iterative decoding device, iterative signal detection device and information update method for the same 
US9973217B2 (en) *  20150421  20180515  National Tsing Hua University  SISO (soft input soft output) system for use in a wireless communication system and an operational method thereof 
Also Published As
Publication number  Publication date  Type 

US20020124227A1 (en)  20020905  application 
US6813742B2 (en)  20041102  grant 
Similar Documents
Publication  Publication Date  Title 

US6563877B1 (en)  Simplified block sliding window implementation of a map decoder  
Boutillon et al.  VLSI architectures for the MAP algorithm  
US20020029362A1 (en)  Method and apparatus for encoding and decoding a turbo code in an integrated modem system  
US6606725B1 (en)  MAP decoding for turbo codes by parallel matrix processing  
Viterbi  An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes  
US20080123781A1 (en)  Apparatus and method using reduced memory for channel decoding in a softwaredefined radio system  
US6754290B1 (en)  Highly parallel map decoder  
US6487694B1 (en)  Method and apparatus for turbocode decoding a convolution encoded data frame using symbolbysymbol traceback and HRSOVA  
US5933462A (en)  Soft decision output decoder for decoding convolutionally encoded codewords  
US7526711B2 (en)  Decoding method and device for repeatedly decoding first and second encoded data  
Montorsi et al.  Design of fixedpoint iterative decoders for concatenated codes with interleavers  
US6516444B1 (en)  Turbocode decoder  
US6829313B1 (en)  Sliding window turbo decoder  
Bickerstaff et al.  A unified turbo/viterbi channel decoder for 3gpp mobile wireless in 0.18/spl mu/m cmos  
Shibutani et al.  Reducing average number of turbo decoding iterations  
Cheng et al.  Linearly approximated logMAP algorithms for turbo decoding  
US6662331B1 (en)  Spaceefficient turbo decoder  
Wang et al.  Areaefficient highspeed decoding schemes for turbo decoders  
Divsalar et al.  Hybrid concatenated codes and iterative decoding  
Wang et al.  VLSI implementation issues of turbo decoder design for wireless applications  
US20070124657A1 (en)  Decoding device, decoding method, and receiving apparatus  
Yoon et al.  A parallel MAP algorithm for low latency turbo decoding  
Bickerstaff et al.  A 24Mb/s radix4 logMAP turbo decoder for 3GPPHSDPA mobile wireless  
US6856657B1 (en)  Soft output decoder for convolutional codes  
US6859906B2 (en)  System and method employing a modular decoder for decoding turbo and turbolike codes in a communications network 