Turbo decoder control for use with a programmable interleaver, variable block length, and multiple code rates

Abstract

A turbo decoder control comprises an address generator for addressing systematic data, parity data, and systematic likelihood ratios according to a pre-determined memory mapping. The systematic data samples are accessed in the order required by the MAP decoding algorithm such that interleaving and de-interleaving functions in the MAP decoding algorithm are performed in real-time, i.e., without delay. Such memory-mapping in combination with data handling functions (e.g., multiplexing and combinatorial logic) minimizes memory requirements for the turbo decoder and allows for use of programmable interleavers, variable block lengths, and multiple code rates.

Description

BACKGROUND OF THE INVENTION

[0002] The present invention relates generally to error-correction coding and, more particularly, to a decoder for parallel convolutional codes, i.e., turbo codes.

[0003] A new class of forward error control codes, referred to as turbo codes, offers significant coding gain for power limited communication channels. Turbo codes are generated using two recursive systematic encoders operating on different orderings of the same information bits. A subset of the code bits of each encoder is transmitted in order to maintain bandwidth efficiency. Turbo decoding involves an iterative algorithm in which probability estimates of the information bits that are derived for one of the codes are fed back to a probability estimator for the other code. Each iteration of processing generally increases the reliability of the probability estimates. This process continues, alternately decoding the two code words until the probability estimates can be used to make reliable decisions.

[0004] The maximum a posteriori (MAP) type algorithm introduced by Bahl, Cocke, Jelinek, and Raviv in “Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate”, IEEE Transactions on Information Theory, March 1974, pp. 284-287, is particularly useful as a component decoder in decoding parallel concatenated convolutional codes, i.e., turbo codes. The MAP algorithm is used in the turbo decoder to generate a posteriori probability estimates of the systematic bits in the code word. These probability estimates are used as a priori symbol probabilities for the second MAP decoder. Three fundamental terms in the MAP algorithm are the forward and backward state probability functions (the alpha and beta functions, respectively) and the a posteriori transition probabilities (the sigma function).

[0005] It is desirable to provide a control and data handling structure for a turbo decoder which allows for a programmable interleaver, variable block length, and multiple code rates.

BRIEF SUMMARY OF THE INVENTION

[0006] A control for a turbo decoder utilizing a MAP decoding algorithm comprises an address generator for addressing systematic data symbols, parity data symbols, and systematic likelihood ratios according to a pre-determined memory mapping. A control signal indicates which of a plurality of component code words comprising a turbo code word is being decoded, each employing the same memory mapping. The systematic data symbol values are accessed in the order required by the alpha, beta and gamma functions of the MAP decoding algorithm such that interleaving and de-interleaving functions in the MAP decoding algorithm are performed in real-time, i.e., without delay. The systematic symbol and parity symbol contributions to the gamma function of the MAP decoding algorithm are computed in parallel using parallel channel transition probability look-up tables, such that the channel transition probabilities required in the gamma calculations are accessed at the same rate as the likelihood ratios. This memory-mapping in combination with other data handling functions (e.g., multiplexing, combinatorial logic and parallel processing) minimizes memory requirements for the turbo decoder and enables the use of programmable interleavers, variable block lengths, and multiple code rates.

BRIEF DESCRIPTION OF THE DRAWINGS

[0007] FIG. 1 is a block diagram illustrating a turbo decoder utilizing a MAP decoding algorithm;

[0008] FIG. 2 is a block diagram illustrating a top level view of data flow in a MAP component decoder such as that of FIG. 1;

[0009] FIG. 3 is a block diagram illustrating address generation and data memory interfaces to a component decoder according to preferred embodiments of the present invention;

[0010] FIG. 4 is a block diagram illustrating a preferred embodiment of a likelihood ratio circuit of the turbo decoder of FIG. 3;

[0011] FIG. 5 is a block diagram illustrating a preferred embodiment of a gamma calculator of the turbo decoder of FIG. 2;

[0012] FIG. 6 is a block diagram illustrating a preferred embodiment of an address generator of the turbo decoder of FIG. 3;

[0013] FIG. 7 is a block diagram illustrating a preferred embodiment of a channel probability generator of the turbo decoder of FIG. 3.

DETAILED DESCRIPTION OF THE INVENTION

Turbo Decoder Structure

[0014] A MAP decoder provides estimates of the a posteriori probabilities of the states and transitions of a Markov source through a discrete memory-less channel. The transition probabilities of a discrete memory-less channel depend on the transitions X1τ of the Markov source and the observations Y1τ such that for a sequence, 1$\begin{array}{cc}\mathrm{Pr}\left\{Y_1^t\&LeftBracketingBar;X_1^t\}=\prod _{j=1}^{t}R(Y_j\&RightBracketingBar;X_j\right)& 1\end{array}$

[0015] where R(&Circlesolid;|&Circlesolid;) defines the channel probabilities.

