Flat tori, lattices and bounds for commutative group codes
Designs, Codes and Cryptography
Hybrid digital-analog coding with bandwidth compression for Gaussian source-channel pairs
IEEE Transactions on Communications
Distributed quantization over noisy channels
IEEE Transactions on Communications
Spherical codes on torus layers
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Analog turbo codes: a chaotic construction
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Analog distributed source-channel coding using sinusoids
ISWCS'09 Proceedings of the 6th international conference on Symposium on Wireless Communication Systems
Nonlinear coding and estimation for correlated data in wireless sensor networks
IEEE Transactions on Communications
Polynomial based analog source-channel codes
IEEE Transactions on Communications
Asymptotically optimal joint source-channel coding with minimal delay
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Hi-index | 754.84 |
We consider two codes based on dynamical systems, for transmitting information from a continuous alphabet, discrete-time source over a Gaussian channel. The first code, a homogeneous spherical code, is generated by the linear dynamical system s˙=As, with A a square skew-symmetric matrix. The second code is generated by the shift map sn=bnsn-1(mod 1). The performance of each of these codes is determined by the geometry of its locus or signal set, specifically, its arc length and minimum distance, suitably defined. We show that the performance analyses for these systems are closely related, and derive exact expressions and bounds for relevant geometric parameters. We also observe that the lattice ZN underlies both modulation systems and we develop a fast decoding algorithm that relies on this observation. Analytic results show that for fixed bandwidth expansion, good scaling behavior of the mean squared error is obtained relative to the channel signal-to-noise ratio (SNR). Particularly interesting is the resulting observation that sampled, exponentially chirped modulation codes are good bandwidth expansion codes.