Inventor
WARD SAMUEL I
US29 patents
⚠️ This page may combine multiple inventors who share the name “WARD SAMUEL I”. Patents are grouped by organization below to help distinguish them — per-person disambiguation is on the roadmap.
IBM
15 patentsUS8014215B2Sep 6, 2011
Cache array power savings through a design structure for valid bit detection
IBM9 citations84
US8365075B2Jan 29, 2013
Recording events in a virtual world
IBM5 citations83
US8661391B1Feb 25, 2014
Spare cell insertion based on reachable state analysis
IBM11 citations82
US8028266B2Sep 27, 2011
System and method for automated placement in custom VLSI circuit design with schematic-driven placement
IBM10 citations81
US8006152B2Aug 23, 2011
Scan chain fail diagnostics
IBM10 citations80
US9147032B2Sep 29, 2015
Machine-learning based datapath extraction
IBM4 citations73
US9043738B2May 26, 2015
Machine-learning based datapath extraction
IBM3 citations63
US8782589B1Jul 15, 2014
Soft pin insertion during physical design
IBM2 citations61
US8028265B2Sep 27, 2011
System and method for improved placement in custom VLSI circuit design with schematic-driven placement
IBM5 citations60
US10091454B2Oct 2, 2018
Recording events in a virtual world
IBM0 citations51
US7673204B2Mar 2, 2010
Method using non-linear compression to generate a set of test vectors for use in scan testing an integrated circuit
IBM1 citations43
US7975194B2Jul 5, 2011
System and method for adaptive nonlinear test vector compression
IBM0 citations42
US8386230B2Feb 26, 2013
Circuit design optimization
IBM0 citations40
US7930610B2Apr 19, 2011
System and method for power reduction through power aware latch weighting of complex sub-circuits
IBM0 citations38
US7925948B2Apr 12, 2011
System and method for power reduction through power aware latch weighting
IBM0 citations38
WARD SAMUEL I
3 patentsUS8589855B1Nov 19, 2013
Machine-learning based datapath extraction
WARD SAMUEL I15 citations91
US8443313B2May 14, 2013
Circuit design optimization
WARD SAMUEL I7 citations81
US8621411B1Dec 31, 2013
Generating and selecting bit-stack candidates from a graph using dynamic programming
WARD SAMUEL I4 citations61