A new algorithm for sorting problem with reformed CAM
説明
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.
収録刊行物
-
- Proceedings of ISCAS'95 - International Symposium on Circuits and Systems
-
Proceedings of ISCAS'95 - International Symposium on Circuits and Systems 2 1045-1048, 2002-11-19
IEEE