Patents by Inventor Emanuel Gofman

Emanuel Gofman has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 7840057
    Abstract: Methods, and program storage devices, for performing model-based optical proximity correction by providing a region of interest (ROI) having an interaction distance and locating at least one polygon within the ROI. A cut line of sample points representative of a set of vertices, or plurality of cut lines, are generated within the ROI across at least one lateral edge of the polygon(s). An angular position, and first and second portions of the cut line residing on opposing sides of an intersection between the cut line and the lateral edge of the polygon are determined, followed by generating a new ROI by extending the original ROI beyond its interaction distance based on such angular position, and first and second portions of the cut line. In this manner, a variety of new ROIs may be generated, in a variety of different directions, to ultimately correct for optical proximity.
    Type: Grant
    Filed: October 18, 2007
    Date of Patent: November 23, 2010
    Assignee: International Business Machines Corporation
    Inventors: Gregg M. Gallatin, Emanuel Gofman, Kafai Lai, Mark A. Lavin, Maharaj Mukherjee, Dov Ramm, Alan E. Rosenbluth, Shlomo Shlafman
  • Patent number: 7774737
    Abstract: Methods, and a program storage device for executing such methods, for performing model-based optical proximity correction by providing a mask matrix having a region of interest (ROI) and locating a plurality of points of interest within the mask matrix. A first polygon having a number of vertices representative of the located points of interest is computed, followed by determining a spatial relation between its vertices and the ROI. The vertices of the first polygon are then pinned to boundaries of and within the ROI such that a second polygon is formed on the ROI. The process is repeated for all vertices of the first polygon such that the second polygon is collapsed onto the ROI. This collapsed second polygon is then used to correct for optical proximity.
    Type: Grant
    Filed: June 1, 2007
    Date of Patent: August 10, 2010
    Assignee: International Business Machines Corporation
    Inventors: Gregg M Gallatin, Emanuel Gofman, Kafai Lai, Mark A. Lavin, Maharaj Mukherjee, Dov Ramm, Alan E. Rosenbluth, Shlomo Shlafman
  • Patent number: 7761839
    Abstract: Methods, and a program storage device for executing such methods, for performing model-based optical proximity correction by providing a mask matrix having a region of interest (ROI) and locating a plurality of points of interest within the mask matrix. A first polygon having a number of vertices representative of the located points of interest is computed, followed by determining a spatial relation between its vertices and the ROI. The vertices of the first polygon are then pinned to boundaries of and within the ROI such that a second polygon is formed on the ROI. The process is repeated for all vertices of the first polygon such that the second polygon is collapsed onto the ROI. This collapsed second polygon is then used to correct for optical proximity.
    Type: Grant
    Filed: October 18, 2007
    Date of Patent: July 20, 2010
    Assignee: International Business Machines Corporation
    Inventors: Gregg M. Gallatin, Emanuel Gofman, Kafai Lai, Mark A. Lavin, Maharaj Mukherjee, Dov Ramm, Alan E. Rosenbluth, Shlomo Shlafman
  • Patent number: 7512524
    Abstract: A method for preparing peptide spectra for identification, the method including constructing a symmetric distance matrix from a plurality of peptide spectra, where a cluster of at least one of the spectra is represented in a row of the matrix, and where the cluster is also represented in a column of the matrix, finding the minimum of each of the clusters in the matrix, constructing a vector from the minima where each element in the vector corresponds to one of the clusters, finding the global minimum of the matrix as being the minimum of the vector, merging two of the clusters identified by the global minimum into a merged cluster, and providing the merged cluster for identification of at least one peptide associated with the merged cluster.
    Type: Grant
    Filed: March 18, 2005
    Date of Patent: March 31, 2009
    Assignee: International Business Machines Corporation
    Inventors: Ilan Be'er, Eilon Barnea, Emanuel Gofman
  • Patent number: 7434196
    Abstract: Methods, and program storage devices, for performing model-based optical lithography corrections by partitioning a cell array layout, having a plurality of polygons thereon, into a plurality of cells covering the layout. This layout is representative of a desired design data hierarchy. A density map is then generated corresponding to interactions between the polygons and plurality of cells, and then the densities within each cell are convolved. An interaction map is formed using the convolved densities, followed by truncating the interaction map to form a map of truncated cells. Substantially identical groupings of the truncated cells are then segregated respectively into differing ones of a plurality of buckets, whereby each of these buckets comprise a single set of identical groupings of truncated cells. A hierarchical arrangement is generated using these buckets, and the desired design data hierarchy enforced using the hierarchical arrangement to ultimately correct for optical lithography.
    Type: Grant
    Filed: October 3, 2005
    Date of Patent: October 7, 2008
    Assignee: International Business Machines Corporation
    Inventors: Gregg M Gallatin, Emanuel Gofman, Kafai Lai, Mark A Lavin, Maharaj Mukherjee, Dov Ramm, Alan E Rosenbluth, Shlomo Shlafman
  • Patent number: 7366342
    Abstract: Methods, and program storage devices, for performing model-based optical proximity correction by providing a region of interest (ROI) having an interaction distance and locating at least one polygon within the ROI. A cut line of sample points representative of a set of vertices, or plurality of cut lines, are generated within the ROI across at least one lateral edge of the polygon(s). An angular position, and first and second portions of the cut line residing on opposing sides of an intersection between the cut line and the lateral edge of the polygon are determined, followed by generating a new ROI by extending the original ROI beyond its interaction distance based on such angular position, and first and second portions of the cut line. In this manner, a variety of new ROIs may be generated, in a variety of different directions, to ultimately correct for optical proximity.
    Type: Grant
    Filed: October 27, 2003
    Date of Patent: April 29, 2008
    Assignee: International Business Machines Corporation
    Inventors: Gregg M. Gallatin, Emanuel Gofman, Kafai Lai, Mark A. Lavin, Maharaj Mukherjee, Dov Ramm, Alan E. Rosenbluth, Shlomo Shlafman
  • Patent number: 7343271
    Abstract: A first method to compute a phase map within an optical proximity correction simulation kernel utilizes simulated wavefront information from randomly generated data. A second method uses measured data from optical tools. A phase map is created by analytically embedding a randomly generated two-dimensional array of complex numbers of wavefront information, and performing an inverse Fourier Transform on the resultant array. A filtering function requires the amplitude of each element of the array to be multiplied by a Gaussian function. A power law is then applied to the array. The elements of the array are shuffled, and converted from the phasor form to real/imaginary form. A two-dimensional Fast Fourier Transform is applied. The array is then unshuffled, and converted back to phasor form.
    Type: Grant
    Filed: October 27, 2003
    Date of Patent: March 11, 2008
    Assignee: International Business Machines Corporation
    Inventors: Gregg M. Gallatin, Emanuel Gofman, Kafai Lai, Mark A. Lavin, Maharaj Mukherjee, Dov Ramm, Alan E. Rosenbluth, Shlomo Shlafman
  • Publication number: 20080059939
    Abstract: Methods, and a program storage device for executing such methods, for performing model-based optical proximity correction by providing a mask matrix having a region of interest (ROI) and locating a plurality of points of interest within the mask matrix. A first polygon having a number of vertices representative of the located points of interest is computed, followed by determining a spatial relation between its vertices and the ROI. The vertices of the first polygon are then pinned to boundaries of and within the ROI such that a second polygon is formed on the ROI. The process is repeated for all vertices of the first polygon such that the second polygon is collapsed onto the ROI. This collapsed second polygon is then used to correct for optical proximity.
    Type: Application
    Filed: October 18, 2007
    Publication date: March 6, 2008
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Gregg Gallatin, Emanuel Gofman, Kafai Lai, Mark Lavin, Maharaj Mukherjee, Dov Ramm, Alan Rosenbluth, Shlomo Shlafman
  • Publication number: 20080037858
    Abstract: Methods, and program storage devices, for performing model-based optical proximity correction by providing a region of interest (ROI) having an interaction distance and locating at least one polygon within the ROI. A cut line of sample points representative of a set of vertices, or plurality of cut lines, are generated within the ROI across at least one lateral edge of the polygon(s). An angular position, and first and second portions of the cut line residing on opposing sides of an intersection between the cut line and the lateral edge of the polygon are determined, followed by generating a new ROI by extending the original ROI beyond its interaction distance based on such angular position, and first and second portions of the cut line. In this manner, a variety of new ROIs may be generated, in a variety of different directions, to ultimately correct for optical proximity.
    Type: Application
    Filed: October 18, 2007
    Publication date: February 14, 2008
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Gregg Gallatin, Emanuel Gofman, Kafai Lai, Mark Lavin, Maharaj Mukherjee, Dov Ramm, Alan Rosenbluth, Shlomo Shlafman
  • Patent number: 7287239
    Abstract: Methods, and a program storage device for executing such methods, for performing model-based optical proximity correction by providing a mask matrix having a region of interest (ROI) and locating a plurality of points of interest within the mask matrix. A first polygon having a number of vertices representative of the located points of interest is computed, followed by determining a spatial relation between its vertices and the ROI. The vertices of the first polygon are then pinned to boundaries of and within the ROI such that a second polygon is formed on the ROI. The process is repeated for all vertices of the first polygon such that the second polygon is collapsed onto the ROI. This collapsed second polygon is then used to correct for optical proximity.
    Type: Grant
    Filed: October 27, 2003
    Date of Patent: October 23, 2007
    Assignee: International Business Machines Corporation
    Inventors: Gregg M. Gallatin, Emanuel Gofman, Kafai Lai, Mark A. Lavin, Maharaj Mukherjee, Dov Ramm, Alan E. Rosenbluth, Shlomo Shlafman
  • Publication number: 20070226677
    Abstract: Methods, and a program storage device for executing such methods, for performing model-based optical proximity correction by providing a mask matrix having a region of interest (ROI) and locating a plurality of points of interest within the mask matrix. A first polygon having a number of vertices representative of the located points of interest is computed, followed by determining a spatial relation between its vertices and the ROI. The vertices of the first polygon are then pinned to boundaries of and within the ROI such that a second polygon is formed on the ROI. The process is repeated for all vertices of the first polygon such that the second polygon is collapsed onto the ROI. This collapsed second polygon is then used to correct for optical proximity.
    Type: Application
    Filed: June 1, 2007
    Publication date: September 27, 2007
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Gregg Gallatin, Emanuel Gofman, Kafai Lai, Mark Lavin, Maharaj Mukherjee, Dov Ramm, Alan Rosenbluth, Shlomo Shlafman
  • Patent number: 7131104
    Abstract: A method is described for performing model-based optical proximity corrections on a mask layout used in an optical lithography process having a plurality of mask shapes. Model-based optical proximity correction is performed by computing the image intensity on selected evaluation points on the mask layout. The image intensity to be computed includes optical flare and stray light effects due to the interactions between the shapes on the mask layout. The computation of the image intensity involves sub-dividing the mask layout into a plurality of regions, each region at an increasing distance from the evaluation point. The contributions of the optical flare and stray light effects due to mask shapes in each of the regions are then determined. Finally, all the contributions thus obtained are combined to obtain the final computation of the image intensity at the selected point.
    Type: Grant
    Filed: May 13, 2004
    Date of Patent: October 31, 2006
    Assignee: International Business Machines Coporation
    Inventors: Gregg M. Gallatin, Emanuel Gofman, Kafai Lai, Mark A. Lavin, Dov Ramm, Alan E. Rosenbluth, Shlomo Shlafman, Zheng Chen, Maharaj Mukherjee
  • Patent number: 7127699
    Abstract: A method is provided for optimizing the number of kernels N used in a sum of coherent sources (SOCS) for optical proximity correction in an optical microlithography process, including setting the number of kernels N to a predetermined minimum value Nmin, where a determination is made as to whether an accuracy estimate of calculated intensity is within a tolerable value, and a determination is also made as to whether an added X/Y asymmetry estimate of the calculated intensity is negligible.
    Type: Grant
    Filed: December 16, 2003
    Date of Patent: October 24, 2006
    Assignee: International Business Machines Corporation
    Inventors: Gregg M. Gallatin, Emanuel Gofman, Kafai Lai, Mark A. Lavin, Maharaj Mukherjee, Dov Ramm, Alan Edward Rosenbluth, Shlomo Shlafman
  • Publication number: 20060208185
    Abstract: A method for preparing peptide spectra for identification, the method including constructing a symmetric distance matrix from a plurality of peptide spectra, where a cluster of at least one of the spectra is represented in a row of the matrix, and where the cluster is also represented in a column of the matrix, finding the minimum of each of the clusters in the matrix, constructing a vector from the minima where each element in the vector corresponds to one of the clusters, finding the global minimum of the matrix as being the minimum of the vector, merging two of the clusters identified by the global minimum into a merged cluster, and providing the merged cluster for identification of at least one peptide associated with the merged cluster.
    Type: Application
    Filed: March 18, 2005
    Publication date: September 21, 2006
    Applicant: International Business Machines Corporation
    Inventors: Ilan Be'er, Eilon Barnea, Emanuel Gofman
  • Patent number: 7055126
    Abstract: Methods, and program storage devices, for performing model-based optical lithography corrections by partitioning a cell array layout, having a plurality of polygons thereon, into a plurality of cells covering the layout. This layout is representative of a desired design data hierarchy. A density map is then generated corresponding to interactions between the polygons and plurality of cells, and then the densities within each cell are convolved. An interaction map is formed using the convolved densities, followed by truncating the interaction map to form a map of truncated cells. Substantially identical groupings of the truncated cells are then segregated respectively into differing ones of a plurality of buckets, whereby each of these buckets comprise a single set of identical groupings of truncated cells. A hierarchal arrangement is generated using these buckets, and the desired design data hierarchy enforced using the hierarchal arrangement to ultimately correct for optical lithography.
    Type: Grant
    Filed: October 27, 2003
    Date of Patent: May 30, 2006
    Assignee: International Business Machines Corporation
    Inventors: Gregg M. Gallatin, Emanuel Gofman, Kafai Lai, Mark A. Lavin, Maharaj Mukherjee, Dov Ramm, Alan E. Rosenbluth, Shlomo Shlafman
  • Patent number: 7010776
    Abstract: A method for calculating long-range image contributions from mask polygons. An algorithm is introduced having application to Optical Proximity Correction in optical lithography. A finite integral for each sector of a polygon replaces an infinite integral. Integrating over two triangles, rather than integrating on the full sector, achieves a finite integral. An analytical approach is presented for a power law kernel to reduce the numerical integration of a sector to an analytical expression evaluation. The mask polygon is divided into regions to calculate interaction effects, such as intermediate-range and long-range effects, by truncating the mask instead of truncating the kernel function.
    Type: Grant
    Filed: October 27, 2003
    Date of Patent: March 7, 2006
    Assignee: International Business Machines Corporation
    Inventors: Gregg M. Gallatin, Emanuel Gofman, Kafai Lai, Mark A. Lavin, Maharaj Mukherjee, Dov Ramm, Alan E. Rosenbluth, Shlomo Shlafman
  • Publication number: 20060041851
    Abstract: Methods, and program storage devices, for performing model-based optical lithography corrections by partitioning a cell array layout, having a plurality of polygons thereon, into a plurality of cells covering the layout. This layout is representative of a desired design data hierarchy. A density map is then generated corresponding to interactions between the polygons and plurality of cells, and then the densities within each cell are convolved. An interaction map is formed using the convolved densities, followed by truncating the interaction map to form a map of truncated cells. Substantially identical groupings of the truncated cells are then segregated respectively into differing ones of a plurality of buckets, whereby each of these buckets comprise a single set of identical groupings of truncated cells. A hierarchal arrangement is generated using these buckets, and the desired design data hierarchy enforced using the hierarchal arrangement to ultimately correct for optical lithography.
    Type: Application
    Filed: October 3, 2005
    Publication date: February 23, 2006
    Inventors: Gregg Gallatin, Emanuel Gofman, Kafai Lai, Mark Lavin, Maharaj Mukherjee, Dov Ramm, Alan Rosenbluth, Shlomo Shlafman
  • Publication number: 20050257187
    Abstract: A method is described for performing model-based optical proximity corrections on a mask layout used in an optical lithography process having a plurality of mask shapes. Model-based optical proximity correction is performed by computing the image intensity on selected evaluation points on the mask layout. The image intensity to be computed includes optical flare and stray light effects due to the interactions between the shapes on the mask layout. The computation of the image intensity involves sub-dividing the mask layout into a plurality of regions, each region at an increasing distance from the evaluation point. The contributions of the optical flare and stray light effects due to mask shapes in each of the regions are then determined. Finally, all the contributions thus obtained are combined to obtain the final computation of the image intensity at the selected point.
    Type: Application
    Filed: May 13, 2004
    Publication date: November 17, 2005
    Inventors: Gregg Gallatin, Emanuel Gofman, Kafai Lai, Mark Lavin, Dov Remm, Alan Rosenbluth, Shlomo Shlafman, Zheng Chen, Maharaj Mukherjee
  • Publication number: 20050132310
    Abstract: A method for optimizing the number of kernels N used in a sum of coherent sources (SOCS) for optical proximity correction in an optical microlithography process including setting the number of kernels N to a predetermined minimum value Nmin. A determination is made as to whether an accuracy estimate of calculated intensity is within a tolerable value. A determination is also made as to whether an added X/Y asymmetry estimate of the calculated intensity is negligible.
    Type: Application
    Filed: December 16, 2003
    Publication date: June 16, 2005
    Inventors: Gregg Gallatin, Emanuel Gofman, Kafai Lai, Mark Lavin, Maharaj Mukherjee, Dov Ramm, Alan Rosenbluth, Shlomo Shlafman
  • Publication number: 20050091631
    Abstract: A method for calculating long-range image contributions from mask polygons. An algorithm is introduced having application to Optical Proximity Correction in optical lithography. A finite integral for each sector of a polygon replaces an infinite integral. Integrating over two triangles, rather than integrating on the full sector, achieves a finite integral. An analytical approach is presented for a power law kernel to reduce the numerical integration of a sector to an analytical expression evaluation. The mask polygon is divided into regions to calculate interaction effects, such as intermediate-range and long-range effects, by truncating the mask instead of truncating the kernel function.
    Type: Application
    Filed: October 27, 2003
    Publication date: April 28, 2005
    Applicant: International Business Machines Corporation
    Inventors: Gregg Gallatin, Emanuel Gofman, Kafai Lai, Mark Lavin, Maharaj Mukherjee, Dov Ramm, Alan Rosenbluth, Shlomo Shlafman