[0016] The MAP decoder uses the received sequence Y1τ to estimate the a posteriori state and transition probabilities of the Markov source.

[0017] and 2$\begin{array}{cc}\begin{array}{c}\mathrm{Pr}\left\{S_t=m|Y_1^{\tau }\right\}=\mathrm{Pr}\left\{S_t=m;Y_1^{\tau }\right\}/\mathrm{Pr}\left\{Y_1^{\tau }\right\}\\ ={\lambda }_t\left(m\right)/\mathrm{Pr}\left\{Y_1^{\tau }\right\}\end{array}& 2\\ \begin{array}{c}\mathrm{Pr}\left\{S_{t-1}=m^{\prime };S_t=m|Y_1^{\tau }\right\}=\mathrm{Pr}\left\{S_{t-1}=m^{\prime };S_t=m;Y_1^{\tau }\right\}/\mathrm{Pr}\left\{Y_1^{\tau }\right\}\\ ={\sigma }_t\left(m^{\prime },m\right)/\mathrm{Pr}\left\{Y_1^{\tau }\right\}\end{array}& 3\end{array}$

[0018] where St is the state of the source at time t.

[0019] The alpha, beta and gamma functions are set forth as follows:

αt(m)=Pr{St=m;Y1t}  4

βt(m)=Pr{Yt+1τ|St=m}  5

[0020] and

γt(m′,m)=Pr{St=m;Yt|St−1=m′}  6

[0021] so that

λt(m)=αt(m)&Circlesolid;βt(m)  7

[0022] and

σt(m′, m)=αt−1(m′)&Circlesolid;γt(m′, m)&Circlesolid;βt(m)  8

[0023] The alpha function is computed from the following recursion: 3$\begin{array}{cc}{a}_t\left(m\right)=\sum _{m^{\prime }}{\alpha }_{t-1}\left(m^{\prime }\right)·{\gamma }_t\left(m^{\prime },m\right).& 9\end{array}$

[0024] The beta function is calculated using the following recursion: 4$\begin{array}{cc}{\beta }_t\left(m\right)=\sum _{m^{\prime }}{\beta }_{t+1}\left(m^{\prime }\right)·{\gamma }_{t+1}\left(m,m^{\prime }\right).& 10\end{array}$

[0025] Finally, the gamma function is defined as follows: 5$\begin{array}{cc}{\gamma }_t\left(m^{\prime },m\right)=\sum _X{p}_t(m\&LeftBracketingBar;m^{\prime })·q_t(X\&RightBracketingBar;m^{\prime },m)·R\left(Y_t,X\right),& 11\end{array}$

[0026] where pt(m|m′) are the transition probabilities of the Markov source, and qt(X|m′,m) is the distribution of the source's output symbols conditioned on the source's state transitions.

[0027] Turbo codes are constructed as two recursive systematic codes concatenated in parallel. A MAP decoder for a turbo code generates a probability estimate of the information bits in a component code word, based on one of the two recursive systematic codes comprising the turbo code, and provides this information to a second MAP decoder which decodes the other component code word of the turbo code. The second decoder uses these probabilities as a priori information and generates new estimates of the information bits in the code word. The updated estimates are provided to the first MAP component decoder, which in turn, generates updated estimates. This feedback process continues a finite number of times, and a decision on the information bits is made based on the final probability estimates. Each operation of a component MAP decoder is referred to as a half iteration, and a typical number of iterations is eight.

[0028] The two parallel component codes in a turbo code are referred to herein as the top code and the bottom code. Normally, the data is encoded by the top code and is interleaved using either a fixed block interleaver or a random interleaver before being encoded by the bottom code.

[0029] FIG. 1 illustrates a turbo decoder 10 employing component MAP decoders 12 and 14. As shown, the top code parity data is provided along with the systematic data to a top code memory 16 and then to MAP decoder 12. The systematic data is also provided, via an interleaver 18, along with the bottom code parity data to a bottom code memory 20 and then to the second MAP decoder 14. FIG. 1 also shows the feedback loop involving MAP decoders 12 and 14, interleaver 18, de-interleaver 22, a probability estimate memory 24, and an address generator 30 for implementing a MAP decoding algorithm as described hereinabove.

[0030] It is to be noted that two component MAP decoders 12 and 14 are shown by way of illustration. However, it is to be understood that a single MAP decoder that is time-multiplexed to decode both the top and bottom codes may likewise be employed.

[0031] The systematic bit probability estimates are computed using the a posteriori transition or σt(m′,m) probabilities. The sum of all a posteriori transition probabilities resulting from the same channel symbol is the a posteriori probability symbol estimate. The output of a MAP component decoder is an a posteriori probability estimate of the systematic symbols, denoted as APPt(0) and APPt(1), as set forth in the following expression: 6$\begin{array}{cc}\begin{array}{c}{\mathrm{APP}}_t\left(k\right)=\mathrm{Pr}\left\{d_t=k|Y_1^{\tau }\right\}\\ =\sum {\sigma }_t\left(m^{\prime },m\right)\end{array}& 12\end{array}$

