0% found this document useful (0 votes)
39 views14 pages

Lecture 2 Signal Processing

The document outlines the basics of signal processing, focusing on the classification of systems into continuous and discrete types. It discusses examples of each type and the interconnection of systems, including series and parallel connections. Additionally, it explains the concepts of memoryless and memory systems, providing examples and practice problems for understanding.

Uploaded by

kenneth kilian
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
39 views14 pages

Lecture 2 Signal Processing

The document outlines the basics of signal processing, focusing on the classification of systems into continuous and discrete types. It discusses examples of each type and the interconnection of systems, including series and parallel connections. Additionally, it explains the concepts of memoryless and memory systems, providing examples and practice problems for understanding.

Uploaded by

kenneth kilian
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Signal Processing I

(23ECE112)
Ms. Latha S
Assistant Professor
Room no B-206, ECE department
Email id: s_latha@[Link]
Introduction

• Till now we have studied basics of signals and elementary signals

• Systems are used for processing the information contained in signals.

• A system takes one or more signals as its input, processes/manipulates it and produces
another signal as output.

Input Signal Output Signal


System
Introduction

• A system can be viewed as an interconnection of several components together which


achieves a goal.
Classification of systems
• Systems can be broadly classified into two types: Continuous and discrete

• A continuous time system, inputs and outputs a continuous time signal

Input Signal Output Signal


𝑥(𝑡) Continuous- 𝑦(𝑡)
time System

• We represent it as 𝑥 𝑡 → 𝑦 𝑡 .
Examples of continuous time systems
• Example 1: Amplifier

• Input output relation: 𝑦 𝑡 = 𝑎 𝑥 𝑡

• Example 2: RC circuit

• Input output relation:

1 𝑡
• 𝑣𝑖 𝑡 = 𝑖 𝑡 𝑅 + ‫׬‬0 𝑖 𝑡 𝑑𝑡
𝐶

𝑑 𝑣𝑜 (𝑡)
• 𝑣𝑖 𝑡 = 𝑅𝐶 + 𝑣𝑜 (𝑡)
𝑑𝑡

𝑑 𝑣𝑜 (𝑡) 1 1
• + 𝑣𝑜 (𝑡)= 𝑣𝑖 𝑡
𝑑𝑡 𝑅𝐶 𝑅𝐶

• Here the input output relation is a differential equation.


Discrete time systems
• A system that processes discrete time signals. Both input and output signals are discrete
time signals.

Input Signal Output Signal


𝑥[𝑛] Discrete-time 𝑦[𝑛]
System

• We represent it as 𝑥[𝑛] → 𝑦[𝑛]


Examples of discrete time systems

• Example 1: Delay element

• Input output relation 𝑦 𝑛 = 𝑥[𝑛 − 𝑛0 ]


Examples of discrete time systems
• Example 2: Echo effect in audio

• Input output relation: 𝑦 𝑛 = 𝑠 𝑛 + 𝛼1 s n − 𝑛0 + 𝛼2 s n − 2𝑛0 + 𝛼3 s n − 3𝑛0


Interconnection of systems
• Several smaller systems (subsystems) can be interconnected together to form large complex
systems.

• There are some basic ways of interconnecting subsystems

• The first approach is called Cascade connection/series connection

• Another approach is the parallel connection


Interconnection of systems
• Series Parallel connection

• Feedback form
Properties and Classification of systems

• Memoryless systems:- Present output value depends only on the present value of the input
• E.g: 𝑦 𝑡 = 2𝑥(𝑡), 𝑦 𝑡 = log(𝑥(𝑡)), 𝑦 𝑛 = 𝑥 2 [𝑛], 𝑦 𝑛 = 3 𝑥 𝑛 − 𝑥 3 [𝑛]
• Identity system 𝑦 𝑡 = 𝑥(𝑡), 𝑦[𝑛] = 𝑥[𝑛]

𝑣(𝑡)
𝑖 𝑡 =
𝑅
• Memory Systems: If the present output value depends on the past or future
values of the input and/or the past or future values output, then we say that the
system has memory.
• E.g: 𝑦 𝑡 = 𝑥(𝑡 − 𝑡0 ), 𝑦 𝑛 = 𝑥[𝑛 + 3]

1 𝑡
𝑣 𝑡 = න𝑖 𝑡 𝑑𝑡
𝐶 0

Accumulator 𝑦 𝑛 = σ𝑛𝑘=−∞ 𝑥[𝑘]


• A system with memory stores/ retains information about the values of
the input signal other than the current time
Memory and memoryless systems

• Is the system 𝑦 𝑛 = 𝑦 𝑛 − 1 + 𝑥[𝑛] memoryless?

• 𝑦 𝑛 − 1 = 𝑦 𝑛 − 2 + 𝑥[𝑛 − 1].

• Substituting the value of 𝑦 𝑛 − 1 in 𝑦 𝑛 we see that 𝑦 𝑛 depends on 𝑥[𝑛 − 1]. Hence it


has memory.

• A system has memory if it depends on past or future values of the input or output.
Practice problems
• Check if the following systems have memory or not?
𝑦(𝑡) = 𝑡𝑥(𝑡)
𝑦 𝑛 = 2𝑛 + 2 𝑥[𝑛]
𝑦 𝑡 = 𝑚𝑥 𝑡 + 𝑐
𝑦 𝑛 = 2𝑥 𝑛 + 3

𝑡
𝑦 𝑡 =𝑥
2
𝑦 𝑛 = 𝑥 3𝑛
𝑦 𝑡 = 𝑥 2𝑡 + 3
𝑦 𝑛 =𝑥 𝑛+5
𝑦 𝑡 = 2𝑥 𝑡 + 𝑦(𝑡 − 2)
𝑦 𝑛 = 3𝑦 𝑛 − 1 + 4𝑥 𝑛

You might also like