On the computation problem of the stack and Fano decoders for specific time-invariant convolutional codes

K. Muhammad, Khaled Letaief

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

Abstract

The authors investigate the performance of the Fano and stack decoders using exact analysis methods based on importance sampling. In contrast to classical analysis, the simulation-based analysis presented in this paper uses no random-coding arguments and is applicable to specific time-invariant convolutional codes. Hence, it serves as a useful complement to the ensemble average analysis as one can study the characteristics of sequential decoders for any given code and operating condition.

Original languageEnglish
Title of host publicationProceedings of the 1993 IEEE International Symposium on Information Theory
PublisherPubl by IEEE
Pages274
Number of pages1
ISBN (Print)0780308786
Publication statusPublished - 1993
Externally publishedYes
EventProceedings of the 1993 IEEE International Symposium on Information Theory - San Antonio, TX, USA
Duration: 17 Jan 199322 Jan 1993

Other

OtherProceedings of the 1993 IEEE International Symposium on Information Theory
CitySan Antonio, TX, USA
Period17/1/9322/1/93

Fingerprint

Importance sampling
Convolutional codes

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Muhammad, K., & Letaief, K. (1993). On the computation problem of the stack and Fano decoders for specific time-invariant convolutional codes. In Proceedings of the 1993 IEEE International Symposium on Information Theory (pp. 274). Publ by IEEE.

On the computation problem of the stack and Fano decoders for specific time-invariant convolutional codes. / Muhammad, K.; Letaief, Khaled.

Proceedings of the 1993 IEEE International Symposium on Information Theory. Publ by IEEE, 1993. p. 274.

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

Muhammad, K & Letaief, K 1993, On the computation problem of the stack and Fano decoders for specific time-invariant convolutional codes. in Proceedings of the 1993 IEEE International Symposium on Information Theory. Publ by IEEE, pp. 274, Proceedings of the 1993 IEEE International Symposium on Information Theory, San Antonio, TX, USA, 17/1/93.
Muhammad K, Letaief K. On the computation problem of the stack and Fano decoders for specific time-invariant convolutional codes. In Proceedings of the 1993 IEEE International Symposium on Information Theory. Publ by IEEE. 1993. p. 274
Muhammad, K. ; Letaief, Khaled. / On the computation problem of the stack and Fano decoders for specific time-invariant convolutional codes. Proceedings of the 1993 IEEE International Symposium on Information Theory. Publ by IEEE, 1993. pp. 274
@inproceedings{6f068dd6f2a148b5aa80f03e40caabb8,
title = "On the computation problem of the stack and Fano decoders for specific time-invariant convolutional codes",
abstract = "The authors investigate the performance of the Fano and stack decoders using exact analysis methods based on importance sampling. In contrast to classical analysis, the simulation-based analysis presented in this paper uses no random-coding arguments and is applicable to specific time-invariant convolutional codes. Hence, it serves as a useful complement to the ensemble average analysis as one can study the characteristics of sequential decoders for any given code and operating condition.",
author = "K. Muhammad and Khaled Letaief",
year = "1993",
language = "English",
isbn = "0780308786",
pages = "274",
booktitle = "Proceedings of the 1993 IEEE International Symposium on Information Theory",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - On the computation problem of the stack and Fano decoders for specific time-invariant convolutional codes

AU - Muhammad, K.

AU - Letaief, Khaled

PY - 1993

Y1 - 1993

N2 - The authors investigate the performance of the Fano and stack decoders using exact analysis methods based on importance sampling. In contrast to classical analysis, the simulation-based analysis presented in this paper uses no random-coding arguments and is applicable to specific time-invariant convolutional codes. Hence, it serves as a useful complement to the ensemble average analysis as one can study the characteristics of sequential decoders for any given code and operating condition.

AB - The authors investigate the performance of the Fano and stack decoders using exact analysis methods based on importance sampling. In contrast to classical analysis, the simulation-based analysis presented in this paper uses no random-coding arguments and is applicable to specific time-invariant convolutional codes. Hence, it serves as a useful complement to the ensemble average analysis as one can study the characteristics of sequential decoders for any given code and operating condition.

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

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

M3 - Conference contribution

SN - 0780308786

SP - 274

BT - Proceedings of the 1993 IEEE International Symposium on Information Theory

PB - Publ by IEEE

ER -