Title :
A new algorithm for sorting problem with reformed CAM
Author :
Lu, Kuei-Ming ; Tamaru, Keikichi
Author_Institution :
Dept. of Electron. Eng., Kyoto Univ., Japan
fDate :
30 Apr-3 May 1995
Abstract :
Nowadays, the addition of specific hardware to CAD or DA applications has been received by the engineering community. Specially, Content Addressable Memory (CAM) is in the limelight because of its fast processing capability. In this paper, we propose a new algorithm and reformed CAM to deal with the sorting problem that always takes the bulk of the execution time in some applications such as design-rule checking. They can effect an 80% reduction in retrieval times
Keywords :
CAD; content-addressable storage; sorting; storage management; CAD; CAM; DA; content addressable memory; design-rule check; hardware; only-one algorithm; retrieval times; same-pattern algorithm; sorting; variable argument algorithm; CADCAM; Computer aided manufacturing; Counting circuits; Decoding; Information retrieval; Logic; Sorting;
Conference_Titel :
Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
0-7803-2570-2
DOI :
10.1109/ISCAS.1995.519946
