DocumentCode
311448
Title
An asynchronous implementation of the maxlist algorithm
Author
Myers, Chris J. ; Zheng, Hao
Author_Institution
Dept. of Electr. Eng., Utah Univ., Salt Lake City, UT, USA
Volume
1
fYear
1997
fDate
21-24 Apr 1997
Firstpage
647
Abstract
We present an efficient asynchronous VLSI architecture for calculating running maximum or minimum values over a sliding window. Running maximums or minimums are very useful for many signal and image processing tasks. Our architecture performs the calculation using the MAXLIST algorithm. In order to take advantage of the wide delay variations due to data-dependencies and operating conditions, an asynchronous approach is taken to achieve higher performance and lower power. Simulation results demonstrate that our asynchronous architecture is significantly faster than existing and potential synchronous architectures
Keywords
VLSI; digital simulation; image processing; asynchronous VLSI architecture; asynchronous implementation; delay variations; image processing; maxlist algorithm; minimums; running maximum; signal processing; simulation results; Cities and towns; Delay; Engineering profession; Filters; Hardware; Image processing; Signal processing; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, 1997. ICASSP-97., 1997 IEEE International Conference on
Conference_Location
Munich
ISSN
1520-6149
Print_ISBN
0-8186-7919-0
Type
conf
DOI
10.1109/ICASSP.1997.599851
Filename
599851
Link To Document