New importance sampling methods for simulating sequential decoders

DOI10.1109/18.259665zbMATH Open0802.94025OpenAlexW2073725178MaRDI QIDQ4307394FDOQ4307394

Authors: Khaled Ben Letaief, John S. Sadowsky 

Publication date: 3 October 1994

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.259665

Recommendations

• Importance Sampling for Tanner Trees
• Importance sampling via a simulacrum
• Sequential decoding of convolutional codes in channels with intersymbol interference
• Importance sampling for the random phase Gaussian channel
• Construction of fast recovery codes using a new optimal importance sampling method

zbMATH Keywords

convolutional codessequential decodingstack algorithm decoders

Mathematics Subject Classification ID

Convolutional codes (94B10) Decoding (94B35)

Cited In (6)

• Joint estimation and decoding of space-time trellis codes
• Sequential importance sampling of binary sequences
• On Monte Carlo estimation of large deviations probabilities
• Importance Sampling for Tanner Trees
• Construction of fast recovery codes using a new optimal importance sampling method
• Importance Sampling for Generalized Likelihood Ratio Procedures in Sequential Analysis

This page was built for publication: New importance sampling methods for simulating sequential decoders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4307394)