Throughput improvement on bidirectional Fano algorithm

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

doi:10.1145/1815396.1815460

Throughput improvement on bidirectional Fano algorithm

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

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

1 Citation (Scopus)

549 Downloads (Pure)

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.

Translated title of the contribution	Throughput improvement on bidirectional Fano algorithm
Original language	English
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
ISBN (Print)	9781450300629
DOIs	https://doi.org/10.1145/1815396.1815460
Publication status	Published - Jun 2010
Event	6th International Wireless Communications and Mobile Computing Conference - Caen, France Duration: 1 Jun 2010 → …

Conference

Conference	6th International Wireless Communications and Mobile Computing Conference
Abbreviated title	IWCMC
Country/Territory	France
City	Caen
Period	1/06/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 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 [email protected].

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

Keywords

sequential decoding
Bidirectional Fano algorithm
convolutional code
high throughput decoding

Access to Document

10.1145/1815396.1815460

Accompanying conference presentationAccepted author manuscript, 1.03 MB
Conference paperAccepted author manuscript, 109 KB

http://hdl.handle.net/1983/1764

Handle.net

Persistent link

Cite this

@inproceedings{d43745daa59e4e138c91946e8a84641c,

title = "Throughput improvement on bidirectional Fano algorithm",

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.",

keywords = "sequential decoding, Bidirectional Fano algorithm, convolutional code, high throughput decoding",

author = "R Xu and T Ko{\c c}ak and G Woodward and KA Morris",

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 {\textcopyright} 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 [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. ; 6th International Wireless Communications and Mobile Computing Conference, IWCMC ; Conference date: 01-06-2010",

year = "2010",

month = jun,

doi = "10.1145/1815396.1815460",

language = "English",

isbn = "9781450300629",

pages = "276 -- 280",

booktitle = "6th International Wireless Communications and Mobile Computing Conference, Caen, France",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

}

Xu, R, Koçak, T, Woodward, G & Morris, KA 2010, Throughput improvement on bidirectional Fano algorithm. in 6th International Wireless Communications and Mobile Computing Conference, Caen, France. Institute of Electrical and Electronics Engineers (IEEE), pp. 276 - 280, 6th International Wireless Communications and Mobile Computing Conference, Caen, France, 1/06/10. https://doi.org/10.1145/1815396.1815460

Throughput improvement on bidirectional Fano algorithm. / Xu, R; Koçak, T; Woodward, G et al.
6th International Wireless Communications and Mobile Computing Conference, Caen, France. Institute of Electrical and Electronics Engineers (IEEE), 2010. p. 276 - 280.

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

TY - GEN

T1 - Throughput improvement on bidirectional Fano algorithm

AU - Xu, R

AU - Koçak, T

AU - Woodward, G

AU - Morris, KA

N1 - 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 [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

PY - 2010/6

Y1 - 2010/6

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

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

KW - sequential decoding

KW - Bidirectional Fano algorithm

KW - convolutional code

KW - high throughput decoding

U2 - 10.1145/1815396.1815460

DO - 10.1145/1815396.1815460

M3 - Conference Contribution (Conference Proceeding)

SN - 9781450300629

SP - 276

EP - 280

BT - 6th International Wireless Communications and Mobile Computing Conference, Caen, France

PB - Institute of Electrical and Electronics Engineers (IEEE)

T2 - 6th International Wireless Communications and Mobile Computing Conference

Y2 - 1 June 2010

ER -

Throughput improvement on bidirectional Fano algorithm

Abstract

Conference

Bibliographical note

Keywords

Access to Document

Handle.net

Fingerprint

Cite this