A technique for reconfiguring an array of arbitrary rectangular shape from a fixed-size square array is presented. This type of reconfiguration is referred to as functional reconfiguration, as it maps processing functionalities (given by processing) into an array of dimensions different from those of the physical device. Functional reconfiguration is analyzed using index mapping. Locality and interconnection requirements are presented. Examples are given to illustrate the algorithm. It is also proven that the proposed technique achieves a lower intercell delay than previous techniques for certain values of ratio of the dimensions of the reconfigured rectangular array and the original square array
An Algorithm for Functional Reconfiguration of Fixed-Size Arrays
SCIUTO, DONATELLA;
1988-01-01
Abstract
A technique for reconfiguring an array of arbitrary rectangular shape from a fixed-size square array is presented. This type of reconfiguration is referred to as functional reconfiguration, as it maps processing functionalities (given by processing) into an array of dimensions different from those of the physical device. Functional reconfiguration is analyzed using index mapping. Locality and interconnection requirements are presented. Examples are given to illustrate the algorithm. It is also proven that the proposed technique achieves a lower intercell delay than previous techniques for certain values of ratio of the dimensions of the reconfigured rectangular array and the original square arrayI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.