GATE EC 2016 Set 3 — Question 45

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
NAT+2 / -0HardDFT & FFTDiscrete-Time SignalsSignals & Systems

Signals & Systems → Discrete-Time Signals → DFT & FFT

Last updated

Question

A continuous-time speech signal xa(t)x_a(t) is sampled at a rate of 8 kHz and the samples are subsequently grouped in blocks, each of size NN. The DFT of each block is to be computed in real time using the radix-2 decimation-in-frequency FFT algorithm. If the processor performs all operations sequentially, and takes 20 μ\mu s for computing each complex multiplication (including multiplications by 1 and 1-1) and the time required for addition/subtraction is negligible, then the maximum value of NN is __________
Your answer

Enter a number. Decimals, negative values and scientific notation are accepted.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE EC question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Discrete-Time Signals