Article | REF: TE5260 V1

Turbocodes: achievements and prospects

Author: Yannick SAOUTER

Publication date: August 10, 2010

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!


Français

4. Implementation

4.1 Max-Log-MAP decoder structure

In this section, we study the classical architecture of a decoder implementing the Max-Log-MAP algorithm. Although inferior in terms of performance, this algorithm is preferred to the MAP algorithm because its complexity in terms of number of logic gates is lower. This is because it uses simple arithmetic operators, whereas the MAP algorithm requires more complex operators such as multiplication.

Let's specify the Max-Log-MAP algorithm. The desired result is Q (c i , t ) for each index i of the received frame and each Boolean value t. We therefore need the values Q (x i , t ) and Q (r i , t...

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!


The Ultimate Scientific and Technical Reference

A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

This article is included in

Signal processing and its applications

This offer includes:

Knowledge Base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

Practical Path

Operational and didactic, to guarantee the acquisition of transversal skills

Doc & Quiz

Interactive articles with quizzes, for constructive reading

Subscribe now!

Ongoing reading
Implementation