A New Importance Sampling Algorithm for Fast Simulation of Linear Block Codes over BSCs

In this paper, we propose an Importance Sampling (IS) scheme for fast simulation of linear block codes over binary symmetric channels (BSCs). By re-formulating the IS problem into the one-dimensional Hamming weight space, we propose a novel IS estimator and derive the optimal IS distribution which w...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2019 IEEE Information Theory Workshop (ITW) S. 1 - 5
Hauptverfasser: Pan, Jinzhe, Mow, Wai Ho
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.08.2019
Schlagworte:
Conferences
Error analysis
Hamming weight
Iterative methods
Monte Carlo methods
Parity check codes
Polar codes
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we propose an Importance Sampling (IS) scheme for fast simulation of linear block codes over binary symmetric channels (BSCs). By re-formulating the IS problem into the one-dimensional Hamming weight space, we propose a novel IS estimator and derive the optimal IS distribution which will minimize the variance of the estimator. Consequently, a corresponding iterative algorithm is proposed. The effectiveness of the proposed IS algorithm compared to the state-of-the-art IS algorithm is demonstrated in the word error rate simulation of both LDPC and Polar codes.
DOI:10.1109/ITW44776.2019.8989120