作者: Niklas Wernersson , Mikael Skoglund , Tor Ramstad
DOI: 10.1109/ACSSC.2007.4487376
关键词: Distribution (number theory) 、 Mathematics 、 Orthogonal polynomials 、 Electronic engineering 、 Code (cryptography) 、 Topology 、 Alphabet 、 Bandwidth expansion 、 Sample (graphics) 、 Sense (electronics) 、 Communication channel
摘要: In many communication applications one is interested in transmitting a time-discrete analog-valued (i.e. continues alphabet) source over analog channel. We study this problem the case of bandwidth expansion, sense that sample, X, transmitted N orthogonal channels. An source-channel code based on polynomials proposed and analyzed. The can be generated using Gram-Schmidt procedure, to fit virtually any distribution.