نتایج جستجو برای: systolic array

تعداد نتایج: 185077  

1997
Antonios Gasteratos Ioannis Andreadis Philippos Tsalides

A new hardware structure for implementation of soft morphological filters is presented in this paper. This is based on the modification of the majority gate technique. A pipelined systolic array architecture suitable to perform real-time soft morphological filtering is presented as an illustrative example. The processing times of the proposed hardware structure do not depend on the data window ...

2007
Giridhar Mandyam

Many discrete transforms, such as the discrete cosine transform (DCT), are derived from sets of orthonormal polynomials. These sets of polynomials all possess recursion relationships, derived from a classic identity. In this paper, this recursion is used to derive generalized systolic arrays for the forward and inverse transform operations.

2001
Victor Bangert

Multiplicative relations in the cohomology ring of a manifold impose constraints upon its stable systoles. Given a compact Riemannian manifold (X, g), its real homology H∗(X, R) is naturally endowed with the stable norm. Briefly, if h ∈ Hk(X, R) then the stable norm of h is the infimum of the Riemannian kvolumes of real cycles representing h. The stable k-systole is the minimum of the stable no...

Journal: :Computer Vision, Graphics, and Image Processing 1989
Zen-Chung Shih Richard C. T. Lee S. N. Yang

Let us consider Fig. 1. In Fig. 1, there are four regions, as indicated (R4 9 epresents the entire space not occupied by the graph). Suppose we are given all of he edges of the graph and their geometrical orientation. Can we find all of the 'egions automatically? A similar problem was discussed in [Nie 82]. In their )roblem, we are given a polygon which is not simple and we are asked to produce...

1991
Selim G. Akl John M. Calvert Ivan Stojmenovic

Iu recent years, a nurnber ofparallel algorithms have appeared for the generation ofcombinator-ial objects such as combinations, permutations, subsets, equivalence relations, etc. However, ltlauy of these algorithms are not cost-optimal, are designed for a powerful model of coutputirtion, or require a large rnemory per processor. To date, no parallel derangement generltion ulgorithrn possessing...

1937
Rose Lane

The school works in co-operation with an Educational Clinic to which all cases of backwardness in the Elementary Schools of the City are referred. The majority of the children are suffering from emotional difficulties due in large measure to environmental causes. There is the nervous child who has fallen behind through fear of failure, the resentful child who may become delinquent, the child wi...

2014
S. Rajopadhye

This is a brief intro to the algebraic path problem, and much of this material is based on Rote’s excellent paper (Günter Rote: A Systolic Array Algorithm for the Algebraic Path Problem (Shortest Paths; Matrix Inversion), Computing, 34(3):191–219, 1985)

Journal: :VLSI Signal Processing 1988
Yoav Yaacoby Peter R. Cappello

Most work on the problem of synthesizing a systolic array from a system of recurrence equations is restricted to systems of uniform recurrence equations. Recently, researchers have begun to relax this restriction to include systems of affine recurrence equations. A system of uniform recurrence equations typically can be embedded in spacetime so that the distance between a variable and a depende...

Journal: :Parallel Processing Letters 1995
Mary Mehrnoosh Eshaghian-Wilner Russ Miller

In this paper, we introduce the Systolic Reconngurable Mesh (SRM), which combines aspects of the reconngurable mesh with that of systolic arrays. Every processor controls a local switch that can be reconngured during every clock cycle in order to control the physical connections between its four bi-directional bus lines. Data is input from one side of the systolic reconngurable mesh and output ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید