PERFORMANCE EVALUATION OF HIGH-SPEED COMMUNICATION METHOD BY COMPACTIFICATION OF DESIGN DATA
Keywords:
Isomorphic polygon, geometric invariant feature value, geometric hashing method, high-speed communicationAbstract
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. From evaluation results of the proposed method, we verified that the proposed method can compact the design data by performing fast search and classification for isomorphic polygons, and reduce the communication quantity drastically.
Downloads
References
IEICE knowledge base, group 10 (integrated circuit) – Part 1 (basic configuration and design technology), 2010.
http://www.ieice-hbkb.org/files/10/10gun_01hen_01.pdf (accessed 2015-04-13).
GDSII Stream Format Manual, February 1987.
http://bitsavers.trailing-edge.com/pdf/calma/GDS_II_Stream_Format_Manual_6.0_Feb87.pdf (accessed 2015-04-13).
OASISTM - Open Artwork System Interchange Standard, SEMI Draft Document 3626 2003/04/23
http://www.wrcad.com/oasis/oasis-3626-042303-draft.pdf (accessed 2015-04-13).
Bishop, C. M., Pattern Recognition and Machine Learning, Springer-Verlag, 2006.
Motoda, H. et. al., Pattern Recognize and Machine Learning, First volume, Springer Japan, 2007.
Motoda, H. et. al., Pattern Recognize and Machine Learning, Second volume, Springer Japan, 2008.
Wolfson, H. J. and Rigoutsos, I., Geometric Hashing: An Overview, IEEE Computational Science & Engineering, 1997, vol.4(4), 10-21.
Iwamura, M., Kise, K. and Iwamura, M., Fast Camera-Based Document Image Retrieval Using Local Arrangements of Feature Points, IEICE Transaction, 2006, vol.J89-D(9), 2045-2054.
Horimatsu, A., Iwamura, M. and Kise, K., Fast Affine Invariant Shape Recognition Using Uniqueness of Arrangement of Points, IEICE Technical Report, 2009, vol.108(432), 127-132.
Iwamura, M., Iwamura, M. and Kise, K., On Accuracy and Speed of Object Recognition Based on Local Arrangements of Feature Points, IEICE Technical Report, 2006, vol.2006(93), 49-56.
Shoji, S. and Koyama, A., High –Speed Communication with Confidentiality by Compactification of Design Data, Proc. of NBiS2015, 2015, 124-131.
