[图书][B] Why systolic architecture?

HT Kung - 1982 - eecs.harvard.edu
Roughly, the cycle for developing a special-purpose system can be divided into three
phases–task definition, design, and implementation. During task definition, some system …

Programmable active memories: Reconfigurable systems come of age

JE Vuillemin, P Bertin, D Roncin… - IEEE transactions on …, 1996 - ieeexplore.ieee.org
Programmable active memories (PAM) are a novel form of universal reconfigurable
hardware coprocessor. Based on field-programmable gate array (FPGA) technology, a PAM …

Measurement of the spectral functions of vector current hadronic tau decays

ALEPH collaboration - Zeitschrift für Physik C Particles and Fields, 1997 - Springer
A measurement of the spectral functions of non-strange τ vector current final states is
presented, using 124 358 τ pairs recorded by the ALEPH detector at LEP during the years …

Synthesis of control circuits in folded pipelined DSP architectures

KK Parhi, CY Wang, AP Brown - IEEE Journal of Solid-State …, 1992 - ieeexplore.ieee.org
A systematic folding transformation technique to fold any arbitrary signal processing
algorithm data-flow graph to a hardware data-flow architecture, for a specified folding set …

Systolic Multipliers for Finite Fields GF(2m)

Yeh, Truong - IEEE Transactions on Computers, 1984 - ieeexplore.ieee.org
Two systolic architectures are developed for performing the product–sum computation AB+
C in the finite field GF (2 m) of 2 m elements, where A, B, and C are arbitrary elements of GF …

[PDF][PDF] The area-time complexity of binary multiplication

RP Brent, HT Kung - Journal of the ACM (JACM), 1981 - dl.acm.org
The problem of performing multtphcaUon of n-bit binary numbers on a chip is considered Let
A denote the ch~ p area and T the time reqmred to perform mult~ phcation. By using a model …

Digit-pipelined arnthmetic as illustrated by the paste-up system: A tutorial

MJ Irwin, RM Owens - Computer, 1987 - computer.org
VLSI chip is important so that the chip area needed for interconnections will be minimal. The
possible penalty, of course, In Xout in using bit-or digit-serial transmission is slow …

A VLSI architecture for fast inversion in GF (2/sup m/)

GL Feng - IEEE Transactions on Computers, 1989 - computer.org
A VLSI Architecture for Fast Inversion in GF(2”) Page 1 IEEE TRANSACTIONS ON
COMPUTERS. VOL 38, NO. IO. OCTOBER 1989 1383 A VLSI Architecture for Fast Inversion in …

Concurrent VLSI architectures

Seitz - IEEE Transactions on Computers, 1984 - ieeexplore.ieee.org
This tutorial paper addresses some of the principles and provides examples of concurrent
architectures and designs that have been inspired by VLSI technology. The circuit density …

[PDF][PDF] Introduction to programmable active memories

P Bertin, D Roncin, J Vuillemin - 1989 - bitsavers.trailing-edge.com
We introduce the concept of PAM, Programmable Active Memory and present results
obtained with our Perle-0 prototype board, featuring: A software silicon foundry for a 50K …