Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Craig Dolwin

dblp:89/9197 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%
Computer networks
1 paper
Wireless networking · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › decoding
channel decoding
0.112011
High Throughput Parallel Fano Decoding · IEEE Trans. Commun. 2011
Coding theory › error-correcting codes › convolutional codes
convolutional code decoding
0.112011
High Throughput Parallel Fano Decoding · IEEE Trans. Commun. 2011
Coding theory › error-correcting codes › decoding › sequential decoding
fano decoding
0.112011
High Throughput Parallel Fano Decoding · IEEE Trans. Commun. 2011

Methods — techniques the papers use, named apart from their topics

viterbi decoding comparison · 0.2dynamic decoder scheduling · 0.2bidirectional search · 0.2
YearPublicationVenuePosition
2011 High Throughput Parallel Fano Decoding
abstract
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.
Ran Xu 0009, Taskin Koçak, Graeme Woodward, Kevin A. Morris, Craig Dolwin
IEEE Trans. Commun.5
2009 Bidirectional Fano algorithm for high throughput sequential decoding
abstract
Various techniques, such as bidirectional search, have been employed in sequential decoding to reduce the decoding delay. 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 simultaneously. It is shown that the proposed BFA can reduce the average decoding delay by at least 50% compared to the unidirectional Fano algorithm (UFA). Due to the reduction in the variability of the computational effort by using bidirectional search, there is even higher decoding throughput improvement at low signal-to-noise-ratio (SNR). For example at Eb/No=3dB, there is 300% throughput improvement by using the BFA decoding compared to the conventional UFA decoding. The proposed BFA decoding technique can be employed in very high throughput wireless communication systems with low hardware complexity and power consumption.
Ran Xu 0009, Taskin Koçak, Graeme Woodward, Kevin A. Morris, Craig Dolwin
PIMRC5
2007 A OMA DM based Software Defined Radio Proof-of-Concept Demonstration Platform
abstract
This paper presents our work on a demonstration platform for a software defined radio proof-of-concept, and how OMA Device Management protocol and Functional Description Language can be used to support RAT reconfiguration on SDR terminals. Open Mobile Alliance is an open standards body for the mobile phone industry, and OMA DM protocol is designed to manage small mobile devices such as mobile phones, PDAs and laptop computers. The Functional Description Language is based on XML and is used to describe functional configurations for reconfigurable equipment. The description file is interpreted by the Configuration Control Module using Signal Processing Modules to create a binary configuration file for the target platform. An SDR platform integrating these ideas is introduced. The adaptive execution environment concept is evaluated on a heterogeneous multi-processor hardware test platform known as the Real-Time Research Platform.
Craig Dolwin, Bernd Steinke, Axel Droege
PIMRC2