Scribd
Upload
62 views20 pages

2.1 Discrete-Time Signals

This document discusses discrete-time signals and their representation and properties. It defines discrete-time signals as sequences of numbers called samples, with the sample value at time n denoted as x[n]. Samples are only defined for integer values of n. Common representations of discrete-time signals include the time-domain sequence representation {x[n]}, functional representation, and graphical representation. Operations that can be performed on discrete-time signals include addition, multiplication, time-reversal, and combinations of these basic operations. Discrete-time signals can be classified as periodic, symmetric, antisymmetric, bounded, absolutely summable, and square summable based on their mathematical properties.

Uploaded by

nishan jayraman
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
62 views20 pages

2.1 Discrete-Time Signals

This document discusses discrete-time signals and their representation and properties. It defines discrete-time signals as sequences of numbers called samples, with the sample value at time n denoted as x[n]. Samples are only defined for integer values of n. Common representations of discrete-time signals include the time-domain sequence representation {x[n]}, functional representation, and graphical representation. Operations that can be performed on discrete-time signals include addition, multiplication, time-reversal, and combinations of these basic operations. Discrete-time signals can be classified as periodic, symmetric, antisymmetric, bounded, absolutely summable, and square summable based on their mathematical properties.

Uploaded by

nishan jayraman
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
You are on page 1/ 20

2.

1 Discrete-time Signals
2.1.1 Time-domain representation
2.1.2 Operations on sequences
2.1.3 Classification of sequences

2.1.1Time-domain representation
Signals represented as sequences of numbers, called
samples

Sample value of a typical signal or sequence denoted as


x[n] with n being an integer in the range
x[n] defined only for integer values of n and undefined for
noninteger values of n n
Discrete-time signal represented by {x[n] }
Discrete-time signal may also be written as a sequence of
numbers inside braces:

{x[n]}= {.1, 2, 3, 4, 5, 6, 4.5, 2.5, 0.5, -1, -2,}

In the above, x[-1]=3, x[0]=4, x[1]=5


2

The arrow is placed under the sample at time index n = 0


Functional representation:

2 n = 1, 4

x[n] = -1 n = 3, 5
0 elsewhere

Graphical representation of a discrete-time signal:


2

x [n ]

-1

-1

In a sequence {x[n]}, the quantity x[n] is called the n-th sample


of the sequence
{x[n]} is a real sequence, if the the n-th sample x[n] is real for
all values of n
Otherwise, {x[n]} is a complex sequence
A complex sequence {x[n]} can be written as
{x[n]}= {xre[n]} +{xim[n]}
Where xre[n] and xim[n] are the real and imaginary parts of x[n]
The complex conjugate sequence of {x[n]} is given by

{x [n]} = {x [n]} j{x [n]}


*

re

im

A discrete-time signal may be a finite-length or an infinitelength sequence


Finite-length (also called finite-duration or finite-extent)
sequence is defined only for a finite time interval:
N1 n N 2 where < N1 and N 2 < with N1 N 2

Length or duration of the above finite-length sequence is


N = N 2 N1 + 1

Example - x[n] = n 2 ,3 n 4 is a finite length sequence of length


4-(-3)+1 =8
y[ n] = cos 0.4n is an infinite-length sequence

A length-N sequence is often referred to as a N-point sequence


The length of a finite-length sequence can be increased by
zero-padding, i.e., by appending it with zeros

n 2 , 3 n 4
Example x[n] =
5n8
0,
is a finite-length sequence of length 12 obtained by zero-padding
with 4 zero-valued samples

2.1.2 Operations on sequences


A single-input, single-output discrete-time
system operates on a sequence, called the
input sequence, according some prescribed
rules and develops another sequence, called
output sequence, with more desirable
properties
Discrete-time system
x[n]

y[n]

Input sequence

Output sequence

For example, the input may be a signal corrupted with additive


noise
Discrete-time system is designed to generate an output by
removing the noise component from the input
In most cases, the operation defining a particular discrete-time
system is composed of some basic operations
Product (modulation) operation:y[n] = x1[n] . x2[n]
Addition operation: y[n] = x [n] + x [n]
1
2
Multiplication operation: y[n] = A . x[n]
Time-reversal (folding) operation:y[n] = x[-n]

10

11

12

Combinations of basic operations

13

2.1.3 Classification of sequences

20

Periodical: x[n] = x[n + kN] n, k

10
0

10

20

30

40

50

60

70

80

90

100

14

x[-n] = x[n]

Symmetric (even):
20
10
0
-10

-8

-6

-4

-2

10

Antisymmetric (odd): x[-n] = -x[n]


20
0
-20
-10

-8

-6

-4

-2

10

|x[n]| B

Bounded:

Absolute summable:

x[n] <

n=

Square summable:

x[n] <
2

n=

15

16

Energy & Power signal

17

18

19

Signal to noise ratio

20

You might also like