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

详细信息    查看全文

• 作者：Yasamine Zrelli (1) (2)
  Roland Gautier (1) (2)
  Eric Rannou (1) (3)
  M茅lanie Marazin (1) (2)
  Emanuel Radoi (1) (2)
  
  1. Universit茅 Europ茅enne de Bretagne ; 5 Boulevard La毛nnec ; Rennes ; 35000 ; France
  2. Universit茅 de Brest ; CNRS ; UMR 6285 Lab-STICC ; 6 avenue Victor Le Gorgeu ; Brest ; 29238 ; France
  3. Universit茅 de Brest ; CNRS UMR 6205 ; Laboratoire de Math茅matiques Bretagne Atlantique ; 6 avenue Victor Le Gorgeu ; Brest ; 29238 ; France
  
• 关键词：Cognitive radio ; Blind identification ; Non ; binary error ; correcting codes ; Galois field
• 刊名：EURASIP Journal on Wireless Communications and Networking
• 出版年：2015
• 出版时间：December 2015
• 年：2015
• 卷：2015
• 期：1
• 全文大小：915 KB
• 参考文献：1. Davey, MC, MacKay, D (1998) Low-density parity-check codes over GF(q). IEEE Commun. Lett. 2: pp. 165-167 CrossRef
  2. Briffa, JA, Schaathun, HG (2008) Non-binary turbo codes and applications. 5th International Symposium on Turbo Codes and Related Topics. IEEE, Lausanne
  3. Declercq, D, Fossorier, M (2007) Decoding algorithms for nonbinary LDPC codes over GF(q). IEEE Trans. Commun. 55: pp. 633-643 CrossRef
  4. Barnault, L, Declercq, D (2003) Fast decoding algorithm for LDPC over GF(2 q ). Proceedings ITW. IEEE,, Paris, France, pp. 70-73
  5. Voicila, A, Declercq, D, Verdier, F, Fossorier, M, Urard, P (2010) Low-complexity decoding for non-binary LDPC codes in high order fields. IEEE Trans. Commun. 58: pp. 1365-1375 CrossRef
  6. Yu, Yang, Chen, W (2012) Design of low complexity non-binary LDPC codes with an approximated performance-complexity tradeoff. IEEE Commun. Lett. 16: pp. 514-517 CrossRef
  7. Xia, T, Wu, HC (2013) Identification of nonbinary LDPC codes using average LLR of syndrome a posteriori probability. IEEE Commun. Lett. 17: pp. 1301-1304 CrossRef
  8. Stern, J (1989) A method for finding code words of small weight. Coding Theory Appl. 388: pp. 106-113 CrossRef
  9. Canteaut, A, Chabaud, F (1998) A new algorithm for finding minimum-weight words in a linear code: application to McElieces cryptosystem and to narrow-sense BCH codes of length 511. IEEE Trans. Inf. Theory 44: pp. 367-378 CrossRef
  10. Valembois, A (2001) Detection and recognition of a binary linear code. Discrete Appl. Math. 111: pp. 199-218 CrossRef
  11. Cluzeau, M (2006) Block code reconstruction using iterative decoding techniques. 2006 IEEE International Symposium on Information Theory. IEEE,, Seattle, WA, pp. 2269-2273 CrossRef
  12. Cluzeau, M, Finiasz, M (2009) Recovering a code鈥檚 length and synchronization from a noisy intercepted bitstream. IEEE International Symposium on Information Theory 2009. IEEE,, Seoul, pp. 2737-2741 CrossRef
  13. C么te, M, Sendrier, N (2009) Reconstruction of convolutional codes from noisy observation. IEEE International Symposium on Information Theory (ISIT). IEEE,, Seoul, pp. 546-550
  14. Burel, G, Gautier, R (2003) Blind estimation of encoder and interleaver characteristics in a non cooperative context. IASTED International Conference on Communications, Internet and Information Technology. ACTA Press,, Scottsdale, AZ, USA
  15. Zrelli, Y, Gautier, R, Marazin, M, Rannou, E, Radoi, E (2012) Focus on theoretical properties of blind convolutional codes identification methods based on rank criterion. MTA Review XXII: pp. 213-234
  16. Zrelli, Y, Marazin, M, Gautier, R, Rannou, E (2011) Blind identification of convolutional encoder parameters over GF(2 m ) in the noiseless case. Proceedings of the International Conference on Computer Communication Networks. IEEE,, Maui, Hawaii
  17. Sicot, G, Houcke, S (2005) Blind detection of interleaver parameters. IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), vol. 3. IEEE,, Philadelphia, Pennsylvania, pp. 829-832
  18. Sicot, G, Houcke, S, Barbier, J (2009) Blind detection of interleaver parameters. Signal Process. 89: pp. 450-462 CrossRef
  19. Marazin, M, Gautier, R, Burel, G (2011) Blind recovery of k/n rate convolutional encoders in a noisy environment. EURASIP J. Wireless Commun. Netw. 2011: pp. 1-9
  20. Jing, Z, Zhiping, H, Chunwu, L, Shaojing, S, Yimeng, Z (2013) Information-dispersion-entropy-based blind recognition of binary BCH codes in soft decision situations. Entropy 15: pp. 1705-1725 CrossRef
  21. Hocquenghem, A (1959) Codes correcteurs d鈥檈rreurs. Chiffres 2: pp. 147-156
  22. Bose, RC, Ray-Chaudhuri, DK (1960) On a class of error correcting binary group codes. Inf. Control 3: pp. 68-79 CrossRef
  23. Reed, I, Solomon, G (1960) Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8: pp. 300-304 CrossRef
  24. Baldi, M, Bianchi, M, Chiaraluce, F, Garello, R, Maturo, N, Sanchez, IA, Cioni, S (2013) Advanced coding schemes against jamming in telecommand links. 2013 IEEE Military Communications Conference. IEEE,, San Diego, CA, pp. 1220-1226
  25. Junbin, C, Lin, W, Yong, L (2005) Performance comparison between non-binary LDPC codes and Reed-Solomon codes over noise bursts channels. International Conference on Communications, Circuits and Systems. IEEE,, Hong Kong, China, pp. 1-4
  26. Zhou, B, Zhang, L, Kang, J, Huang, Q, Tai, YY, Lin, S, Xu, M (2008) Non-binary LDPC codes vs. Reed-Solomon codes. Information Theory and Applications Workshop. IEEE,, San Diego, CA, pp. 175-184
  27. version 8.8.0 Release 8 GT, LTE; Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and Channel Coding. The 3rd Generation Partnership Project 2, Technical Specification Group Radio Access Network (2010). http://www.3gpp.org . (2013).
  28. Marazin, M, Gautier, R, Burel, G (2009) Dual code method for blind identification of convolutional encoder for cognitive radio receiver design. IEEE GLOBECOM Workshops. IEEE,, Honolulu, HI
  29. Moro, EM (2012) Algebraic geometry modeling in information theory. World Scientific, Singapore
  30. Anderson, E, Bai, Z, Bischof, C, Blackford, S, Demmel, J, Dongarra, J, Croz, JD, Greenbaum, A, Hammarling, S, McKenney, A, Sorensen, D (1999) LAPACK user鈥檚 guide. SIAM, Philadelphia CrossRef
  31. Zrelli, Y (2013) Identification aveugle de codes correcteurs d鈥檈rreurs bas茅s sur des grands corps de Galois et recherche d鈥檃lgorithmes de type d茅cision souple pour les codes convolutifs. PhD thesis, Universit茅 de Brest, France
  
• 刊物主题：Signal, Image and Speech Processing;
• 出版者：Springer International Publishing
• ISSN：1687-1499

文摘

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.