Patents by Inventor Patrick Eichenseer

Patrick Eichenseer 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).

  • Publication number: 20080016485
    Abstract: Aspects for designing a timing closure of an integrated circuit include instantiating a minimum repeater between at least one block and a corresponding blockage if an interconnect crosses the corresponding blockage and according to a drive of the blockage. The aspects further include instantiating one or more smallest repeaters between at least one pair of connected blocks depending upon a drive of a corresponding interconnect, the instantiation of the smallest repeater being based on pre-determined criteria.
    Type: Application
    Filed: July 18, 2007
    Publication date: January 17, 2008
    Inventors: Patrick Eichenseer, Ricky Lewelling, Ziad Sadi
  • Publication number: 20060288319
    Abstract: Aspects for designing a timing closure of an integrated circuit include instantiating a minimum repeater between at least one block and a corresponding blockage if an interconnect crosses the corresponding blockage and according to a drive of the blockage. The aspects further include instantiating one or more smallest repeaters between at least one pair of connected blocks depending upon a drive of a corresponding interconnect, the instantiation of the smallest repeater being based on pre-determined criteria.
    Type: Application
    Filed: June 21, 2005
    Publication date: December 21, 2006
    Inventors: Patrick Eichenseer, Rickly Lewelling, Ziad Sadi
  • Publication number: 20060031803
    Abstract: In accordance with a method for generating a trial placement plan for an IC having two or more identical modules, a floor plan reserves a separate area of identical size and shape for each of the identical modules, one of which is designated a “master module” and the others designated “clone modules”. A placement and routing (P&R) tool initially places all of the cell instances of the clone modules at the center of their reserved areas. The P&R tool then employs a conventional placement algorithm to iteratively adjust positions of cell instances of all other modules, including the master module within their reserved areas in a manner that tries to minimize net lengths. The P&R tool copies the placement within the master module area into the clone module areas either after every N>0 iterations of the placement algorithm and/or after the placement algorithm has completed placement for the master module area.
    Type: Application
    Filed: July 23, 2004
    Publication date: February 9, 2006
    Inventors: Patrick Eichenseer, Hsi-Chuan Chen, Dennis Huang