Patents by Inventor Ranko Scepanovic

Ranko Scepanovic 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: 6312980
    Abstract: Several inventions are disclosed. A cell architecture using hexagonal shaped cells is disclosed. The architecture is not limited to hexagonal shaped cells. Cells may be defined by clusters of two or more hexagons, by triangles, by parallelograms, and by other polygons enabling a variety of cell shapes to be accommodated. Polydirectional non-orthogonal three layer metal routing is disclosed. The architecture may be combined with the tri-directional routing for a particularly advantageous design. In the tri-directional routing arraingement, electrical conductors for interconnecting terminals of microelectronic cells of an integrated circuit preferrably extend in three directions that are angularly displaced from each other by 60°. The conductors that extend in the three directions are preferrably formed in three different layers. A method of minimizing wire length in a semiconductor device is disclosed. A method of minimizing intermetal capacitance in a semiconductor device is disclosed.
    Type: Grant
    Filed: June 5, 1998
    Date of Patent: November 6, 2001
    Assignee: LSI Logic Corporation
    Inventors: Michael D. Rostoker, James S. Koford, Ranko Scepanovic, Edwin R. Jones, Gobi R. Padmanahben, Ashok K. Kapoor, Valeriv B. Kudryavtsev, Alexander E. Andreev, Stanislav V. Aleshin, Alexander S. Podkolzin
  • Patent number: 6292924
    Abstract: Integrated circuit chips (IC's) require proper placement of many cells (groups of circuit components) and complex routing of wires to connect the pins of the cells. Designing of the IC's require meeting real-world constraints such as minimization of the circuit area, minimization of wire length within the circuit, and minimization of the time the IC requires to perform its function, referred to as the IC delay. In order to design circuits to meet a given set of requirements, each signal path of the circuit must be analyzed. Because of the large number of the cells and the complex connections, the number of paths is very large and requires much computing power to analyze. Also, some of the paths are not important for the purposes of the operations of the chip and can be discounted during the analysis process. The present invention discloses a method and apparatus used to avoid analyzing non-important paths, referred to as false paths of a directed timing graph.
    Type: Grant
    Filed: November 5, 1997
    Date of Patent: September 18, 2001
    Assignee: LSI Logic Corporation
    Inventors: Ivan Pavisic, Anatoli A. Bolotov, Alexander E. Andreev, Ranko Scepanovic
  • Patent number: 6292929
    Abstract: A system for determining an affinity associated with relocating a cell located on a surface of a semiconductor chip to a different location on the surface is disclosed herein. Each cell may be part of a cell net containing multiple cells. The system initially defines a bounding box containing all cells in the net which contains the cell. The system then establishes a penalty vector based on the bounding box and borders of a region containing the cell, computes a normalized sum of penalties for all nets having the cell as a member, and calculates the affinity based on the normalized sum of penalties. Also included in the disclosed system are methods and apparatus for capacity and utilization planning of the use of the floor, or the surface area, and the methods and apparatus for parallelizing the process of affinity based placements using multiple processors. Finally, method and apparatus for connecting the cells based on a Steiner Tree method is disclosed.
    Type: Grant
    Filed: November 22, 1999
    Date of Patent: September 18, 2001
    Assignee: LSI Logic Corporation
    Inventors: Ranko Scepanovic, Ivan Pavisic, James S. Koford, Alexander E. Andreev, Edwin Jones
  • Patent number: 6289495
    Abstract: 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: Grant
    Filed: April 17, 1998
    Date of Patent: September 11, 2001
    Assignee: LSI Logic Corporation
    Inventors: Pedja Raspopovic, Ranko Scepanovic, Alexander E. Andreev
  • Publication number: 20010020289
    Abstract: Integrated circuit chips (IC's) require proper placement of many cells (groups of circuit components) and complex routing of wires to connect the pins of the cells. Designing of the IC's require meeting real-world constraints such as minimization of the circuit area, minimization of wire length within the circuit, and minimization of the time the IC requires to perform its function, referred to as the IC delay. In order to design circuits to meet a given set of requirements, each signal path of the circuit must be analyzed. Because of the large number of the cells and the complex connections, the number of paths is very large and requires much computing power to analyze. Also, some of the paths are not important for the purposes of the operations of the chip and can be discounted during the analysis process. The present invention discloses a method and apparatus used to avoid analyzing non-important paths, referred to as false paths of a directed timing graph.
    Type: Application
    Filed: November 5, 1997
    Publication date: September 6, 2001
    Inventors: IVAN PAVISIC, ALEXANDER ANDREEV, RANKO SCEPANOVIC, ANATOLI BOLOTOV
  • Publication number: 20010018759
    Abstract: 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: Application
    Filed: April 17, 1998
    Publication date: August 30, 2001
    Inventors: ALEXANDER E. ANDREEV, ELYAR E. GASANOV, RANKO SCEPANOVIC, PEDJA RASPOPOVIC
  • Patent number: 6269469
    Abstract: 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: Grant
    Filed: April 17, 1998
    Date of Patent: July 31, 2001
    Assignee: LSI Logic Corporation
    Inventors: Ivan Pavisic, Ranko Scepanovic, Pedja Raspopovic
  • Patent number: 6260183
    Abstract: 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: Grant
    Filed: April 17, 1998
    Date of Patent: July 10, 2001
    Assignee: LSI Logic Corporation
    Inventors: Pedja Raspopovic, Ranko Scepanovic, Alexander E. Andreev
  • Patent number: 6253363
    Abstract: 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: Grant
    Filed: April 17, 1998
    Date of Patent: June 26, 2001
    Assignee: LSI Logic Corporation
    Inventors: Elyar E. Gasanov, Ranko Scepanovic, Pedja Raspopovic, Alexander E. Andreev
  • Publication number: 20010003843
    Abstract: A system for determining an affinity associated with relocating a cell located on a surface of a semiconductor chip to a different location on the surface is disclosed herein. Each cell may be part of a cell net containing multiple cells. The system initially defines a bounding box containing all cells in the net which contains the cell. The system then establishes a penalty vector based on the bounding box and borders of a region containing the cell, computes a normalized sum of penalties for all nets having the cell as a member, and calculates the affinity based on the normalized sum of penalties. Also included in the disclosed system are methods and apparatus for capacity and utilization planning of the use of the floor, or the surface area, and the methods and apparatus for parallelizing the process of affinity based placements using multiple processors. Finally, method and apparatus for connecting the cells based on a Steiner Tree method is disclosed.
    Type: Application
    Filed: November 22, 1999
    Publication date: June 14, 2001
    Inventors: RANKO SCEPANOVIC, IVAN PAVISIC, JAMES S KOFORD, ALEXANDER E ANDREEV, EDWIN JONES
  • Patent number: 6247167
    Abstract: 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: Grant
    Filed: April 17, 1998
    Date of Patent: June 12, 2001
    Assignee: LSI Logic Corporation
    Inventors: Pedja Raspopovic, Ranko Scepanovic, Alexander E. Andreev
  • Patent number: 6230306
    Abstract: 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: Grant
    Filed: April 17, 1998
    Date of Patent: May 8, 2001
    Assignee: LSI Logic Corporation
    Inventors: Pedja Raspopovic, Ranko Scepanovic, Alexander E. Andreev
  • Patent number: 6223332
    Abstract: A method for refining the position of linearly aligned cells on the surface of a semiconductor chip is disclosed herein. The method comprises defining an array of spaces between cells based on maximum and minimum cell positions, establishing a minimum spacing between cells, and linearly shifting cells in a predetermined manner such that no cells are closer to one another than the minimum spacing between cells. Linear shifting is accomplished by shifting any cell in a positive direction if the spacing associated the cell is less than the minimum spacing between cells; shifting any cell in a negative direction if the spacing associated with the cell is greater than the minimum spacing between cells, but only if all cells on the negative side of the cell have been shifted in their maximum negative direction; and performing positive shifting and negative shifting until all cells have been shifted such that no space between cells is less than the negative space between cells.
    Type: Grant
    Filed: February 14, 2000
    Date of Patent: April 24, 2001
    Assignee: LSI Logic Corporation
    Inventors: Ranko Scepanovic, James S. Koford, Alexander E. Andreev
  • Patent number: 6197456
    Abstract: A mask is provided which has a complex transmission function and which includes a transparent layer and a non-transparent layer. The transparent layer has three types of phase-shifting elements, each imparting a different phase shift relative to the others, with the phase-shifting elements alternating in both x and y dimensions. The non-transparent layer has holes arranged in an approximately equally spaced grid pattern defined by common points in borders of the phase-shifting elements. Centers of at least two holes in the non-transparent layer have different offsets from their corresponding common points. Also provided is a mask blank which includes a transparent layer and a non-transparent layer. The transparent layer has three types of phase-shifting elements, each imparting a different phase shift relative to the others, with the phase-shifting elements alternating in both x and y dimensions.
    Type: Grant
    Filed: January 19, 1999
    Date of Patent: March 6, 2001
    Assignee: LSI Logic Corporation
    Inventors: Stanislav V. Aleshin, Genadij V. Belokopitov, Ranko Scepanovic
  • Patent number: 6186676
    Abstract: Integrated circuit chips (IC's) require proper placement of many cells (groups of circuit components) and complex routing of wires to connect the pins of the cells. Because of the large number of the cells and the complex connections required, it is essential that wire routine be done correctly to avoid any congestion of wires. Congestion of wires can be determined by actually routing of the wires to connect the cells; however, the routing process is computationally expensive. For determination of congestion, the only required information are the location of the connections, or edges, to connect the pins of the IC. The present invention discloses a method to quickly provide a good estimate of the location of the edges, or connections for an IC. The present invention provides for a method to determine all the edges and superedges (bounding boxes, or areas where an edge will take space) of an IC without requiring to determine the actual routing of the wires of an IC.
    Type: Grant
    Filed: August 6, 1997
    Date of Patent: February 13, 2001
    Assignee: LSI Logic Corporation
    Inventors: Alexander E. Andreev, Ivan Pavisic, Ranko Scepanovic
  • Patent number: 6175950
    Abstract: 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: Grant
    Filed: April 17, 1998
    Date of Patent: January 16, 2001
    Assignee: LSI Logic Corporation
    Inventors: Ranko Scepanovic, Alexander E. Andreev, Elyar E. Gasanov, Pedja Raspopovic
  • Patent number: 6174630
    Abstract: The present invention is a method and apparatus for applying one-dimensional proximity correction to a piece of a mask pattern, by segmenting a first piece of a mask pattern with horizontal dividing lines into a plurality of segments, segmenting a second piece of said mask pattern with said horizontal dividing lines into a second plurality of segments, and applying proximity correction to a first segment from said first plurality of segments taking into consideration a second segment from said second plurality of segments.
    Type: Grant
    Filed: March 3, 1998
    Date of Patent: January 16, 2001
    Assignee: LSI Logic Corporation
    Inventors: Dusan Petranovic, Ranko Scepanovic, Edwin Jones, Richard Schinella, Nicholas F. Pasch, Mario Garza, Keith K. Chao, John V. Jensen, Nicholas K. Eib
  • Patent number: 6175953
    Abstract: The present invention is a method and apparatus for systematically applying proximity corrections to a mask pattern, wherein the pattern is divided into a grid of equally sized grid rectangles, an inner rectangle comprising a plurality of grid rectangles is formed, an outer rectangle comprising a second plurality of grid rectangles and the inner rectangle is formed and proximity correction is applied to the pattern contained within the inner rectangle as a function of the pattern contained within the outer rectangle.
    Type: Grant
    Filed: March 3, 1998
    Date of Patent: January 16, 2001
    Assignee: LSI Logic Corporation
    Inventors: Ranko Scepanovic, Dusan Petranovic, Edwin Jones, Richard Schinella, Nicholas F. Pasch, Mario Garza, Keith K. Chao, John V. Jensen, Nicholas K. Eib
  • Patent number: 6171731
    Abstract: An aerial image produced by a mask having transmissive portions is simulated by dividing the transmissive portions of the mask into primitive elements and obtaining a spatial frequency function corresponding to each of the primitive elements. The spatial frequency functions corresponding to the primitive elements are combined to obtain a transformed mask transmission function, and the transformed mask transmission function is utilized to generate a simulation of the aerial image.
    Type: Grant
    Filed: January 20, 1999
    Date of Patent: January 9, 2001
    Assignee: LSI Logic Corporation
    Inventors: Marina G. Medvedeva, Ranko Scepanovic, Dusan Petranovic
  • Patent number: 6155725
    Abstract: A large number of possible cell placements for an integrated circuit chip are evaluated to determine which has the highest fitness in accordance with a predetermined criteria such as interconnect congestion. Each cell placement, which constitutes an individual permutation of cells from a population of possible permutations, is represented as an initial cell placement in combination with a list of individual cell transpositions or swaps by which the cell placement can be derived from the initial cell placement. A cell placement can be genetically mutated and/or inverted by adding swaps to the list for its cell placement which designates cells to be transposed. Genetic crossover can be performed by transposing swaps between the lists for two cell placements. This cell representation and transposition method enables any type of cell transposition to be performed without loss or duplication of cells or generation of illegal placements.
    Type: Grant
    Filed: April 19, 1994
    Date of Patent: December 5, 2000
    Assignee: LSI Logic Corporation
    Inventors: Ranko Scepanovic, James S Koford, Edwin R. Jones, Douglas B. Boyle, Michael D. Rostoker