Polynomial based analog source-channel codes - [transactions papers]

In many communication applications one is interested in transmitting a time-discrete analog-valued (i.e. continuous alphabet) source over a time-discrete analog channel. We study this problem in the case of bandwidth expansion, in the sense that one source sample, X, is transmitted over N-orthogonal...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on communications 2009-09, Vol.57 (9), p.2600-2606
Hauptverfasser:	Wernersson, Niklas, Skoglund, Mikael, Ramstad, Tor
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences AWGN channels Bandwidth Channel coding Coding, codes Delay effects Delay systems Digital systems error correction Error correction codes Exact sciences and technology Information technology Information, signal and communications theory Informationsteknik Memoryless systems Modulation Modulation, demodulation nonlinear functions Real time systems Signal and communications theory Source coding TECHNOLOGY TEKNIKVETENSKAP Telecommunication Telecommunications and information theory Telekommunikation
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In many communication applications one is interested in transmitting a time-discrete analog-valued (i.e. continuous alphabet) source over a time-discrete analog channel. We study this problem in the case of bandwidth expansion, in the sense that one source sample, X, is transmitted over N-orthogonal channels. An analog source-channel code based on orthogonal polynomials is proposed and analyzed. The code can be generated using a Gram-Schmidt procedure, to fit virtually any source distribution.
ISSN:	0090-6778 1558-0857 1558-0857
DOI:	10.1109/TCOMM.2009.5281750