Abstract
A design method for array architectures from regular dependence graphs (DGs) is extended for the design of reconfigurable arrays. The original design method is combined to a single step mapping of the DG with arbitrary dimension n onto the final signal flow graph (SFG) with dimension k. This eliminates the need for recursive application of a mapping which reduces the dimension of the DG by one, and it is possible to separate the node mapping from the derivation of the time schedule. Sufficient conditions for a valid mapping are given. Then a reconfigurable DG (RecDG) and a reconfiguration control DG (RecCDG) are introduced, which can be mapped onto an SFG using the same procedure as for the nonredundant DG. It is explained how to obtain the RecDG and the RecCDG from the DG. As an example the design procedure is applied to matrix-matrix multiplication. >
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