[0032] where the summation is over all σt(m′,m) values where the systematic bit corresponding to the transition (m′,m) is k.

[0033] The calculated a posteriori systematic bit probabilities are stored in memory as likelihood ratios, that is, APPt(1)/APPt(0).

[0034] Although the description herein is given with respect to non-logarithmic functions, it is to be understood that a logarithmic implementation is preferred for many applications. To this end, the mathematical expressions herein may converted to logarithmic expressions in known fashion.

[0035] FIG. 2 is a top level view illustrating a preferred turbo decoder data flow structure. Each block, or functional unit, has a specific function to perform as described below. The blocks within the turbo decoder in the data path are the gamma block 40, the alpha block 42, the beta block 44 , and the sigma blocks 50. Received symbols IPDATA and the a posteriori probability estimates from the sigma blocks are provided as inputs to the gamma block. Four gamma values are outputted from the gamma block, one gamma value being provided to each of the alpha and beta blocks (GAMA and GAMB, respectively); and the other gamma values (GAMSR and GAMSL) being provided via multiplexers 52 to the sigma blocks along with the present alpha and beta values (ASR, BSL) and the alpha and beta values stored in memory (A-MEM and B-MEM).

[0036] There are four sigma blocks 50 which calculate the sigma values for the transitions in the trellis. These blocks also compute an update of the a posteriori probability associated with each of the data (systematic) bits in the code word. The probability of the transmitted bit being zero (AP0R, AP0L) is computed simultaneously with the probability of the bit being one (AP1R, AP1L). Since symbol-by-symbol MAP decoding involves both forward (from the beginning to the end of the received component code word) and backward (from the end to the beginning of the received component code word) recursive calculations, as described in U.S. patent application Ser. No. 09/137,260, filed Aug. 20, 1998, the turbo decoder processes the received symbols comprising the received component code words of the received turbo code word sequentially from the first received to the last received for the forward recursion and from the last received symbol to first for the backward recursion substantially simultaneously. These operations are performed in parallel in order to minimize the delay which would otherwise result from serial sigma block calculations. For brevity, the forward recursions are referred to herein as processing received symbols comprising the component code words from the left and the backward recursions as processing symbols from the right side of the code word, and the resulting calculated values will be subscripted with L and R, respectively.

[0037] In an ASIC implementation of a turbo code, for example, it is particularly desirable to perform the interleaving and de-interleaving operations as efficiently as possible. It is also desirable that the interleaving and de-interleaving operations be performed in real time, that is, essentially without delay, in order to maximize decoding speed. The turbo decoder structure of FIG. 1 cannot perform the interleaving (or de-interleaving) operation in real time because, in general, the complete sequence is required at the input of the interleaver (or de-interleaver) before the interleaved (or de-interleaved) sequence can be generated.

[0038] FIG. 3 illustrates a turbo decoder structure with control according to a preferred embodiment of the present invention which provides for real-time interleaving and de-interleaving. Address generator 30 addresses the systematic data samples in the order in which the MAP decoder requires them. In particular, instead of moving the contents of memory addresses, the addresses themselves are manipulated to provide the contents of certain locations as required.

[0039] The output of the address generator is provided to a de-interleaver definition block 60, a bottom code parity data block 62, and a top code parity data block 64. A control signal is generated by a top/bottom code select block 66 for controlling multiplexers 68 and 70. In particular, the output of the de-interleaver definition block is an address, which is used to address the received systematic symbols and a priori log-likelihood ratios. Multiplexer 68 selects, via the signal from block 66, either the address generated by the address generator or the address generated by the de-interleaver definition. The output address is applied to a systematic likelihood ratio circuit 72, both directly and through a delay block 74. The address selected by multiplexer 68 is also applied to a systematic data memory block 76. The data and likelihood ratio are applied to component MAP decoder 12. A feedback loop for the iterative MAP decoding process is shown through the likelihood ratio block. As to the parity data, the address generated by the address generator is provided to bottom code parity data block 62 and top code parity data block 64. The output of one or the other is selected via multiplexer 70 and provided as an input to MAP decoder 12.

[0040] A preferred implementation of likelihood ratio circuit 72 is illustrated in FIG. 4. The inputs to the likelihood ratio circuit are a data clock signal, the systematic read address from the address generator, and the a posteriori estimates from the sigma calculators 50 which calculates the a posteriori estimates according to equation 12. The systematic read address is applied to a delay block 80 and a likelihood memory 82. The a posteriori estimates from the sigma blocks are selected via multiplexer 83 and provided as write data to likelihood memory 82. The output of memory 82 is applied to an absolute value block 84. In addition, the sign of the read data from memory 82 is applied as a control signal, along with a 0 bit, to multiplexers 86 and 88. The outputs of multiplexers 86 and 88 are applied to registers 90 such that two likelihood ratios are read from memory 82 each alpha/beta recursion update cycle, converted to bit probabilities, and routed to the appropriate gamma calculator 92, as illustrated in FIG. 5. (Each gamma block 40 comprises four gamma calculators 92).

