By Topic

A parallel, high speed circular queue structure

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

2 Author(s)
Barbour, A.E. ; Dept. of Electr. Eng. & Comput. Sci., Illinois Univ., Chicago, IL, USA ; Alhayek, I.

A 4×4 parallel circular queue structure in which data can be stored and deleted simultaneously is presented. This design eliminates the latency problem, which is the time for the data to propagate from input to output ports in a serial queue. The insertions and deletions are accomplished by two pointers, front and rear, which are interfaced to two independent bus structures. This allows the data to be inserted into a location where the rear pointer is pointing to, if the queue is not full and the rear pointer is incremented to point to the next available space. The data are deleted from a location where the front pointer is pointing to if the queue is not empty and the front pointer is incremented to point to the next data to be deleted. An up/down counter is used to control the activity of the queue and to set/reset full and empty flags. The queue is circular in the sense that there are no specific input and output ports from which data should be inserted and deleted, respectively. The design has the characteristics of simplicity and modularity, which makes it attractive for VLSI implementation

Published in:

Circuits and Systems, 1989., Proceedings of the 32nd Midwest Symposium on

Date of Conference:

14-16 Aug 1989