Jason R Baumgartner

US Patent:

6438556, Aug 20, 2002

Filed:

Dec 11, 1998

Appl. No.:

09/210503

Inventors:

Nadeem Malik - Austin TX
Jason Raymond Baumgartner - Austin TX
Steven Leonard Roberts - Austin TX

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1730

US Classification:

707101, 707 6, 707100, 386109, 386111, 386112, 3484191, 3483841

Abstract:

A system and method for compressing data on a computer system is disclosed. The method and system include separating the data into a plurality of segments. The plurality of segments includes a plurality of unique segments. The method and system also include providing a plurality of code words. Each of the plurality of code words corresponds to a unique segment of the plurality of unique segments. The method and system also include providing a representation of the data. The representation includes the plurality of code words for the plurality of segments. The plurality of code words in the representation replaces the plurality of segments. As a result, the data in the representation could be accessed randomly.

US Patent:

6449752, Sep 10, 2002

Filed:

Sep 23, 1999

Appl. No.:

09/404278

Inventors:

Jason Raymond Baumgartner - Austin TX 78728
Nadeem Malik - Austin TX 78750
Steven Leonard Roberts - Austin TX 78746

International Classification:

G06F 1750

US Classification:

716 5

Abstract:

A method for automatically generating a set of specifications against which a model of the digital circuit can be verified. In one embodiment, the method includes an initial step in which a specification class that corresponds to a type of behavior of the digital circuit is defined. A set of specification formulae that satisfies the defined specification class is then enumerated. Each formula in the set of formulae is then applied to the model of the digital circuit to determine whether the digital circuit satisfies the corresponding formula. The definition of the specification class preferably includes a set of input conditions, a set of output or response conditions, and a temporal component. Preferably, the enumeration of the specification formulae includes all specification formulae that satisfy the specification class. The application of the set of formulae to the model of the digital circuit is preferably achieved with a verification engine such as a model checker.

US Patent:

6463412, Oct 8, 2002

Filed:

Dec 16, 1999

Appl. No.:

09/464847

Inventors:

Jason Raymond Baumgartner - Austin TX
Steven Leonard Roberts - Austin TX
Nadeem Malik - Austin TX
Flemming Andersen - Austin TX

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G10L 1300

US Classification:

704246, 704261, 704269

Abstract:

A high performance voice transformation apparatus and method is provided in which voice input is transformed into a symbolic representation of phonemes in the voice input. The symbolic representation is used to retrieve output voice segments of a selected target speaker for use in outputting the voice input in a different voice. In addition, voice input characteristics are extracted from the voice input and are then applied to the output voice segments to thereby provide a more realistic human sounding voice output.

US Patent:

6473772, Oct 29, 2002

Filed:

Dec 17, 1998

Appl. No.:

09/213913

Inventors:

Jason Raymond Baumgartner - Austin TX
Sriram Srinivasan Mandyam - Austin TX
Robert James Ramirez - New Braunfels TX
Brett Adam St. Onge - Austin TX
Kenneth Lee Wright - Austin TX

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1730

US Classification:

7071041, 707100, 703 17

Abstract:

A method and apparatus for dynamically driving events in a simulation of a data processing system are implemented. Events, or system states, are generated by drivers located at predetermined locations within the simulation model under test. These events, which are drawn from a predetermined class of events, termed âeffects,â are driven in response to other events observed by monitors disposed within the simulation model in accordance with a predetermined set of âcauses,â and a set of ârulesâ that map causes to effects. The driving of events is mediated by a library process that receives observed events from the monitors, in the form of data structures, stored them in a database, and passes the effects to be driven to the appropriate driver in accordance with the set of rules, also data structures stored in the database, when a cause corresponds to a observed event.

US Patent:

6567962, May 20, 2003

Filed:

Nov 30, 2000

Appl. No.:

09/726289

Inventors:

Jason Raymond Baumgartner - Austin TX
Robert Neill Newshutz - Rochester MN
Steven Leonard Roberts - Austin TX
Anson Jeffrey Tripp - Austin TX

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1750

US Classification:

716 6, 716 7, 716 11, 716 16, 716 18

Abstract:

An apparatus performs a process for partitioning a netlist. The process picks a unique color for each clock and traverses the clock tree coloring the latches in support of that clock tree with that color. The process then colors the fanout logic cones for each latch and notes any coloring collisions. In the case of a multicolored gate, the process retimes the network by moving the terminating latch backwards, towards the collision, to enable single coloring of the gate. The process then performs a depth-first search on the fanout logic of each primary input to the first latch encountered or a primary output. If a primary output is encountered, the path is colored with a color representing the free-run domain. Otherwise, the process colors the path with the color of the terminating latch. Next, the process duplicates the fanin cones for remaining multicolored gates so that a copy of the logic can be incorporated with each independent domain.

US Patent:

6553514, Apr 22, 2003

Filed:

Sep 23, 1999

Appl. No.:

09/404281

Inventors:

Jason Raymond Baumgartner - Austin TX
Nadeem Malik - Austin TX
Steven Leonard Roberts - Austin TX

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

H02H 305

US Classification:

714 32, 714 33, 714724, 714741, 703 13, 703 14, 703 15, 703 16, 716 4, 716 5

Abstract:

A method of verifying a digital circuit in which state transition information is extracted from the output of a non-formal first verification technique. A formal verification tool is then applied to the extracted state transition information to extend the verification coverage of the digital circuit beyond the coverage that is achieved using the first verification technique. In one embodiment, the method includes the initial step of applying a first verification technique such as a simulation technique to a model of the digital circuit. In the preferred embodiment, the application of the formal verification tool comprises applying a model checker to the extracted state transition data to achieve a formal verification of the state machine represented by the state transition diagram. In one embodiment, the extracted state transition information includes a set of data points each representing a present state, a present input, and a next state. In one embodiment useful for extending the verification coverage provided by a conventional non-formal verification technique, the non-formal tool is used to verify satisfaction of a specification or rule by traversing a first transition path of the circuit.

US Patent:

6678417, Jan 13, 2004

Filed:

Nov 30, 1999

Appl. No.:

09/451951

Inventors:

Jason Raymond Baumgartner - Austin TX
Nadeem Malik - Austin TX
Steven Leonard Roberts - Austin TX

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06K 936

US Classification:

382236, 382103, 348153

Abstract:

A method and system for transmitting video data are disclosed. The method includes receiving a first video image and comparing the first video image to at least one stock image where each of the stock images is associated with a corresponding index value. If a match between at least a portion of the first video image and one of the at least one stock images is detected, the index value corresponding to the matching stock image is transmitted over a transmission medium. In one embodiment, the method further includes receiving the transmitted index value and generating the corresponding stock image from the index value. The method of may further includes comparing the first video image with a set of stock images. If it is determined that the first image does not match to any of the set of stock images, then a new index value is assigned to the first image and the first image is added to the set of stock images. In one embodiment, the new index value and the corresponding video image are then transmitted to a receiving device.

US Patent:

6698003, Feb 24, 2004

Filed:

Dec 6, 2001

Appl. No.:

10/006076

Inventors:

Jason Raymond Baumgartner - Austin TX
Geert Janssen - Putnam Valley NY
Andreas Kuehlmann - Berkeley CA
Viresh Paruthi - Austin TX
Louise Helen Trevillyan - Katonah NY

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1750

US Classification:

716 4, 716 1, 716 2, 716 3, 716 18, 716 5, 703 14

Abstract:

A design verification system comprising a set of modular verification engines invoked by a framework that manages the control flow between the engines. The framework receives a verification problem from an application and attempts to solve it by instantiating one or more engine in a customizable sequence or set of sequences. Each verification engine is configured to achieve a specific verification objective and may be coded against a common API to facilitate exchange of information between the engines. The verification engines may include reduction engines, which attempt to simplify a problem by modifying it or decomposing it, and decision engines, which attempt to solve problems that are passed to them. As a verification problem is passed from one engine to the next, the engine may alter the verification problem such that a decision engine at the end of the sequence may receive a verification problem that is simpler to solve than the original problem specified by the system user. If the decision engine is able to solve a problem by determining a state or sequence of states that produces a specified value on a specified node of the design, the engine passes the determined sequence to the engine that invoked it in the form of a counterexample trace after modifying it to âundoâ whatever effect it may have had on the problem.