[0041] As representative, FIG. 5 shows the inputs to one of the four gamma calculators 92 via selection switches, or multiplexers, 94, 96 and 98. The inputs are the a priori bit probabilities, AP0 and AP1, and the systematic and parity channel transition probabilities, represented as I0, I1, P0 and P1. The channel transition probabilities P0 and P1, or R(Xt|Yt), are computed as the one-dimensional channel probabilities for the information and parity bits:

R(Yti|Xti),R(Ytp|Xtp)  13

[0042] where Xti and Xtp are the systematic and parity components of the transitions respectively. The transition probability pt(m|m′) is zero for invalid transitions and is otherwise equal to the a priori bit probability of the systematic bit Xti. 7$\begin{array}{cc}\begin{array}{cc}{\gamma }_t\left(m^{\prime },m\right)=0& \mathrm{when}{p}_t\left(m|m^{\prime }\right)=0\\ ={\mathrm{AP}}_t\left(0\right)·R\left(Y_{t_i}|0\right)·R\left(Y_{t_p}|X_{t_p}\right)& \mathrm{when}\left(X_{t_i}|m^{\prime },m\right)=0\\ ={\mathrm{AP}}_t\left(1\right)·R\left(Y_{t_i}|1\right)·R\left(Y_{t_p}|X_{t_p}\right)& \mathrm{when}\left(X_{t_i}|m^{\prime },m\right)=1\end{array}& 14\end{array}$

[0043] where APt(k) is the a priori probability for the systematic bit at trellis level t. Furthermore, the only values that the parity symbol can assume are 0 and 1 so that at any trellis level, there can be only four possible non-zero values for gamma.

γt,00(m′,m)=APt(0)&Circlesolid;R(Yti|0)&Circlesolid;R(Ytp|0)  15

γt,01(m′,m)=APt(0)&Circlesolid;R(Yti|0)&Circlesolid;R(Ytp|1)

γt,10(m′,m)=APt(1)&Circlesolid;R(Yti|1)&Circlesolid;R(Ytp|0)

γt,11(m′,m)=APt(1)&Circlesolid;R(Yti|1)&Circlesolid;R(Ytp|1)

[0044] Each gamma calculation requires two multiplication functions and depends only on the a priori bit probability and the received symbol for the trellis level. Each set of gamma functions for a trellis index t requires the a priori bit probability for 0 and 1 and four channel probability computations.

[0045] Advantageously, by using multiplexers 94, 96, 98 in the gamma calculator, as shown, multiple code rates may be supported. Multiple code rates are constructed by puncturing the parity data of the top and bottom component codes. Specifically, multiplexers 98 (P Sel) are switched according to the puncturing pattern; and multiplexers 94 (I Sel) and multiplexers 96 (AP Sel) are used to control feedback in the turbo decoding algorithm. Puncturing involves selectively neutralizing the parity bit contribution of the gamma calculation of equation 15. Neutralizing of the parity portion of the gamma calculation is performed in the gamma calculator using a multiplexers 98.

[0046] In an exemplary embodiment, when the controller signifies that a parity bit is punctured, the gamma calculator eliminates the third term in the calculation of the set of gamma values for that symbol. If the puncturing rate of the parity bits is greater than ½, and, at minimum, every other symbol is punctured, then every two memory locations in the parity memory will contain only one valid symbol.

[0047] Referring back to FIGS. 2 and 5, let tR be defined as the trellis level index for the alpha recursion and tL be defined as the trellis level index for the beta recursion. With a block length of τ, the alpha recursion begins at trellis level tR=0 and ends at trellis level tR=τ−1. The beta recursion beings at tL=τ and ends at trellis level tL=1. Since according to preferred embodiments of the present invention, the alpha and beta recursions are operated in parallel, with indices tR and tL having different values and counting in opposite directions, eight gamma values must be calculated simultaneously, i.e., four values for the alpha recursions in parallel with four values for the beta recursions. Hence, two sets of a priori bit probabilities and eight table look-up values are needed for each update cycle.

[0048] The four gamma values for index tR are routed to the alpha block, and the four gamma values for index tL are routed to the beta block. In a recursive systematic code (n, k) for which k=1, i.e., one bit shifted into the encoder, the alpha and beta recursions each have only two terms in their summations. The two non-zero terms for each state of the trellis are known under certain code restrictions and can be hard-wired. Within the alpha and beta blocks, the matching of the feedback portion of the recursion with the correct value is performed using multiplexers. The multiplexers are controlled by switches which identify the correct gamma matching for state in and systematic bit k, where TS(m, k) identifies the trellis connection for state m and systematic bit k.

