Method of producing phase masks in an automated layout generation for integrated circuits
AssigneeInfineon Technologies AG
InventorsThomas Krüger, Werner Schiele
Life of this patent
Estimating the term…
Abstract
A method of producing phase masks for automatically generating a layout for an integrated circuit includes the step of compacting a layout of an integrated circuit by processing a distance graph. A respective phase is allocated to at least some of a plurality of polygons in the layout in order to generate a phase mask, wherein the allocating step is performed during the processing of the distance graph.
Claims11
A method of producing phase masks for automatically generating a layout for an integrated circuit, the method which comprises;
- compacting a layout of an integrated circuit by processing a distance graph by applying a longest path algorithm;
- allocating a respective phase to at least some of a plurality of polygons in the layout for generating a phase mask by,
- if a longest path can be further shortened with the longest path algorithm, then allocating the respective phase to given ones of the polygons having no allocated phase yet, and
- if a minimum distance between specific ones of the polygons having an identical phase is achieved, then allocating respective different phases to the specific ones of the polygons;
- and
- performing the allocating step during the processing of the distance graph by applying the longest path algorithm.
A method for producing phase masks for an automated design of integrated circuits, the method which comprises:
- compacting a layout of an integrated circuit by processing a separation graph by applying a longest path algorithm;
- allocating a respective phase to at least some of a plurality of polygons in the design by,
- allocating a phase to polygons having no allocated phase yet, as long as a longest path can still be shortened, and
- allocating different phases, if a minimum separation for polygons of the same phase already been achieved;
- and
- performing the allocating step at least partially during the processing of the separation graph by applying the longest path algorithm.
Dependencies are inferred from the claim text.