Abstract
We present a linear systolic array of O( n) cells that solves the least squares linear prediction problem in time O( n) via an algorithm based on the so-called lattice algorithm. The total storage required is O( n) words, i.e., only a constant number of words are needed at each cell.
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.
