wufei
Junior Member level 2
i try to use systolic array and Givens rotation to implement QRD-RLS.
the first element of the upper triangle matrix R is coming bigger along with the computation.
because R11=sqrt( R11(n-1)^2+X11^2 ), where matrix X is the input data aray.
in square root free algorithm, R11=R11(n-1)+X11^2
the first element of R will become bigger and bigger, so it seems that i cannot define the digit of a register which could lodge this element.
though many theses and papers are about this algorithm, but i dont know how to implement this matrix R.
who can help me?
or where can i get a detailed reference?
----------------
thank you for be patient to read my unreadable words!
the first element of the upper triangle matrix R is coming bigger along with the computation.
because R11=sqrt( R11(n-1)^2+X11^2 ), where matrix X is the input data aray.
in square root free algorithm, R11=R11(n-1)+X11^2
the first element of R will become bigger and bigger, so it seems that i cannot define the digit of a register which could lodge this element.
though many theses and papers are about this algorithm, but i dont know how to implement this matrix R.
who can help me?
or where can i get a detailed reference?
----------------
thank you for be patient to read my unreadable words!