A Modified MAP Turbo Decoding Algorithm

In this paper, an improved maximum a posteriori probability (MAP) turbo decoding algorithm is proposed. This algorithm reduces the computational complexity however is exactly equivalent to the MAP turbo decoding. Then we extend the new algorithm for log-MAP. We also present some complexity compariso...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2006 International Symposium on Communications and Information Technologies : Bangkok, Thailand, 18-29 October 2006 s. 380 - 383
Hlavní autor: Rogeau-Azizi, L.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: 01.10.2006
Témata:
AWGN
Computational complexity
Computational modeling
Concatenated codes
Error correction codes
Iterative decoding
Modulation coding
Table lookup
Turbo codes
Yttrium
ISBN:9780780397408, 0780397401
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, an improved maximum a posteriori probability (MAP) turbo decoding algorithm is proposed. This algorithm reduces the computational complexity however is exactly equivalent to the MAP turbo decoding. Then we extend the new algorithm for log-MAP. We also present some complexity comparison to show that the modified algorithm requires fewer computation than MAP. As a practical example forming the basis for simulations, we consider a parallel concatenated trellis-coded modulation (PCTCM). The simulation results prove that our simplified algorithm is equivalent to the log-MAP algorithm in term of the performance
ISBN:9780780397408
0780397401
DOI:10.1109/ISCIT.2006.340069