WO2004054115A1 - Turbo decoder using parallel processing - Google Patents

Turbo decoder using parallel processing Download PDF

Info

Publication number
WO2004054115A1
WO2004054115A1 PCT/US2003/033584 US0333584W WO2004054115A1 WO 2004054115 A1 WO2004054115 A1 WO 2004054115A1 US 0333584 W US0333584 W US 0333584W WO 2004054115 A1 WO2004054115 A1 WO 2004054115A1
Authority
WO
WIPO (PCT)
Prior art keywords
starting
estimated
segments
variable
backward
Prior art date
Application number
PCT/US2003/033584
Other languages
French (fr)
Other versions
WO2004054115A8 (en
Inventor
Jin Lu
Joon-Hwa Chun
Erdem Hokenek
Mayan Moudgill
Original Assignee
Sandbridge Technologies, Inc.
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Sandbridge Technologies, Inc. filed Critical Sandbridge Technologies, Inc.
Priority to EP03774933A priority Critical patent/EP1584140A1/en
Priority to AU2003283001A priority patent/AU2003283001A1/en
Priority to JP2004559079A priority patent/JP2006509465A/en
Publication of WO2004054115A1 publication Critical patent/WO2004054115A1/en
Publication of WO2004054115A8 publication Critical patent/WO2004054115A8/en

Links

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/39Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
    • H03M13/3905Maximum a posteriori probability [MAP] decoding or approximations thereof based on trellis or lattice decoding, e.g. forward-backward algorithm, log-MAP decoding, max-log-MAP decoding
    • H03M13/3927Log-Likelihood Ratio [LLR] computation by combination of forward and backward metrics into LLRs
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/45Soft decoding, i.e. using symbol reliability information
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/29Coding, 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
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/29Coding, 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/2957Turbo codes and decoding
    • H03M13/296Particular turbo code structure
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/65Purpose and implementation aspects
    • H03M13/6561Parallelized implementations
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045Arrangements at the receiver end
    • H04L1/0047Decoding adapted to other signal detection operation
    • H04L1/005Iterative decoding, including iteration between signal detection and decoding operation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0064Concatenated codes
    • H04L1/0066Parallel concatenated codes

Definitions

  • the present invention relates generally to decoders and, more specifically, to a turbo decoder that reduces processing time for the computation of A Posteroiri Probability (APP) and is suitable for implementation in parallel processing architectures.
  • APP Posteroiri Probability
  • Data delivered over a telecommunication channel are subject to channel noise, channel fading, and interferences from other channels.
  • data received at the destination are usually "altered" by the channel from those delivered at the source.
  • the data are encoded before transmission by a channel encoder to allow the data receiver to detect or correct the errors. For example, if bit 0 is encoded as 000 and bit 1 is encoded as 111, then when one bit error occurs, 000 may become 100, and 111 may becomes 101.
  • the receiver can correct 100 as 000 ( bit 0) and 101 as 111 (bit 1) by the "majority rule" or the hamming distance.
  • the part of receiver responsible for correcting errors is called a channel decoder.
  • Turbo encoders and decoders are used in emerging high-speed telecommunications transmission systems, such as terrestrial digital TV communication systems, and third generation wireless (e.g., WCDMA) communication systems.
  • a turbo decoder has been demonstrated to approach the error correcting limit on both AWGN and Rayleigh fading channels.
  • turbo decoder is computing intensive. To meet the real-time performance (e.g., a few millisecond), it is usually implemented in ASIC. If a turbo decoder is to be implemented in software running on a DSP or a CPU, as in the context of software defined radio, its real-time performance will be improved.
  • a 3GPP turbo encoder ( Figure 1) consists of a parallel concatenation of two identical RSC (Recursive Systematic Convolutional) encoders separated by an interleaver.
  • the info word U of length K is encoded by the first RSC encoder, and the interleaved info word is encoded by the second RSC encoder.
  • the interleaver de- correlates the inputs to the two RSC's by reordering the input bits to the second RSC, so that it is unlikely that the encoded bits from both RSC's have low weight code words at the same time. Also, it helps the encoded bits to cope with bursty noise.
  • a pseudo-random block interleaver is used. Both RSC encoded words are terminated by a trellis termination.
  • the turbo encoded words are consists of systematic bits and two parity bits (U, Xpl, Xp2).
  • the standard turbo decoder consists of two concatenated
  • SISO Soft Input Soft Output
  • the SISO blocks are A Posteriori Probability (APP) decoders also know as Maximum A Posteriori (MAP) decoders.
  • APP Posteriori Probability
  • MAP Maximum A Posteriori
  • each SISO block Upon reception of bits from channel and priori information, each SISO block computes log posterior ratios of each bit with well-known forward and backward algorithm. Once SISO computes the log posterior ratios of all bits, it separates a probabilistic entity that was calculated based on its input from overall posterior, then pass it to the other SISO block. This probabilistic entity is often called extrinsic information (Lll and Lll in Figure 2) for the other SISO block to use as prior information.
  • the two SISO blocks run in an iterative scheme, mutually exchanging extrinsic information. After the required number of iterations is completed, hard decision is made based on accumulated soft information up to the iteration.
  • the log posterior probability ratio can be written as:
  • the posterior probability can be obtained by way of computing weighted likelihood, where weights are provided by the prior probability of the event u k .
  • Direct evaluation of weighted likelihood requires the summations over a very large number of state patterns, which is proportional to the sequence length K . Because of the combinatorial complexity, it is not computationally feasible even for a reasonable length of the sequence.
  • an efficient procedure known as forward and backward algorithm, is often used. In this algorithm, the posterior probability P(u k I y) is factorized into following 3 terms:
  • S k _, S') .
  • the present invention is a method of decoding using a log posterior probability ratio L(u ), which is a function of forward variable a (.) and backward variable ⁇ (.) .
  • the method comprises dividing the forward variable a (.) and the backward variable ⁇ (.) into, for example, two segments p and q, where p plus q equal the length of the codeword U.
  • the forward segments a (.) are parallel calculated, and the backward segments ⁇ (.) are parallel calculated.
  • the ratio L(u k ) is calculated using the parallel calculated segments of a (.) and ⁇ (.) .
  • the first forward segment is calculated from a x (.) ,...., a p (.) starting from ⁇ 0 (.)
  • the second forward segment is calculated from +1 (.) ,...., ⁇ (.) starting from an estimated a p (.)
  • the first backward segment is calculated from ⁇ ⁇ (.),..., ⁇ q+1 (.) starting from ⁇ ⁇ (.)
  • the second backward segment is calculated from ⁇ q (.) , ⁇ x (.) starting from an estimated ⁇ g+1 (.) .
  • the forward variable is calculated recursively from p-d+1 where d is an arbitrary amount of time and the state at time p-d+1 is treated as a uniform random variable.
  • the backward variable is calculated from q+d and again the state at time q+d is treated as a uniform random variable.
  • the arbitrary amount of time, d is in the range of 1 to 20 or may be in the range of 15 to 20.
  • the starting points for the estimated probability may also be a predetermined state. This predetermined state may be one divided by the number of possible states.
  • the method may include dividing the forward variable a (.) and the backward variable ⁇ (.) into more than two segments, and each of the forward and reverse segments would be calculated in parallel. [0020] The process is performed in a signal receiver including a decoder. [0021 ]
  • Figure 1 is a block diagram of a 3GPP turbo decoder of the prior art.
  • Figure 2 is a block diagram of a 3GPP turbo decoder of the prior art.
  • Figure 3 is a graph of bit error rate (BER) for a turbo decoder of the prior art and for a turbo decoder of the present invention under various signal to noise ratios (SNRs).
  • BER bit error rate
  • Figure 4 is a graph of block error rate or packet error rate (BLER) of the prior art turbo decoder and a turbo decoder according to the present invention under various SNR.
  • BLER packet error rate
  • the parallel computing is for the calculation of ⁇ k (.) and ⁇ k (.) , which are the most computational intensive part of a turbo decoder.
  • the algorithm is similar.
  • - Process 1 calculate ⁇ ⁇ (.) ,...., ⁇ p (.) starting from ⁇ 0 (.) ;
  • - Process 2 calculate a p+x (.) ,...., a ⁇ (.) starting from an estimated a p (.) , say
  • Process 1 and 3 are run as regular turbo alpha and beta calculation with known initial points (with reduced size), process 2 and 4 require estimated initial points.
  • the following algorithm can be used for obtaining p '(.) for process 2 and ⁇ q X(.) for process 4.
  • the first iteration start from p _ d+l (.) where d is an arbitrary amount of time steps.
  • the state at time p-d+1 is treated as a uniform random variable. This implies that the probability of a specific state occurs at p-d+1 is 1/8 since the 3GPP turbo encoder has 8 system states.
  • p _ d+l (.) 1/8 and as is ⁇ q+d (.) .
  • the estimate c p '(.) results, and at q+1, the estimate ⁇ q X(.) results.
  • Simulation scenarios are defined by SNR (signal to noise ratio).
  • SNR signal to noise ratio
  • 2000 packets of size 5114 bits were randomly generated, turbo encoded, and subjected to AWGN noise.
  • the "spoiled" packets were run through both the regular prior art and present parallel turbo decoders.
  • Figures 3 and Figure 4 compare the BER (bit error rate) and BLER (block error rate, or packet error rate) of the regular turbo decoder and parallel turbo decoder under various SNR. The results were so close they are not discernable on the graphs.
  • the definitions of the estimated starting points would be a p (.),.... ,o w (.) and ⁇ w (.) ,..., ⁇ q+x (.) .
  • the forward variable segments are calculated as follows: a x (.) ,...., a p (.) starting from ⁇ 0 (.) p+x (.) ,...., a q (.) starting from a p (.)
  • the starting points for the forward variable are estimated from:

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computing Systems (AREA)
  • Error Detection And Correction (AREA)
  • Detection And Correction Of Errors (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

A method of decoding using a log posterior probability ratio L(uk), which is a function of forward variable α (.) and backward variable β (.) . The method comprises dividing the forward variable α (.) and the backward variable β (.) into, for example, two segments p and q, where p plus q equal the length of the code word U. The forward segments α (.) are parallel calculated, and the backward segments ,β (.) are parallel calculated. The ratio L(uk) is calculated using the parallel calculated segments of α (.) and β (.).

Description

PARALLELIZED SLIDING-WINDOW MAP DECODING
BACKGROUND AND SUMMARY OF THE INVENTION
[0001 ] The present invention relates generally to decoders and, more specifically, to a turbo decoder that reduces processing time for the computation of A Posteroiri Probability (APP) and is suitable for implementation in parallel processing architectures.
[0002] Data delivered over a telecommunication channel are subject to channel noise, channel fading, and interferences from other channels. As a result, data received at the destination are usually "altered" by the channel from those delivered at the source. To ensure error-free transmission, the data are encoded before transmission by a channel encoder to allow the data receiver to detect or correct the errors. For example, if bit 0 is encoded as 000 and bit 1 is encoded as 111, then when one bit error occurs, 000 may become 100, and 111 may becomes 101. The receiver can correct 100 as 000 ( bit 0) and 101 as 111 (bit 1) by the "majority rule" or the hamming distance. The part of receiver responsible for correcting errors is called a channel decoder.
[0003] Turbo encoders and decoders are used in emerging high-speed telecommunications transmission systems, such as terrestrial digital TV communication systems, and third generation wireless (e.g., WCDMA) communication systems. A turbo decoder has been demonstrated to approach the error correcting limit on both AWGN and Rayleigh fading channels.
[0004] Despite the error-correcting efficiency, however, a turbo decoder is computing intensive. To meet the real-time performance (e.g., a few millisecond), it is usually implemented in ASIC. If a turbo decoder is to be implemented in software running on a DSP or a CPU, as in the context of software defined radio, its real-time performance will be improved.
[0005] A 3GPP turbo encoder (Figure 1) consists of a parallel concatenation of two identical RSC (Recursive Systematic Convolutional) encoders separated by an interleaver. The info word U of length K is encoded by the first RSC encoder, and the interleaved info word is encoded by the second RSC encoder. The interleaver de- correlates the inputs to the two RSC's by reordering the input bits to the second RSC, so that it is unlikely that the encoded bits from both RSC's have low weight code words at the same time. Also, it helps the encoded bits to cope with bursty noise. In 3GPP turbo encoder, a pseudo-random block interleaver is used. Both RSC encoded words are terminated by a trellis termination. The turbo encoded words are consists of systematic bits and two parity bits (U, Xpl, Xp2).
[0006] As shown in Figure 2, the standard turbo decoder consists of two concatenated
SISO (Soft Input Soft Output) blocks, one for each set of systematic and parity bits, (U',Xpl ') and (U',Xp2 j, where Xpl ' and Xpl ' denote the noisy version of Xpl and Xpl, respectively, and the same for U' (U refers to the info words). The SISO blocks are A Posteriori Probability (APP) decoders also know as Maximum A Posteriori (MAP) decoders. The two SISO blocks are separated by the same interleaver (as the encoder) and its inverse block, the deinterleaver. Upon reception of bits from channel and priori information, each SISO block computes log posterior ratios of each bit with well-known forward and backward algorithm. Once SISO computes the log posterior ratios of all bits, it separates a probabilistic entity that was calculated based on its input from overall posterior, then pass it to the other SISO block. This probabilistic entity is often called extrinsic information (Lll and Lll in Figure 2) for the other SISO block to use as prior information. The two SISO blocks run in an iterative scheme, mutually exchanging extrinsic information. After the required number of iterations is completed, hard decision is made based on accumulated soft information up to the iteration.
[0007] The log posterior probability ratio can be written as:
L(uk ) , (1)
Figure imgf000003_0001
where S+ andS~ denote the set of all possible state transitions caused by data input uk = +\ and uk = -1 , respectively, and y denotes the set of observations, y = (yλ,...,yκ) where yk = (μk xk') t k = l,....,K . Note that y e (U XpV,Xp ) .
[0008] As usual, the posterior probability can be obtained by way of computing weighted likelihood, where weights are provided by the prior probability of the event uk . Direct evaluation of weighted likelihood requires the summations over a very large number of state patterns, which is proportional to the sequence length K . Because of the combinatorial complexity, it is not computationally feasible even for a reasonable length of the sequence. [0009] To reduce the computation, an efficient procedure, known as forward and backward algorithm, is often used. In this algorithm, the posterior probability P(uk I y) is factorized into following 3 terms:
- Forward variable, ak (.) ,
- Backward variable, βk (.) ,
- State transition probability, γk (.,.) .
[0010] The ak(.) is thejoint probability of the observations y1,...,yκ and the state at time k, that is ak (S) = P(Sk ,yx,...,yκ) . The βk (.) represents the conditional probability of future observations given state at time k,βk(S) = P(y1,...,yκ+1 | Sk) . The γk (.,.) is the probability of the state transitions from k-1 to k, caused by uk , and expressed as γk (S',S) = P(Sk = S,yk | Sk_, = S') .
[0011 ] The procedure of recursive calculation of ak (S) is implemented according to
S'
[0012] For βk (S) , the calculation is proceeded recursively as:
&(S) = ∑Λ+1(S'WS,S').
5"
[0013] Since the turbo encoder is expected to start and end in state 1, the initial conditions for ak (.) and βk (.) are known and given as 0 (S) = δ{s i and βκ (S) = δ{S 1} , respectively, where δ{ ) denote the Kronecker delta.
[0014] Calculation of the posterior entity L( U ) as a function f( ak (.) , βk (.) ) is then equivalent to:
∑akχs')yk (S',S)βk(S) P(uk I y) = — (2)
where S* is the set of state pairs corresponding to all state transitions caused by uk = + 1/ - 1 , and P(y) is a normalization constant. [0015] The procedure of forward and backward algorithm is summarized as:
- Calculate γ k (.,.) , k=l,2, ...,K;
- Calculate ak(.,.) forward recursively, k=0,l,l, ...,K; - Calculate βk (.,.) backward recursively, k^K,K-l, ...,0;
- Calculate (2) to form (1).
[0016] The present invention is a method of decoding using a log posterior probability ratio L(u ), which is a function of forward variable a (.) and backward variable β (.) . The method comprises dividing the forward variable a (.) and the backward variable β (.) into, for example, two segments p and q, where p plus q equal the length of the codeword U. The forward segments a (.) are parallel calculated, and the backward segments β (.) are parallel calculated. The ratio L(uk) is calculated using the parallel calculated segments of a (.) and β (.) . The first forward segment is calculated from ax (.) ,...., ap (.) starting fromα0 (.) , whereas the second forward segment is calculated from +1 (.) ,...., κ (.) starting from an estimated ap (.) . The first backward segment is calculated from βκ (.),..., βq+1 (.) starting from βκ (.) , and the second backward segment is calculated from βq (.) , , βx (.) starting from an estimated βg+1 (.) .
[0017] To obtain the estimated initial point ap+1 (.) , the forward variable is calculated recursively from p-d+1 where d is an arbitrary amount of time and the state at time p-d+1 is treated as a uniform random variable. Similarly, for βq+x (.) , the backward variable is calculated from q+d and again the state at time q+d is treated as a uniform random variable. With treating the states at time p-d+l and q+d as uniform random variables, no informative prior knowledge of the states at the time is claimed.
[0018] The arbitrary amount of time, d, is in the range of 1 to 20 or may be in the range of 15 to 20. Also, the starting points for the estimated probability may also be a predetermined state. This predetermined state may be one divided by the number of possible states.
[0019] The method may include dividing the forward variable a (.) and the backward variable β (.) into more than two segments, and each of the forward and reverse segments would be calculated in parallel. [0020] The process is performed in a signal receiver including a decoder. [0021 ] These and other aspects of the present invention will become apparent from the following detailed description of the invention, when considered in conjunction with accompanying drawings.
BRIEF DESCRIPTION OF DRAWINGS
[0022] Figure 1 is a block diagram of a 3GPP turbo decoder of the prior art.
[0023] Figure 2 is a block diagram of a 3GPP turbo decoder of the prior art.
[0024] Figure 3 is a graph of bit error rate (BER) for a turbo decoder of the prior art and for a turbo decoder of the present invention under various signal to noise ratios (SNRs).
[0025] Figure 4 is a graph of block error rate or packet error rate (BLER) of the prior art turbo decoder and a turbo decoder according to the present invention under various SNR.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0026] One problem with the standard turbo decoding algorithm is that if the size of input sequence K is large, the time required for the computation of the above forward and backward variables grows, causing a long latency as we go through the forward and backward algorithms. Tmay reach 5114 bits. To reduce the time in calculating ak (.) and βk (.) , the input data is divided into M segments and simultaneously calculate the k(.) an.d k(.) for the M segments. Truncation loss may occur with this segment-based approach; however, simulation results show that the loss was negligible when M=2. [0027] In theory, this parallel scheme reduced the computation to nearly 1 out of M of the original calculation of αk (.) anάβk (.) (e.g. V-∑ for M=2). The parallel computing is for the calculation of αk (.) and βk (.) , which are the most computational intensive part of a turbo decoder. [0028] The parallel algorithm will be discussed for the case of M=2 as an example.
For M>2, the algorithm is similar. The algorithm consists of the following steps: [0029] 1. Divide the forward and the backward variable into two parallel segments of size ? and q, respectively, where p+q =K. [0030] 2. Calculate the four segments simultaneously with the following four processes:
- Process 1: calculate αλ (.) ,...., αp (.) starting fromα0 (.) ; - Process 2: calculate ap+x (.) ,...., aκ (.) starting from an estimated ap (.) , say
- Process 3: calculate (backwardly) βκ (.),..., βq+l starting from βκ(.) ; and
- Process 4: calculate (backwardly) ? (.) , , ^ (.) staring from an estimated βq+1 (.) , say βq+1 ' (.) .
[0031 ] Process 1 and 3 are run as regular turbo alpha and beta calculation with known initial points (with reduced size), process 2 and 4 require estimated initial points. [0032] The following algorithm can be used for obtaining p '(.) for process 2 and βqX(.) for process 4. The first iteration start from p_d+l (.) where d is an arbitrary amount of time steps. The state at time p-d+1 is treated as a uniform random variable. This implies that the probability of a specific state occurs at p-d+1 is 1/8 since the 3GPP turbo encoder has 8 system states. As a consequence, p_d+l(.) = 1/8 and as is βq+d (.) . Starting from this uniform prior, when the process reaches atp, the estimate c p '(.) results, and at q+1, the estimate βqX(.) results.
[0033] The amount of information extracted from the observation for the duration d is proportional to d. A longer d may give a better initial estimate. However, since the computation during d steps represents "overhead", d should be increased more than a certain limit. While d may be in the range of 1-20, simulation show that =15~20 provides decent results. From the second iteration on, c p_d+1 (.) and β d (.) can be chosen by the same way as for the first iteration, or use the values resulted from process 1 and process 3 in previous iteration can be used.
[0034] Simulation scenarios are defined by SNR (signal to noise ratio). For each scenario, 2000 packets of size 5114 bits were randomly generated, turbo encoded, and subjected to AWGN noise. The "spoiled" packets were run through both the regular prior art and present parallel turbo decoders. For the parallel turbo decoders of the present invention, the number of division M = 2 and the length for initial estimation <f=20 in the parallel algorithm, and the appropriate values of the previous iteration as the starting points of the initial estimation of the current iteration were used.
[0035] Figures 3 and Figure 4 compare the BER (bit error rate) and BLER (block error rate, or packet error rate) of the regular turbo decoder and parallel turbo decoder under various SNR. The results were so close they are not discernable on the graphs. [0036] Although the number of segments M = 2 has been used as an example, a larger number of M may be used. In such case, the equations would have the general formula as follows: L( Uk) = ϊ(ak (.) , βk (.) ). The definitions of the estimated starting points would be ap (.),.... ,o w(.) and βw(.) ,...,βq+x(.) . The forward variable segments are calculated as follows: ax (.) ,...., ap (.) starting fromα0 (.) p+x (.) ,...., aq (.) starting from ap (.)
a^x (.) ,...., aκ (.) starting from aw (.) and the reverse variable segments are calculated as follows: βκ (•) . ■ ■ ■ . w+ι (•) starting from βκ(.) βwO >• ••> &+! (•) starting from βw+ (.)
βq (X , βι (•) staring from βq+l (.) .
The starting points for the forward variable are estimated from:
Figure imgf000008_0001
w_d+x(.) ,....,αw(.) ; and for the backward segments from: Λ^O ,-.., ) and
/W-), »^0 where d is an arbitrary amount of time steps.
[0037] It should also be noted that even though turbo decoders are discussed, any system that uses the A Posteriori Probability decoding may use the present invention.
[0038] Although the present invention has been described and illustrated in detail, it is to be clearly understood that this is done by way of illustration and example only and is not to be taken by way of limitation. The spirit and scope of the present invention are to be limited only by the terms of the appended claims.

Claims

CLAIMS:
1. A method of a turbo decoder using log A Posteriori Probability L(uk), where L( k) = f( ak (s) , βk (s) ), the method comprising: dividing a forward variable a (.) and a backward variable β (.) into a plurality M of parallel segments of size p, q . . . w, where p+q, . . .+w equals the length of a coded word U; parallel calculating the segments of forward variable a (.) and backward variable β (.) ; and calculating L(u ) using the parallel calculated segments of (.) and β (.) .
2. The method according to Claim 1, wherein the forward variable segments are calculated as follows: ax (.) ,.... ,ap (.) starting from α0(.) p+x (.) ,...., aq (.) starting from ap (.)
w+x (.) ,.... ,aκ(.) starting from α„,(.) ; and the reverse variable segments are calculated as follows: fix (•)»• ■ ., A*.ι (■) starting from βκ (.)
A O >•• -, ,+,(•) starting from /?1V+1(.)
βq (•) , A (•) staring from βq+x (.) .
3. The method according to Claim 2, wherein the starting points p (.),...., w (.) are estimated, and the starting points w (.) ,..., βq+x (.) are estimated.
4. The method according to Claim 3, wherein the starting points for the forward variable are estimated from: ap_d+x(.) ,....,ap(.)
w_d+x(.) ,...., w(.) ; and for the backward segments from:
Figure imgf000010_0001
/W-)> ,βgQ where d is an arbitrary amount of time steps.
5. The method according to Claim 4, wherein d is in the range of 1 to 20.
6. The method according to Claim 4, wherein d is in the range of 15 to 20.
7. The method according to Claim 4, wherein the starting points for the estimated states are uniform random variables.
8. The method according to Claim 4, wherein the starting points for the estimated states are a predetermined state.
9. The method according to Claim 4, wherein the starting point for the estimated states is one divided by the number of possible states.
10. The method according to Claim 1, wherein the segment sizes are set equal.
11. The method according to Claim 1, wherein the variables are divided only into two segments p and q.
12. A method of decoding using a log A Posteriori Probability ratio L(u where L( Uk) = f(ak(s) , βk(s) ), the method comprising: dividing a forward variable (.) and a backward variable β (.) into two segments/? and q where p+q equals the length of the code word U; parallel calculating the forward segments: x(.) ,...., ap (.) starting from a known c 0 (.) and p+x (.) ,...., c k(.) starting from an estimated ap (.) ; parallel calculating the backward segments: βκ (.),... , βq+x (.) starting from a known βκ (.) and βq (.) , , β (.) staring from an estimated βq+x (.) ; and calculating L(uk) using the parallel calculated segments of (.) and β (.) .
13. A method according to Claim 12, wherein the estimated starting point ap(.) for ap+x(.) is estimated from prior probabilities c p_d+x (.) ,...., p(.) , and the estimated starting point βq+x(.) for βq(.) is estimated from prior probabilities β q.AX->β q«Q -
14. A method according to Claim 13, wherein d is in the range of 1 to 20.
15. A method according to Claim 13, wherein d is in the range of 15 to 20.
16. A method according to Claim 13, wherein the starting points for the estimated states are uniform random variables.
17. A method according to Claim 13, wherein the starting points for the estimated states are a predetermined state.
18. A method according to Claim 13, wherein the starting point for the estimated states is one divided by the number of possible states.
19. A signal receiver including a decoder performing the method according to Claim 1.
20. A signal receiver including a decoder performing the method according to Claim 11.
PCT/US2003/033584 2002-12-06 2003-10-23 Turbo decoder using parallel processing WO2004054115A1 (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP03774933A EP1584140A1 (en) 2002-12-06 2003-10-23 Turbo decoder using parallel processing
AU2003283001A AU2003283001A1 (en) 2002-12-06 2003-10-23 Turbo decoder using parallel processing
JP2004559079A JP2006509465A (en) 2002-12-06 2003-10-23 Turbo decoder using parallel processing

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US10/310,919 US7055102B2 (en) 2002-12-06 2002-12-06 Turbo decoder using parallel processing
US10/310,919 2002-12-06

Publications (2)

Publication Number Publication Date
WO2004054115A1 true WO2004054115A1 (en) 2004-06-24
WO2004054115A8 WO2004054115A8 (en) 2004-09-16

Family

ID=32468135

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2003/033584 WO2004054115A1 (en) 2002-12-06 2003-10-23 Turbo decoder using parallel processing

Country Status (9)

Country Link
US (1) US7055102B2 (en)
EP (1) EP1584140A1 (en)
JP (1) JP2006509465A (en)
KR (1) KR20050085400A (en)
CN (1) CN1757166A (en)
AU (1) AU2003283001A1 (en)
MY (1) MY134531A (en)
TW (1) TW200423550A (en)
WO (1) WO2004054115A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2009525009A (en) * 2006-01-27 2009-07-02 クゥアルコム・インコーポレイテッド MAP decoder with bidirectional sliding window architecture

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100606023B1 (en) * 2004-05-24 2006-07-26 삼성전자주식회사 The Apparatus of High-Speed Turbo Decoder
WO2006059280A2 (en) 2004-12-02 2006-06-08 Koninklijke Philips Electronics N.V. Turbo decoder with stake heritage for data block redundant version decoding
US20070223599A1 (en) * 2005-07-25 2007-09-27 Sysair, Inc., A Delaware Corporation Cellular PC modem architecture and method of operation
US8344503B2 (en) 2008-11-25 2013-01-01 Freescale Semiconductor, Inc. 3-D circuits with integrated passive devices
EP2429085B1 (en) * 2009-06-18 2018-02-28 ZTE Corporation Method and apparatus for parallel turbo decoding in long term evolution system (lte)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2000059118A1 (en) * 1999-03-31 2000-10-05 Qualcomm Incorporated Highly parallel map decoder
US20010046269A1 (en) * 2000-01-31 2001-11-29 Alan Gatherer MAP decoding with parallelized sliding window processing
US20020118776A1 (en) * 2000-12-29 2002-08-29 Blankenship Thomas Keith Method and system for adapting a training period in a turbo decoding device

Family Cites Families (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6377610B1 (en) 1997-04-25 2002-04-23 Deutsche Telekom Ag Decoding method and decoding device for a CDMA transmission system for demodulating a received signal available in serial code concatenation
CA2245603C (en) 1997-08-14 2011-06-28 Stewart Crozier Method of enhanced max-log-a posteriori probability processing
US6563877B1 (en) * 1998-04-01 2003-05-13 L-3 Communications Corporation Simplified block sliding window implementation of a map decoder
US6128765A (en) * 1998-08-20 2000-10-03 General Electric Company Maximum A posterior estimator with fast sigma calculator
US6292918B1 (en) 1998-11-05 2001-09-18 Qualcomm Incorporated Efficient iterative decoding
JP2002533991A (en) * 1998-12-18 2002-10-08 テレフォンアクチーボラゲット エル エム エリクソン(パブル) Method and apparatus for fast recursive maximum decoding
US6343368B1 (en) * 1998-12-18 2002-01-29 Telefonaktiebolaget Lm Ericsson (Publ) Method and system for fast maximum a posteriori decoding
US6484283B2 (en) * 1998-12-30 2002-11-19 International Business Machines Corporation Method and apparatus for encoding and decoding a turbo code in an integrated modem system
US6304995B1 (en) 1999-01-26 2001-10-16 Trw Inc. Pipelined architecture to decode parallel and serial concatenated codes
EP1030457B1 (en) * 1999-02-18 2012-08-08 Imec Methods and system architectures for turbo decoding
US6715120B1 (en) * 1999-04-30 2004-03-30 General Electric Company Turbo decoder with modified input for increased code word length and data rate
US6856657B1 (en) * 2000-02-10 2005-02-15 Motorola, Inc. Soft output decoder for convolutional codes
US6829313B1 (en) * 2000-07-17 2004-12-07 Motorola, Inc. Sliding window turbo decoder
US6813743B1 (en) * 2000-07-31 2004-11-02 Conexant Systems, Inc. Sliding window technique for map decoders
US6865711B2 (en) * 2000-12-15 2005-03-08 Conexant Systems, Inc. System of and method for decoding trellis codes

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2000059118A1 (en) * 1999-03-31 2000-10-05 Qualcomm Incorporated Highly parallel map decoder
US20010046269A1 (en) * 2000-01-31 2001-11-29 Alan Gatherer MAP decoding with parallelized sliding window processing
US20020118776A1 (en) * 2000-12-29 2002-08-29 Blankenship Thomas Keith Method and system for adapting a training period in a turbo decoding device

Non-Patent Citations (7)

* Cited by examiner, † Cited by third party
Title
AKELLA R ET AL: "On the parallel map algorithm", PROC. OF 2001 IEEE FOURTH WORKSHOP ON MULTIMEDIA SIGNAL PROCESSING, CANNES, FRANCE, 3 October 2001 (2001-10-03), pages 371 - 376, XP010565802 *
HSU J-M ET AL: "A parallel decoding scheme for turbo codes", PROC. OF THE 1998 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS. MONTEREY, USA, vol. 1, 31 May 1998 (1998-05-31), pages 445 - 448, XP002124484, ISBN: 0-7803-4456-1 *
HUNT A ET AL: "Performance degradation as a function of overlap depth when using sub-block processing in the decoding of turbo codes", PROC. OF 6TH INTERNATIONAL MOBILE SATELLITE CONFERENCE 1999, OTTAWA, CANADA, 18 June 1999 (1999-06-18), pages 276 - 280, XP002272481, ISBN: 0-662-27869-0 *
See also references of EP1584140A1 *
WORM A ET AL: "VLSI architectures for high-speed MAP decoders", PROC. OF FOURTEENTH INTERNATIONAL CONFERENCE ON VLSI DESIGN, BANGALORE, INDIA, 3 January 2001 (2001-01-03), pages 446 - 453, XP010531492 *
XU YOUYUN ET AL: "VLSI design and implementation of WCDMA channel decoder", PROC. OF CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING 2001, TORONTO, CANADA, vol. 1, 16 May 2001 (2001-05-16), 2001, Piscataway, NJ, USA, IEEE, USA, pages 241 - 245, XP002272480, ISBN: 0-7803-6715-4 *
YOON S ET AL: "A PARALLEL MAP ALGORITHM FOR LOW LATENCY TURBO DECODING", IEEE COMMUNICATIONS LETTERS, PISCATAWAY, USA, vol. 6, no. 7, July 2002 (2002-07-01), pages 288 - 290, XP001123683, ISSN: 1089-7798 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2009525009A (en) * 2006-01-27 2009-07-02 クゥアルコム・インコーポレイテッド MAP decoder with bidirectional sliding window architecture

Also Published As

Publication number Publication date
EP1584140A1 (en) 2005-10-12
WO2004054115A8 (en) 2004-09-16
US20040111659A1 (en) 2004-06-10
AU2003283001A8 (en) 2004-06-30
AU2003283001A1 (en) 2004-06-30
KR20050085400A (en) 2005-08-29
MY134531A (en) 2007-12-31
TW200423550A (en) 2004-11-01
US7055102B2 (en) 2006-05-30
CN1757166A (en) 2006-04-05
JP2006509465A (en) 2006-03-16

Similar Documents

Publication Publication Date Title
EP1383246B1 (en) Modified Max-LOG-MAP Decoder for Turbo Decoding
JP3610329B2 (en) Turbo coding method using large minimum distance and system for realizing the same
EP1480347A1 (en) Digital transmission method of the error-correcting coding type
EP1170870A1 (en) Turbo decoder
US6167552A (en) Apparatus for convolutional self-doubly orthogonal encoding and decoding
US7539256B2 (en) Decoding device and decoding method
EP1518327A1 (en) A fast h-arq acknowledgement generation method using a stopping rule for turbo decoding
US6981203B2 (en) Method and apparatus for random shuffled turbo multiuser detector
CA2522498A1 (en) Turbo decoder with early termination of iterations
US8358713B2 (en) High throughput and low latency map decoder
KR100841295B1 (en) Method for decoding turbo code and the corresponding decoder
EP1821415B1 (en) Hybrid decoding using multiple turbo decoders in parallel
US7055102B2 (en) Turbo decoder using parallel processing
JP2004349901A (en) Turbo decoder and dynamic decoding method used therefor
JP2006509465A5 (en)
CN110798229B (en) Method for generating Turbo code interleaver
WO2005055435A1 (en) Linear approximation of the max* operation for log-map decoding
WO2005055433A1 (en) Decoder apparatus and decoding method
CN116455429A (en) Multi-user power line communication method based on optimal Bayesian algorithm
CN115333549A (en) Turbo code decoding self-adaptive iteration stopping method
EP1698057B1 (en) Method and apparatus for random shuffled turbo multiuser detector
KR20100027631A (en) A method for decoding data in a wireless communication system
JP2001177417A (en) Decoder combining channel decoding and entropy decoding
Lwin et al. Convergence acceleration of turbo decoding iterations with the Epsilon algorithm

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
CFP Corrected version of a pamphlet front page

Free format text: REVISED TITLE RECEIVED BY THE INTERNATIONAL BUREAU AFTER COMPLETION OF THE TECHNICAL PREPARATIONS FOR INTERNATIONAL PUBLICATION

WWE Wipo information: entry into national phase

Ref document number: 1020057010237

Country of ref document: KR

WWE Wipo information: entry into national phase

Ref document number: 20038A52520

Country of ref document: CN

Ref document number: 2004559079

Country of ref document: JP

WWE Wipo information: entry into national phase

Ref document number: 2003774933

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 1020057010237

Country of ref document: KR

WWP Wipo information: published in national office

Ref document number: 2003774933

Country of ref document: EP