Linearly approximated log map algorithm for turbo decoding

A method and apparatus for implementing a linearly approximated Log MAP algorithm, said implementation involves calculating MAX*(a(n),b(n)) function, said method comprising the steps of: (A) Receiving a(n), b(n) and DE; (B) calculating (a(n)+b(n)+DE)/2 and generating at least one intermediate result...

Full description

Saved in:
Bibliographic Details
Main Authors SIVAN, NOAM, AIDAN, FABRICE, LESHIN, GREGORY
Format Patent
LanguageEnglish
French
German
Published 20.03.2002
Edition7
Subjects
BASIC ELECTRONIC CIRCUITRY
CODE CONVERSION IN GENERAL
CODING
DECODING
ELECTRICITY
Online AccessGet full text

Cover

More Information
Summary:A method and apparatus for implementing a linearly approximated Log MAP algorithm, said implementation involves calculating MAX*(a(n),b(n)) function, said method comprising the steps of: (A) Receiving a(n), b(n) and DE; (B) calculating (a(n)+b(n)+DE)/2 and generating at least one intermediate result, said at least one intermediate result reflecting at least one relationship between at least two elements out of a(n), b(n) and DE; and (C) providing an MAX*(a(n),b(n)) result selected from a group comprising of a(n), b(n) or (a(n)+b(n)+DE)/2, said selection dependent upon the at least one intermediate result.
Bibliography:Application Number: EP20000116858