High-Speed Communication with Confidentiality by Compactification of Design Data

Abstract

A large number of isomorphic polygons are included in design data of large scale integrated circuit. Fast searching and classification for isomorphic polygons in these design data are able to apply to compactification of design data. Compactification of design data has a merit for communication via networks. So, we use expression method using a geometric invariant feature value for polygon. This method does not be affected for rotation and reduced scale. The Geometric Hashing method is known widely as an object recognition method using geometric invariant feature amount which expresses feature of shape. However, this method has drawbacks which increase computational complexity and memory usage amount with increasing of feature points. To solve these issues, we propose a fast and high accuracy search method for isomorphic polygon and apply to compactification of design data. In the design data, access is limited because they are needed high confidentiality. So, the design data are managed by high confidentiality server. Access of the design data is performed by access request from a client to the server. To do so, we prepared the dedicated library for access. The dedicated library can access the design data with confidentiality, and compactification of design data can reduce communication quantity drastically. From evaluation results of the proposed method, we verified that the proposed method could compact the design data by performing fast search and classification for isomorphic polygons, and reduced the communication quantity drastically.