1ENSA-El-Jadida, Chouaib Doukkali University, Assistant Professor, Telecommunications and Networks Department, Angle Rue de Fès et Avenue Ahmed Chaouki (Place11Janvier) BP: 1166 El Jadida Plateau 24002, Morocco
2Associate Professor, Telecom-Bretagne, Signal and communication Department, Technopole Brest-Iroise, CS 83818–29238 Brest Cedex 3 – France
3Professor, Telecom-Bretagne, Signal and communication Department, Technopole Brest-Iroise, CS 83818–29238 Brest Cedex 3 – France
4Project leader Orange Labs, 4 rue Clos Courtel, Cesson-Sévigné 35512, France
5R&D engineer at Orange Labs, 4 rue Clos Courtel, Cesson-Sévigné 35512, France
*Email id: sanae.elhassani@telecom-bretagne.eu
Non-binary LDPC codes have interesting performances, especially for short to moderate blocklengths. The decoding schedule of these codes decoding, similarly to the binary case, has an important impact on the decoder's behaviour and should be carefully designed. This paper studies and optimizes the layered scheduling of non-binary LDPC codes following two approaches: A static approach, defining an optimized permanent scheduling for the decoder independently of its entries or state, and a dynamic approach adapting the scheduling on the fly following the decoder's convergence. These two approaches show either a reduction in the number of iterations of about 18% or a reduction in signal to noise ratio of about 0.05dB.
Non-Binary LDPC, Dynamic decoding, Scheduling
