Operations on Sequences: Signal Addition H.w/ what will be the output signal if we change the values in the above code to: x1 = [1, 2, 3, 4]; n1 = -1:2; x2 = [1, 1, 1, 1); n2 = -2:1; please use matlap to rewrite the code with updated values Est-CawTube V 21 12 15 34 15 16 17 18 y- clc clear fx >> x1-[1,2,3]; n1--1:1;% -1,0,1 x2-[1,1,1,1,1]; n2--2:2;% -2,-1,0,1,2 mini-abs (min(n1)-min(n2)); max1-abs (max (n1)-max(n2)); if(min(n2) max(n1)) yl-[zeros (1, min1), x1, zeros (1,max1)]; y2-x2; else y2-[zeros (1,min1), x2, zeros (1,max1)]; yl-xl; end y-y1+y2; Net MLS for at y stem (y) 1 2 3 4 1 Fii Ven et Tick Desktop Wi Hdp GRAT DE 35 SE 25 2 15 18 as 2 25 3 35 4 45

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
T
Operations on Sequences: Signal Addition
H.w/ what will be the output signal if we change the values in the
above code to:
x1 = [1, 2, 3, 4];
n1 = -1:2;
x2 = [1, 1, 1, 1);
n2 = -2:1;
please use matlap to rewrite the code with updated values
Efter-Cilleria DocumMATAR2.
tenim
1
2
3
4
O
7
U
9
20
11
12
13
14
15
16
17
18
D
clc
clear
y =
x1=[1,2,3];
n1--1:1; % -1,0,1
x2-[1,1,1,1,1];
n2=-2:2; % -2,-1,0,1,2.
min1-abs (min(n1)-min(n2));
max1-abs (max (n1)-max(n2));
if(min(n2) <min (n1) || max (n2) >max(n1))
yl-[zeros (1,min1), x1, zeros (1,max1)];
y2=x2;
else
y2-[zeros (1,min1), x2, zeros (1,max1)];
yl-x1;
end
y=y1+y2;
y
stem(y)
Cound Weekw
New to MAILASesaces for tratad
1 2 3 4 1
DUES BOG
36
st
25
2
1.5
11
06
1
15
2
25
3
35
4
45
By Younis M. Jalil
Transcribed Image Text:T Operations on Sequences: Signal Addition H.w/ what will be the output signal if we change the values in the above code to: x1 = [1, 2, 3, 4]; n1 = -1:2; x2 = [1, 1, 1, 1); n2 = -2:1; please use matlap to rewrite the code with updated values Efter-Cilleria DocumMATAR2. tenim 1 2 3 4 O 7 U 9 20 11 12 13 14 15 16 17 18 D clc clear y = x1=[1,2,3]; n1--1:1; % -1,0,1 x2-[1,1,1,1,1]; n2=-2:2; % -2,-1,0,1,2. min1-abs (min(n1)-min(n2)); max1-abs (max (n1)-max(n2)); if(min(n2) <min (n1) || max (n2) >max(n1)) yl-[zeros (1,min1), x1, zeros (1,max1)]; y2=x2; else y2-[zeros (1,min1), x2, zeros (1,max1)]; yl-x1; end y=y1+y2; y stem(y) Cound Weekw New to MAILASesaces for tratad 1 2 3 4 1 DUES BOG 36 st 25 2 1.5 11 06 1 15 2 25 3 35 4 45 By Younis M. Jalil
Expert Solution
steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Knowledge Booster
Binary numbers
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education