EE351 Spring 2017 Zahid Extra Credit 2 Due: Sunday, February

EE351, Spring 2017, Zahid Extra Credit #2 Due: Sunday, February 5, Midnight Please read the following notes carefully

EE351, Spring 2017, Zahid Extra Credit #2 Due: Sunday, February 5, Midnight Please read the following notes carefully: 1. Extra credit assignments will be assigned periodically throughout the semester. The extra credits will be added to your midterm scores at the end of the semester. 2. Extra Credits are individual efforts; they are not group projects. Any indication of copying from each other will results in a grade of F. It is not worth the embarrassment! 3. Extra Credits are OPTIONAL. You don't need to submit them if you are confident that you will do well in class and you won't need the help 4. All submissions (detailed, I am not interested in answers only or in Yes or No?) must be e-mailed to [email protected]. Your attachment must be in a word/pdf/scanned file format. NO TEXT attachments and NO hardcopy. You must include your full name on every page (not only in the e-mail) of your solutions file and you MUST specify the following in the subject field of your e-mail "EE350-Extra Credit-Set #2". 5. When assigned, extra credits will always be assigned on Thursday night. They are due midnight the following Sunday). Your e-mail has to indicate the time of submission. No late submissions are accepted no matter what the reasons are. 6. Here is the first extra credit assignment. It is due Midnight, Feb 5. Good Luck. mailto: [email protected]

Paper For Above instruction

The assignment involves analyzing discrete systems and sequences to determine their properties, which are fundamental concepts in signal processing and systems theory. The first part requires evaluating whether certain discrete-time systems are linear, shift-invariant, causal, memoryless, and stable. The second part involves analyzing specific sequences for periodicity and identifying their periods if they exist.

Analysis of Discrete Systems

Given the systems:

  • y(n) = n x(n)
  • y(n) = x(2 - n)
  • y(n) = x(n) u(n)
  • y(n) = x(n) x(n - 1)

Each system must be evaluated for the following properties:

  1. Linearity: A system is linear if it satisfies the principles of additivity and homogeneity. For two inputs x₁(n) and x₂(n) with outputs y₁(n) and y₂(n), respectively, the system's output for the sum should equal the sum of the individual outputs, and scaling the input should scale the output correspondingly.
  2. Shift-Invariance: A system is shift-invariant if a shift in the input signal results in an identical shift in the output without changing the shape or amplitude.
  3. Causality: A system is causal if the output at any time n depends only on current and past inputs, not future inputs.
  4. Memoryless: A system is memoryless if the output at any time n depends only on the input at the same time n.
  5. Stability: A system is BIBO (Bounded Input, Bounded Output) stable if bounded inputs produce bounded outputs.

Applying these criteria to each system involves algebraic and conceptual analysis to conclude whether each property holds or not.

Analysis of Sequences for Periodicity

Given the sequences:

  • x(n) = e^(j 7π n/9)
  • x(n) = cos(6π n/9)
  • x(n) = sin(7π n/9)

Determine whether each sequence is periodic. If it is, find the period; if not, explain why it is not periodic.

Periodicity in discrete sequences depends on the rationality of the frequency relative to 2π. For complex exponentials, the sequence is periodic if the ratio of the frequency to 2π is a rational number with a rational period. For cosines and sines, the same applies, as they are related to complex exponentials via Euler’s formulas.

Specifically, a sequence x(n) = e^{jωn} is periodic if and only if ω/(2π) is a rational number, i.e., ω/(2π) = p/q with integers p, q; in that case, the period N = q.

Conclusion

This assignment tests foundational concepts in systems and signals, requiring application of system analysis principles and understanding of periodicity conditions for discrete sequences. Proper explanations should be provided to support each conclusion, referencing core theories in signal processing.

References

  1. Oppenheim, A. V., & Willsky, A. S. (1997). Signals and Systems. Prentice-Hall.
  2. Proakis, J. G., & Manolakis, D. G. (2006). Digital Signal Processing: Principles, Algorithms, and Applications. Pearson.
  3. Strang, G. (1999). The Discrete Fourier Transform. SIAM Review.
  4. Haykin, S. (2002). Adaptive Filter Theory. Prentice Hall.
  5. Kreyszig, E. (1989). Introductory Functional Analysis with Applications. Wiley.
  6. Mitola, J. (2000). Cognitive radio: Making software radios more personal. IEEE Personal Communications.
  7. Lathi, B. P. (2009). Signal Processing and Linear Systems. Oxford University Press.
  8. Vetterli, M., Kovačević, J., & Goyal, V. K. (2014). Foundations of Signal Processing. Cambridge University Press.
  9. Mallat, S. (1999). A Wavelet Tour of Signal Processing. Academic Press.
  10. Chen, C. T. (1999). Analog and Digital Signal Processing. Oxford University Press.

Related Assignments