Abstract
In this paper, two linear systolic arrays for the solution of general, strongly regular Toeplitz system of equations are presented. They arise from systolization of the efficient serial Schur-like algorithm. Both arrays are time-minimal and they complete the solution in 3n – 4 time cycles (without the initialization and the retrieval of results). The first array requires 2n – 2 processors, and the second one uses only n – 1 processors.
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.
