초록 ▼

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 d

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.

대표청구항 ▼

What is claimed is: 1. A decoder for use in data control supporting high-speed MAP decoding, the decoder comprising: an address generator for generating an address; a first memory unit for storing systematic data samples of a turbo codeword; a second memory unit for storing parity data samples of t

What is claimed is: 1. A decoder for use in data control supporting high-speed MAP decoding, the decoder comprising: an address generator for generating an address; a first memory unit for storing systematic data samples 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; and wherein the address further forms the basis of a write address provided to the third memory unit. 2. The 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 encoder of claim 1 wherein the address generated from the address generator is delayed for a predetermined number of clock cycles and provided to the third memory unit as the write address. 4. The decoder of claim 3 wherein the address generated from the address generator is delayed using a buffer. 5. The decoder of claim 1 wherein the second 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 parity data samples of a bottom code of the turbo codeword. 6. The decoder of claim 5 further comprising a multiplexer for selecting one of the top memory unit and bottom memory unit as an output of the second memory unit. 7. The decoder of claim 5 further comprising a multiplexer for selecting one of the top memory unit and bottom memory unit as an output of the second memory unit. 8. A decoder for use in data control support high-speed MAP decoding, the decoder comprising: an address generator for generating an address; a first memory unit for storing systematic data samples 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 third memory unit. 9. The decoder of claim 8 wherein a top code/bottom code select block controls the multiplexer. 10. The decoder of claim 8 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. 11. The decoder of claim 8 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 decoder of claim 8 wherein the address generator comprises an up/down counter and wherein the first memory unit, the second memory unit and the third memory unit are adapted to store respective memory data as required for use with the up/down counter. 13. The decoder of claim 8 wherein the address generated by the address generator is provided to a MAP decoder, the MAP decoder being adapted to use the address for buffering values of alpha and beta recursions. 14. The decoder of claim 8 wherein the up/down counter generates a memory mapping sequence 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. 15. The decoder of claim 14 wherein τ is programmable and supports variable block lengths. 16. A decoder for use in data control supporting high-speed MAP decoding, the turbo decoder comprising: an address generator for generating an address; a first memory unit for storing systematic data samples 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; and wherein the address further forms the basis of a write address provided to the third memory unit. 17. The decoder of claim 16 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. 18. The decoder of claim 16 wherein the second 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 parity data samples of a bottom code of the turbo codeword. 19. A decoder for use in data control supporting high-speed MAP decoding, the decoder comprising: an address generator for generating an address; a first memory unit coupled to the address generator and storing systematic data samples 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 and 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 third memory unit. 20. A decoder for decoding punctured components codes supporting high-speed 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 components codes. 21. 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 component code rates are supported. 22. 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. 23. The decoder of claim 22 wherein memories that buffer the parity data samples are implemented at at least 쩍 size. 24. A decoder for decoding turbo codewords supporting high-speed 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. 25. The decoder of claim 24 wherein a same input from each of an a priori probabilities input, a systematic bit probabilities input and a parity bit probabilities input are provided to both the first and second probabilities blocks. 26. The decoder of claim 25 wherein probability contributions of the a priori probabilities input, the systematic bit probabilities input and the parity bit probabilities input are selectively neutralized in at least one of the first gamma probability block and the second gamma probability block.