A discrete time Markov chain model for high throughput bidirectional Fano decoders

R Xu, G Woodward, KA Morris, T Koçak

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

3 Citations (Scopus)
491 Downloads (Pure)

Abstract

The bidirectional Fano algorithm (BFA) can achieve at least two times decoding throughput compared to the conventional unidirectional Fano algorithm (UFA). In this paper, bidirectional Fano decoding is examined from the queuing theory perspective. A Discrete Time Markov Chain (DTMC) is employed to model the BFA decoder with a finite input buffer. The relationship between the input data rate, the input buffer size and the clock speed of the BFA decoder is established. The DTMC based modelling can be used in designing a high throughput parallel BFA decoding system. It is shown that there is a trade-off between the number of BFA decoders and the input buffer size, and an optimal input buffer size can be chosen to minimize the hardware complexity for a target decoding throughput in designing a high throughput parallel BFA decoding system.
Translated title of the contributionA discrete time Markov chain model for high throughput bidirectional fano decoders
Original languageEnglish
Title of host publicationGlobecom, Miami
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages1 - 5
Number of pages5
ISBN (Print)9781424456369, 9781424456369, 9781424456376 (eISBN)
DOIs
Publication statusPublished - Dec 2010
EventGlobal Telecommunications Conference, 2010 (GLOBECOM 2010) - Miami, Florida, United States
Duration: 1 Dec 2010 → …

Publication series

Name
ISSN (Print)1930529X

Conference

ConferenceGlobal Telecommunications Conference, 2010 (GLOBECOM 2010)
CountryUnited States
CityMiami, Florida
Period1/12/10 → …

Bibliographical note

Rose publication type: Conference contribution

Additional information: With accompanying conference presentation

Sponsorship: The authors would like to thank the Telecommunications Research Laboratory (TRL) of Toshiba Research Europe Ltd. and its directors for supporting this work.

Terms of use: Copyright © 2010 IEEE. Reprinted from IEEE Global Telecommunications Conference 2010
(GLOBECOM 2010).

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org.

By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Keywords

  • Bidirectional Fano algorithm
  • high throughput decoding
  • queuing theory
  • sequential decoding

Fingerprint Dive into the research topics of 'A discrete time Markov chain model for high throughput bidirectional Fano decoders'. Together they form a unique fingerprint.

Cite this