On importance sampling simulation of stack algorithm decoders

Khaled Letaief, John S. Sadowsky

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Importance Sampling (IS) is a Monte Carlo (MC) technique that employs a "biased" distribution to improve computational efficiency. In this paper, we present two IS schemes (including some variations) for estimating the distribution of computation for stack decoders. The first general method is called the reference path method. This method biases noise inputs using the weight distribution of the associated convolutional code (CC). The second method is the partitioning method. This method uses a stationary biasing of noise inputs that alters the drift of the path metric process in an ensemble average sense.

Original languageEnglish
Title of host publicationProceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages1
ISBN (Electronic)0780300564
DOIs
Publication statusPublished - 1 Jan 1991
Event1991 IEEE International Symposium on Information Theory, ISIT 1991 - Budapest, Hungary
Duration: 24 Jun 199128 Jun 1991

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1991 IEEE International Symposium on Information Theory, ISIT 1991
CountryHungary
CityBudapest
Period24/6/9128/6/91

Fingerprint

Importance sampling
Importance Sampling
Convolutional codes
Computational efficiency
Simulation
Convolutional Codes
Path
Weight Distribution
Monte Carlo Techniques
Computational Efficiency
Biased
Partitioning
Ensemble
Metric

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Cite this

Letaief, K., & Sadowsky, J. S. (1991). On importance sampling simulation of stack algorithm decoders. In Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991 [695258] (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.1991.695258

On importance sampling simulation of stack algorithm decoders. / Letaief, Khaled; Sadowsky, John S.

Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991. Institute of Electrical and Electronics Engineers Inc., 1991. 695258 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Letaief, K & Sadowsky, JS 1991, On importance sampling simulation of stack algorithm decoders. in Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991., 695258, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., 1991 IEEE International Symposium on Information Theory, ISIT 1991, Budapest, Hungary, 24/6/91. https://doi.org/10.1109/ISIT.1991.695258
Letaief K, Sadowsky JS. On importance sampling simulation of stack algorithm decoders. In Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991. Institute of Electrical and Electronics Engineers Inc. 1991. 695258. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.1991.695258
Letaief, Khaled ; Sadowsky, John S. / On importance sampling simulation of stack algorithm decoders. Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991. Institute of Electrical and Electronics Engineers Inc., 1991. (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{85dcbad4f04641a39fc11b4cf28f6841,
title = "On importance sampling simulation of stack algorithm decoders",
abstract = "Importance Sampling (IS) is a Monte Carlo (MC) technique that employs a {"}biased{"} distribution to improve computational efficiency. In this paper, we present two IS schemes (including some variations) for estimating the distribution of computation for stack decoders. The first general method is called the reference path method. This method biases noise inputs using the weight distribution of the associated convolutional code (CC). The second method is the partitioning method. This method uses a stationary biasing of noise inputs that alters the drift of the path metric process in an ensemble average sense.",
author = "Khaled Letaief and Sadowsky, {John S.}",
year = "1991",
month = "1",
day = "1",
doi = "10.1109/ISIT.1991.695258",
language = "English",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991",

}

TY - GEN

T1 - On importance sampling simulation of stack algorithm decoders

AU - Letaief, Khaled

AU - Sadowsky, John S.

PY - 1991/1/1

Y1 - 1991/1/1

N2 - Importance Sampling (IS) is a Monte Carlo (MC) technique that employs a "biased" distribution to improve computational efficiency. In this paper, we present two IS schemes (including some variations) for estimating the distribution of computation for stack decoders. The first general method is called the reference path method. This method biases noise inputs using the weight distribution of the associated convolutional code (CC). The second method is the partitioning method. This method uses a stationary biasing of noise inputs that alters the drift of the path metric process in an ensemble average sense.

AB - Importance Sampling (IS) is a Monte Carlo (MC) technique that employs a "biased" distribution to improve computational efficiency. In this paper, we present two IS schemes (including some variations) for estimating the distribution of computation for stack decoders. The first general method is called the reference path method. This method biases noise inputs using the weight distribution of the associated convolutional code (CC). The second method is the partitioning method. This method uses a stationary biasing of noise inputs that alters the drift of the path metric process in an ensemble average sense.

UR - http://www.scopus.com/inward/record.url?scp=85067441362&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85067441362&partnerID=8YFLogxK

U2 - 10.1109/ISIT.1991.695258

DO - 10.1109/ISIT.1991.695258

M3 - Conference contribution

AN - SCOPUS:85067441362

T3 - IEEE International Symposium on Information Theory - Proceedings

BT - Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991

PB - Institute of Electrical and Electronics Engineers Inc.

ER -