Blind identification of code word length for non-binary error-correcting codes in noisy transmission

Yasamine Zrelli,Mélanie Marazin,Emanuel Radoi,Eric Rannou,Roland Gautier

doi:10.1186/s13638-015-0294-5

Abstract

Abstract In cognitive radio context, the parameters of coding schemes are unknown at the receiver. The design of an intelligent receiver is then essential to blindly identify these parameters from the received data. The blind identification of code word length has already been extensively studied in the case of binary error-correcting codes. Here, we are interested in non-binary codes where a noisy transmission environment is considered. To deal with the blind identification problem of code word length, we propose a technique based on the Gauss-Jordan elimination in GF(q) (Galois field), with q=2 m , where m is the number of bits per symbol. This proposed technique is based on the information provided by the arithmetic mean of the number of zeros in each column of these matrices. The robustness of our technique is studied for different code parameters and over different Galois fields.

Highlights

Error-correcting codes are frequently used in modern digital transmission systems in order to improve the communication quality
We demonstrate here that it is possible to generalize the blind identification technique proposed in [17,18] to non-binary block codes provided that the Galois field parameters are known by the receiver
We propose here an approach which is more robust because it allows us the blind identification of the code word length of nonbinary and binary block codes without using the error probability pe

Summary

Introduction

Error-correcting codes are frequently used in modern digital transmission systems in order to improve the communication quality These codes are designed to achieve a good immunity against channel impairments by introducing redundancy in the informative data. Low-density parity check (LDPC) codes and turbo codes over GF(2) have attracted considerable interest of many researchers due to their excellent error correction capability. They have been generalized to finite fields GF(q) [1,2], where q = 2m, and are among the most widely used errorcorrecting codes in wireless communication standards.

Objectives

Conclusion