[0049] Since the alpha and beta recursions begin at opposite ends of the code-word, there is not enough information available to compute the sigma values until each recursion is half finished. At such time, all of the sigma values which reside at trellis indexes following both the alpha and beta blocks can be calculated. For a sixteen-state recursive systematic code there will be sixty-four such values. Fortunately, these can be naturally grouped into four categories using equation 12. In a recursive systematic code with sixteen states, there are sixteen elements in the summation. In one cycle of the alpha and beta recursions, equation 12 can be invoked four times. The four summations simultaneously compute APPtR (0), APPtR (1), APPtL (0) and APPtL (1) .

[0050] Until the point where the sigma-AP blocks can compute a posteriori transition probabilities, the alpha and beta probabilities are buffered, which requires considerable memory. There must be enough memory to buffer half of the alpha and beta functions for the block. For a sixteen-state code, and a block length of five hundred twelve information bits, the memory requirement is 16&Circlesolid;2&Circlesolid;512/2=8192 words. Longer blocks require additional memory, as do terminating tails on the component codes. This memory is implemented as thirty-two separate memories, one for each state of the alpha and beta recursions. Advantageously, in accordance with preferred embodiments of the present invention, the control for the memories comprises a low-complexity design. The memories can be written to consecutive locations starting at the first location. When the iteration is half completed, the memories can be read, starting from the last location written and decrementing until the iteration is completed. Both the alpha and beta memories share the same control.

[0051] Routing of the alpha and beta values to the sigma-AP block is controlled by multiplexers in the alpha and beta blocks, which select the feedback path in the recursion. These multiplexers match the alpha and beta values generated in real-time in the alpha and beta blocks, respectively, with the beta and alpha values respectively buffered in memory.

[0052] The sigma calculations also require the gamma values. For this operation, there are two gamma calculator blocks which calculate and supply the sigma-AP block with the four possible gamma values for the trellis indices tR and tL. Separate gamma-calc-cells are used to allow selective neutralizing of the systematic contribution of the gamma value and/or the a priori portion of the gamma value. Matching of the appropriate alpha, beta, and gamma values in equation 8 is performed with the selection switches described hereinabove. The gamma-calc-cells which have outputs provided to the sigma-AP blocks require the same input bit probabilities and channel probabilities as the gamma-calc-cells which support the alpha and beta recursions.

[0053] The outputs of the sigma-AP blocks are updated systematic bit probabilities. These probabilities are converted into likelihood ratios and written to the likelihood ratio memory for use with the subsequent iteration. The memory locations that these likelihood ratios must be written to can be derived from the read address of the likelihood ratio memory. The write address is simply a delayed copy of the read address. The delay required is the propagation delay of the information through the circuit. Typically, this delay will be about five cycles of the alpha/beta recursion period. All circuits, except the alpha/beta update circuit, can operate with multiple cycles without any significant decoding speed loss.

[0054] The computation of the channel probability function R(&Circlesolid;|&Circlesolid;) is performed using a look-up table. In an exemplary implementation, the input data sequence Y1τ is quantized into 64 levels, and a lookup table containing the 128 different values 64 levels (bit values 0 and 1) of the function R(&Circlesolid;|&Circlesolid;) is pre-computed. When a specific value of the channel probability function is required, the pre-computed value can be read from the table and provided to the gamma block. The memory required to store the 128 table elements is small, and the performance loss due to 64 level (6 bit) quantization of the inputs is minimal.

[0055] Typically, a MAP decoder requires data in an order consistent with that of the output of the encoder. In accordance with preferred embodiments described herein, however, the MAP decoder may compute the alpha, beta, and sigma functions in parallel and thus require data in a different order, that is, forward and backward with respect to the trellis structure.

[0056] In order to use a single address generator 30 for the systematic data samples, the likelihood ratio samples, and the parity data samples, a separate memory is utilized for each, as illustrated in FIG. 3. In addition, the data is mapped into each memory location using the same convention. For example, the pth memory location of each of the systematic data memory, the likelihood ratio memory, and the top parity data memory would contain the systematic data sample, the likelihood ratio estimate, and the parity data sample, respectively, for a given trellis level. Advantageously, with this memory mapping, a single address generator can be used to generate inputs for the top MAP decoder. And assuming that the MAP decoder generates a posteriori likelihood ratio estimates in the same order as the data is provided to the MAP decoder, then the same address can also be used as a write address for the likelihood ratio estimates.

[0057] The bottom code is supported with a similar data path structure, including an additional memory comprising the de-interleaver mapping, or definition (block 60 of FIG. 3). In decoding of the bottom code, the address generator provides input to the de-interleaver memory. The output of the de-interleaver memory is then used as the address for the systematic data memory and the likelihood ratio memory. The de-interleaver memory is arranged such that the order of the systematic data and other inputs to the MAP decoder are in the correct order. The bottom code parity data is stored in memory such that re-ordering of addresses is not required. Multiplexers are used to select the addresses for the systematic data memory and likelihood ratio memory and to select data from the parity data memories. A control signal from the top/bottom select block 66 to the multiplexers indicates whether the top or bottom code is being decoded.

