Information Set Based Soft-Decoding Algorithm for Block Codes

In this paper we introduce a new sub-optimum soft-decoding algorithm for block codes, based on information sets and erasures, which showed to be very efficient in terms of bit error rate and computational complexity when compared to optimum decoding methods. Our results show that the proposed algori...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Revista IEEE América Latina 2011-07, Vol.9 (4), p.463-469
Hauptverfasser:	de Oliveira Brante, G. G., Muniz, D. N., Godoy, W.
Format:	Artikel
Sprache:	eng ; por
Schlagworte:	Algorithm design and analysis Algorithms Bit error rate Block codes Complexity Computation Decoding Golay codes Irrigation Maximum likelihood decoding Optimization Signal to noise ratio Studies sub-optimum decoding Tradeoffs Viterbi algorithm
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!