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

K. Muhammad, K. Ben 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
Number of pages1
ISBN (Print)0780308786
Publication statusPublished - 1 Jan 1993
EventProceedings of the 1993 IEEE International Symposium on Information Theory - San Antonio, TX, USA
Duration: 17 Jan 199322 Jan 1993

Publication series

NameProceedings of the 1993 IEEE International Symposium on Information Theory

Other

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

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Muhammad, K., & Letaief, K. B. (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 (Proceedings of the 1993 IEEE International Symposium on Information Theory). Publ by IEEE.