[0058] The use of memory, as described hereinabove, allows real-time interleaving and de-interleaving. And since the memory can be pre-loaded, an arbitrary interleaver and a variable size block length for the turbo code are easily supportable. In order to change the interleaver structure, a new interleaver definition is merely downloaded. And for a block-length change, a new de-interleaver definition and a change in the address generator's sequence are needed.

[0059] In order to support a MAP decoder which computes the alpha and beta recursions simultaneously, the address generator needs to be able to access the systematic data and likelihood ratios for the alpha and beta recursions simultaneously. A sequential counter may be used for this purpose. In particular, the data corresponding to trellis level τ is placed in address number 0 for the beta recursion, and the data corresponding to trellis level 1 is place in address number 1 for the alpha recursion. The data is alternately stored in this manner such that the data can be addressed with an address generator with the sequence [0 1 2 3 . . . ]. Since the data corresponding to trellis level 1 is the last value required by the beta recursion, and the data corresponding to trellis level τ is the last value required in the alpha recursion, the address generator would comprise the following sequence [0 1 2 3 4 5 . . . τ−1 τ−1 τ−2 . . . 3 2 1 0]. In such case, the data for the alpha recursion comprise the even locations in the sequence, for example, and the data for the beta recursion comprise the odd locations in the sequence. A similar type of memory mapping would result in alpha recursion data in the odd locations and beta recursion data in the even locations. This memory mapping is used for the systematic data memory, the parity data memory, and the likelihood ratio memory. In the particular sequence represented hereinabove, this address generator supports a variable size block length by changing the maximum address τ−1.

[0060] Further efficiency improvement in memory mapping can be achieved where the puncture rate is at least ½, i.e., every other symbol, by dividing the sequence [1 2 3 4 5 . . τ τ τ−1 τ−2 . . . 3 2 1] by two, addressing the parity data with the new sequence, and controlling the gamma calculator with a punctured signal.

[0061] The bottom code requires different parity values, but requires the same likelihood values and systematic data values as the top code. The difference is that the bottom code requires the likelihood values and systematic data values in a different order, as a result of interleaving.

[0062] Parity data is treated differently from systematic data and likelihood ratios. Since the parity data for the bottom code is independent from the top code parity data, separate memories could be provided for the parity data. However, for practical reasons, they may be implemented using the same physical memory with the top and bottom codes occupying different portions of the same memory.

[0063] Physical separation of memories would not generally be practical for the systematic data since double the memory space would be required. And physical separation is not possible for the likelihood ratio memory because the same likelihood ratio is required for both the top code and the bottom code and because they are each updated during each half-iteration of the turbo decoder. A solution is to use a separate memory for storing the interleaver definition. When the decoder is decoding the bottom code, it reads the interleaver with the address sequence [0 1 2 3 4 5 . . . τ−1 τ−1 τ−2 . . . 3 2 1 0]. The output of the interleaver is then used for the systematic data address and the likelihood ratio address. Since the interleaver comprises a one-to-one mapping, such a structure would support an arbitrary interleaver structure.

[0064] FIG. 6 illustrates address generator 30 in more detail. The address generator accesses data and likelihood ratios for the alpha and beta recursions, and supports the top and bottom codes of the turbo code. As shown, the inputs to the address generator are an initialization signal (start block), a data clock signal, a signal indicative of block length, and a signal indicative of the number of iterations in the MAP decoding algorithm. The start block signal is applied along with the output of an up/down address counter 100, via a count zero indicator block 102, to an OR gate 104, the output of which is applied to the up/down counter along with the data clock signal. The block length signal is applied as an input to the up/down counter and to a comparator 106 wherein it is compared with the output of the up/down counter to provide a sign, or direction, signal to the up/down counter. The address from the up/down counter is applied to the de-interleaver definition block 60 (FIG. 3), the output of which is applied to multiplexer 68 (FIG. 3), which selects the systematic read address. The address from the up/down counter is also applied along with a predetermined offset value to a summer 108 to multiplexer 70 (FIG. 3), which selects the parity data address. Multiplexers 68 and 70 are controlled by the top/down code select control block 66 which is labeled in FIG. 6 as a down iteration counter based on the particular implementation illustrated in FIG. 6. (See also FIG. 3.) The inputs to the down iteration counter (or the top/down code select control block) 66 are the start block initiation signal which presets the counter and the signal representative of the number of iterations. As illustrated, the outputs of the address generator are the systematic and parity read addresses. These addresses are provided as inputs to the channel probability generator circuit 120 (FIG. 7) and the likelihood ratio circuit 72 (FIG. 4).

