Universal Algorithms for Channel Decoding of Uncompressed Sources

In many applications, an uncompressed source stream is systematically encoded by a channel code (which ignores the source redundancy) for transmission over a discrete memoryless channel. The decoder knows the channel and the code but does not know the source statistics. This paper proposes several u...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2008-05, Vol.54 (5), p.2243-2262
Hauptverfasser:	Ordentlich, E., Seroussi, G., Verdu, S., Viswanathan, K.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Belief propagation Channel capacity channel decoding Channels Codes Coding, codes Decoders Decoding denoising Detection, estimation, filtering, equalization, prediction discrete memoryless channels Exact sciences and technology GSM Information theory Information, signal and communications theory joint source-channel decoding lossless compression Maximum likelihood decoding Memoryless systems Miscellaneous Noise reduction Probability Propagation losses Redundancy Signal and communications theory Signal processing Signal, noise soft decoding Statistics Streams Telecommunications and information theory universal algorithms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In many applications, an uncompressed source stream is systematically encoded by a channel code (which ignores the source redundancy) for transmission over a discrete memoryless channel. The decoder knows the channel and the code but does not know the source statistics. This paper proposes several universal channel decoders that take advantage of the source redundancy without requiring prior knowledge of its statistics.
ISSN:	0018-9448 1557-9654
DOI:	10.1109/TIT.2008.920187