Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.
Yeah OpenCV is good. I also found this recently. Yet to test it though. https://codeblag.wordpress.com/2013/03/16/using-libccv-opencv-alternative-in-go-for-gnulinux/
Got it folks. Ok, the reason is:
In FFT, we work with orthogonal basis, but they are not orthonormal.! Each basis vector has magnitude of √N. How? Read on...
Each component of the basis vector is a complex number. Sin2θ + Cos2θ becomes 1 for each component when we do <x, x>. So the magnitude of...
Hi folk
During DFT of a input sequence of length N, we find X(k).
X(k) = <x[n], e[k, n]>
where e(k, n)=[e-2kπ/N e-2kπ*2/N e-2kπ*3/N ... e-2kπ*(N-1)/N ].
For each value of k, I get a coefficient. Similarly I got coefficients for all basis in the vector space.
Now to reconstruct the original...
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.
