𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Area-time trade-offs for matrix-vector multiplication

✍ Scribed by B. Codenotti; G. Lotti; F. Romani

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
668 KB
Volume
8
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Time-space trade-offs for compressed suf
Time-space trade-offs for compressed suffix arrays
✍ S.Srinivasa Rao πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 70 KB

Given a binary string of length n, we give a representation of its suffix array that takes O(nt (lg n) 1/t ) bits of space such that given i, 1 i n, the ith entry in the suffix array of the string can be retrieved in O(t) time, for any parameter 1 t lg lg n. For t = lg lg n, this gives a compressed

Two-level pipelined systolic arrays for
Two-level pipelined systolic arrays for matrix-vector multiplication
✍ Ivan Z. MilentijeviΔ‡; Igor Z. MilovanoviΔ‡; Emina I. MilovanoviΔ‡; Milorad B. ToΕ‘i πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 303 KB

Novel two-level pipelined linear systolic arrays for matrix vector multiplication are proposed. The number of processing elements in the proposed arrays s reduced to half of the number of' processing elements in the existing arrays. An area-time (AT) criteria is used to compare the proposed arrays w