Efficient decoding algorithm for affine reflection group codes of rank 2

Author

Niyomsataya, Terasan ; Miri, Ali ; Nevins, Monica

Author_Institution

Sch. of Inf. Technol. & Eng., Univ. of Ottawa, Ottawa, ON

fYear

2008

fDate

24-26 June 2008

Firstpage

72

Lastpage

75

Abstract

This paper presents an efficient decoding algorithm for group codes based on affine reflection groups of rank 2. The proposed decoding algorithm works exceptionally well for a large number of codewords (or even infinite constellations) which is useful for high data rate transmission. It is derived from the geometry of the groups and is equivalent to the maximum likelihood (ML) criterion. Simulations show signal constellations obtained from affine reflection group A₂ has higher symbol-error rate (SER) performance compared to QAM at the same rate.

Keywords

data communication; decoding; error statistics; maximum likelihood detection; SER; affine reflection group codes; data rate transmission; efficient decoding algorithm; maximum likelihood criterion; symbol-error rate performance; Acoustic reflection; Constellation diagram; Gaussian channels; Geometry; Information technology; Lattices; Mathematics; Maximum likelihood decoding; Modulation coding; Quadrature amplitude modulation;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 2008 24th Biennial Symposium on

Conference_Location

Kingston, ON

Print_ISBN

978-1-4244-1945-6

Electronic_ISBN

978-1-4244-1946-3

Type

conf

DOI

10.1109/BSC.2008.4563208

Filename

4563208