Author:
Zrelli Yasamine,Gautier Roland,Rannou Eric,Marazin Mélanie,Radoi Emanuel
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.
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Computer Science Applications,Signal Processing
Reference31 articles.
1. MC Davey, D MacKay, Low-density parity-check codes over GF(q). IEEE Commun. Lett. 2, 165–167 (1998).
2. JA Briffa, HG Schaathun, in 5th International Symposium on Turbo Codes and Related Topics. Non-binary turbo codes and applications (IEEELausanne, 2008).
3. D Declercq, M Fossorier, Decoding algorithms for nonbinary LDPC codes over GF(q). IEEE Trans. Commun. 55(4), 633–643 (2007).
4. L Barnault, D Declercq, in Proceedings ITW. Fast decoding algorithm for LDPC over GF(2
q
) (IEEE,Paris, France, 2003), pp. 70–73.
5. A Voicila, D Declercq, F Verdier, M Fossorier, P Urard, Low-complexity decoding for non-binary LDPC codes in high order fields. IEEE Trans. Commun. 58(5), 1365–1375 (2010).
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献