Abstract
Folding transformations on processor arrays result in smaller processor arrays, more efficient work for the processing elements, a decrease in I/O time and pipelineable implementations. The regular folding procedure is realized to improve the efficiency of processor arrays whilst retaining the complexity of the data communications, the processor operations and the regular data flow. The efficiency analysis shows that the implementation obtained utilizes the processor array with double efficiency. Moreover by using the same processor array problems with double dimension can be solved. Also the circular data flow can be used for cascaded algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.