Geometrical library recognition for mask data compression

Robert Veltman; Isao Ashida

doi:10.1117/12.245219

24 July 1996 Geometrical library recognition for mask data compression

Robert Veltman, Isao Ashida

Author Affiliations +

Proceedings Volume 2793, Photomask and X-Ray Mask Technology III; (1996) https://doi.org/10.1117/12.245219
Event: Symposium on Photomask and X-Ray Mask Technology, 1996, Kawasaki City, Japan

Abstract

Recent developments in LSI mask data processing show a tendency towards unpreceded data volume increases. This paper introduces a data compression technique designed to reduce mask data volumes and is based on geometrical library recognition in which a library is defined as a set of patterns that can be referenced as a single object repeated along a 2 dimensional mesh. The data compression technique is referred to as mask data geometrical library recognition compression (MD-GLRC) and includes a newly developed repetition center tracking (RCT) and library inheritance tree (LIT) algorithm. By applying MD-GLRC, a 885 Mbyte 0.25 μm memory device mask data sample was compressed to 7 Mbytes in 3.5 CPU hours on a 135 MIPS workstation.

Citation Download Citation

Robert Veltman and Isao Ashida "Geometrical library recognition for mask data compression", Proc. SPIE 2793, Photomask and X-Ray Mask Technology III, (24 July 1996); https://doi.org/10.1117/12.245219

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE