Abstract
The development of next-generation computer-aided design tools and field reconfigurable architectures require efficient high-level data-flow synthesis. In this paper, we present the transform rules from polynomial presentation to polynomial matrix presentation and show how symbolic algebra can be used to construct arithmetic-level decomposition algorithm with extensibility that leads to efficient high-level synthesis of system. And the simple verification approach for reconfigurable architectures is given. On second thoughts, the parallelism of the mapping methodology for matrix multiplication is utilized to speed up the process of optimization. The key contribution of the work is to obtain a minimal state-space realization of the system
Sign-in/Register to access full text options 
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.
