Least-squares iterative solution on a fixed-size VLSI architecture

This item is provided by the institution :
Technical University of Crete   

Repository :
Institutional Repository Technical University of Crete   

see the original item page
in the repository's web site and access all digital files if the item*



Least-squares iterative solution on a fixed-size VLSI architecture (EN)

Παπαδοπουλου Ελενη (EL)
Papadopoulou Eleni (EN)
T. S. Papatheodorou (EN)

Πολυτεχνείο Κρήτης (EL)
Technical University of Crete (EN)

journalArticle

2005


The VLSI implementation of the Accelerated Overrelaxation (AOR) method, when used for the accurate computation of the least-squares solutions of overdetermined systems, is the problem addressed here. As the size of this computational task is usually very large, we use space-time domain expansion techniques to partition the computation and map it onto a fixed size VLSI architecture. (EN)

Springer Link (EL)

English

Springer Link (EN)




*Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)