Asymptotic waveform evaluation (AWE) provides a generalized approach to linear RLC circuit response approximations. The RLC interconnect model may contain floating capacitors, grounded resistors, inductors, and even linear controlled sources. The transient portion of the response is approximated by matching the initial boundary conditions and the first 2q-1 moments of the exact response to a lower-order q-pole model. For the case of an RC tree model, a first-order AWE approximation reduces to the RC tree methods. >

Asymptotic waveform evaluation for timing analysis

We characterize high-performance streaming applications as a new and distinct domain of programs that is becoming increasingly important. The StreamIt language provides novel high-level representations to improve programmer productivity and program robustness within the streaming domain. At the same time, the StreamIt compiler aims to improve the performance of streaming applications via stream-specific analyses and optimizations. In this paper, we motivate, describe and justify the language features of StreamIt, which include: a structured model of streams, a messaging system for control, a re-initialization mechanism, and a natural textual syntax.

/pdf/streamit-a-language-for-streaming-applications-il2k3rjwwy.pdf

StreamIt: A Language for Streaming Applications

A geometric program (GP) is a type of mathematical optimization problem characterized by objective and constraint functions that have a special form. Recently developed solution methods can solve even large-scale GPs extremely efficiently and reliably; at the same time a number of practical problems, particularly in circuit design, have been found to be equivalent to (or well approximated by) GPs. Putting these two together, we get effective solutions for the practical problems. The basic approach in GP modeling is to attempt to express a practical problem, such as an engineering analysis or design problem, in GP format. In the best case, this formulation is exact; when this is not possible, we settle for an approximate formulation. This tutorial paper collects together in one place the basic background material needed to do GP modeling. We start with the basic definitions and facts, and some methods used to transform problems into GP format. We show how to recognize functions and problems compatible with GP, and how to approximate functions or data in a form compatible with GP (when this is possible). We give some simple and representative examples, and also describe some common extensions of GP, along with methods for solving (or approximately solving) them.

/pdf/a-tutorial-on-geometric-programming-47sdznbzxw.pdf

A tutorial on geometric programming

Maximized multi-state compaction and more tolerance in memory state behavior is achieved through a flexible, self-consistent and self-adapting mode of detection, covering a wide dynamic range. For high density multi-state encoding, this approach borders on full analog treatment, dictating analog techniques including A to D type conversion to reconstruct and process the data. In accordance with the teachings of this invention, the memory array is read with high fidelity, not to provide actual final digital data, but rather to provide raw data accurately reflecting the analog storage state, which information is sent to a memory controller for analysis and detection of the actual final digital data.

Multi-state memory

In MOS integrated circuits, signals may propagate between stages with fanout. The exact calculation of signal delay through such networks is difficult. However, upper and lower bounds for delay that are computationally simple are presented in this paper. The results can be used 1) to bound the delay, given the signal threshold, or 2) to bound the signal voltage, given a delay time, or 3) certify that a circuit is "fast enough," given both the maximum delay and the voltage threshold.

/pdf/signal-delay-in-rc-tree-networks-523jfr2m16.pdf

Signal Delay in RC Tree Networks

In MOS integrated circuits, signals may propagate between stages with fanout. The MOS interconnect may be modeled by an RC tree. Exact calculation of signal delay through such networks is difficult. However, upper and lower bounds for delay that are computationally simple are presented here. The results can be used (1) to bound the delay, given the signal threshold; or (2) to bound the signal voltage, given a delay time; or (3) to certify that a circuit is "fast enough", given both the maximum delay and the voltage threshold.

A storage cell and a sense amplifier for use in a register or other memory in an integrated circuit. The storage cell has single-rail input and output, thereby eliminating the necessity of differential input lines and access transistors. The cell also has dual individually-addressable output buses. The sense amplifier includes a master latch connected to the bit line from the storage cell and a slave latch connected to the output. The master latch is normally maintained at its meta-stable condition by a normally-enabled gate. When the content of a storage cell is to be read, the cell outputs a signal onto the bit line, which signal drives the master latch to one side of its meta-stable state. The gate is turned off, allowing the master latch to go to the nearest stable state. The slave latch is connected to the master latch and assumes a state in response thereto. The slave latch and master latch are then disconnected and the master latch returned to its meta-stable state.

Single rail CMOS register array and sense amplifier circuit therefor

Embodiments of the present invention are directed to parallel, pipelined, integrated-circuit implementations of computational engines designed to solve complex computational problems. One embodiment of the present invention is a family of video encoders and decoders (“codecs”) that can be incorporated within cameras, cell phones, and other electronic devices for encoding raw video signals into compressed video signals for storage and transmission, and for decoding compressed video signals into raw video signals for output to display devices. A highly parallel, pipelined, special-purpose integrated-circuit implementation of a particular video codec provides, according to embodiments of the present invention, a cost-effective video-codec computational engine that provides an extremely large computational bandwidth with relatively low power consumption and low-latency for decompression and compression of compressed video signals and raw video signals, respectively.

Parallel, pipelined, integrated-circuit implementation of a computational engine

Embodiments of the present invention are video acquisition and processing systems. One embodiment of the present invention, video acquisition and processing systems include a sensor, image signal processor, and video compression and decompression components fully integrated in a single integrated circuit. The integrated sensor and image signal processor feature highly parallel transmission of image data to the video compression and decompression component. This highly parallel, pipelined, special-purpose integrated-circuit implementation offers cost-effective video acquisition and image data processing and an extremely large computational bandwidth with relatively low power consumption and low-latency for processing video signals.

Jorge Rubinstein

Papers

Signal Delay in RC Tree Networks

Signal Delay in RC Tree Networks

Single rail CMOS register array and sense amplifier circuit therefor

Parallel, pipelined, integrated-circuit implementation of a computational engine

Video acquisition and processing systems