A Parallel Decoding Algorithm for Short Polar Codes Based on Error Checking and Correcting

We propose a parallel decoding algorithm based on error checking and correcting to improve the performance of the short polar codes. In order to enhance the error-correcting capacity of the decoding algorithm, we first derive the error-checking equations generated on the basis of the frozen nodes, a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:TheScientificWorld Jg. 2014; H. 2014; S. 1 - 14
Hauptverfasser: Ye, Zhan, Pan, Kegang, Pan, Xiaofei, Zhang, Yingxian, Gong, Chao
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Cairo, Egypt Hindawi Publishing Corporation 01.01.2014
John Wiley & Sons, Inc
Wiley
Schlagworte:
Algorithms
Binary system
Codes
Error-correcting codes
Graph representations
Linear programming
Low density parity check codes
Models, Theoretical
Satellite communications
ISSN:2356-6140, 1537-744X, 1537-744X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We propose a parallel decoding algorithm based on error checking and correcting to improve the performance of the short polar codes. In order to enhance the error-correcting capacity of the decoding algorithm, we first derive the error-checking equations generated on the basis of the frozen nodes, and then we introduce the method to check the errors in the input nodes of the decoder by the solutions of these equations. In order to further correct those checked errors, we adopt the method of modifying the probability messages of the error nodes with constant values according to the maximization principle. Due to the existence of multiple solutions of the error-checking equations, we formulate a CRC-aided optimization problem of finding the optimal solution with three different target functions, so as to improve the accuracy of error checking. Besides, in order to increase the throughput of decoding, we use a parallel method based on the decoding tree to calculate probability messages of all the nodes in the decoder. Numerical results show that the proposed decoding algorithm achieves better performance than that of some existing decoding algorithms with the same code length.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
Academic Editor: Lei Cao
ISSN:2356-6140
1537-744X
1537-744X
DOI:10.1155/2014/895782