Title :
Fast digital operational units using comparison lookahead
Author_Institution :
Dept. of Electr. & Comput. Eng., Illinois Inst. of Technol., Chicago, IL, USA
Abstract :
The author discusses the design of two-input maximum operation units (TIMUs) using comparison look-ahead, as well as the different possible designs for multiple input max/min units (MIMUs). The time and area complexities of different designs of MIMUs and TIMUs are discussed and compared. It is found that the implementation of MIMU as a binary tree of high-speed look-ahead TIMUs gives a shorter time of selection than the selection-sort-based MIMU for a practical number of inputs. However, the former is much more expensive in area
Keywords :
computational complexity; minimax techniques; search problems; sorting; MIMUs; TIMUs; area complexities; binary tree; comparison lookahead; fast digital operational units; multiple input max/min units; time complexity; two-input maximum operation units; Application software; Binary trees; Circuits; Computer applications; Costs; Database machines; Hardware; Logic design; Optimization methods; Sorting;
Conference_Titel :
Systems, Man and Cybernetics, 1992., IEEE International Conference on
Conference_Location :
Chicago, IL
Print_ISBN :
0-7803-0720-8
DOI :
10.1109/ICSMC.1992.271561
