Hello all
I'm about to write a code of floating point dot-product using software pipelining for TMS320C6713 by using LDW . I encountered a problem in the accumulation of the multiplication result ( I think it's loop carry path problem because the addsp require 4 cycles to complete ) . How can I solve this issue . I blevie that LDDW will be more effecitiant . I try it ...but how can i deal with odd number of multiplication( if count is an odd number ) ...one solution is done by add a zero coef at the end of the coefficient array but if i don't know the value of count if it even or odd
here the C code
float dot-product(float *in, float *coef, int count)
{
int i;
float sum = 0;
for (i=0; i < count; i++)
{
sum = sum + in[i] * coef[i];
}
return(sum);
}
thank you ^_^