Fast algebraic decoding of the (17, 9, 5) quadratic residue code

A fast algebraic decoding algorithm is proposed to correct all patterns of two or fewer errors in the binary (17, 9, 5) quadratic residue (QR) code. Computer simulations show that the average decoding time of the proposed decoding algorithm is about 2.88 times less execution time than the D3 algebra...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2012 2nd International Conference on Consumer Electronics, Communications and Networks S. 1812 - 1815
1. Verfasser: Hung-Peng Lee
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.04.2012
Schlagworte:
algebraic decoding algorithm
Algorithm design and analysis
Decoding
Encoding
error pattern
Polynomials
quadratic residue code
Silicon
Software algorithms
syndrome
Systematics
ISBN:9781457714146, 1457714140
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A fast algebraic decoding algorithm is proposed to correct all patterns of two or fewer errors in the binary (17, 9, 5) quadratic residue (QR) code. Computer simulations show that the average decoding time of the proposed decoding algorithm is about 2.88 times less execution time than the D3 algebraic decoding algorithm of Chang et al.
ISBN:9781457714146
1457714140
DOI:10.1109/CECNet.2012.6201457