A Discrete Time Markov Chain Model for High Throughput Bidirectional Fano Decoders

Details A Discrete Time Markov Chain Model for High Throughput Bidirectional Fano Decoders A Discrete Time Markov Chain Model for High Throughput Bidirectional Fano Decoders

2010-11-11

arxiv.org/abs/1011.2686v1

Computer Science

Information Theory

5 pages, 10 figures, accepted by GLOBECOM 2010, Miami, FL, USA

Scientific paper

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 tradeoff 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.

Affiliated with

Also associated with

No associations

Rating

A Discrete Time Markov Chain Model for High Throughput Bidirectional Fano Decoders does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Discrete Time Markov Chain Model for High Throughput Bidirectional Fano Decoders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Discrete Time Markov Chain Model for High Throughput Bidirectional Fano Decoders will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-431234