High Throughput Parallel Fano Decoding

In this paper, a bidirectional Fano algorithm (BFA) is proposed, in which a forward decoder (FD) and a backward decoder (BD) search in the opposite direction in the code tree simultaneously. It is shown that the proposed BFA can achieve more than twice the decoding throughput compared to the convent...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2011-09, Vol.59 (9), p.2394-2405
Main Authors: Ran Xu, Kocak, Taskin, Woodward, G., Morris, K., Dolwin, C.
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Architecture
Bidirectional
Bidirectional Fano algorithm
Bit error rate
Coding, codes
Convolutional codes
Decoders
Decoding
Dynamical systems
Dynamics
Exact sciences and technology
high throughput decoding
Information, signal and communications theory
Measurement
Merging
parallel Fano decoding
Scheduling
sequential decoding
Signal and communications theory
Signal to noise ratio
Studies
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Throughput
Transmission and modulation (techniques and equipments)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, a bidirectional Fano algorithm (BFA) is proposed, in which a forward decoder (FD) and a backward decoder (BD) search in the opposite direction in the code tree simultaneously. It is shown that the proposed BFA can achieve more than twice the decoding throughput compared to the conventional unidirectional Fano algorithm (UFA) and there is higher throughput improvement at low signal-to-noise ratio (SNR). This new BFA decoding technique is applied in the parallel convolutional decoding architecture in very high throughput systems, such as the WirelessHD system. Due to the variability in the decoding delays of the parallel codewords, a scheduler is introduced in the parallel Fano decoding architecture which can dynamically allocate the idle decoders to assist with decoding the other parallel codewords in a bidirectional manner. It is shown that the proposed parallel Fano decoding with scheduling can dramatically increase the decoding throughput compared to the parallel Fano decoding without scheduling, and its computational complexity is much lower than that of parallel Viterbi decoding, especially at high SNR. The performance of the parallel Fano decoding with different scheduling schemes is also compared and analyzed in detail in the paper.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2011.062011.100236