By Topic

A simple self-timed implementation of a priority queue for dictionary search problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ali Muhtaroglu ; Middle East Technical University Northern Cyprus Campus, T.R.N.C. via Mersin 10, Turkey ; Omer Berat Sezer

This paper describes a sparse priority queue suitable for reporting the results from a sequence database search, using a self-timed protocol. The prioritization is simplified through an insertion sort scheme with no greater/less than logic. The resulting implementation promises to be compact, fast, and suitable for the specified application area. The architectural design has been validated on a prototype platform with Altera Cyclone II field programmable gate array (FPGA).

Published in:

2009 2nd International Conference on Adaptive Science & Technology (ICAST)

Date of Conference:

14-16 Jan. 2009