Mouhcine Razi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mouhcine Razi has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Ali Ahaitouf
Sidi Mohamed Ben Abdellah University
4 shared publications - Mhammed Benhayoun
University Sidi Mohammed Ben Abdellah, Faculty of Sciences and Technology, Laboratory of Intelligent Systems, Georesources and Renewable Energies, P.O. Box 2202, Fez, Morocco
3 shared publications - Anas Mansouri
National School of Applied Sciences, Laboratory of Intelligent Systems, Georesources and Renewable Energies, University Sidi Mohammed Ben Abdellah, Fez, Morocco
2 shared publications - Abdessalam Ait Madi
USMBA
1 shared publication Anas Mansouri
University Sidi Mohammed Ben Abdellah, National School of Applied Sciences, Laboratory of Intelligent Systems, Georesources and Renewable Energies, Fez, Morocco
1 shared publication- Anass Mansouri
Laboratory of Science and Engineering Research, Electric Department, School of Applied Sciences, Sidi Mohamed Ben Abdellah University, Fez 30000, Morocco
1 shared publication
Latest Publications
- Open Access
- 21 October 2023
- Published by Wiley in Applied Computational Intelligence and Soft Computing
- Vol. 2023 (1) , 1-12
Embedded Parallel Implementation of LDPC Decoder for Ultra-Reliable Low-Latency Communications
Ultra-reliable low-latency communications, URLLC, are designed for applications such as self-driving cars and telesurgery requiring a response in milliseconds and are very sensitive to transmission errors. To match the computational complexity of LDPC decoding algorithms to URLLC applications on IoT devices having very limited computational resources, this paper presents a new parallel and low-latency software implementation of the LDPC decoder. First, a decoding algorithm optimization and a compact data structure are proposed. Next, a parallel software implementation is performed on ARM multicore platforms in order to evaluate the latency of the proposed optimization. The synthesis results highlight a reduction in the memory size requirement by 50 and a three-time speedup in terms of processing time when compared to previous software decoder implementations. The reached decoding latency on the parallel processing platform is 150μs for 288bits with a bit error ratio of 3.410–9.
- 21 October 2023
- Published by Wiley in Applied Computational Intelligence and Soft Computing
- Vol. 2023 (1) , 1-12
Open AccessEmbedded Parallel Implementation of LDPC Decoder for Ultra-Reliable Low-Latency Communications
Ultra-reliable low-latency communications, URLLC, are designed for applications such as self-driving cars and telesurgery requiring a response in milliseconds and are very sensitive to transmission errors. To match the computational complexity of LDPC decoding algorithms to URLLC applications on IoT devices having very limited computational resources, this paper presents a new parallel and low-latency software implementation of the LDPC decoder. First, a decoding algorithm optimization and a compact data structure are proposed. Next, a parallel software implementation is performed on ARM multicore platforms in order to evaluate the latency of the proposed optimization. The synthesis results highlight a reduction in the memory size requirement by 50 and a three-time speedup in terms of processing time when compared to previous software decoder implementations. The reached decoding latency on the parallel processing platform is 150μs for 288bits with a bit error ratio of 3.410–9.
- Open Access
- 19 January 2022
- Published by Wiley in Modelling and Simulation in Engineering
- Vol. 2022, 1-12
Low-Complexity LDPC Decoding Algorithm Based on Layered Vicinal Variable Node Scheduling
The informed dynamic scheduling (IDS) strategies for the low-density parity check (LDPC) decoding have shown superior performance in error correction and convergence speed, particularly those based on reliability measures and residual belief propagation (RBP). However, the search for the most unreliable variable nodes and the residual precomputation required for each iteration of the IDS-LDPC increases the complexity of the decoding process which becomes more sequential, making it hard to exploit the parallelism of signal processing algorithms available in multicore platforms. To overcome this problem, a new, low-complexity scheduling system, called layered vicinal variable nodes scheduling (LWNS) is presented in this paper. With this LWNS, each variable node is updated by exchanging intrinsic information with all its associated control and variable nodes before moving to the next variable node updating. The proposed scheduling strategy is fixed by a preprocessing step of the parity control matrix instead of calculation of the residuals values and by computation of the most influential variable node instead the most unreliable metric. It also allows the parallel processing of independent Tanner graph subbranches identified and grouped in layers. Our simulation results show that the LWNS BP have an attractive convergence rate and better error correction performance with low complexity when compared to previous IDS decoders under the white Gaussian noise channel (AWGN).
- 19 January 2022
- Published by Wiley in Modelling and Simulation in Engineering
- Vol. 2022, 1-12
Open AccessLow-Complexity LDPC Decoding Algorithm Based on Layered Vicinal Variable Node Scheduling
The informed dynamic scheduling (IDS) strategies for the low-density parity check (LDPC) decoding have shown superior performance in error correction and convergence speed, particularly those based on reliability measures and residual belief propagation (RBP). However, the search for the most unreliable variable nodes and the residual precomputation required for each iteration of the IDS-LDPC increases the complexity of the decoding process which becomes more sequential, making it hard to exploit the parallelism of signal processing algorithms available in multicore platforms. To overcome this problem, a new, low-complexity scheduling system, called layered vicinal variable nodes scheduling (LWNS) is presented in this paper. With this LWNS, each variable node is updated by exchanging intrinsic information with all its associated control and variable nodes before moving to the next variable node updating. The proposed scheduling strategy is fixed by a preprocessing step of the parity control matrix instead of calculation of the residuals values and by computation of the most influential variable node instead the most unreliable metric. It also allows the parallel processing of independent Tanner graph subbranches identified and grouped in layers. Our simulation results show that the LWNS BP have an attractive convergence rate and better error correction performance with low complexity when compared to previous IDS decoders under the white Gaussian noise channel (AWGN).
- Open Access
- 1 December 2021
- Published by Institute of Advanced Engineering and Science in International Journal of Electrical and Computer Engineering (IJECE)
- Vol. 11 (6) , 4774-4784
An improvement and a fast DSP implementation of the bit flipping algorithms for low density parity check decoder
For low density parity check (LDPC) decoding, hard-decision algorithms are sometimes more suitable than the soft-decision ones. Particularly in the high throughput and high speed applications. However, there exists a considerable gap in performances between these two classes of algorithms in favor of soft-decision algorithms. In order to reduce this gap, in this work we introduce two new improved versions of the hard-decision algorithms, the adaptative gradient descent bit-flipping (AGDBF) and adaptative reliability ratio weighted GDBF (ARRWGDBF). An adaptative weighting and correction factor is introduced in each case to improve the performances of the two algorithms allowing an important gain of bit error rate. As a second contribution of this work a real time implementation of the proposed solutions on a digital signal processors (DSP) is performed in order to optimize and improve the performance of these new approchs. The results of numerical simulations and DSP implementation reveal a faster convergence with a low processing time and a reduction in consumed memory resources when compared to soft-decision algorithms. For the irregular LDPC code, our approachs achieves gains of 0.25 and 0.15 dB respectively for the AGDBF and ARRWGDBF algorithms.
- 1 December 2021
- Published by Institute of Advanced Engineering and Science in International Journal of Electrical and Computer Engineering (IJECE)
- Vol. 11 (6) , 4774-4784
Open AccessAn improvement and a fast DSP implementation of the bit flipping algorithms for low density parity check decoder
For low density parity check (LDPC) decoding, hard-decision algorithms are sometimes more suitable than the soft-decision ones. Particularly in the high throughput and high speed applications. However, there exists a considerable gap in performances between these two classes of algorithms in favor of soft-decision algorithms. In order to reduce this gap, in this work we introduce two new improved versions of the hard-decision algorithms, the adaptative gradient descent bit-flipping (AGDBF) and adaptative reliability ratio weighted GDBF (ARRWGDBF). An adaptative weighting and correction factor is introduced in each case to improve the performances of the two algorithms allowing an important gain of bit error rate. As a second contribution of this work a real time implementation of the proposed solutions on a digital signal processors (DSP) is performed in order to optimize and improve the performance of these new approchs. The results of numerical simulations and DSP implementation reveal a faster convergence with a low processing time and a reduction in consumed memory resources when compared to soft-decision algorithms. For the irregular LDPC code, our approachs achieves gains of 0.25 and 0.15 dB respectively for the AGDBF and ARRWGDBF algorithms.
- 2 August 2018
- Published by Springer Nature
- p. 22-29
Horizontal-Shuffled Scheduling for the Low Density Parity Check Codes Decoding for WiMAX Application
- 2 August 2018
- Published by Springer Nature
- p. 22-29
Horizontal-Shuffled Scheduling for the Low Density Parity Check Codes Decoding for WiMAX Application