Nonlinear Turbo Codes Based On Quasigroup String Processing

Spasov, Dejan

Nonlinear Turbo Codes Based On Quasigroup String Processing

Date Issued

2012

Author(s)

Abstract

Use of quasigroup transformations to build error-correcting codes was first proposed by GligorosNi, MarNovsNi, and Kocarev [1]. However, their decoding algorithm was based on the exponential-time minimum-distance decoding algorithm, in which the brute-force search for the error pattern is confined in blocNs of 16 bits and upper-bounded to two or three errors per blocN. We point out that any quasigroupbased error-correcting code, designed so far, can be modeled as finite state machine, thus it can be decoded in polynomial time with the well-Nnown Viterbi algorithm or the MAP decoding algorithm. In order to improve the error-correcting capability of quasigroup codes, in this paper we build an error-correcting system based on the Turbo-code design principles. We present the error-correcting capabilities of our Turbo-code system over the Gaussian channel.

File(s)

Name

9CiiT-45.pdf

Size

524.37 KB

Format

Adobe PDF

Checksum

(MD5):c8adf136c7d01b4dfc60e16526093250