Recently, we introduced a bidirectional Fano algorithm (BFA)  which can achieve much higher decoding throughput compared to the regular unidirectional Fano algorithm (UFA), especially at low signal-to-noise-ratio (SNR). However, the decoding throughput improvement of the conventional BFA with respect to the UFA reduces as the SNR increases and converges to 100% at high SNR. In this paper, two parameters in the BFA, which are known as the number of merged states (NMS) and the threshold increment value Δ, are exploited to improve the decoding throughout of the conventional BFA. The improved BFA can achieve much higher decoding throughput compared to the UFA and the conventional BFA, especially at high SNR. For example at Eb/N0=5dB, the throughput improvement achieved by the improved BFA is about 280% compared to the UFA and about 80% compared to the conventional BFA, and its computational complexity is only 4% of the Viterbi algorithm.
|Translated title of the contribution||Throughput improvement on bidirectional Fano algorithm|
|Title of host publication||6th International Wireless Communications and Mobile Computing Conference, Caen, France|
|Publisher||Institute of Electrical and Electronics Engineers (IEEE)|
|Pages||276 - 280|
|Number of pages||5|
|Publication status||Published - Jun 2010|
|Event||6th International Wireless Communications and Mobile Computing Conference - Caen, France|
Duration: 1 Jun 2010 → …
|Conference||6th International Wireless Communications and Mobile Computing Conference|
|Period||1/06/10 → …|
Bibliographical noteRose 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 firstname.lastname@example.org.
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
- sequential decoding
- Bidirectional Fano algorithm
- convolutional code
- high throughput decoding