Patents by Inventor Pedja Raspopovic
Pedja Raspopovic 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: 8843865Abstract: A system and method for generating physical design of an integrated circuit, based on schematic design. The system includes graphical user interface and integrated circuit design and layout system. The integrated circuit design and layout system creates and analyzes logical slices of the integrated circuit based on the schematic design; creates and edits macros based on the logical slices; and traces and analyzes data paths through the physical design based on the schematic design. The method includes providing the schematic design of the integrated circuit, and generating logical slices of the integrated circuit from the schematic design. The method also includes generating, grouping and manipulating macros, responsive to identification of multiple occurrences of logical slices. The method further includes performing data flow analysis to identify data paths for the physical design, quantifying weight indices for the data paths, and positioning objects in the physical design based on the weight indices.Type: GrantFiled: February 26, 2012Date of Patent: September 23, 2014Assignee: Synopsys, Inc.Inventors: Philip H. Tai, Pedja Raspopovic, Jaime Wong
-
Publication number: 20130227503Abstract: A system and method for generating physical design of an integrated circuit, based on schematic design. The system includes graphical user interface and integrated circuit design and layout system. The integrated circuit design and layout system creates and analyzes logical slices of the integrated circuit based on the schematic design; creates and edits macros based on the logical slices; and traces and analyzes data paths through the physical design based on the schematic design. The method includes providing the schematic design of the integrated circuit, and generating logical slices of the integrated circuit from the schematic design. The method also includes generating, grouping and manipulating macros, responsive to identification of multiple occurrences of logical slices. The method further includes performing data flow analysis to identify data paths for the physical design, quantifying weight indices for the data paths, and positioning objects in the physical design based on the weight indices.Type: ApplicationFiled: February 26, 2012Publication date: August 29, 2013Applicant: SYNOPSYS INC.Inventors: Philip H. TAI, Pedja RASPOPOVIC, Jaime WONG
-
Patent number: 7020589Abstract: An optimization apparatus and method optimizes a functional block within a netlist of an integrated circuit design. A corresponding delay value is assigned to each of a plurality of pins of the block. Each pin corresponds to a respective signal path through the block. The delay values together form a delay value combination, which is selected from a continuous set of possible combinations in which each combination in the set satisfies a predetermined criteria. A circuit configuration for the block is then generated with a plurality of logic cells that are interconnected in the netlist such that the respective signal paths have delays through the block that are based on the corresponding delay values.Type: GrantFiled: September 26, 2001Date of Patent: March 28, 2006Assignee: LSI Logic CorporationInventors: Partha P. Datta Ray, Mikhail I. Grinchuk, Pedja Raspopovic
-
Patent number: 6643832Abstract: A pre-placement delay model for a logical function block of an integrated circuit design includes a fan-in count variable, a fan-out count variable and a delay variable. The fan-in count variable has a value indicative of a number of inputs to the logical function block. The fan-out count variable has a value indicative of the number of inputs of other logical function blocks that are driven by an output of the logical function block. The delay variable has a value that is a function of the binary logarithm of the fan-in count variable and the binary logarithm of the fan-out count variable.Type: GrantFiled: September 26, 2001Date of Patent: November 4, 2003Assignee: LSI Logic CorporationInventors: Partha P. Data Ray, Mikhail I. Grinchuk, Pedja Raspopovic
-
Patent number: 6557144Abstract: A computer program that improves a netlist of logic nodes and physical placement for an IC. The program (a) identifies critical nodes based on delay information calculated from the physical placement. Then the program (b) selects a set of critical nodes and optimally collapses their critical fan-ins and part of the non-critical fan-ins based on their Boolean relationship, which, includes at least one critical node. After that, the program (c) remaps the collapsed sub-netlist by covering its subject graph with an optimal pattern graph, and dynamically estimates and updates the fanout loads. The program returns to step (b) if the remapped sub-netlist is unacceptable, and returns to step (a) after updating the delay information and coordinates of newly mapped gates if the remapped sub-netlist is acceptable. The program exits at step (a) when no more critical nodes are identified at step (a).Type: GrantFiled: December 14, 2000Date of Patent: April 29, 2003Assignee: LSI Logic CorporationInventors: Aiguo Lu, Ivan Pavisic, Pedja Raspopovic
-
Patent number: 6546539Abstract: A program for improving a netlist of logic nodes and physical placement for an IC. The program (A) identifies critical nodes based on time calculated from a physical placement. The program (B) selects a set of critical nodes and sub-netlists associated with the critical nodes and co-factors critical fan-ins in the sub-netlists. The program remaps the sub-netlists by optimization and dynamically estimates and updates fanout loads. The program returns to step B if the remapped sub-netlist is unacceptable, returns to step A if the remapped sub-netlist is acceptable, and exits at step A when no more critical nodes are identified at step A.Type: GrantFiled: December 14, 2000Date of Patent: April 8, 2003Assignee: LSI Logic CorporationInventors: Aiquo Lu, Ivan Pavisic, Pedja Raspopovic
-
Patent number: 6505336Abstract: Channels are routed in an integrated circuit layout by reserving grid positions for buffers. Cell pins are identified at different y-coordinates to be connected by the channel. A determination is made as to the necessity of a jog between vertical segments, and if so, a y-coordinate is assigned to each such jog. An x-coordinate is assigned to each channel segment extending across the y-coordinates. Y-coordinates are assigned to buffers to be connected to the channel.Type: GrantFiled: March 13, 2001Date of Patent: January 7, 2003Assignee: LSI Logic CorporationInventors: Alexander E. Andreev, Pedja Raspopovic, Anatoli A. Bolotov
-
Patent number: 6463572Abstract: True paths are identified in a timing graph of a circuit in which the timing graph contains known false paths containing nodes of at least two sets selected from FROM, THROUGH and TO nodes. The false paths are processed to include sets of FROM and TO nodes and then transformed into equivalent sets of two logical false paths. True path intervals are constructed as logical subgraphs that do not describe any equivalent false path. In preferred embodiments, the process is carried out by a computer under control of a computer readable program.Type: GrantFiled: May 31, 2001Date of Patent: October 8, 2002Assignee: LSI Logic CorporationInventors: Ivan Pavisic, Pedja Raspopovic, Aiguo Lu
-
Patent number: 6453453Abstract: A linear assignment problem for an ordered system containing a plurality of boxes each containing an object having an associated penalty function is solved. A hierarchy contains a bottom level containing at least as many generalized boxes as there are boxes in the assignment problem, and top and intermediate levels. The objects of the assignment problem are placed in the generalized box of the top level. A first local task is executed to transition the contents of a generalized box of a higher level to at least two generalized boxes of the next lower level. A second local task is executed on the generalized boxes of the lower level to minimize a global penalty function. The first and second tasks are executed through successive iterations until all of the objects are placed in the generalized boxes in the bottom level in a layout having minimal penalty function.Type: GrantFiled: April 11, 2001Date of Patent: September 17, 2002Assignee: LSI Logic CorporationInventors: Alexander E. Andreev, Anatoli A. Bolotov, Pedja Raspopovic
-
Patent number: 6412102Abstract: The invention is directed to optimization of an initial routing that connects nets on a surface, each of the nets including plural interconnected net pins. The surface is divided into a set of areas, and a boundary pin is defined at each point on a boundary of one of the areas where the boundary of the one of the areas intersects a net. Routing optimization is then performed in at least one of the areas, the routing optimization optimizing the routing among the net pins and the boundary pins within the at least one of the areas. The invention is also directed to optimization of an initial routing that connects nets on a surface, each of the nets including plural interconnected net pins. The surface is divided into a first set of pre-defined areas, and routing optimization is performed independently in each of the pre-defined areas in the first set.Type: GrantFiled: July 22, 1998Date of Patent: June 25, 2002Assignee: LSI Logic CorporationInventors: Alexander Andreev, Ivan Pavisic, Pedja Raspopovic
-
Patent number: 6324674Abstract: A method for routing nets in an integrated circuit design, said method comprising the steps of dividing the integrated circuit design with lines in a first direction and lines in a second direction, forming a routing graph having vertices and edges, wherein vertices correspond to locations where lines in the first direction cross lines in the second direction, routing nets as a function of said routing graph with parallel processors operating substantially simultaneously, determining the relative wire congestion among different areas in the integrated circuit design, and rerouting nets passing though areas with a relatively high wire congestion.Type: GrantFiled: April 17, 1998Date of Patent: November 27, 2001Assignee: LSI Logic CorporationInventors: Alexander E. Andreev, Elyar E. Gasanov, Ranko Scepanovic, Pedja Raspopovic
-
Patent number: 6289495Abstract: A method for routing nets in an integrated circuit design, said method comprising the steps of forming a routing graph for an integrated circuit design, said routing graph have edges in a first direction and edges in a second direction, globally routing said integrated circuit design in accordance with said routing graph, dividing the routing graph into strips, for each strip in the routing graph, generating a general task for optimizing the routing in the strip, solving general tasks in parallel by assigning different processors different strips to process.Type: GrantFiled: April 17, 1998Date of Patent: September 11, 2001Assignee: LSI Logic CorporationInventors: Pedja Raspopovic, Ranko Scepanovic, Alexander E. Andreev
-
Publication number: 20010018759Abstract: A method for routing nets in an integrated circuit design, said method comprising the steps of dividing the integrated circuit design with lines in a first direction and lines in a second direction, forming a routing graph having vertices and edges, wherein vertices correspond to locations where lines in the first direction cross lines in the second direction, routing nets as a function of said routing graph with parallel processors operating substantially simultaneously, determining the relative wire congestion among different areas in the integrated circuit design, and rerouting nets passing though areas with a relatively high wire congestion.Type: ApplicationFiled: April 17, 1998Publication date: August 30, 2001Inventors: ALEXANDER E. ANDREEV, ELYAR E. GASANOV, RANKO SCEPANOVIC, PEDJA RASPOPOVIC
-
Patent number: 6269469Abstract: A method for implementing net routing for an integrated circuit design with parallel processors, said method comprising the steps of creating a character array, filling said character array with a first character, dividing a plurality of nets into groups, supplying a plurality of locks and assigning each said group its own individual lock, assigning for each net in said plurality of nets a position in the character array; and placing a second character in the position of a particular net in said character array when the net is operated on by a processor and replacing said second character with the first character after said operation is completed.Type: GrantFiled: April 17, 1998Date of Patent: July 31, 2001Assignee: LSI Logic CorporationInventors: Ivan Pavisic, Ranko Scepanovic, Pedja Raspopovic
-
Patent number: 6260183Abstract: Nets are routed on an integrated circuit device by dividing a portion of the integrated circuit device into a first group of tiles. A first routing graph is then formed as a function of the first group of tiles and nets are routed as a function of the first routing graph. A new group of tiles is formed by dividing the tiles of the first group of tiles, a new routing graph is formed as a function of the new group of tiles, and nets are rerouted as a function of the new routing graph. The steps of the preceding sentence are then repeated and each time a new group of tiles is formed, the tiles are divided in a same first dimension, resulting in tiles have progressively smaller lengths in that first dimension, while the size of the tiles in a second dimension does not change.Type: GrantFiled: April 17, 1998Date of Patent: July 10, 2001Assignee: LSI Logic CorporationInventors: Pedja Raspopovic, Ranko Scepanovic, Alexander E. Andreev
-
Patent number: 6253363Abstract: A method for routing a net on an integrated circuit device, said method comprising the steps of creating a list of basis elements of the net, said basis elements being defined by a predetermined size limitation, determining a complexity value for each basis element as a function of the distance between pins in the basis element, forming a hypertree for the net as a function of complexity values of basis elements so determined, and routing the net as a function of the hypertree.Type: GrantFiled: April 17, 1998Date of Patent: June 26, 2001Assignee: LSI Logic CorporationInventors: Elyar E. Gasanov, Ranko Scepanovic, Pedja Raspopovic, Alexander E. Andreev
-
Patent number: 6247167Abstract: The present invention provides for a method and apparatus to partition high fanout nets into smaller subnets. Said method includes the steps of identifying elementary pairs of pins in the net, each such elementary pair defining a line; eliminating lines such that a planar graph is formed; eliminating further lines such that a spanning tree is formed, said spanning tree connecting each pin in the net; identifying basic elements, each basic element forming a portion of said spanning tree; and constructing a connected cover for said net, said connected cover comprising a plurality of said basic elements.Type: GrantFiled: April 17, 1998Date of Patent: June 12, 2001Assignee: LSI Logic CorporationInventors: Pedja Raspopovic, Ranko Scepanovic, Alexander E. Andreev
-
Patent number: 6230306Abstract: A method for optimizing the routing of nets in an integrated circuit device, said method comprising the steps of dividing an integrated circuit design with lines in a first direction and lines in a second direction, wherein said first direction is substantially orthogonal to said second direction, forming a routing graph with vertices corresponding to locations where lines in said first direction and lines in said second direction cross and edges connect vertices, for each edge in a plurality of edges in said routing graph, computing an individual edge occupancy value, for an edge in said plurality of edges, computing a penalty value as a function of the individual edge occupancy value of a different edge, and routing a net as a function of said penalty value.Type: GrantFiled: April 17, 1998Date of Patent: May 8, 2001Assignee: LSI Logic CorporationInventors: Pedja Raspopovic, Ranko Scepanovic, Alexander E. Andreev
-
Patent number: 6182272Abstract: Routing layers are assigned to connection segments in integrated circuit design. A routing description that includes connection segments and a vertex where at least two of the connection segments connect to each other is obtained. A penalty is determined for the vertex based on a potential layer assignment combination for the connection segments that connect at the vertex, and routing layers are assigned to the connection segments based on the determined penalty.Type: GrantFiled: July 16, 1998Date of Patent: January 30, 2001Assignee: LSI Logic CorporationInventors: Alexander Andreev, Ivan Pavisic, Pedja Raspopovic
-
Patent number: 6175950Abstract: Net routing is optimized in an integrated circuit device by dividing an integrated circuit design with a first group of substantially parallel lines in a first direction and with a group of substantially parallel lines in a second direction, with the second direction being substantially perpendicular to the first direction. A first routing graph is formed with vertices corresponding to locations where lines in the first direction and lines in the second direction cross, and nets are globally routed as a function of the first routing graph. The integrated circuit design is further subdivided with a second group of substantially parallel lines in the first direction, and a second routing graph is formed with vertices corresponding to locations where lines in the first and second groups of substantially parallel lines in the first direction cross lines in the group of substantially parallel lines in the second direction.Type: GrantFiled: April 17, 1998Date of Patent: January 16, 2001Assignee: LSI Logic CorporationInventors: Ranko Scepanovic, Alexander E. Andreev, Elyar E. Gasanov, Pedja Raspopovic