Design of Log-Map / Max-Log-Map Decoder

TL;DR

This paper discusses the design of a turbo-code decoder using Log-Map and Max-Log-Map algorithms, focusing on the process of decoding corrupted code sequences by calculating APPs to determine the most probable transmitted bits.

Contribution

It introduces the design considerations for Log-Map and Max-Log-Map decoders in turbo coding, emphasizing their role in efficient decision-making based on APPs.

Findings

Log-Map and Max-Log-Map algorithms effectively decode turbo codes.

APP calculation is crucial for accurate bit decision in turbo decoding.

The methods improve decoding reliability for corrupted sequences.

Abstract

The process of turbo-code decoding starts with the formation of a posteriori probabilities (APPs) for each data bit, which is followed by choosing the data-bit value that corresponds to the maximum a posteriori (MAP) probability for that data bit. Upon reception of a corrupted code-bit sequence, the process of decision making with APPs allows the MAP algorithm to determine the most likely information bit to have been transmitted at each bit time.