Manel Abdelhedi | Ecole Nationale d'Ingénieurs de Sousse (original) (raw)

Uploads

Papers by Manel Abdelhedi

Lecture Notes in Computer Science, 2015

In 1989, N.Sourlas used the parallel that exists between the information theory and the statistic... more In 1989, N.Sourlas used the parallel that exists between the information theory and the statistical physics to bring out that low density parity check (LDPC) codes correspond to spins glass models. Such a correspondence is contributing nowadays to the similarity between the statistical physics and the error correcting codes. Hence, the statistical physics methods have been applied to study the properties of these codes. Among these methods the Thouless-Anderson-Palmer (TAP) is an approach which is proved to be similar to the Belief Propagation (BP) algorithm. Unfortunately, there are no studies made for the other decoding algorithms.

2008 3rd International Symposium on Communications, Control and Signal Processing, 2008

Low-density parity-check (LDPC) codes deliver very good performance when decoded with the BP algo... more Low-density parity-check (LDPC) codes deliver very good performance when decoded with the BP algorithm. Unfortunately, this algorithm has the disadvantage to be complex for implementation. In this paper, we investigate the BP algorithm and its simplifications (BP-based, normalized BP-based, offset BP-based). Previous works on normalized and offset BP-based proposed theoretical values for the offset and normalization factors, we perform simulations

2009 Fifth International Conference on Signal Image Technology and Internet Based Systems, 2009

Low-density parity-check (LDPC) codes are based on random construction. Because of this randomnes... more Low-density parity-check (LDPC) codes are based on random construction. Because of this randomness, it is not easy to analyze them with the traditional methods of information theory. N. Sourlas was the first to point out that LDPC codes have a similarity with Ising spin systems of statistical physics. Besides, it has been shown that the Belief-Propagation algorithm, the LDPC codes

Melecon 2010 - 2010 15th IEEE Mediterranean Electrotechnical Conference, 2010

I. INTRODUCTION Low-density parity-check (LDPC) codes were first discov-ered by Gallager [2], in ... more I. INTRODUCTION Low-density parity-check (LDPC) codes were first discov-ered by Gallager [2], in his thesis, in 1962 and have recently been rediscovered by Mackay and Neal [3], [4]. In fact, when LDPC codes have been invented, their decoding was too complicated for the ...

2010 4th International Symposium on Communications, Control and Signal Processing (ISCCSP), 2010

In this paper, we present the decoding algorithms of Low-density parity-check (LDPC) codes using ... more In this paper, we present the decoding algorithms of Low-density parity-check (LDPC) codes using statistical physics arguments. Previous works, have shown that the Belief-Propagation (BP) algorithm, is equivalent to the Thouless-Anderson-Palmer (TAP) [1] approach. In this paper, we develop the log-likelihood ratios-Belief Propagation (LLR-BP) algorithm and its simplification, the λ-min algorithm using this method developed in the study of disordered

2009 Global Information Infrastructure Symposium, 2009

Abstract Low-density parity-check (LDPC) codes are based on random construction. Because of this ... more Abstract Low-density parity-check (LDPC) codes are based on random construction. Because of this randomness, it is not easy to analyze them with the traditional methods of communication theory. N.Sourlas [6] was the first to point out that LDPC codes have a similarity to Ising ...

Int'l J. of Communications, Network and System Sciences, 2010

Low-density parity-check (LDPC) codes are very efficient for communicating reliably through a noi... more Low-density parity-check (LDPC) codes are very efficient for communicating reliably through a noisy channel. N.Sourlas [1] showed that LDPC codes, which revolutionize the codes domain and used in many communications standards, can be mapped onto an Ising spin systems. Besides, it has been shown that the Belief-Propagation (BP) algorithm, the LDPC codes decoding algorithm, is equivalent to the Thouless-Anderson-Palmer (TAP) approach [2]. Unfortunately, no study has been made for the other decoding algorithms. In this paper, we develop the Log-Likelihood Ratios-Belief Propagation (LLR-BP) algorithm and its simplifications the BP-Based algorithm and the λ-min algorithm with the TAP approach. We present the performance of these decoding algorithms using statistical physics argument i.e., we present the performance as function of the magnetization.