Abstract
Computational origami is an algorithm by which one can reshape another algorithm. This reshaping permits various time–hardware trade-offs to be explored. An algorithm, is first rearranged as feed forward with constant fan-in and fan-out. It is then regularized into certain predetermined geometries that break the lateral data dependencies. The result is then folded with the help of delay lines. This time–hardware trade-off technique is also applicable to the scheduling of multiple-instruction multiple-data parallel processors and bit serial VLSI designs.
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.
