Abstract
The nonlinear tranformations in the data dependence method for implementations on processor arrays offer many advantages such as more efficient work for the processing elements, smaller processor arrays, a decrease in I/O time, pipelineable implementations, circular data flow. In this paper the folding transformation is used to realize these proposed ideas. The symmetric linear transformations are analyzed and certain characteristics are pointed out. Space time graphs are defined as objects where the folding transformation is implemented. It is shown that a direct implementation of a folding transformation according to the line of symmetry does not result in a valid and regular implementation, even if retiming is used. The solution of this problem is offered for the space time graphs having the interlocking property, or implementations working in swapped active and inactive moments. It is proved that the folding transformation according to a translated line of symmetry offers valid and regular solutions. Some examples are given to demonstrate the idea of folding transformations. The comparison between the regular and the folded implementation shows an improvement of up to 50% of processors, circular data flow and decreased input and output.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
