Abstract
AbstractA new hardware engine called CHARGE (CAM‐based Hardware Engine for Geometrical Problems) is presented to accelerate basic geometrical search algorithms for VLSI layout design and verification. Due to the world‐parallel nature of the Content Addressable Memory (CAM), basic geometrical search problems can be solved in constant time, independent of the number of geometrical data. This approach has flexibility to exclude complicated coding for various data structures depending on subproblems. The architecture of CHARGE and performance data measured on a prototype machine are described.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Electronics and Communications in Japan (Part III: Fundamental Electronic Science)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
