Patents by Inventor Sanjeev Saluja

Sanjeev Saluja 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).

  • Reducing datapath widths by rebalancing data flow topology
    Patent number: 6832357
    Abstract: A Huffman algorithm is applied to revise the topology of a data flow graph. The result of the application of the algorithm is an increase in the sizes of at least some clusters (i.e., enhanced mergeability). The Huffman rebalancing of the topology may also result in the benefit of allowing further pruning of the bitwidths of data flow paths, which may further enhance mergeability. Thus, the algorithm may be applied with a maximum information content analysis.
    Type: Grant
    Filed: June 17, 2002
    Date of Patent: December 14, 2004
    Assignee: Cadence Design Systems, Inc.
    Inventors: Sanjeev Saluja, Anmol Mathur
  • Procedure for optimizing mergeability and datapath widths of data flow graphs
    Patent number: 6807651
    Abstract: Required precision and information content of datapath signals are used to define functionally safe transformations on data flow graphs. These transformations reduce widths of datapath operators and edges and enhance the mergeability of operators. An algorithm for optimally balancing data flow graph topology to further reduce the data path widths and further enhance mergeability is combined with the above in an iterative algorithm for optimizing DFGs.
    Type: Grant
    Filed: June 17, 2002
    Date of Patent: October 19, 2004
    Assignee: Cadence Design Systems, Inc.
    Inventors: Sanjeev Saluja, Anmol Mathur
  • Enhancing mergeability of datapaths and reducing datapath widths responsively to required precision
    Patent number: 6772399
    Abstract: A practical definition for determining a required precision is provided and used to reduce the widths of operators and edges of data flow graphs. A bottom-up procedure for systematically pruning data flow graphs is described. The result is shown to enhance the mergeability of subgraphs and provide reduced data path widths. This may result in lower area, power requirements and other benefits as readily understood in the field of circuit design.
    Type: Grant
    Filed: June 17, 2002
    Date of Patent: August 3, 2004
    Assignee: Cadence Design Systems, Inc.
    Inventors: Sanjeev Saluja, Anmol Mathur
  • Reducing datapath widths responsively to upper bound on information content
    Patent number: 6772398
    Abstract: A practical definition for determining an upper bound on information content is provided and used to reduce the widths of operators and edges of data flow graphs. A top down procedure for systematically pruning data flow graphs is described. The result is shown to enhance the mergeability of subgraphs and provide reduced data path widths. This may result in lower area, power requirements and other benefits as readily understood in the field of circuit design.
    Type: Grant
    Filed: June 17, 2002
    Date of Patent: August 3, 2004
    Assignee: Cadence Design Systems, Inc.
    Inventors: Sanjeev Saluja, Anmol Mathur
  • Enhancing mergeability of datapaths and reducing datapath widths responsively to required precision
    Publication number: 20030061577
    Abstract: A practical definition for determining a required precision is provided and used to reduce the widths of operators and edges of data flow graphs. A bottom-up procedure for systematically pruning data flow graphs is described. The result is shown to enhance the mergeability of subgraphs and provide reduced data path widths. This may result in lower area, power requirements and other benefits as readily understood in the field of circuit design.
    Type: Application
    Filed: June 17, 2002
    Publication date: March 27, 2003
    Inventors: Sanjeev Saluja, Anmol Mathur
  • Enhancing mergeability of datapaths and reducing datapath widths by rebalancing data flow topology
    Publication number: 20030061575
    Abstract: A Huffman algorithm is applied to revise the topology of a data flow graph. The result of the application of the algorithm is an increase in the sizes of at least some clusters (i.e., enhanced mergeability). The Huffman rebalancing of the topology may also result in the benefit of allowing further pruning of the bitwidths of data flow paths, which may further enhance mergeability. Thus, the algorithm may be applied with a maximum information content analysis.
    Type: Application
    Filed: June 17, 2002
    Publication date: March 27, 2003
    Inventors: Sanjeev Saluja, Anmol Mathur
  • Procedure for optimizingmergeability and datapath widths of data flow graphs
    Publication number: 20030061574
    Abstract: Required precision and information content of datapath signals are used to define functionally safe transformations on data flow graphs. These transformations reduce widths of datapath operators and edges and enhance the mergeability of operators. An algorithm for optimally balancing data flow graph topology to further reduce the data path widths and further enhance mergeability is combined with the above in an iterative algorithm for optimizing DFGs.
    Type: Application
    Filed: June 17, 2002
    Publication date: March 27, 2003
    Inventors: Sanjeev Saluja, Anmol Mathur
  • Enhancing mergeability of datapaths and reducing datapath widths responsively to upper bound on information content
    Publication number: 20030061576
    Abstract: A practical definition for determining an upper bound on information content is provided and used to reduce the widths of operators and edges of data flow graphs. A top down procedure for systematically pruning data flow graphs is described. The result is shown to enhance the mergeability of subgraphs and provide reduced data path widths. This may result in lower area, power requirements and other benefits as readily understood in the field of circuit design.
    Type: Application
    Filed: June 17, 2002
    Publication date: March 27, 2003
    Inventors: Sanjeev Saluja, Anmol Mathur