Title :
A new decoding algorithm for spherical codes generated by binary partitions of symmetric pointsets
Author :
Karlof, John K. ; Liu, Guodong
Author_Institution :
Math. Dept., North Carolina Univ., Wilmington, NC, USA
Abstract :
Ericson and Zinoviev (1995) presented a clever, new construction for spherical codes for the Gaussian channel using ideas of code concatenation and set partitioning. This family of new spherical codes is generated from sets of binary codes using equally spaced symmetric pointsets on the real line. The family contains some of the best known spherical codes in terms of minimum distance. In this paper, we present a new decoding algorithm for this family of spherical codes which is more efficient than maximum likelihood decoding. At low signal to noise ratios, it is 99% equivalent to maximum likelihood but takes just 2% of the computational time
Keywords :
Gaussian channels; binary codes; channel coding; decoding; Gaussian channel; binary codes; binary partitions; code concatenation; computational time; decoding algorithm; equally spaced symmetric pointsets; minimum distance; set partitioning; signal to noise ratio; spherical codes; symmetric pointsets; Binary codes; Binary sequences; Gaussian channels; Hamming distance; Information systems; Intelligent systems; Mathematics; Maximum likelihood decoding; Partitioning algorithms; Signal to noise ratio;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866347
