Iteratively maximum likelihood decodable spherical codes and a method for their construction

Author

Gao, Jiapeng ; Rudolph, Luther D. ; Hartmann, Carlos R P

Author_Institution

Sch. of Comput. and Inf. Sci., Syracuse Univ., NY, USA

Volume

34

Issue

3

fYear

1988

fDate

5/1/1988 12:00:00 AM

Firstpage

480

Lastpage

485

Abstract

The authors propose a class of spherical codes which can be easily decoded by an efficient iterative maximum likelihood decoding algorithm. A necessary and sufficient condition for a spherical code to be iteratively maximum likelihood decodable is formulated. A systematic construction method for such codes based on shrinking of Voronoi corners is analyzed. The base code used for construction is the binary maximal length sequence code. The second-level construction is described. Computer simulation results for selected codes constructed by the proposed method are given

Keywords

codes; decoding; encoding; iterative methods; Voronoi corners; binary maximal length sequence code; computer simulation results; iterative maximum likelihood decoding algorithm; spherical codes; systematic construction method; Additive white noise; Euclidean distance; Information science; Iterative algorithms; Iterative decoding; Iterative methods; Maximum likelihood decoding; Partitioning algorithms; Signal to noise ratio; Sufficient conditions;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.6027

Filename

6027