초록 ▼

A matrix transform method and circuit provides for MAP decoding of turbo codes. The method begins by initializing a forward recursion probability function vector α0,and a backward recursion probability function vector βN. Then, transition probability matrices Γ(Rk) and Γi(Rk) are determined accordin

A matrix transform method and circuit provides for MAP decoding of turbo codes. The method begins by initializing a forward recursion probability function vector α0,and a backward recursion probability function vector βN. Then, transition probability matrices Γ(Rk) and Γi(Rk) are determined according to each received symbol of the sequence R1N. And then, values of αk,corresponding to the received Rkare determined according to Γ(Rk). At the same time of determining αk,a plurality of multiplacation on Γ(Rk) and Γi(Rk) are accomplished in parallel. By making use of the results of the matrix multiplications, after receiving the complete symbol sequence R1N,values of all of the backward recursion probability vector βk,where k=1, 2, . . . , N-1, are determined in parallel, and the log likelihood ratio for every decoded bit dk,k=1, 2, . . . , N, are also determined in parallel. The circuit performs successive decoding procedures in parallel using a set of regular matrix operations. These operations substantially accelerate the decoding speed and reduce the computational complexity, and are particularly suited for implementation in special-purpose parallel processing VLSI hardware architectures. Using shift registers, the VLSI implementation effectively reduces memory requirements and simplifies complicated data accesses and transfers.

대표청구항 ▼

1. A method for decoding a turbo-encoded symbol sequence R1Nreceived via a noisy channel, comprising the steps of: initializing a forward recursion probability function vector α0; initializing a backward recursion probability function vector βN; determining a plurality of transition probability

1. A method for decoding a turbo-encoded symbol sequence R1Nreceived via a noisy channel, comprising the steps of: initializing a forward recursion probability function vector α0; initializing a backward recursion probability function vector βN; determining a plurality of transition probability matrices for each received symbol Rkof the sequence R1N,the plurality of probability matrices including a matrix Γ(Rk); determine values of the forward recursion probability function vector αkaccording to Γ(Rk) for each received symbol Rkwhile multiplying the plurality of transition probability matrices in parallel; determining a log likelihood ratio for each decoded bit dkin parallel after receiving the complete symbol sequence R1N. 2. The method of claim 1 wherein the forward recursion probability function vector α0is initialized to [1, 0, 0, . . . , 0], the backward recursion probability function vector βNis initialized to [1, 0, 0, . . . , 0], and the plurality of transition probability matrices also includes Γi(Rk), and further comprising the step of: