Maximum a posteriori decoding algorithms for turbo codes | Zendy

Hamid R. Sadjadpour | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

<title>Maximum a posteriori decoding algorithms for turbo codes</title>

Author(s) -

Hamid R. Sadjadpour

Publication year - 2000

Publication title -

proceedings of spie, the international society for optical engineering/proceedings of spie

Language(s) - English

Resource type - Conference proceedings

SCImago Journal Rank - 0.192

H-Index - 176

eISSN - 1996-756X

pISSN - 0277-786X

DOI - 10.1117/12.394081

Subject(s) - bcjr algorithm , decoding methods , maximum a posteriori estimation , turbo code , algorithm , computer science , serial concatenated convolutional codes , difference map algorithm , logarithm , symbol (formal) , berlekamp–welch algorithm , sequential decoding , list decoding , turbo equalizer , concatenated error correction code , computational complexity theory , bit error rate , a priori and a posteriori , mathematics , maximum likelihood , block code , mathematical analysis , philosophy , statistics , epistemology , programming language

The symbol-by-symbolmaximum,a posteriori (MAP) known,also as BCJR algorithm is described. The logarith- mic versions of the MAP algorithm, namely, Log-MAP and Max-Log-MAP decoding algorithms along with a new Simplified-Log-MAP algorithm, are presented here. Their bit error rate (BER) performance and computational corn- plexity of these algorithms are compared. A new hardware architecture for implementing,the MAP-based decoding algorithms suitable for chip design is also presented here. Keywords: Iterative decoding, MAP decoding, Turbo Codes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research