- #1

- 27

- 0

## Homework Statement

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

## Homework Equations

[/B]

Nlog

_{2}N

## The Attempt at a Solution

[/B]

The vectors were padded with zeros but I'm working under the assumption that can be negated.

x1(n) = 4log

_{2}4 = 8

x2(n) = 5log

_{2}5 = 11.61

product of both created an 8 length vector

8log

_{2}8 = 24

Do I add these? The 5 one doesn't seem correct, something about it being a prime factor that doesn't hold for the equation?