|Conference||Global Telecommunications Conference, 2010 (GLOBECOM 2010)|
|Period||1/12/10 → …|
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.
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.
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 email@example.com.
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
- Bidirectional Fano algorithm, high throughput decoding, queuing theory, sequential decoding
Global Telecommunications Conference, 2010 (GLOBECOM 2010)
|Duration||1 Dec 2010 → …|