[0065] As illustrated in FIG. 7, the channel probability generator circuit 120 generates the channel probabilities required by the gamma calculator circuit (FIG. 5) for generating the alpha and beta recursions simultaneously. And, as described hereinabove, by using multiplexers in the gamma calculator, as illustrated in FIG. 5, multiple code rates may be supported.

[0066] Computation of the systematic and parity contributions to the gamma function in parallel requires two identical channel transition probability tables. Each time that channel probability R(y|0) is accessed for received symbol y, a corresponding value is required for R(y|1). Hence, for each single look-up table access, the values for both R(y|0) and R(y|1) may be provided. Advantageously, therefore, by using parallel circuits for the systematic and parity components and by returning two channel probabilities per table access, the eight required channel probabilities can be accessed at the same rate as the likelihood memory.

[0067] Specifically, as illustrated in FIG. 7, a preferred embodiment of the channel transition probability generator receives as inputs the systematic and parity read addresses from the address generator (FIG. 6). The received data is provided to a format convert block 122, which also receives a signal indicative of format type and converts it to 6-bit data, for example, with the first bit comprising a sign bit. The data is provided to a memory for systematic data 124 and is stored at locations specified by the write address along with the systematic write address, and to a memory for parity data 126, along with the parity write address. The output of each memory block 124 and 126, respectively, is provided to a memory for channel probabilities, 130 and 132, respectively. Each memory comprises a look-up table for channel transition probabilities, each single table address being loaded with the probabilities P(1|X) and P(0|X), or P0 and P1, as referenced hereinabove with respect to FIG. 5. The sign bit output from each data memory comprises the control signal for multiplexers 134 and 136, respectively, for selecting the appropriate value of the channel transition probability from the look-up tables. Through the system of registers 140, 142 and 144, illustrated in FIG. 7 for parallel processing, two channel probabilities are returned per table access, and the eight required channel probabilities are accessed at the same rate as the likelihood memory.

[0068] An alternative embodiment allows for terminated recursive systematic convolutional (RSC) codes for the top and bottom code, and for a merging of the component codes after 512 trellis levels. The merging of the component codes at trellis level 512 permits decoding of a longer block length by computing the alpha and beta recursions for the two sections separately (in time), but requires only the memory in the alpha and beta cells to decode a block of length 512 information bits. Both the termination of the component codes and the merging of the component codes at trellis level 512 (if the block length is larger than 512) are handled the same way. For this embodiment, separate memory locations are used for the systematic portions of the code-word. To this end, the systematic components of the top code are placed in memory such that the sequence [0 1 2 3 4 . . . τ−1 τ−1 τ−2 τ−3 . . . 3 2 1 0] will access the correct data for that code, and the merging sections of the bottom code are placed in memory cells separate from those of the top code. These memory locations are accessed by loading the interleaver with the appropriate addresses. Advantageously, since the bottom code accesses the data through the interleaver anyway, no additional circuitry is required. The number of trellis levels required to merge the trellis is equal to the memory of the code m, an exemplary value being four.

[0069] While the preferred embodiments of the present invention have been shown and described herein, it will be obvious that such embodiments are provided by way of example only. Numerous variations, changes and substitutions will occur to those of skill in the art without departing from the invention herein. Accordingly, it is intended that the invention be limited only by the spirit and scope of the appended claims.

Claims

1. A turbo decoder for use in data control and comprising MAP decoding, the turbo decoder comprising: an address generator for generating an address; a first memory unit for storing systematic data sampled of a turbo codeword; a second memory unit for storing parity data samples of the turbo codeword; and a third memory unit for storing bit probability likelihood ratios of the systematic data samples, wherein the address is simultaneously provided to at least the first memory unit, the second memory unit and the third memory unit such that the first memory unit reads a systematic data sample based on the address, the second memory unit reads a parity data sample based on the address and the third memory unit reads a likelihood ratio sample based on the address.

2. The turbo decoder of claim 1 wherein the address generator further comprises: a memory unit comprising a de-interleaver definition; and a counter for generating a real address into the de-interleaver definition, wherein an output of the de-interleaver definition is used to address the first memory unit and the third memory unit.

3. The turbo decoder of claim 1 wherein the third memory unit further comprises a top memory unit and a bottom memory unit, the top memory unit for storing parity data samples of a top code of the turbo codeword and the bottom memory unit for storing a bottom code of the turbo codeword.

4. The turbo decoder of claim 3 further comprising a multiplexer for selecting one of the top memory unit and bottom memory unit as an output of the third memory unit.

5. The turbo decoder of claim 1 wherein the address generated from the address generator is delayed for a predetermined number of clock cycles and provided to the first memory unit and the third memory unit as a write address.

6. The turbo decoder of claim 5 wherein the address generated from the address generator is delayed using a buffer.

