By Topic

Dream chip 1: a timed priority queue

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
$31 $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

1 Author(s)
Kahrs, M. ; Dept. of Electr. & Comput. Eng., Rutgers Univ., Piscataway, NJ, USA

Real-time programs often need a time-tagged priority queue that must be updated on the tick of a clock. A prime example of such a queue is a list of filter coefficients that must be changed on a given sample clock. A single chip that manages a time-tagged priority queue is proposed. The queue connects either to a static random access memory (SRAM) or directly to a digital signal processor (DSP) microprocessor. The SRAM would be part of the address space of a DSP microprocessor executing digital filter code.<>

Published in:

Micro, IEEE  (Volume:13 ,  Issue: 4 )