The mapping of linear recurrence equations on regular arrays
From MaRDI portal
Publication:3970994
DOI10.1007/BF02477176zbMath0825.68431OpenAlexW2085376012WikidataQ124964527 ScholiaQ124964527MaRDI QIDQ3970994
Vincent van Dongen, Patrice Quinton
Publication date: 25 June 1992
Published in: Journal of VLSI signal processing systems for signal, image and video technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02477176
Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Distributed algorithms (68W15)
Related Items
Advanced Regular Array Design ⋮ Space-Time Equations for Non-Unimodular Mappings ⋮ Undecidability of restricted uniform recurrence equations ⋮ THE DERIVATION OF UNIFORM RECURRENCE EQUATIONS FOR THE KNAPSACK PROBLEM ⋮ ON THE EXPECTED EXECUTION TIME FOR A CLASS OF NON UNIFORM RECURRENCE EQUATIONS MAPPED ONTO 1D REGULAR ARRAYS ⋮ SYSTOLIC MATRIX INVERSION USING A MONTE CARLO METHOD ⋮ Tools for Regularizing Array Designs ⋮ Mapping 3-D IIR digital filter onto systolic arrays ⋮ A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems ⋮ parallel parsing from recurrence equations ⋮ Computability of recurrence equations ⋮ Forty-three ways of systolic matrix multiplication ⋮ Systolic partitioning algorithms ⋮ Towards systolizing compilation ⋮ EFFICIENT MAPPING REDUCTIONS USING ISO-PLANES ON THE POLYTOPE MODEL ⋮ Synthesis aspects in the design of efficient processor arrays from affine recurrence equations ⋮ Geometrical tools to map systems of affine recurrence equations on regular arrays