7. A turbo decoder for use in data control and comprising MAP decoding, the turbo decoder comprising: an address generator for generating an address; a first memory unit for storing systematic data sampled of a turbo codeword; a second memory unit for storing parity data samples of a top code and a bottom code of the turbo codeword; a third memory unit for storing bit probability likelihood ratios of the systematic data samples, a fourth memory unit for storing a de-interleaver definition; and a multiplexer for selecting between an output of the address generator and the fourth memory unit, wherein the address is simultaneously provided to at least the second memory unit and the fourth memory unit and an output of the multiplexer provides an address to the first memory unit and the second memory unit.

8. The turbo decoder of claim 7 wherein a top code/bottom code select block controls the multiplexer.

9. The turbo decoder of claim 7 wherein an output of the multiplexer is delayed for a predetermined number of clock cycles and provided to the third memory unit as a write address to update the bit probability likelihood ratios.

10. The turbo decoder of claim 7 wherein the output of the multiplexer is delayed using a buffer.

11. The turbo decoder of claim 7 wherein the address generator comprises an up/down counter and wherein the first memory unit, second memory unit and third memory unit are adapted to store respective memory data as required for use with the up/down counter.

12. The turbo decoder of claim 7 wherein the up/down counter generates a memory mapping sequence represented by represented as [0 1 2 3 4 5 . . . τ−1 τ−1 τ−2 . . . 3 2 1 0], where τ represents a number of systematic data samples in the turbo codeword.

13. The turbo decoder of claim 12 wherein τ is programmable and supports variable block lengths.

14. The turbo decoder of claim 7 wherein the address generated by the address generator is provided to a MAP decoder, the MAP decoder is adapted to use the address for buffering values of alpha and beta recursions.

15. A turbo decoder for use in data control and comprising MAP decoding, the turbo decoder comprising: an address generator for generating an address; a first memory unit coupled to the address generator for storing systematic data sampled of a turbo codeword; a second memory unit coupled to the address generator and storing parity data samples of the turbo codeword; and a third memory unit coupled to the address generator and storing bit probability likelihood ratios of the systematic data samples, wherein the address is simultaneously provided to at least the first memory unit, the second memory unit and the third memory unit such that the first memory unit reads a systematic data sample based on the address, the second memory unit reads a parity data sample based on the address and the third memory unit reads a likelihood ratio sample based on the address.

16. The turbo decoder of claim 15 wherein the address generator further comprises: a memory unit comprising a de-interleaver definition; and a counter coupled to the memory unit and generating a real address into the de-interleaver definition, wherein an output of the de-interleaver definition is used to address the first memory unit and the third memory unit.

17. The turbo decoder of claim 15 wherein the third memory unit further comprises a top memory unit and a bottom memory unit coupled to the address generator, the top memory unit for storing parity data samples of a top code of the turbo codeword and the bottom memory unit for storing a bottom code of the turbo codeword.

18. The turbo decoder of claim 17 further comprising a multiplexer coupled to the top memory unit and the bottom memory unit and selecting one of the top memory unit and bottom memory unit as an output of the third memory unit.

19. A turbo decoder for use in data control and comprising MAP decoding, the turbo decoder comprising: an address generator for generating an address; a first memory unit coupled to the address generator and storing systematic data sampled of a turbo codeword; a second memory unit coupled to the address generator and storing parity data samples of a top code and a bottom code of the turbo codeword; a third memory unit coupled to the address generator storing bit probability likelihood ratios of the systematic data samples, a fourth memory unit coupled to the address generator and storing a de-interleaver definition; and a multiplexer coupled to the address generator and the fourth memory unit and selecting between an output of the address generator and the fourth memory unit, wherein the address is simultaneously provided to at least the second memory unit and the fourth memory unit and an output of the multiplexer provides an address to the first memory unit and the second memory unit.

20. A decoder for decoding punctured at least one turbo codeword using MAP decoding, the decoder comprising: a gamma probability module for calculating a gamma probability contribution wherein the gamma probability contribution corresponding to a parity bit is selectively neutralized according to a puncturing pattern associated with the turbo codeword.

21. The decoder of claim 20 wherein the puncturing pattern comprises a puncturing rate of one-half (½) and at a minimum every other parity bit contribution to the gamma probability contribution is neutralized.

22. The decoder of claim 20 wherein the gamma probability module is adapted to change the puncturing pattern of neutralizing the parity bit contribution to the gamma probability contribution such that multiple turbo codeword rates are supported.

23. A decoder for decoding turbo codewords using MAP decoding, the decoder comprising: a first gamma probability block for computing gamma values used for computing alpha and beta recursions; and a second gamma probability block for computing gamma values used for computing sigma probabilities.

24. The decoder of claim 23 wherein a same input from each of an a priori probabilities input, a systematic bit probabilities input and a parity bit probabilities input is provided to both the first and the second probability blocks.

25. The decoder of claim 24 wherein probability contributions of the a priori probabilities input, the systematic bit probabilities input and the parity bit probabilities input are selectively neutralized using the gamma values computation from at least one of the first gamma probability block and the second gamma probability block.