Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Andrew K. Martin is active.

Publication


Featured researches published by Andrew K. Martin.


symposium on vlsi circuits | 2007

A 5.3GHz 8T-SRAM with Operation Down to 0.41V in 65nm CMOS

Leland Chang; Yutaka Nakamura; Robert K. Montoye; Jun Sawada; Andrew K. Martin; Kiyofumi Kinoshita; Fadi H. Gebara; Kanak B. Agarwal; Dhruva Acharyya; Wilfried Haensch; Kohji Hosokawa; Damir A. Jamsek

A 32 kb subarray demonstrates practical implementation of a 65 nm node 8T-SRAM cell for variability tolerance in highspeed caches. Ideal cell stability allows single-supply operation down to 0.41 V at 295 MHz without dynamic voltage techniques. Despite a larger cell, array area is competitive with 6T-SRAM due to higher array efficiency. With an LSDL decoder, a gated diode sense amplifier, and design tradeoffs enabled by the 8 T cell, 5.3 GHz operation at 1.2 V is achieved.


Ibm Journal of Research and Development | 2006

Limited switch dynamic logic circuits for high-speed low-power circuit design

Wendy Belluomini; Damir A. Jamsek; Andrew K. Martin; Chandler Todd McDowell; Robert K. Montoye; Hung C. Ngo; Jun Sawada

This paper describes a new circuit family--limited switch dynamic logic (LSDL). LSDL is a hybrid between a dynamic circuit and a static latch that combines the desirable properties of both circuit families. The paper also describes many enhancements and extensions to LSDL that increase its logical capability. Finally, it presents the results of two multiplier designs, one fabricated in 130- nm technology and one in 90-nm technology. The 130- and 90-nm designs respectively reach speeds up to 2.2 GHz and 8 GHz.


Ibm Journal of Research and Development | 2005

Custom math functions for molecular dynamics

Robert F. Enenkel; Blake G. Fitch; Robert S. Germain; Fred G. Gustavson; Andrew K. Martin; Mark P. Mendell; Jed W. Pitera; Mike Pitman; Aleksandr Rayshubskiy; Frank Suits; William C. Swope; T. J. C. Ward

While developing the protein folding application for the IBM Blue Gene®/L supercomputer, some frequently executed computational kernels were encountered. These were significantly more complex than the linear algebra kernels that are normally provided as tuned libraries with modern machines. Using regular library functions for these would have resulted in an application that exploited only 5-10% of the potential floating-point throughput of the machine. This paper is a tour of the functions encountered; they have been expressed in C++ (and could be expressed in other languages such as Fortran or C). With the help of a good optimizing compiler, floating-point efficiency is much closer to 100%. The protein folding application was initially run by the life science researchers on IBM POWER3™ machines while the computer science researchers were designing and bringing up the Blue Gene/L hardware. Some of the work discussed resulted in enhanced compiler optimizations, which now improve the performance of floating-point-intensive applications compiled by the IBM VisualAge® series of compilers for POWER3, POWER4™, POWER4+™, and POWER5™. The implementations are offered in the hope that they may help in other implementations of molecular dynamics or in other fields of endeavor, and in the hope that others may adapt the ideas presented here to deliver additional mathematical functions at high throughput.


international solid-state circuits conference | 2005

An 8GHz floating-point multiply

Wendy Belluomini; Damir A. Jamsek; Andrew K. Martin; Chandler Todd McDowell; Robert K. Montoye; Tuyet Nguyen; Hung Ngo; Jun Sawada; Ivan Vo; R. Datta

The implementation of the mantissa portion of a floating-point multiply (54/spl times/54b) is described. The 0.124mm/sup 2/ multiplier is implemented using limited switch dynamic logic and operates at speeds up to 8GHz in a 90nm SOI technology. The multiplier dissipates between 150mW and 1.8W as it scales between 2GHz and 8GHz.


formal methods | 2005

