✦ LIBER ✦

A very fast multiplication algorithm for VLSI implementation

✍ Scribed by Jean Vuillemin

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 507 KB
Volume: 1
Category: Article
ISSN: 0167-9260
DOI: 10.1016/0167-9260(83)90005-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast neural-network algorithm for VLSI

A fast neural-network algorithm for VLSI cell placement

✍ Cevdet Aykanat; Tevfik Bultan; İsmail Haritaoğlu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 423 KB

Cell placement is an important phase of current VLSI circuit design styles such as standard cell, gate array, and Field Programmable Gate Array (FPGA). Although nondeterministic algorithms such as Simulated Annealing (SA) were successful in solving this problem, they are known to be slow. In this pa

SIGMA: a VLSI systolic array implementat

SIGMA: a VLSI systolic array implementation of a Galois Field [GF(2)m)] based multiplication and division algorithm: IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1(1), 22 (1993)

📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 102 KB

A submatrix algorithm for the matrix-vec

A submatrix algorithm for the matrix-vector multiplication of very large matrices

✍ Roland Lindh; Per-Årke Malmquist 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB

In self-consistent field (SCF) calculations the construction of the Fock matrix is most time-consuming step. The Fock matrix construction may formally be seen as a matrix-vector multiplication, where the matrix is the supermatrix, Tikl, and the vector is the first-order density matrix, yi. This form

Implementation of a high speed Fast Four

Implementation of a high speed Fast Fourier Transform VLSI chip

✍ S.A Samad; A Ragoub; M Othman; Z.A.M Shariff 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 380 KB

Very high speed proce,;sing of radar signals has led to the requirement of very high speed conversion of signals from the time domain to the frequency domain. In this paper we discuss the implementation of an FFT chip based on the proposed digit slicing architecture. The paper begins with a discussi

A very fast algorithm for detecting comm

A very fast algorithm for detecting community structures in complex networks

✍ Xutao Wang; Guanrong Chen; Hongtao Lu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 362 KB

A practical algorithm for faster matrix

A practical algorithm for faster matrix multiplication

✍ Igor Kaporin 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 69 KB

The purpose of this paper is to present an algorithm for matrix multiplication based on a formula discovered by Pan [7]. For matrices of order up to 10 000, the nearly optimum tuning of the algorithm results in a rather clear non-recursive one-or two-level structure with the operation count comparab