Skip to content
Signal Processing –
Medium Difficulty
ARE YOU READY?
LET’S PRACTICE!
#1. The stability of FIR filters is:
#2. A radix-2 FFT requires the sequence length N to be:
#3. The Hanning window has the form:
#4. Linear phase in FIR filter requires:
#5. A linear-phase filter has group delay that is:
#6. In filter design, the transition band is:
#7. A Butterworth filter is characterized by:
#8. A signal with maximum frequency 4 kHz should be sampled at least at:
#9. Dithering in ADC is used to:
#11. The rectangular window has the _____ main lobe but _____ sidelobes:
#12. An all-pass filter has:
#13. Quantization noise in ADC is modeled as:
#14. Increasing N in DFT (more samples):
#15. The Z-transform of the unit step u[n] is:
#16. The Nyquist frequency is defined as:
#17. An FIR filter with N coefficients has how many zeros?
#18. The group delay of a filter is:
#19. Zero-padding in DFT:
#20. Passband ripple is specified in:
#21. A sample-and-hold circuit is needed because:
#22. An anti-aliasing filter is placed:
#23. The Parks-McClellan algorithm designs:
#24. The frequency response of ZOH has the form:
#25. Sigma-delta modulation uses:
#26. Interpolation by factor L means:
#27. Partial fraction expansion in z-domain typically uses:
#28. The signal-to-quantization-noise ratio (SQNR) for a B-bit ADC is approximately:
#29. A Bessel filter is designed for:
#30. Which filter type always has linear phase?
#31. Linear convolution using DFT requires:
#32. The difference equation y[n] = x[n] – x[n-1] represents:
#33. The difference equation y[n] = x[n] + x[n-N] represents:
#34. For a B-bit ADC with full-scale range V, the quantization step size is:
#35. An elliptic (Cauer) filter has:
#36. Frequency warping in bilinear transformation means:
#37. The twiddle factor WN in FFT is defined as:
#38. The Z-transform of the unit sample δ[n] is:
#39. The impulse response of H(z) = 1 + 0.5z^(-1) + 0.25z^(-2) is:
#40. The Gibbs phenomenon occurs due to:
#41. The inverse DFT converts:
#42. The Z-transform of x[n] = a^n u[n] is:
#43. For a causal FIR filter, all poles are at:
#44. Circular convolution of two N-point sequences produces:
#45. Spectral leakage in DFT occurs because:
#46. If a 10 kHz signal is sampled at 8 kHz, the aliased frequency appears at:
#47. The frequency response of a digital filter is obtained by evaluating H(z) at:
#48. The convolution theorem states that convolution in time domain equals:
#50. The window method of FIR design involves:
#51. Oversampling by factor M improves SNR by:
#52. A first-order low-pass digital filter has the difference equation:
#53. The order of a filter affects:
#54. Before decimation by M, we must:
#55. The transfer function H(z) = (1 – z^(-1))/(1 – 0.9z^(-1)) represents:
#56. Parseval’s theorem relates:
#57. A Chebyshev Type II filter has:
#58. A causal discrete-time system has ROC:
#59. The FFT algorithm reduces DFT computation from O(N²) to:
#60. A moving average filter of order N is:
#61. The inverse Z-transform of z/(z-a) for |z| > |a| is:
#62. Noise shaping in sigma-delta converters pushes quantization noise to:
#63. Aliasing occurs when:
#64. The transfer function H(z) = 0.5(1 + z^(-1)) is a:
#65. The DFT of a sequence of length N produces:
#66. A Type I FIR filter has:
#67. The relationship between z and s domains is:
#68. Minimum-phase systems have:
#69. Stopband attenuation is the minimum:
#70. The Z-transform of a discrete sequence x[n] is defined as:
#71. A notch filter removes:
#72. Windowing is used in DFT to:
#73. The frequency resolution of an N-point DFT with sampling frequency fs is:
#74. According to the Nyquist theorem, to avoid aliasing, the sampling frequency must be:
#75. In the z-domain, a time shift of k samples (delay) corresponds to:
#76. The Kaiser window allows:
#77. A polyphase filter structure is used for:
#80. For the same filter order, which has the sharpest transition band?
#81. Zero-order hold (ZOH) in DAC produces:
#82. In the bilinear transformation s = (2/T)(z-1)/(z+1), the s-plane imaginary axis maps to:
#83. A Chebyshev Type I filter has:
#84. The short-time Fourier transform (STFT) provides:
#85. An ideal low-pass filter has impulse response:
#86. A discrete-time system is stable if all poles of H(z) are:
#87. For a real-valued signal, the DFT has:
#88. The reconstruction filter (after DAC) should be:
#89. Decimation by factor M means:
#90. The rolloff rate of an Nth order Butterworth filter in the stopband is:
#91. The Nyquist sampling rate for a signal with bandwidth 5 kHz is:
#92. Aliasing occurs when sampling frequency is:
#93. The order of an FIR filter with N taps is:
#94. A moving average filter is a type of:
#95. The region of convergence (ROC) for causal signals:
#96. The Z-transform of δ[n] is:
#97. A low-pass filter passes frequencies:
#98. The DFT of a sequence of length N produces:
#99. Quantization noise increases with:
#100. The Z-transform of u[n] (unit step) is:
