Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Practice with the fast Fourier transform.

(a) What is the FFT of (1,0,0,0)? What is the appropriate value of ωin this case? And of which sequence is (1,0,0,0)the FFT?

(b)Repeat for (1,0,1,-1).

Short Answer

Expert verified

Part (a)

FTT of (1,0,0,0) is: (1,1,1,1)

Approximate value of ωis: i

Sequence is:14,14,14,14

Part (b)

FTT of (1,0,1,-1) is:(1,i,3,-i)

Step by step solution

01

Solution of part (a)

Fast Fourier Transform (FFT) of 1,0,0,0& the numbers of ω':

The 4×4matrix of FFT is,

M4ω'=11111ωω2ω31ω2ω4ω61ω3ω6ω9 …… (1)

The nth root of unity's complicated value ωis,

localid="1658922894437" ω'=e2πin …… (2)

Extra information base calculation value “4” for “n” in the Equation (2). Thus, the value of ωis,

ω'=e2πin

=eπi2

Note: eix=cosx+isinx

Thus, eπi2has been written as given details:

localid="1658923197401" ω=cosπ2+isinπ2=cos90+isin90(3)

=0+i1ω=i

Alternative calculation of Equation (3) in Equation (1),

M4ω'=11111ii2i31i2i4i61i3i6i9......4Ingeneral,thevalueofi,i2i3i4are,i=ii2=-1i3=-ii4=1......5Thecalculationvalueofi6,i9is,i6=i4×i2=-1i9=i6×i3=i......6Alternativecalculationvaluesarei,i2,i3,i4,i6,i9inEquation(4).TheFFTmatrixis,

M4ω'=11111i-1-i1-11-11-i-1i......7LetthegivenmatrixbeA=1000......8

The FFT of A is,

The FFT of 1,0,0,0=M4ω'×A......9 …… (9)

Alternative of calculation related value of “A” matrix and M4ωin Equation (9),

=11111i-1-i1-11-11-i-1i×1000=1111

As a result of Calculation (3), the correct value ofω=iand the FFT of (1,0,0,0) is (1,1,1,1).

Progression of FFT it is priceless1,0,0,0:

Apply the inverted FFT, which equals to determine the FFT sequence,

Inverse FFT=1nMnω-1…… (10)

Here, from Equation (3), the value of . Thus, the value of is:

role="math" localid="1658981947890" =cosπ2+isinπ2-1=cos-π2+isinπ2=cosπ2-isinπ2ω-1=-i(11)

Accepting the value of role="math" localid="1658982023034" M4ω-2substitute i=-i in Equation (4)

M4ω-2=11111-i-1i1-11-11i-1-i......12

Now let us say the matrix is

B=1000(13) …… (13)

So, there is inverse FFT (B) is,

The inverse FFT (B)=14BMnω-1 …… (14)

Substitute the value of “B” matrix and Mnω-1in Equation (14),

=1411111-i-1i1-11-11i-1-i×1000=141111

Therefore, the sequence of FFT that has the1,0,0,0is14,14,14,14

02

Solution of part (b)

Fast Fourier Transform (FFT) of ( 1,0,1,-1 ) :

Let the given matrix be,

C=101-1......15

The FFT of ( 1,0,10-1 ) is,

The FFT of 1,0,1,-1=CMnω-1 …… (16)

Substitute the value of “C” matrix and Mnω-1in Equation (16),

=11111i-1-i1-11-11-i-1i×101-1=1+0+1-11+0-1+i1+0+1+11+0-1-i=1i3-1

Therefore, the FFT of 1,0,1,-1is1,i,3,-iis .

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

A kway merge operation. Suppose you have ksorted arrays, each with nelements, and you want to combine them into a single sorted array ofkn elements.

(a)Here’s one strategy: Using the merge procedure from Section 2.3, merge the first two arrays, then merge in the third, then merge in the fourth, and so on. What is the time complexity of this algorithm, in terms of kand n?

(b) Give a more efficient solution to this problem, using divide-and-conquer.

Question: On page 66 there is a high-level description of the quicksort algorithm.

(a) Write down the pseudocode for quicksort.

(b) Show that its worst - case running time on an array of size n is Θ(n)2.

(c) Show that its expected running time satisfies the recurrence relation.

T(n)O(n)+1ni=1n-1(Ti+Tn-i)

Then, show that the solution to this recurrence is O(nlogn).

How many lines, as a function of n (in (.)form), does the following program print? Write a recurrence and solve it. You may assume is a power of . function f (n) if n > 1:

print_line (‘‘still going’’)

f (n/2)

f (n/2)

Question: Use the divide-and-conquer integer multiplication algorithm to multiply the two binary integers 10011011and10111010 and .

Question: Solve the following recurrence relations and give a bound for each of them.

(a)T(n)=2T(n/3)+1(b)T(n)=5T(n/4)+n(c)T(n)=7T(n/7)+n(d)T(n)=9T(n/3)+n2(e)T(n)=8T(n/2)+n3(f)T(n)=49T(n/25)+n(3/2)logn(g)T(n)=T(n-1)+2(h)T(n)=T(n-1)+nc,whereisaconstant(i)T(n)=T(n-1)+cn,whereissomeconstant(j)T(n)=2T(n-1)+1(k)T(n)=T(n)+1

See all solutions

Recommended explanations on Computer Science Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free