Message Passing-Based Decoding of Convolutional Codes: Performance and Complexity Analysis

In this letter, we propose to apply message passing algorithms to decode standard convolutional codes and assess the resulting performance and the required complexity compared to conventional decoding algorithms for convolutional codes by concentrating on the Viterbi algorithm (VA). We show that, in...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2016-02, Vol.20 (2), p.216-219
Main Authors: Mani, Hossein, Saeedi, Hamid
Format: Article
Language:English
Subjects:
Complexity theory
Convolutional codes
Generators
Iterative decoding
Maximum likelihood decoding
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this letter, we propose to apply message passing algorithms to decode standard convolutional codes and assess the resulting performance and the required complexity compared to conventional decoding algorithms for convolutional codes by concentrating on the Viterbi algorithm (VA). We show that, in contrast to the VA for which the decoding complexity increases exponentially with m, the number of memory blocks for the proposed framework, such an increase, is only linear in m. This suggests that applying message passing algorithms can provide considerable savings in the required computational power if it can also exhibit a comparable bit-error-rate performance to that of the VA. In this letter, we show via simulations that this is in fact the case for convolutional codes.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2015.2508459