1/2023 - 5 |
Sum-Log Stopping Criterion for Log-MAP Turbo DecodingOUARDI, A. |
Extra paper information in |
Click to see author's profile in SCOPUS, IEEE Xplore, Web of Science |
Download PDF (2,135 KB) | Citation | Downloads: 765 | Views: 1,042 |
Author keywords
channel coding, convolutional codes, gaussian channels, iterative decoding, turbo codes
References keywords
turbo(31), decoding(23), stopping(21), criterion(12), communications(12), codes(11), letters(9), iterative(7), error(6), electronics(6)
Blue keywords are present in both the references section and the paper title.
About this article
Date of Publication: 2023-02-28
Volume 23, Issue 1, Year 2023, On page(s): 43 - 50
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2023.01005
Web of Science Accession Number: 000937345700005
SCOPUS ID: 85150202224
Abstract
This article presents a new stopping criterion for the logarithmic - maximum a posteriori (Log-MAP) turbo decoding. This method is inspired from the recent stopping criterion Sum alpha of the maximum a posteriori (MAP) algorithm. We call it Sum-Log. This criterion manipulates logarithmic quantities of the Log-MAP algorithm and provides a decision on the decoding quality. It is proposed in two versions Sum-Log-1 and Sum-Log-2. It is aimed for practical use and at the same time guarantees lower complexity. The simulation results show that the Sum-Log criterion offers the same performances in terms of Bit Error Rate (BER), Frame Error Rate (FER) and average number of iterations of the Sum alpha and the famous Cross-Entropy (CE) criteria. |
References | | | Cited By |
Web of Science® Times Cited: 0
View record in Web of Science® [View]
View Related Records® [View]
Updated today
SCOPUS® Times Cited: 1
View record in SCOPUS® [Free preview]
View citations in SCOPUS® [Free preview]
[1] Low Complexity Stopping Rule for Turbo Decoding: the Max-log Criterion, Ouardi, Aissa, Journal of Telecommunications and Information Technology, ISSN 1509-4553, Issue 2024, Volume 1, 2024.
Digital Object Identifier: 10.26636/jtit.2024.1.1377 [CrossRef]
Disclaimer: All information displayed above was retrieved by using remote connections to respective databases. For the best user experience, we update all data by using background processes, and use caches in order to reduce the load on the servers we retrieve the information from. As we have no control on the availability of the database servers and sometimes the Internet connectivity may be affected, we do not guarantee the information is correct or complete. For the most accurate data, please always consult the database sites directly. Some external links require authentication or an institutional subscription.
Web of Science® is a registered trademark of Clarivate Analytics, Scopus® is a registered trademark of Elsevier B.V., other product names, company names, brand names, trademarks and logos are the property of their respective owners.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.