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...

Full description

Saved in:
Bibliographic Details
Published in:2019 IEEE Information Theory Workshop (ITW) pp. 1 - 5
Main Authors: Pan, Jinzhe, Mow, Wai Ho
Format: Conference Proceeding
Language:English
Published: IEEE 01.08.2019
Subjects:
Conferences
Error analysis
Hamming weight
Iterative methods
Monte Carlo methods
Parity check codes
Polar codes
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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