Turbo Decoder Design based on an LUT-Normalized Log-MAP Algorithm

Jun Li1, Xiumin Wang2, Jinlong He2

  • 1Binjiang College, Nanjing University of Information Science & Technology, Wuxi 214105, China.

Summary

A new normalized Log-MAP (Nor-Log-MAP) decoding algorithm improves Turbo code performance in wireless systems. The LUT-Nor-Log-MAP variant offers comparable decoding to LUT-Log-MAP while reducing logic resources and improving bit error rates.

Related Concept Videos

Block Diagram Reduction01:22

Block Diagram Reduction

The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
401
Transformers with Off-Nominal Turns Ratios01:25

Transformers with Off-Nominal Turns Ratios

In scenarios involving parallel transformers with disparate ratings, developing per-unit models requires accommodating off-nominal turns ratios. This situation arises when the selected base voltages are not proportional to the transformer’s voltage ratings. Consider a transformer where the rated voltages are related by the term a. If the chosen voltage bases satisfy a relationship involving term b, term c is defined as the ratio of these bases. This ratio is then substituted into the...
404
Definition of Laplace Transform01:22

Definition of Laplace Transform

The Laplace transform is an indispensable mathematical technique for simplifying the resolution of differential equations by converting them into more manageable algebraic expressions. The Laplace transform of a function is denoted by L[x(t)], where x(t) is the time-domain function. The laplace transform is mathematically expressed as
3.8K
Properties of the z-Transform I01:17

Properties of the z-Transform I

The z-transform is a fundamental tool in digital signal processing, enabling the analysis of discrete-time systems through its various properties. It is an invaluable tool for analyzing discrete-time systems, offering a range of properties that simplify complex signal manipulations. One fundamental property is linearity. For any two discrete-time signals, the z-transform of their linear combination equals the same linear combination of their individual z-transforms. This property is essential...
471
Downsampling01:20

Downsampling

When considering a sampled sequence with zero values between sampling instants, one can replace it by taking every N-th value of the sequence. At these integer multiples of N, the original and sampled sequences coincide. This process, known as decimation, involves extracting every N-th sample from a sequence, thereby creating a more efficient sequence.
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
468
Relation of DFT to z-Transform01:20

Relation of DFT to z-Transform

The Discrete Fourier Transform (DFT) is a crucial tool for analyzing the frequency content of discrete-time signals. It converts a sequence of N samples from the time domain into its corresponding sequence in the frequency domain, where each sample represents a specific frequency component.
To understand how the DFT works, it's helpful to consider the z-transform, which is a method for representing discrete sequences in the complex frequency domain. The z-transform involves summing the...
644