Ali Al Ghouwayel

Learn More
—This paper presents the architecture, performance and implementation results of a serial GF(64)-LDPC decoder based on a reduced-complexity version of the Extended Min-Sum algorithm. The main contributions of this work correspond to the variable node processing, the codeword decision and the elementary check node processing. Post-synthesis area results show(More)
1 Abstract—Non-binary LDPC codes are now recognized as a potential competitor to binary coded solutions, especially when the codeword length is small or moderate. More and more works are reported with good performance/complexity tradeoffs, which make non-binary solutions interesting for practical applications, such as 4G-wireless systems or DVB-like(More)
—Non-Binary LDPC codes offer higher performances than their binary counterpart but suffer from higher decoding complexity. A solution to reduce the decoding complexity is the use of the Extended Min-Sum algorithm. The first step of this algorithm requires the generation of the first n m largest Log-Likelihood Ratio (LLR), sorted in increasing order, of each(More)
In this letter, a new metric for fast and efficient performance evaluation of iterative decoding algorithms is proposed. It is based on the estimation of distance between probability density function (pdf) of the symbol log likelihood ratio (LLR) of optimal and suboptimal iterative decoding algorithms. We apply the notion of entropy to evaluate this(More)
  • 1