Analog source-channel codes based on orthogonal polynomials
2007 (English)In: CONFERENCE RECORD OF THE FORTY-FIRST ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, NEW YORK: IEEE , 2007, 1025-1029 p.Conference paper (Refereed)
In many communication applications one is interested in transmitting a time-discrete analog-valued (i.e. continous 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.
Place, publisher, year, edition, pages
NEW YORK: IEEE , 2007. 1025-1029 p.
IdentifiersURN: urn:nbn:se:kth:diva-28970DOI: 10.1109/ACSSC.2007.4487376ISI: 000257172900196ScopusID: 2-s2.0-50249109521OAI: oai:DiVA.org:kth-28970DiVA: diva2:398037
41st Asilomar Conference on Signals, Systems and Computers Pacific Grove, CA, NOV 04-07, 2007
QC 201102162011-02-162011-01-252012-01-09Bibliographically approved