What question did this study set out to answer?

This research aims to compare the effectiveness and computational complexity of different MAP algorithms, focusing on log-MAP.

November 19, 2002

A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain

View Full Paper

Ask AI

Bookmark

Authors

Randomized trial compares optimal and sub-optimal MAP algorithms, indicating implications for Turbo decoding performance.

This research aims to compare the effectiveness and computational complexity of different MAP algorithms, focusing on log-MAP.
Theoretical comparison of log-MAP, max-log-MAP, and SOVA algorithms.
Simulations performed using Turbo decoding with recursive systematic convolutional component codes.
Assessment of algorithm performance considering quantization effects.
At SNR of 10^-4, SOVA is approximately 0.7 dB worse than the log-MAP.
Max-log-MAP performs between SOVA and log-MAP regarding decoding performance.
Complexity increases among the algorithms in the order of their optimality.

Robertson et al. (2002) studied this question.

View Full Paper

Ask AI

Bookmark