I want to implement a Kalman-filter on a DSP56F8323. To do that I need to
compute a matrix (9x9). Using Gauss-Jordan algorithmen I need to divide a
lot of figures. In my eyes there is a problem using fixed point
arithmetics. Its not allowed to divide a smaller figure through a bigger
one because the figure range is -1 to 0.999 and it would result in bigger
than 1. I am DSP newby so it would be nice when somebody could help me.
Best regards,
Maik Schormann
This message was sent using the Comp.DSP web interface on
www.DSPRelated.com
.
Re: prime number routine ... > need a routine for figuring out if a number inputted by the user is a prime ... If it is bigger than your max, then you have to start doing ... bigger than the square root of the number. ... And you don't need to divide by any number that is itself ... (comp.lang.cpp)
Re: inverse matrix ... > I want to implement a Kalman-filter on a DSP56F8323. ... Its not allowed to divide a smaller figure through a bigger... As I remember all the inverseing that is done in KFs is to symmetric ... (comp.dsp)
Re: returning none when it should be returning a list? ... It divide next by the list of previous prime numbers if next ... is not bigger than lim, count up all the times where it's not evenly ... Your basic algorithm as described above sounds workable, ... (comp.lang.python)
Re: inverse matrix ...mswu wrote: ... In my eyes there is a problem using fixed point arithmetics. ... Its not allowed to divide a smaller figure through a bigger one because the figure range is -1 to 0.999 and it would result in bigger than 1. ... (comp.dsp)
