Hi,
I need some assistance in optimizing the below operations
1) An array contains complex values say a+ib , with both a and b being signed short integers. I need an output array of unsigned integer say c. Where c[j]=((a[j]*a[j])+(b[j]*b[j])). Whats the best possible way to implement this equation in an optimized manner.(j is a multiple of 1024).
2)2 arrays A and B. I need to find C such that C[j]=A[j]+B[j]. A,B and C are of signed short integer type. Whats the best possible way to implement this equation in an optimized manner.(j is a multiple of 1024).
Is there any library available to implement these equations in an optimized manner?