LECTURE NOTES 3 – OPERATION ON SEQUENCE

Time Shifting 𝑛
Up-sampled signal: 𝑥 [ ] where k is a positive integer,
Transformation defined by 𝑘
new sequence is obtained by inserting k-1 number of
𝑦[𝑛] = 𝑥[𝑛 − 𝑘]
zeros between samples, it is also called ________
Based on sequence count,
𝑥[𝑛] = [3, 5, −1, 2, 8, 7]
• Delay: Signal shifted to the right by k-samples if k
↑
is positive
• Advanced: Signal shifted to the left by k-samples if
Insert k-1 number of zeros between samples
k is negative 𝑛
𝑥 [ ] = [3, 0, 5, 0, −1, 0, 2, 0, 8, 0, 7]
2
Based on arrow (if no indicated interval), ↑
• Delay: arrow moves to the left if k is positive
• Advanced: arrow moves to the right if k is negative 𝑛
𝑥 [ ] = [3, 0, 0, 5, 0, 0, −1, 0, 0, 2, 0, 0, 8, 0, 0, 7]
3
𝑥[𝑛] = [−1, −4, 3, 2, −2, 1, 5, 3, 2, 1, −2] ↑
↑
Signal Addition
Delayed by 2 samples Sample-by-sample addition
𝑦[𝑛] = 𝑥1 [𝑛] + 𝑦2 [𝑛]

𝑥1 [𝑛] = [2, 4, −1, −2, 6, 8, 0, 5]

Advanced by 3 samples ↑
𝑥[𝑛 + 3] = [−1, −4, 3, 2, −2, 1, 5, 3, 2, 1, −2]
↑ 𝑥2 [𝑛] = [−1, −4, 3, 2, −2, 1, 5, 3, 2, 1, −2]
↑
Folding/Flipping
In this operation, each sample of 𝑥[𝑛] is flipped around Limits of the interval depends on the minimum
n=0 to obtain folded sequence 𝑦[𝑛] negative integer and maximum positive integer of the
𝑦[𝑛] = 𝑥[−𝑛] given sequences
𝑦[𝑛] = [−1, −2, 7, 1, −4, 7, 13, 3, 7, 1, −2]
𝑥[𝑛] = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11] ↑
↑
Signal Multiplication
𝑥[−𝑛] = [11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1] Sample-by-sample multiplication
↑ 𝑦[𝑛] = 𝑥1 [𝑛] ∗ 𝑥2 [𝑛]
𝑥[𝑘 − 𝑛]: means folded and time-shifted
• If k is positive, delay by k-sample 𝑥1 [𝑛] = [2, 4, −1, −2, 6, 8, 0, 5]
• If k is negative, advanced by k-sample ↑

𝑥[2 − 𝑛] = [11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1] 𝑥2 [𝑛] = [−1, −4, 3, 2, −2, 1, 5, 3, 2, 1, −2]

↑ ↑
Limits of the interval depends on the maximum
𝑥[−𝑛 − 3] = [11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0] negative integer and minimum positive integer of the
↑ given sequences
𝑦[𝑛] = [−8, 12, −2, 4, 6, 40, 0, 10]
Time Scaling ↑
Each sample is multiplied by a scalar 𝛼
𝑦[𝑛] = 𝛼𝑥[𝑛] Solved Problem No. 1
𝑥[𝑛] = [1, 2, −2, 5, 6]
Down-sampled signal: 𝑥[𝑘𝑛] where k is a positive ↑
integer, new sequence is obtained by sampling 𝑥[𝑛] 1 2 2−𝑛
every k-samples, it is also called ___________ Determine 𝑥1 [𝑛] = 𝑥 [− 𝑛 + ] = 𝑥 [ ]
3 3 3

𝑥[𝑛] = [1, 5, 2, 4, −1, −2, 6, 8, 0, 5] Method:

↑ Scaling>>Folding>>Shifting>>Multiplication>> Addition
Syempre Fasado, Sipag Mag Aral
𝑥[2𝑛] = [1, 2, −1, 6, 0]
↑ 𝑥[𝑛] = [1, 2, −2, 5, 6]
↑
𝑥[3𝑛] = [1, 4, 6, 0] 𝑛
↑ 𝑥 [ ] = [1, 0, 0, 2, 0, 0, −2, 0, 0, 5, 0, 0, 6]
3
** in programming, scale must be divisible to smallest interval value ↑
Prepared by: Engr. Rhodonelle S. Duatin
Department of Computer, Electronics and Electrical Engineering
 LECTURE NOTES 3 – OPERATION ON SEQUENCE
𝑛 Integrating Activity 5
𝑥 [− ] = [6, 0, 0, 5, 0, 0, −2, 0, 0, 2, 0, 0, 1]
2 Given the original sequence,
↑ 𝑥[𝑛] = [2, 4, 6, −8, 10, 9, −8, 7]
↑
2−𝑛 Determine and plot the output of the following
𝑥[ ] = [6, 0, 0, 5, 0, 0, −2, 0, 0, 2, 0, 0, 1]
3 sequences.
−𝑛+5
a. 𝑥1 [𝑛] = 2𝑥 ( ) − 3𝑥(3𝑛 − 1)
2
↑ b. 𝑥2 [𝑛] = 2𝑟(𝑛 + 3) + 𝑥(𝑛 − 1) + 2𝑢(𝑛 + 1),
−5 ≤ 𝑛 ≤ 5
c. 𝑥3 [𝑛] = 2𝑥(𝑛 − 5) − 3𝑥(𝑛 + 4)
Solved Problem No. 2 d. 𝑥4 [𝑛] = 𝑥(3 − 𝑛) + 𝑥(𝑛) ∗ 𝑥(𝑛 − 2)
𝑥[𝑛] = [3, 7, 1, 4, −3, −2, 5, 6, 4, 2, −1] e. 𝑥5 [𝑛] = 2𝑥[−𝑛 + 3] + 3𝑢[𝑛 + 1] − 𝑥[𝑛] +
↑ 𝑥[−3𝑛 + 2], −5 ≤ 𝑛 ≤ 5
Determine 𝑥1 [𝑛] = 𝑥[−2𝑛 − 2] = 𝑥[−2 − 2𝑛]

Method:
Scaling>>Folding>>Shifting>>Multiplication>> Addition

𝑥[2𝑛] = [3, 1, −3, 5, 4, −1]

↑

𝑥[−2𝑛] = [−1, 4, 5, −3, 1, 3]

↑

𝑥[−2 − 2𝑛] = [−1, 4, 5, −3, 1, 3]

↑

Solved Problem No. 3

𝑥[𝑛] = [3, 7, 1, 4, −3, −2, 5, 6, 4, 2, −1]
↑

Determine 𝑥1 [𝑛] = 2𝑥[𝑛 − 1] + 3𝑥[𝑛 + 3] ∗ 𝑥[𝑛 + 2] at

−6 ≤ 𝑛 ≤ 3 and −6 ≤ 𝑛 ≤ 7

Method:
Scaling>>Folding>>Shifting>>Multiplication>> Addition

2𝑥[𝑛 − 1] = [6, 14, 2, 8, −6, −4, 10, 12, 8, 4, −2]

↑

3𝑥[𝑛 + 3] = [9, 21, 3, 12, −9, −6, 15, 18, 12, 6, −3]
↑

𝑥[𝑛 + 2] = [3, 7, 1, 4, −3, −2, 5, 6, 4, 2, −1]

Limit: −6 ≤ 𝑛 ≤ 3

𝑥𝑚 [𝑛] = [63, 21, 12, −36, 18, −30, 90, 72, 24, −6]
↑

Limit: −6 ≤ 𝑛 ≤ 7
𝑥1 [𝑛]
= [63, 21, 12, −30, 32, −28, 98, 66, 20, 4, 12, 8, 4, −2]
↑

Prepared by: Engr. Rhodonelle S. Duatin

Department of Computer, Electronics and Electrical Engineering