Crosstalk in VLSI interconnects is a major constrain in DSM and UDSM technology. Among various strategies followed for its minimization, shield insertion between Aggressor and Victim is one of the prominent options. This paper analyzes the extent of crosstalk in inductively coupled interconnects and minimizes the same through distributed shield insertion. Comparison is drawn between signal volt...

N-digit, radix-a bases are proposed for VLSI implementation of redundant arithmetic, mod m, where a m = ±1, a j m π ±1, for 0 < j < N and m is prime. These bases simplify arithmetic overflow and are well suited to redundant arithmetic. The representations provide competitive, multiplierless T-point Number Theoretic Transforms, mod m, where T | N or T | 2N.

VLSI design does not stand alone. The challenges and opportunities for the design community are driven and shaped by larger forces, from semiconductor technology evolution through product trends, and ultimately to large scale societal forces which are far beyond the control of designers. To understand the requirements for design, then, we first need to examine the larger environment in which we...

In this research communication, we comment on “Dual-rail asynchronous logic multi-level implementation” [Integration, the VLSI Journal 47 (2014) 148-159] by expounding the problematic issues, and provide some clarifications on delay-insensitivity, robust asynchronous logic, multi-level decomposition, and physical implementation.

Abstract In this paper, we extend our generalized methodology for designing lower-error area-efficient fixed-width two’s-complement multipliers that receive two s -bit numbers and produce an s -bit product. The generalized methodology involving four steps results in several better error-compensation biases. These better error-compensation biases can be easily mapped to lower-error fixed-width m...

This paper describes a tool for use in user-directed synthesis of circuits speciied using the relational VLSI description language Ruby. The synthesis method is based on syntactic rewriting of Ruby terms, combined with the introduction of constraints into the speciica-tion. The rewriting process is described in a metalanguage based on the use of tactics and tacticals, which makes it possible to...

An area-universal VLSI circuit can be programmed to emulate every circuit of a given area, but at the cost of lower area-time performance. In particular, if a circuit with area-time bounds (A, T ) is emulated by a universal circuit with bounds (Au, Tu), we say that the universal circuit has blowup Au/A and slowdown Tu/T . A central question in VLSI theory is to investigate the inherent costs an...

A set of polygons is called c-oriented if the edges of all polygons are oriented in a constant number of previously defined directions. The intersection searching problem is studied for such objects, namely: Given a set of c-oriented polygons P and a c-oriented query polygon q, find all polygons in P that intersect q. It is shown that this problem can be solved in O(logZn + t) time with O(n log...