Polynomial based analog source-channel codes - [transactions papers]
Niklas Wernersson, Mikael Skoglund, Tor Audun Ramstad · IEEE Transactions on Communications · 2009
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.