Advanced search
Start date
Betweenand


Spherical Codes on Torus Layers

Full text
Author(s):
Torezzan, Cristiano ; Costa, Sueli I. R. ; Vaishampayan, Vinay A. ; IEEE
Total Authors: 4
Document type: Journal article
Source: 2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4; v. N/A, p. 2-pg., 2009-01-01.
Abstract

A new class of spherical codes is constructed by selecting a finite subset of flat tori that foliate the unit sphere S2L-1 subset of R-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 R-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. (AU)

FAPESP's process: 02/07473-7 - Geometrically uniform codes in homogeneous spaces
Grantee:Sueli Irene Rodrigues Costa
Support Opportunities: Research Projects - Thematic Grants