Sueli I. R. Costa

Curves on a sphere, shift-map dynamics, and error control for continuous alphabet sources

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/spl dot/=As, with A a square skew-symmetric matrix. The second code is generated by the shift map s/sub n/=b/sub n/s/sub n-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 /spl Zopf//sup N/ 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.

Graphs, tessellations, and perfect codes on flat tori

Quadrature amplitude modulation (QAM)-like signal sets are considered in this paper as coset constellations placed on regular graphs on surfaces known as flat tori. Such signal sets can be related to spherical, block, and trellis codes and may be viewed as geometrically uniform (GU) in the graph metric in a sense that extends the concept introduced by Forney . Homogeneous signal sets of any order can then be labeled by a cyclic group, induced by translations on the Euclidean plane. We construct classes of perfect codes on square graphs including Lee spaces, and on hexagonal and triangular graphs, all on flat tori. Extension of this approach to higher dimensions is also considered.

Fisher information distance

This paper presents a geometrical approach to the Fisher distance, which is a measure of dissimilarity between two probability distribution functions. The Fisher distance, as well as other divergence measures, is also used in many applications to establish a proper data average. The main purpose is to widen the range of possible interpretations and relations of the Fisher distance and its associated geometry for the prospective applications. It focuses on statistical models of the normal probability distribution functions and takes advantage of the connection with the classical hyperbolic geometry to derive closed forms for the Fisher distance in several cases. Connections with the well-known Kullback-Leibler divergence measure are also devised.

Signal constellations in the hyperbolic plane: A proposal for new communication systems

Signal constellations in the hyperbolic plane are provided as an alternative to traditional signal constellations in the Euclidean plane, since channels may actually exist for which the latter signal constellations are not as suitable as the former. A hyperbolic gaussian probability density function, based solely on geometrical considerations, is derived to determine the performance of the hyperbolic signal constellations. Benefits result from an approach conceived in terms of reduced signal-to-noise ratio, needed to achieve a prescribed error rate and equivalent optimum receiver complexity.

Spherical codes on torus layers

A new class of spherical codes is constructed by selecting a finite subset of flat tori that foliate the unit sphere S2L−1 ⊂ ℝ2L and constructing a structured codebook on each torus in the finite subset. The codebook on each torus is the image of a lattice restricted to a specific hyperbox in ℝL. Group structure and homogeneity, useful for efficient decoding, are inherited from the underlying lattice codebook. Upper and lower bounds on performance are derived and a systematic search algorithm is presented for constructing optimal codebooks. The torus layer spherical codes presented here exhibit good performance when compared to the well known apple-peeling, wrapped and laminated codes.

Flat tori, lattices and bounds for commutative group codes

We show that commutative group spherical codes in Rn, as introduced by D. Slepian, are directly related to flat tori and quotients of lattices. As consequence of this view, we derive new results on the geometry of these codes and an upper bound for their cardinality in terms of minimum distance and the maximum center density of lattices and general spherical packings in the half dimension of the code. This bound is tight in the sense it can be arbitrarily approached in any dimension. Examples of this approach and a comparison of this bound with Union and Rankin bounds for general spherical codes is also presented.

Optimum commutative group codes

A method for finding an optimum

Perfect codes in the l p metric

n