Fast Simulation for the Performance Evaluation of LDPC Codes using Fast Flat Histogram Method

Autor: David Declercq, Vincent Heinrich, S. Kakakhail, Sylvain Reynal
Přispěvatelé: Equipes Traitement de l'Information et Systèmes (ETIS - UMR 8051), Ecole Nationale Supérieure de l'Electronique et de ses Applications (ENSEA)-Centre National de la Recherche Scientifique (CNRS)-CY Cergy Paris Université (CY), STMicroelectronics [Crolles] (ST-CROLLES), Declercq, David
Rok vydání: 2008
Předmět:
Theoretical computer science
Monte Carlo method
Markov process
Data_CODINGANDINFORMATIONTHEORY
02 engineering and technology
01 natural sciences
[MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT]
symbols.namesake
Signal-to-noise ratio
Histogram
0103 physical sciences
0202 electrical engineering
electronic engineering
information engineering

Low-density parity-check code
010306 general physics
Monte Carlo
ComputingMilieux_MISCELLANEOUS
Computer Science::Information Theory
Block (data storage)
Mathematics
LDPC codes
[MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]
020206 networking & telecommunications
Markov chain Monte Carlo
[INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT]
Wang Landau algorithm
symbols
[INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT]
Algorithm
Importance sampling
Zdroj: Proceedings of the 2008 IEEE Sarnoff Symposium
IEEE Sarnoff Symposium
IEEE Sarnoff Symposium, 2008, Princeton, United States. pp.1-5, ⟨10.1109/SARNOF.2008.4520050⟩
in the proceedings
IEEE Sarnoff symposium
IEEE Sarnoff symposium, Apr 2008, Princeton, United States
DOI: 10.1109/sarnof.2008.4520050
Popis: International audience; The quality of transmission in digital communication systems is usually measured by Frame Error Rate (FER). The time taken by standard Monte Carlo (MC) simulation to estimate the FER increases exponentially with the increase in Signal-to-Noise Ratio (SNR). In this correspondence, we present an Adaptive Importance Sampling (AIS) technique inspired by statistical physics called Fast Flat Histogram (FFH) method to evaluate the performance of LDPC codes with a reduced simulation time. The FFH method employs Wang Landau algorithm based on a Markov Chain Monte Carlo (MCMC) sampler and we managed to decrease the simulation time by a factor of 13 to 173 for LDPC codes with block lengths up to 2640 bits.
Databáze: OpenAIRE