DocumentCode
406159
Title
Logarithmic complexity implementation for integer comparator
Author
Sun, Haiping ; Cai, Jinqing ; He, Wei ; Gao, Minglun
Author_Institution
Inst. of VLSI Design, Hefei Univ. of Technol., China
Volume
1
fYear
2003
fDate
14-17 Dec. 2003
Firstpage
328
Abstract
A logarithmic complexity implementation for the integer comparator is presented. The relation between unsigned integers to be compared and their comparison result is analyzed, and then a logarithmic complexity algorithm is inferred, which takes the advantage of both speed and area. The algorithm is also extended for comparing two signed integers in two´s complement. The complexities of the basic algorithm in terms of time and hardware are given. The experimental results of several concrete schemes are also discussed.
Keywords
computational complexity; hardware description languages; integer comparator; logarithmic complexity implementation algorithm; unsigned integers; Algorithm design and analysis; Circuit synthesis; Concrete; Hardware design languages; Helium; Logic; Sun; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks and Signal Processing, 2003. Proceedings of the 2003 International Conference on
Conference_Location
Nanjing
Print_ISBN
0-7803-7702-8
Type
conf
DOI
10.1109/ICNNSP.2003.1279276
Filename
1279276
Link To Document