Subjects
Books
Showing: discrete time signal processing • reset
or   Classic search
<prev • 38 results • page 1 of 2 • next >
0
votes
0
answers
923
views
0
answers
Question Paper: Discrete Time Signal Processing : Question Paper May 2016 - Electronics & Telecomm (Semester 6) | Mumbai University (MU)
question paper discrete time signal processing mu electronics &amp; telecomm (semester 6) updated 2.5 years ago by Team Ques10 ♦♦ 440
0
votes
1
answer
699
views
1
answer
Sketch the frequency response and identify the following filters based on their passband
mumbai university discrete time signal processing updated 3.1 years ago by Juilee • 2.5k
0
votes
1
answer
916
views
1
answer
By using FFT - 2FFT find linear convolution,
mumbai university discrete time signal processing updated 3.3 years ago by Aksh_31 • 690
0
votes
1
answer
1.8k
views
1
answer
Write a short note on
mumbai university discrete time signal processing updated 3.3 years ago by Aksh_31 • 690
0
votes
1
answer
785
views
1
answer
Consider the following specifications for a low pass filter $0.99 < I H (e^{\omega} ) 1 < 1.01\space 0 < {\omega} < 0 3 \pi $ and
mumbai university discrete time signal processing updated 3.3 years ago by Aksh_31 • 690
0
votes
1
answer
2.6k
views
1
answer
What is multirate DSP? Where it is required?
mumbai university discrete time signal processing updated 3.3 years ago by Aksh_31 • 690
0
votes
1
answer
623
views
1
answer
Determine the zeros of the following FIR systems and indicate whether the system is minimum phase, maximum phase or mixed phase.
mumbai university discrete time signal processing updated 3.3 years ago by Aksh_31 • 690
0
votes
1
answer
708
views
1
answer
Design a digital low pass IIR Butterworth filter for the following specification
mumbai university discrete time signal processing updated 3.3 years ago by Aksh_31 • 690
0
votes
1
answer
4.1k
views
1
answer
Obtain cascade and parallel realization structures for the system described by $y (n) = 0.1y (n-1) + 0.72y (n-2) + 0.7 \times (n) - 0.252 \times (n-1). $
mumbai university discrete time signal processing updated 3.3 years ago by Aksh_31 • 690
0
votes
1
answer
2.7k
views
1
answer
Explain the effects of coefficient quantization in FIR filters.
mumbai university discrete time signal processing updated 3.3 years ago by Aksh_31 • 690
0
votes
1
answer
652
views
1
answer
The transfer function of digital causal system is given as follows: $H(z)=\dfrac {1-z^{-1}}{1-0.2z^{-1}-0.15z^{-2}} $. Draw cascade form, parallel form realization
mumbai university discrete time signal processing updated 3.3 years ago by Aksh_31 • 690
0
votes
1
answer
776
views
1
answer
Design digital low pass IIR Butterworth filter for the following specifications:
mumbai university discrete time signal processing updated 3.3 years ago by Aksh_31 • 690
0
votes
1
answer
878
views
1
answer
Explain the effects of coefficient quantization in FIR filters
mumbai university discrete time signal processing updated 3.3 years ago by Aksh_31 • 690
0
votes
1
answer
1.1k
views
1
answer
An analog filter has transfer function $H(s)=\dfrac {S+0.1}{(s+0.1)^2+16}$. Determine the transfer function of digital filter using bilinear transformation.
mumbai university discrete time signal processing updated 3.3 years ago by Aksh_31 • 690
0
votes
1
answer
1.3k
views
1
answer
Explain up- sampling process in detail and derive for input-output relationship in time domain and frequency domain.
mumbai university discrete time signal processing updated 3.4 years ago by Aksh_31 • 690
0
votes
1
answer
860
views
1
answer
If $X (n) = \{1 + 2j, 3 + 4j, 5+6j, 7 + 8j\}.$ Find DFT X(k) using DIF-FFT algorithm.
mumbai university discrete time signal processing updated 3.4 years ago by Aksh_31 • 690
0
votes
1
answer
1.9k
views
1
answer
Compute DFT of sequence $x(n) = \{1, 2, 2, 2, 1, 0, 0, 0\}$ using DIT-FFT algorithm.
mumbai university discrete time signal processing updated 3.4 years ago by Aksh_31 • 690
0
votes
1
answer
2.4k
views
1
answer
The first five points of eight point DFT of real valued signal are $\{0.25, 0.125 -j0.3018, 0, 0.125-j0.0150, 0\}$. Determine the remaining three points.
mumbai university discrete time signal processing updated 3.4 years ago by Aksh_31 • 690
0
votes
1
answer
1.0k
views
1
answer
By means of FFT-IFFT technique compute the linear convolution of $x [n] = \{2,2,1,1\}$ and $h[n] = \{1,2,3,4\}$.
mumbai university discrete time signal processing updated 3.4 years ago by Aksh_31 • 690
0
votes
1
answer
619
views
1
answer
$x = \begin{cases} 1 & 0\leq n\leq 3 \\ 0 & 4\leq n\leq 7. \end{cases}$
mumbai university discrete time signal processing updated 3.4 years ago by Aksh_31 • 690
0
votes
1
answer
1.5k
views
1
answer
The first five points of eight point DFT of real valued sequence are
mumbai university discrete time signal processing updated 3.4 years ago by Aksh_31 • 690
0
votes
1
answer
4.6k
views
1
answer
Justify DFT as a linear transformation.
mumbai university discrete time signal processing myposts updated 3.4 years ago by Aksh_31 • 690
0
votes
1
answer
1.1k
views
1
answer
Identify whether the following system is minimum phase, maximum phase, mixed phase.$ (i) H_1(z)=6+ z^{-1} + z^{-2} (ii) H_2(z)=1 - z^{-1}- 6z^{-2} $
mumbai university discrete time signal processing updated 3.4 years ago by Aksh_31 • 690
0
votes
1
answer
837
views
1
answer
Sketch the frequency response and identify the following filters based on their passband
mumbai university discrete time signal processing updated 3.4 years ago by Aksh_31 • 690
0
votes
0
answers
969
views
0
answers
Question Paper: Discrete Time Signal Processing : Question Paper May 2015 - Electronics & Telecomm. (Semester 6) | Mumbai University (MU)
mumbai university question paper electronics and telecomm (semester 6) discrete time signal processing updated 3.5 years ago by Team Ques10 ♦♦ 440
<prev • 38 results • page 1 of 2 • next >
Top Members • All »
Recent Awards • All »