Stochastic Decoding of Linear Block Codes With High-Density Parity-Check Matrices

This correspondence extends the application of the recently proposed stochastic decoding approach to decode linear block codes with high-density parity-check matrices and discusses its hardware complexity. Results demonstrate decoding performance close to floating-point iterative soft-input soft-out...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on signal processing 2008-11, Vol.56 (11), p.5733-5739
Hauptverfasser:	Sharifi Tehrani, S., Jego, C., Bo Zhu, Gross, W.J.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences BCH codes Belief propagation Block codes block turbo codes Coding, codes Complexity Decoding Electronics Engineering Sciences Exact sciences and technology Floating point arithmetic Hardware Information, signal and communications theory Iterative algorithms Iterative decoding Mathematical analysis Matrices Matrix methods Miscellaneous Parity check codes Phase change materials Reed-Solomon codes Signal and communications theory Signal processing Signal processing algorithms soft-input soft-output decoding stochastic decoding Stochastic processes Stochasticity Telecommunications and information theory Turbo codes
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	This correspondence extends the application of the recently proposed stochastic decoding approach to decode linear block codes with high-density parity-check matrices and discusses its hardware complexity. Results demonstrate decoding performance close to floating-point iterative soft-input soft-output (SISO) decoding while offering nodes with considerably lower complexity compared to fixed-point SISO decoding.
ISSN:	1053-587X 1941-0476
DOI:	10.1109/TSP.2008.929337