Insights Blog
-- Browse All Articles --
Physics Articles
Physics Tutorials
Physics Guides
Physics FAQ
Math Articles
Math Tutorials
Math Guides
Math FAQ
Education Articles
Education Guides
Bio/Chem Articles
Technology Guides
Computer Science Tutorials
Forums
Intro Physics Homework Help
Advanced Physics Homework Help
Precalculus Homework Help
Calculus Homework Help
Bio/Chem Homework Help
Engineering Homework Help
Trending
Featured Threads
Log in
Register
What's new
Search
Search
Search titles only
By:
Intro Physics Homework Help
Advanced Physics Homework Help
Precalculus Homework Help
Calculus Homework Help
Bio/Chem Homework Help
Engineering Homework Help
Menu
Log in
Register
Navigation
More options
Contact us
Close Menu
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Forums
Homework Help
Engineering and Comp Sci Homework Help
Number of complex calculations in FFT and inverse FFT
Reply to thread
Message
[QUOTE="Jimmy Johnson, post: 4988523, member: 539639"] [h2]Homework Statement[/h2] Calculate the total number of compex multiplications required for the calculation in (b) when FFTs are used to perform the Discrete Fourier Transforms and Inverse Discrete Fourier Transforms.[/B] There were two FFT multiplied together and one inverse FFT of that product to solve B. x1(n) = [1, 0, −1, 1] x2(n) = [2, 3, 2, 0, 1 [h2]Homework Equations[/h2] [/B] Nlog[SUB]2[/SUB]N [h2]The Attempt at a Solution[/h2] [/B] The vectors were padded with zeros but I'm working under the assumption that can be negated. x1(n) = 4log[SUB]2[/SUB]4 = 8 x2(n) = 5log[SUB]2[/SUB]5 = 11.61 product of both created an 8 length vector 8log[SUB]2[/SUB]8 = 24Do I add these? The 5 one doesn't seem correct, something about it being a prime factor that doesn't hold for the equation? [/QUOTE]
Insert quotes…
Post reply
Forums
Homework Help
Engineering and Comp Sci Homework Help
Number of complex calculations in FFT and inverse FFT
Back
Top