Blind Identification of Convolutional Encoder Parameters over GF(2m) in the Noiseless Case

• DOI: 10.1109/icccn.2011.6005780
• Publication Date: 2011-09-12T19:33:30Z
• Authors: Yasamine Zrelli; Melanie Marazin; Eric Rannou; Roland Gautier
• Keywords: Blind identification; [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing; [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT]; Galois Field GF(2m); 0202 electrical engineering, electronic engineering, information engineering; non-binary convolutional codes; [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]; 02 engineering and technology; Galois Field GF(2m).; [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing

In most digital communication systems, error correcting codes are essential to achieve good immunity to channel impairment. Due to the complexity of the encoding process, but especially of the decoding process, most research on error correcting codes is restricted to binary data which are elements of the Galois field GF(2). Reed Solomon codes have been the most commonly used so far as non-binary (GF(q)) error correcting codes. Recently, low complexity decoding algorithms for non-binary LDPC and non-binary turbo-codes have been developed. In this paper, the design of convolutional codes over the non-binary Galois field, with cardinal 2^m (GF(2^m)), is presented in order to blind identify their parameters. An extension of our blind identification method dedicated to convolutional codes over GF(2) is developed for convolutional encoders over GF(2^m). Finally, the impact of Galois field parameters on the blind estimation of convolutional encoder parameters over GF(2^m) is investigated.