DSpace Repository

Optimal M-BCJR Turbo Decoding: The Z-MAP Algorithm

Show simple item record

dc.contributor.author Ouardi, Aissa
dc.contributor.author Djebbari, Ali
dc.contributor.author Bouazza, Boubakar S.
dc.date.accessioned 2016-10-31T07:35:00Z
dc.date.available 2016-10-31T07:35:00Z
dc.date.issued 2011-10
dc.identifier.citation Wireless Engineering and Technology, 2011, 2, 230-234 en_US
dc.identifier.uri http://dx.doi.org/10.4236/wet.2011.24031
dc.identifier.uri http://hdl.handle.net/123456789/1096
dc.description.abstract In this paper, we propose a novel idea for improvement performances of the leader M-BCJR algorithm functioning in low complexity. The basic idea consists to localize error instant possibility, and then increase the complexity around this moment. We also propose an easy and important idea for early localisation of erroneous moments. We call this new algorithm Z-MAP. The simulations show that the improvement of performances is significant. The performances of Z-MAP turbo decoding are so close to full MAP-BCJR performances. Furthermore, the complexity is the same that of the M-BCJR. So, Z-MAP is an optimal version of M-BCJR algorithm. en_US
dc.language.iso en en_US
dc.publisher Scientific Research Publishing en_US
dc.subject MAP-BCJR Algorithm en_US
dc.subject M-BCJR en_US
dc.subject Turbo Decoding en_US
dc.subject Complexity Reduction en_US
dc.subject Error Localisation Criterion en_US
dc.title Optimal M-BCJR Turbo Decoding: The Z-MAP Algorithm en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account