Spherical codes on torus layers
- 1 June 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 2033-2037
Abstract
A new class of spherical codes is constructed by selecting a finite subset of flat tori that foliate the unit sphere S2L-1 sub R2L 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 RL. 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.Keywords
This publication has 6 references indexed in Scilit:
- Flat tori, lattices and bounds for commutative group codesDesigns, Codes and Cryptography, 2008
- Graphs, Tessellations, and Perfect Codes on Flat ToriIEEE Transactions on Information Theory, 2004
- Curves on a sphere, shift-map dynamics, and error control for continuous alphabet sourcesIEEE Transactions on Information Theory, 2003
- Asymptotically dense spherical codes .II. laminated spherical codesIEEE Transactions on Information Theory, 1997
- Using simulated annealing to design good codesIEEE Transactions on Information Theory, 1987
- Group codes for the Gaussian channel (Abstr.)IEEE Transactions on Information Theory, 1968