A formal framework for verification of embedded custom memories of the Motorola MPC7450 microprocessor

Jayanta Bhadra; Andrew K. Martin; Jacob A. Abraham

In this presentation, we will deal with verification of custom designed embedded memories. Using our paradigm, one can abstract the behavior of a memory block by a couple of artifacts—one representing its contents, and another representing its interface. We make use of the well known behavioral model known as the Efficient Memory Model (EMM) [29, 30] to represent contents of memories. We provide a methodology using which the behavior of a switch (or equivalently, transistor) level device can be specified using parameterized regular expressions. These entities can be used to abstractly describe the behavior of a bunch of switches that represent the interface of a memory. An automaton that we construct out of an abstract memory interface definition represents an abstraction of the memory interface itself. We show that such an automaton also forms a transducer that is a simulation model in a symbolic simulation environment. An EMM representing a memory core in conjunction with a transducer representing its interface is used as an abstraction of a complete memory during our automatic verification process.We also present a language formalism using which we show that the outputs from the transducers that are generated from the abstract specifications are weaker than or equal to the outputs defined by the regular expressions, in a partially ordered output space. We show that although the regular expressions are defined over exact and legal input strings, the transducers computed from them can provide outputs even when provided with weak or illegal input strings. This is an absolute necessity in order to have the capability to produce outputs when treated as a reactive system embedded in a symbolic simulation environment. Thus, we show that the simulation model generated by our technique is an conservative approximation of the corresponding abstract specification.We present a simple theory of composition that can be used to compose different simulation models used in our technique. Memories consisting of several ports result into several user-provided abstract specifications, which in turn result into several transducers that can be composed into a single transducer. That transducer in turn can be composed to a simulation model of an EMM. Our simple theory of composition also enables one to compose the abstract state space a memory core along with its ports with the concrete state space of the circuitry surrounding the memory core. We have shown that the composite simulation model representing the complete circuit has a partially ordered state space that (a) forms a complete lattice, and (b) that has a monotonic state transition function, that makes it suitable for being used in a symbolic simulation environment making use of Symbolic Trajectory Evaluation (STE) [27].The verification paradigm used is STE. For Motorola high performance microprocessors, switch level models are hand designed assuming that corresponding RTLs are golden models. Therefore, checking of equivalence between the two models is of absolute necessity as the RTL needs to be predictive of silicon behavior. We have developed a tool based on the proposed technique and used it to check that RTL descriptions of custom memories have been correctly implemented by transistor level descriptions of the same, augmented with abstract specifications of their cores. Our example circuits were taken from the state of the art Motorola MPC7450 microprocessor, a Motorola PowerPC. Experimental evidence testify to the effectiveness of the technique in catching subtle bugs in data path circuitry.


formal methods | 2003

Formal Verification Successes at Motorola

Magdy S. Abadir; Kenneth L. Albin; John W. Havlicek; Narayanan Krishnamurthy; Andrew K. Martin

Formal tools are either too labor intensive or are completely impractical for industrial-size problems. This paper describes two formal verification tools used within Motorola, Versys2 and CBV, that challenge this assertion. The two tools are being used in current design verification flows and have shown that it is possible to seamlessly integrate formal tools into existing design flows.


Archive | 2008

Self-resetting, self-correcting latches

Alan J. Drake; Aj Kleinosowski; Andrew K. Martin


Archive | 2005

A Self-Correcting Soft Error Tolerant Flop-Flop

Alan J. Drake; A. J. Kleinosowski; Andrew K. Martin


Archive | 2005

Method and apparatus for soft-error immune and self-correcting latches

Alan J. Drake; Aj Klein Osowski; Andrew K. Martin


Archive | 2004

Method and ring oscillator circuit for measuring circuit delays over a wide operating range

Wendy Belluomini; Andrew K. Martin; Chandler Todd McDowell

Researchain Logo
Decentralizing Knowledge