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: 6154874
    Abstract: An object of the present invention is to provide 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: November 28, 2000
    Assignee: LSI Logic Corporation
    Inventors: Ranko Scepanovic, Alexander E. Andreev, Pedja Raspopovic
  • Patent number: 6134702
    Abstract: A process for designing an integrated circuit chip includes specifying a set of cells, a set of wiring nets for interconnecting the cells, and a set of regions on the chip in which the cells are to be placed. An assignment of the cells of the set to the regions is generated, and the set of cells is randomly divided into a first subset of cells which remain in the assignment, and a second subset of cells which are removed from the assignment. Penalties are computed for assigning the cells of the second subset to the regions respectively, and the cells of the second subset are assigned to the regions such that a total penalty thereof is minimized. The process is repeated iteratively with the size of the second subset being progressively reduced relative to the size of the first subset until an end criterion is reached.
    Type: Grant
    Filed: December 16, 1997
    Date of Patent: October 17, 2000
    Assignee: LSI Logic Corporation
    Inventors: Ranko Scepanovic, James S. Koford, Valeriy B. Kudryavtsev, Alexander E. Andreev, Stanislav V. Aleshin, Alexander S. Podkolzin
  • Patent number: 6123736
    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 placement of the cell and the wire routine be done correctly to avoid any congestion of wires. Placement of the cells and the routing of the wires to avoid congestion can be accomplished by determining congestion of various regions, or pieces, of the IC's after an initial placement of the cells and routing of the wires. The present invention discloses a method and apparatus to define the regions, or pieces, of the IC, determine various density measurement of the pieces, and adjust the sizes of the pieces to reduce congestion of congested pieces by reallocating space from uncongested pieces to congested pieces.
    Type: Grant
    Filed: August 6, 1997
    Date of Patent: September 26, 2000
    Assignee: LSI Logic Corporation
    Inventors: Ivan Pavisic, Ranko Scepanovic, Alexander E. Andreev
  • Patent number: 6109201
    Abstract: Integrated circuit chips (IC's) require proper placement of many cells (groups of circuit components) and complex routing of wires to connect the cells. Designing of the IC's require meeting real-world constraints one of which is the performance of the IC, or the period of time required by the integrated circuit to produce the output signals from the time the input signals are available. Typically, the performance of an integrated circuit is determined by the slowest path of the signals, called the critical path. The critical path is usually only a small portion of the IC. The present invention discloses a method and apparatus for transforming the circuits comprising the critical path, thereby increasing the performance of the entire IC. The transformation is performed by segmenting, or blocking, the cells which make up the critical path. Then, each block is transformed, or replaced, with a resynthesized circuit to which both the digital 0 and digital 1 values are provided.
    Type: Grant
    Filed: January 21, 1998
    Date of Patent: August 29, 2000
    Assignee: LSI Logic Corporation
    Inventors: Dusan Petranovic, Ranko Scepanovic, Stanislav V. Aleshin, Mikhail Grinchuk, Sergei Gashov
  • Patent number: 6097073
    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.degree.. 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: August 21, 1995
    Date of Patent: August 1, 2000
    Assignee: LSI Logic Corporation
    Inventors: Michael D. Rostoker, James S. Koford, Ranko Scepanovic, Edwin R. Jones, Gobi R. Padmanahben, Ashok K. Kapoor, Valeriy B. Kudryavtsev, Alexander E. Andreev, Stanislav V. Aleshin, Alexander S. Podkolzin
  • Patent number: 6085032
    Abstract: A system for optimizing placement of cells a surface of a semiconductor chip divided into regions is provided herein. The system repetitively calculates affinities for relocating cells to alternate regions, repositioning cells having a maximum affinity greater than a predetermined threshold to the region providing the maximum affinity for the cell based on an influence parameter. The system then alters the influence parameter and repeats the previous functions for a predetermined number of times.
    Type: Grant
    Filed: June 28, 1996
    Date of Patent: July 4, 2000
    Assignee: LSI Logic Corporation
    Inventors: Ranko Scepanovic, James S. Koford, Alexander E. Andreev
  • Patent number: 6075933
    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 placement of the cell and the wire routine be done correctly to avoid any congestion of wires. The present invention discloses method and apparatus to optimize the cell density of the segments of columns on the IC. To optimize the segment or column density, the present columns densities are calculated, and the desired densities are determined. Then, the amount and the location of the of cell overload is found. The cells of the overloaded columns are spread out the neighboring columns. The reassignment of the cells are performed to minimize the distance, therefore the affect, of the relocation.
    Type: Grant
    Filed: August 6, 1997
    Date of Patent: June 13, 2000
    Assignee: LSI Logic Corporation
    Inventors: Ivan Pavisic, Ranko Scepanovic, Alexander E. Andreev
  • Patent number: 6068662
    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 placement of the cell and the wire routine be done correctly to avoid any congestion of wires. The present invention discloses method and apparatus to reduce or to eliminate cell placement and wire routing congestion. The congestion reduction is achieved by first examining regions of the IC to determine whether horizontal or vertical congestion exists. If horizontal congestion exists, then the cells are moved, within the columns, vertically to give more room for the cells and in between the cells for the routing of the wires. If vertical congestion exists, then the cells are moved to different columns to alleviate congestion.
    Type: Grant
    Filed: August 6, 1997
    Date of Patent: May 30, 2000
    Assignee: LSI Logig Corporation
    Inventors: Ranko Scepanovic, Alexander E. Andreev, Ivan Pavisic
  • Patent number: 6070108
    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. Placement of the cells and the routing of the wires to avoid congestion can be accomplished by determining congestion of various regions of the IC's after an initial placement of the cells and routing of the wires. The present invention discloses a method and apparatus to determine the congestion of the regions and a technique to increase the fictive heights (or, the "working height", or the "working size") of the cells for repeating the placement of the cells if the current placement and routing leads to congestion. The present invention provides for a method of defining regions and line segment.
    Type: Grant
    Filed: August 6, 1997
    Date of Patent: May 30, 2000
    Assignee: LSI Logic Corporation
    Inventors: Alexander E. Andreev, Ivan Pavisic, Ranko Scepanovic
  • Patent number: 6067409
    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: February 11, 1997
    Date of Patent: May 23, 2000
    Assignee: LSI Logic Corporation
    Inventors: Ranko Scepanovic, Ivan Pavisic, James S. Koford, Alexander E. Andreev, Edwin Jones
  • Patent number: 6058254
    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 placement of the cell and the wire routine be done correctly to avoid any congestion of wires. The present invention discloses method and apparatus to reduce or to eliminate cell placement and wire routing congestion. To reduce vertical congestion, the cells are moved from congested regions to uncongested regions. The present invention discloses techniques of defining regions as pieces and columns, determining the level of congestion in the regions, and the methods of moving the cells to different columns to reduce congestion while minimizing affects to wire routing. The movement of the cells to other columns may create overlapping of the cells or overloading of the columns.
    Type: Grant
    Filed: August 6, 1997
    Date of Patent: May 2, 2000
    Assignee: LSI Logic Corporation
    Inventors: Ranko Scepanovic, Alexander E. Andreev, Ivan Pavisic
  • Patent number: 6038385
    Abstract: A cell placement for an integrated circuit chip is divided into two "chessboard" patterns or "jiggles". Each pattern resembles a chessboard in that it consists of alternating regions of different types or "colors" such that no region of a given color has an edge common with another region of the same color. The jiggles are offset relative to each other such that the regions of one jiggle partially overlap at least two regions of the other jiggle. A placement improvement operation such as simulated annealing is performed sequentially for each color of each jiggle. During each operation, a plurality of parallel processors operate on the regions simultaneously using a previous copy of the entire chip, with one processor being assigned to one or more regions. At the end of each operation, the copy of the chip is updated. The chessboard patterns eliminate unproductive cell moves resulting from adjacent regions having a common edge.
    Type: Grant
    Filed: March 1, 1996
    Date of Patent: March 14, 2000
    Assignee: LSI Logic Corporation
    Inventors: Ranko Scepanovic, James S. Koford, Alexander E. Andreev, Ivan Pavisic
  • Patent number: 6030110
    Abstract: A system for proportionally partitioning multiple groups of cells on the surface of a semiconductor chip into subregions is disclosed herein. The cell groups are separated by dividing lines, and the system comprising a calculator which determines an offset of the cut line from the dividing line; a shifter which moves the location of said groups of cells by the offset such that the cut line coincides with the dividing line; and an overflow evaluator and compensator which shifts any cells outside said region to an edge of said region.
    Type: Grant
    Filed: June 28, 1996
    Date of Patent: February 29, 2000
    Assignee: LSI Logic Corporation
    Inventors: Ranko Scepanovic, James S. Koford, Alexander E. Andreev
  • Patent number: 6026223
    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: June 28, 1996
    Date of Patent: February 15, 2000
    Inventors: Ranko Scepanovic, James S. Koford, Alexander E. Andreev
  • Patent number: 6000038
    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. Because of the large number of cells and nets of an IC, the process of determining IC delay of an IC design requires a lot of time. The present invention discloses a method and apparatus for determining the IC delay quickly by using multiple processors and analyzing multiple pins simultaneously. Also disclosed is the method of ordering the pins to allow the application of the parallel processing technique.
    Type: Grant
    Filed: November 5, 1997
    Date of Patent: December 7, 1999
    Assignee: LSI Logic Corporation
    Inventors: Ranko Scepanovic, Alexander E. Andreev, Ivan Pavisic
  • Patent number: 5973376
    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.degree.. 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: August 21, 1995
    Date of Patent: October 26, 1999
    Assignee: LSI Logic Corporation
    Inventors: Michael D. Rostoker, James S. Koford, Ranko Scepanovic, Edwin R. Jones, Gobi R. Padmanahben, Ashok K. Kapoor, Valeriy B. Kudryavtsev, Alexander E. Andreev, Stanislav V. Aleshin, Alexander S. Podkolzin
  • Patent number: 5971588
    Abstract: A system for providing an optimal cluster of cells on the surface of a semiconductor chip is provided herein. The system collects a predetermined quantity of cells, this predetermined quantity containing a center cell, and all cells are assigned a distance value from the center cell. A coordinate is assigned to each cell based on its associated distance value, and new cell positions are calculated based on related cell positions and weights associated with each cell.
    Type: Grant
    Filed: June 28, 1996
    Date of Patent: October 26, 1999
    Assignee: LSI Logic Corporation
    Inventors: Ranko Scepanovic, James S. Koford, Alexander E. Andreev
  • Patent number: 5963975
    Abstract: The capacity of a cache memory is substantially reduced over that required for a multi-chip distributed shared memory (DSM) implementation to enable the cache memory, a main memory, a processor and requisite logic and control circuitry to fit on a single integrated circuit chip. The increased cache miss rate created by the reduced cache memory capacity is compensated for by the reduced cache miss resolution period resulting from integrating the main memory and processor on the single chip. The reduced cache miss resolution period enables the processor clock rate to be substantially increased, so that a processor having a simple functionality such as a reduced instruction set computer (RISC) processor can be utilized and still provide the required processing speed.
    Type: Grant
    Filed: September 17, 1997
    Date of Patent: October 5, 1999
    Assignee: LSI Logic Corporation
    Inventors: Douglas B. Boyle, James S. Koford, Edwin R. Jones, Ranko Scepanovic, Michael D. Rostoker
  • Patent number: 5963455
    Abstract: A system for optimizing placement of a cell on a surface of a semiconductor chip is disclosed herein. The cells may belong to nets and may belong to neighborhoods. The system initially calculates affinities based on repositioning the cell. The system then combines affinities and repositions cells based on these combined affinities. The system then computes a cost function and repeats the combining, repositioning, and computing functions a predetermined number of times.
    Type: Grant
    Filed: June 28, 1996
    Date of Patent: October 5, 1999
    Assignee: LSI Logic Corporation
    Inventors: Ranko Scepanovic, James S. Koford, Alexander E. Andreev
  • Patent number: 5930500
    Abstract: A method for maximizing effectiveness of parallel processing, using multiple processors, to connect pins of a net of an integrated circuit is disclosed. The method requires the pins to be partitioned into sets of pins and the sets of pins to be further partitioned into meta-sets of the sets of pins. The sets and the meta-sets are connected using a minimal spanning tree algorithm, and the connected sets are made to share a pin, thereby ensuring that the whole net is interconnected without creating a loop in the routing. In addition, because the partitions and the sets of partitions average approximately the same number of pins, the work load can easily be balanced between the processors.
    Type: Grant
    Filed: February 11, 1997
    Date of Patent: July 27, 1999
    Assignee: LSI Logic Corporation
    Inventors: Ranko Scepanovic, Edwin Jones, Alexander E. Andreev