This paper addresses the problem of rectangular matrix multiplication on bidirectional linear systolic arrays (SAs). We analyze all bidirectional linear SAs in terms of efficiency. We conclude that the efficiency depends on the relation between the loop boundaries in the systolic algorithm (i.e. matrix dimensions). We point out which SA is the best choice depending on the relation between matri...

High-resolution imaging and beam steering using 3 microlens arrays (MLA) is demonstrated. Small lateral displacement of one microlens array is sufficient for large angle beam steering. A prescan lens is added to the system to overcome the discrete addressing problem associated with microlens scanning systems. A hybrid method that uses both geometrical ray tracing optimization and physical optic...

The application of microarray hybridization theory to Affymetrix GeneChip data has been a recent focus for data analysts. It has been shown that the hyperbolic Langmuir isotherm captures the shape of the signal response to concentration of Affymetrix GeneChips. We demonstrate that existing linear fit methods for extracting gene expression measures are not well adapted for the effect of saturati...

Achieving fault tolerance through incorporation of redundancy and reconfiguration is quite common. In this paper we study the fault tolerance of linear arrays of N processors with k bypass links whose maximum length is g. We consider both arrays with bidirectional links and unidirectional links. We first consider the problem of testing whether a set of n faulty processors is catastrophic, i.e.,...

Frequently used problems of linear algebra, such as the solution of linear systems, triangular decomposition and matrix multiplication, are computationally extensive. To increase the speed, those problems should be solved with systolic structures, where many processors are used concurrently to compute the result. Since two-dimensional array of processors is very consumptive, considering space a...

ion Refinement of Linear Programs

We present an automatic method for mapping a system of linear recurrence equations onto systolic architectures. First, we show that systolic architectures can be derived from linear recurrence equations using the notion of directed recurrence equations. Next, we provide a procedure called CUBIZATION to achieve better performance while mapping such equations. The CUBIZATION procedure is complete...

The system of coupled discrete equations describing a two-component superlattice with interlaced linear and nonlinear constituents is studied as a basis for investigating binary waveguide arrays, such as ribbed AlGaAs structures, among others. Compared to the single nonlinear lattice, the interlaced system exhibits an extra band-gap controlled by the, suitably chosen by design, relative detunin...

It is proved that the collection of blocks of an affine 1-design that yields a linear orthogonal array is a union of parallel classes of hyperplanes in a finite affine space. In particular, for every prime power q and every m ≥ 2 there exists a unique (up to equivalence) complete linear orthogonal array of strength two associated with the classical design of points and hyperplanes in AG(m, q).

In regular architectures of identical processing elements, a widely used technique to improve the reconngurability of the system consists of providing redundant processing elements and connections together with mechanisms of reconnguration. In this paper we consider linear arrays of processing elements, with unidirectional bypass links of length g. We study those sets of faulty processing eleme...