Patents by Inventor Andrei Gratchev

Andrei Gratchev 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).

  • Method and mechanism for extraction and recognition of polygons in an IC design
    Patent number: 8429588
    Abstract: Disclosed is an improved approach for organizing, analyzing, and operating upon polygon data which significantly reduces the amount of data required for processing while keeping elements non-interfacing with each other. According to one approach, clusters of elements are extracted which are then handled separately. In some approaches, a set of polygons forms a cluster if for any two polygons from the set of polygons there exists a sequence of polygons from the set such that the distance between any sequential polygons are less than or equal to a given threshold number. Rather than analyzing each and every polygon in the design, repetitive unique patterns are analyzed once, which are then replicated for all clusters which have the same repetitive pattern.
    Type: Grant
    Filed: March 14, 2011
    Date of Patent: April 23, 2013
    Assignee: Cadence Design Systems, Inc.
    Inventors: Anwar Irmatov, Alexander Belousov, Eitan Cadouri, Andrei Gratchev, Alexander Ryjov, Laurent Thenie
  • METHOD AND MECHANISM FOR EXTRACTION AND RECOGNITION OF POLYGONS IN AN IC DESIGN
    Publication number: 20110167400
    Abstract: Disclosed is an improved approach for organizing, analyzing, and operating upon polygon data which significantly reduces the amount of data required for processing while keeping elements non-interfacing with each other. According to one approach, clusters of elements are extracted which are then handled separately. In some approaches, a set of polygons forms a cluster if for any two polygons from the set of polygons there exists a sequence of polygons from the set such that the distance between any sequential polygons are less than or equal to a given threshold number. Rather than analyzing each and every polygon in the design, repetitive unique patterns are analyzed once, which are then replicated for all clusters which have the same repetitive pattern.
    Type: Application
    Filed: March 14, 2011
    Publication date: July 7, 2011
    Applicant: CADENCE DESIGN SYSTEMS, INC.
    Inventors: Anwar Irmatov, Alexander Belousov, Eitan Cadouri, Andrei Gratchev, Alexander Ryjov, Laurent Thenie
  • Method and mechanism for extraction and recognition of polygons in an IC design
    Patent number: 7908579
    Abstract: Disclosed is an improved approach for organizing, analyzing, and operating upon polygon data which significantly reduces the amount of data required for processing while keeping elements non-interfacing with each other. According to one approach, clusters of elements are extracted which are then handled separately. In some approaches, a set of polygons forms a cluster if for any two polygons from the set of polygons there exists a sequence of polygons from the set such that the distance between any sequential polygons are less than or equal to a given threshold number. Rather than analyzing each and every polygon in the design, repetitive unique patterns are analyzed once, which are then replicated for all clusters which have the same repetitive pattern.
    Type: Grant
    Filed: January 17, 2007
    Date of Patent: March 15, 2011
    Assignee: Cadence Design Systems, Inc.
    Inventors: Anwar Irmatov, Alexander Belousov, Eitan Cadouri, Andrei Gratchev, Alexander Ryjov, Laurent Thenie
  • METHOD AND MECHANISM FOR EXTRACTION AND RECOGNITION OF POLYGONS IN AN IC DESIGN
    Publication number: 20070288876
    Abstract: Disclosed is an improved approach for organizing, analyzing, and operating upon polygon data which significantly reduces the amount of data required for processing while keeping elements non-interfacing with each other. According to one approach, clusters of elements are extracted which are then handled separately. In some approaches, a set of polygons forms a cluster if for any two polygons from the set of polygons there exists a sequence of polygons from the set such that the distance between any sequential polygons are less than or equal to a given threshold number. Rather than analyzing each and every polygon in the design, repetitive unique patterns are analyzed once, which are then replicated for all clusters which have the same repetitive pattern.
    Type: Application
    Filed: January 17, 2007
    Publication date: December 13, 2007
    Applicant: Cadence Design System, Inc.
    Inventors: Anwar Irmatov, Alexander Belousov, Eitan Cadouri, Andrei Gratchev, Alexander Ryjov, Laurent Thenie