On the Analysis and Synthesis of VLSI Algorithms
From MaRDI portal
Publication:3954816
DOI10.1109/TC.1982.1675929zbMath0492.68032MaRDI QIDQ3954816
Publication date: 1982
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Related Items (15)
Systolic computation of interpolating polynomials ⋮ Synthesis and equivalence of concurrent systems ⋮ FOLDING TRANSFORMATIONS ON SYSTOLIC AND VLSI PROCESSOR ARRAYS ⋮ A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems ⋮ ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS ⋮ Decoupling the dimensions of a system of affine recurrence equations ⋮ Algorithm transformations for computational and data broadcast ⋮ Algorithm transformations for the data broadcast elimination method ⋮ Decomposing polynomial interpolation for systolic arrays ⋮ The application of a sequence notation to the design of systolic computations ⋮ NEW RESULTS ON COMPUTABILITY OF RECURRENCE EQUATIONS ⋮ Elimination of the computational broadcast in systolic arrays: an application to the qr decomposition algorithm ⋮ Total unfolding: theory and applications ⋮ Computing transitive closure on systolic arrays of fixed size ⋮ Computability of affine non-conditional recurrent systems
This page was built for publication: On the Analysis and Synthesis of VLSI Algorithms