Proposal of sub-optimum decoding algorithm with a bound of Voronoi region V( C0)

Proposal of sub-optimum decoding algorithm with a bound of Voronoi region V( C0)

The objective of this paper is to analyze the bound of addition proposed by Barros et al. (Computer Communication 20(4) (1997) 302–308) in contrast to the GMD bound (Forney, IEEE Trans. Inf. Theory IT-12 (1996)) and the cone bound (Godoy, Doctoral Thesis, UNICAMP, Campinas, SP, Brazil, 1990) which s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer communications 1998-06, Vol.21 (8), p.736-740
Hauptverfasser: Godoy, Walter, Wille, Emı́lio C.G.
Format: Artikel
Sprache:eng
Schlagworte:
algorithms
decoding stop rules
error correcting codes
soft decision decoding
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The objective of this paper is to analyze the bound of addition proposed by Barros et al. (Computer Communication 20(4) (1997) 302–308) in contrast to the GMD bound (Forney, IEEE Trans. Inf. Theory IT-12 (1996)) and the cone bound (Godoy, Doctoral Thesis, UNICAMP, Campinas, SP, Brazil, 1990) which shows the Voronoi region of the zero code-word for a specific vector. A new algorithm, which associates the ZNA algorithm (Levitin and Hartmann, IEEE Trans. Inf. Theory, IT-31(3) (1985)) with the bound of addition, is proposed for soft decision techniques.
ISSN:0140-3664
1873-703X
DOI:10.1016/S0140-3664(98)00149-2