Patents by Inventor Kanad Basu

Kanad Basu 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: 9218447
    Abstract: Crosstalk effects can be taken into account in automatic test pattern generation (ATPG) by providing crosstalk fault models, determining paths and/or nodes to be sensitized to activate each crosstalk fault, and optimizing to enable as many crosstalk faults as possible with a given pattern, subject to constraints. Constraints can include threshold numbers of endpoints/observation points and/or attempts to sensitize. Intermediate nodes in a crosstalk fault model path to an observation point can also be determined and/or sensitized.
    Type: Grant
    Filed: January 10, 2014
    Date of Patent: December 22, 2015
    Assignee: International Business Machines Corporation
    Inventors: Kanad Basu, Raghu Gaurav GopalaKrishnaSetty, Hari Krishnan Rajeev
  • Publication number: 20150199466
    Abstract: Crosstalk effects can be taken into account in automatic test pattern generation (ATPG) by providing crosstalk fault models, determining paths and/or nodes to be sensitized to activate each crosstalk fault, and optimizing to enable as many crosstalk faults as possible with a given pattern, subject to constraints. Constraints can include threshold numbers of endpoints/observation points and/or attempts to sensitize. Intermediate nodes in a crosstalk fault model path to an observation point can also be determined and/or sensitized.
    Type: Application
    Filed: January 10, 2014
    Publication date: July 16, 2015
    Applicant: International Business Machines Corporation
    Inventors: Kanad Basu, Raghu Gaurav GopalaKrishnaSetty, Hari Krishnan Rajeev
  • Publication number: 20100223237
    Abstract: A method, information processing system, and computer program storage product store data in an information processing system. Uncompressed data is received and the uncompressed data is divided into a series of vectors. A sequence of profitable bitmask patterns is identified for the vectors that maximizes compression efficiency while minimizes decompression penalty. Matching patterns are created using multiple bit masks based on a set of maximum values of the frequency distribution of the vectors. A dictionary is built based upon the set of maximum values in the frequency distribution and a bit mask savings which is a number of bits reduced using each of the multiple bit masks. Each of the vectors is compressed using the dictionary and the matching patterns with having high bit mask savings. The compressed vectors are stored into memory. Also, an efficient placement is developed to enable parallel decompression of the compressed codes.
    Type: Application
    Filed: November 5, 2008
    Publication date: September 2, 2010
    Applicant: University of Florida Research Foundation, Inc.
    Inventors: Prabhat Mishra, Seok-Won Seong, Kanad Basu, Weixun Wang, Xiaoke Qin, Chetan Murthy