Question

In: Electrical Engineering

1. A length-10 discrete-time signal x[n] is defined by the values { 6, 1, 1, 6,...

1. A length-10 discrete-time signal x[n] is defined by the values { 6, 1, 1, 6, 1, 1, 6, 1, 1, 0 }.
After taking the 10-pt DFT, X[k], determine the DC value, i.e., X[0].

2. Suppose that the N-point DFT of the signal x[n]x[n] is X[k]. A new signal y[n] is formed by adding a constant:

y[n]=x[n]+1 for n=0,1,2,…,N−1n=0,1,2,…,N−1

The N-point DFT of Y[k] is:

Solutions

Expert Solution

Part 1.

To calculate DFT of N time, the formula is

where N = 10, and 0<=k<=10

for DC value of X(k) can be calculated by putting k = 0 in the equation

  

  

  

  

Part 2

given us

  

which means at every time instant we are adding a constant 1

therefor y(n) become y(n) = {7,2,2,7,2,2,7,2,2,1}

now form the dft eqution

  

for k = 0;

  

  

  

for k = 1;

  

  

for k = 2;

  

  

similarly

  

  

  

  

  

  

  

we also can use the 10*10 square DFT matrix to calculate 10 points DFT, but it will be quite complex.


Related Solutions

Consider a discrete-time periodic signal x [ n ]   =   cos ( 0 . 7 πn ) (1)...
Consider a discrete-time periodic signal x [ n ]   =   cos ( 0 . 7 πn ) (1) Determine the fundamental period of x[n]. (2) Suppose x[n] is obtained by sampling the continuous-time signal  x ( t )   =   cos   ( πt ), by letting the sampling period to be T s =   0 . 7 and considering the sample values at each n. Is the Nyquist sampling conditions satisfied in this case? Explain and relate this to the answer given before. (3) Under that conditions would...
Use and provide Matlab for the following: Generate the discrete-time signal x[n] = 4 cos (2pi....
Use and provide Matlab for the following: Generate the discrete-time signal x[n] = 4 cos (2pi. 10. nT5) + 2cos(2pi. 100. nT5) + 3cos(2pi 200. nT's), with Ts0.001 sec. Display the signal in both time and frequency-domain. Assume that the 100 Hz component of x [n] is your desired signal while the other two components are noise. Design a suitable filter to extract the desired (i.e. 100 Hz) signal. Display the filter's response. Display the output signal in the frequency-domain....
1. (Memoryless property) [10] Consider a discrete random variable X ∈ N (X ∈ N is...
1. (Memoryless property) [10] Consider a discrete random variable X ∈ N (X ∈ N is a convention to represent that the range of X is N). It is memoryless if Pr{X > n + m|X > m} = Pr{X > n}, ∀m,n ∈{0,1,...}. a) Let X ∼ G(p), 0 < p ≤ 1. Show that X is memoryless. [2] b) Show that if a discrete positive integer-valued random variable X is memoryless, it must be a geometric random variable,...
4. For a signal x(n)=sin(2*pi*n/3) defined for n=0to7, evaluate the Fast Fourier Transform using signal flow...
4. For a signal x(n)=sin(2*pi*n/3) defined for n=0to7, evaluate the Fast Fourier Transform using signal flow graph. (Use decimation in frequency Algorithm)     
For a signal x(n)=sin(2*pi*n/5) defined for n=0to7, evaluate the Fast Fourier Transform using signal flow graph....
For a signal x(n)=sin(2*pi*n/5) defined for n=0to7, evaluate the Fast Fourier Transform using signal flow graph. (Use decimation in Time Algorithm).                                               
4. For a signal x(n)=sin(4*pi*n/5) defined for n=0to7, evaluate the Fast Fourier Transform using signal flow...
4. For a signal x(n)=sin(4*pi*n/5) defined for n=0to7, evaluate the Fast Fourier Transform using signal flow graph. (Use decimation in Time Algorithm).                                                
For a signal x(n)=sin(2*pi*n/5) defined for n=0to7, evaluate the Fast Fourier Transform using signal flow graph....
For a signal x(n)=sin(2*pi*n/5) defined for n=0to7, evaluate the Fast Fourier Transform using signal flow graph. (Use decimation in Time Algorithm).                                               
Signals and systems Consider the following discrete signal x[n] = sin(π n/32) (u[n]-u[n-33]) a) Using MATLAB...
Signals and systems Consider the following discrete signal x[n] = sin(π n/32) (u[n]-u[n-33]) a) Using MATLAB only, Find the DFT using FFT algorithm, b) Plot the signal x[n], spectrum |X(ω)|^2 , and phase of X(ω). Hint: use L=512 for FFT.
1. The probability mass function of a discrete random variable X is defined as p(x) =...
1. The probability mass function of a discrete random variable X is defined as p(x) = ax for x = 1, 2, 4, 8 (p(x) =0 for all other values) then the value of a is? 2. Let X be a discrete random variable with Var(X) =6.0 and E(X2) = 17.00. Then: E(X) = ? 3. If X is a binomial random variable with parameters n and p, i.e. X ~ b(x; n, p), then the expected value of X...
For any sequence, S[1…n], of length n, a basement is defined as a contiguous subsequence of...
For any sequence, S[1…n], of length n, a basement is defined as a contiguous subsequence of S, which we denote by S[ i, i + 1, ..., j – 1, j ], with 1 £ i < i + 1 <   j – 1 < j £ n, satisfying the following conditions: S[ i ] > S[ i + 1] S[ j – 1] < S[ j ] 1 £ i < i + 1 <   j – 1 <...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT