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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2009-09, Vol.57 (9), p.2600-2606
Main Authors: Wernersson, Niklas, Skoglund, Mikael, Ramstad, Tor
Format: Article
Language:English
Subjects:
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
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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