Curves on Flat Tori and Analog Source-Channel Codes
- 18 June 2013
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 59 (10) , 6646-6654
Abstract
In this paper, we consider the problem of transmitting a continuous alphabet discrete-time source over an additive white Gaussian noise channel in the bandwidth expansion case. We propose a constructive scheme based on a set of curves on the surface of a 2N-dimensional sphere. Our approach shows that the design of good codes for this communication problem relies on geometrical properties of spherical codes and projections of N-dimensional rectangular lattices. Theoretical comparisons with some previous works in terms of the mean squared error as a function of the channel SNR, as well as simulations, are provided.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Single-Sample Robust Joint Source–Channel Coding: Achieving Asymptotically Optimum Scaling of SDR Versus SNRIEEE Transactions on Information Theory, 2012
- The lifting construction: A general solution for the fat strut problem2010
- Polynomial based analog source-channel codes - [transactions papers]IEEE Transactions on Communications, 2009
- Spherical codes on torus layers2009
- Shannon-kotel-nikov mappings in joint source-channel codingIEEE Transactions on Communications, 2009
- Curves on a sphere, shift-map dynamics, and error control for continuous alphabet sourcesIEEE Transactions on Information Theory, 2003
- Perfect Lattices in Euclidean Spaces2003
- Asymptotically dense spherical codes .II. laminated spherical codesIEEE Transactions on Information Theory, 1997