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

Simple item page
dc.contributor.authorOuardi, Aissa
dc.contributor.authorDjebbari, Ali
dc.contributor.authorBouazza, Boubakar S.
dc.date.accessioned2016-10-31T07:35:00Z
dc.date.available2016-10-31T07:35:00Z
dc.date.issued2011-10
dc.description.abstractIn 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.identifier.citationWireless Engineering and Technology, 2011, 2, 230-234en_US
dc.identifier.urihttp://dx.doi.org/10.4236/wet.2011.24031
dc.identifier.urihttp://hdl.handle.net/123456789/1096
dc.language.isoenen_US
dc.publisherScientific Research Publishingen_US
dc.subjectMAP-BCJR Algorithmen_US
dc.subjectM-BCJRen_US
dc.subjectTurbo Decodingen_US
dc.subjectComplexity Reductionen_US
dc.subjectError Localisation Criterionen_US
dc.titleOptimal M-BCJR Turbo Decoding: The Z-MAP Algorithmen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Optimal M-BCJR Turbo Decoding The Z-MAP Algorithm.pdf
Size:
698.88 KB
Format:
Adobe Portable Document Format
Description:
Full text
Download

License bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Computer Science & Communications