Parallel Concatenated Tree Hadamard Codes

In this letter, a new class of low-rate error-correcting codes named parallel concatenated tree Hadamard codes (CTrHC) are designed. Tree Hadamard codes consist of Hadamard segments which are connected by carefully chosen positions from a Hadamard codeword. With the same encoding and decoding comple...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE communications letters 2011-07, Vol.15 (7), p.743-745
Hauptverfasser:	Che, Shuling, Wang, Xinmei
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Bit error rate Coding, codes Complexity Complexity theory Decoding Encoding Equations Error correcting codes Error correction Error correction codes error floor Errors Exact sciences and technology Hadamard codes Information, signal and communications theory low-complexity decoding low-rate codes parallel concatenation Parity check codes Segments Signal and communications theory Simulation Telecommunications and information theory Trees
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In this letter, a new class of low-rate error-correcting codes named parallel concatenated tree Hadamard codes (CTrHC) are designed. Tree Hadamard codes consist of Hadamard segments which are connected by carefully chosen positions from a Hadamard codeword. With the same encoding and decoding complexity as the parallel concatenated zigzag Hadamard codes, CTrHC with short code length can achieve much better error floor performance illustrated by simulation results.
ISSN:	1089-7798 1558-2558
DOI:	10.1109/LCOMM.2011.051911.102464