[amp_mcq option1=”It is not possible to construct a signal flow graph with both input and output in normal order” option2=”The number of butterflies in the mn state is $$\\frac{N}{m}$$” option3=”In-place computation requires storage of only 2N node data” option4=”Computation of a butterfly requires only one complex multiplication” correct=”option2″]<\/p>\n
The correct answer is: B. The number of butterflies in the mn state is $\\frac{N}{m}$<\/strong>.<\/p>\n A butterfly is a basic operation in the Fast Fourier Transform (FFT) algorithm. It consists of two complex multiplications and two complex additions. The number of butterflies in the mn state is equal to the number of complex numbers in the input sequence, which is $\\frac{N}{m}$.<\/p>\n Option A is incorrect because it is possible to construct a signal flow graph with both input and output in normal order. This is done by using a butterfly network.<\/p>\n Option C is incorrect because in-place computation requires storage of all $N$ node data. This is because the input sequence is stored in the same memory locations as the output sequence.<\/p>\n Option D is incorrect because computation of a butterfly requires two complex multiplications and two complex additions.<\/p>\n","protected":false},"excerpt":{"rendered":" [amp_mcq option1=”It is not possible to construct a signal flow graph with both input and output in normal order” option2=”The number of butterflies in the mn state is $$\\frac{N}{m}$$” option3=”In-place computation requires storage of only 2N node data” option4=”Computation of a butterfly requires only one complex multiplication” correct=”option2″]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[959],"tags":[],"class_list":["post-58950","post","type-post","status-publish","format-standard","hentry","category-signal-processing","no-featured-image-padding"],"yoast_head":"\n