Analog Source-Channel Codes Based on Orthogonal Polynomials

Analog Source-Channel Codes Based on Orthogonal Polynomials

In many communication applications one is interested in transmitting a time-discrete analog-valued (i.e. continues 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
Hauptverfasser: Wernersson, N., Skoglund, M., Ramstad, T.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
AWGN channels
Bandwidth
Channel coding
Computer science
Datavetenskap
Decoding
Delay effects
Delay systems
Digital systems
Information technology
Informationsteknik
Memoryless systems
Real time systems
System performance
TECHNOLOGY
TEKNIKVETENSKAP
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. continues 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:1058-6393
2576-2303
DOI:10.1109/ACSSC.2007.4487376