Skip to content

Throughput improvement on bidirectional Fano algorithm

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish
Title of host publication6th International Wireless Communications and Mobile Computing Conference, Caen, France
Publisher or commissioning bodyInstitute of Electrical and Electronics Engineers (IEEE)
Publication dateJun 2010
Pages276 - 280
Number of pages5
ISBN (Print)9781450300629
DOIs
StatePublished

Conference

Conference6th International Wireless Communications and Mobile Computing Conference
Abbreviated titleIWCMC
CountryFrance
CityCaen
Period1/06/10 → …
Other

Abstract

Recently, we introduced a bidirectional Fano algorithm (BFA) [10] 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.

Additional information

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 with permission, from - R Xu, T Kocak, G Woodward, KA Morris; paper 'Throughput improvement on bidirectional Fano algorithm'; 6th International Conference Wireless Communications and Mobile Computing (IWCMC2010); June 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.

Research areas

  • sequential decoding, Bidirectional Fano algorithm, convolutional code, high throughput decoding

Event

6th International Wireless Communications and Mobile Computing Conference

Abbreviated TitleIWCMC
Duration1 Jun 2010 → …
CountryFrance
CityCaen

Event: Conference

Documents

Documents

DOI

View research connections

Related faculties, schools or groups