| Table of contents |
Memory is a property relevant only to systems whose input and output signals share the same independent variable (for example, both are functions of time).

A system is said to be memoryless if its output at any value of the independent variable depends only on the input at that same value of the independent variable.
Important remark. A system description may appear to indicate memory but, after algebraic simplification, be memoryless. For example, consider the system
Y(t) = X(t − 5) + { X(t) − X(t − 5) }
Although the expression contains terms with X(t − 5), direct simplification gives
Y(t) = X(t)
so the system is actually memoryless. This shows that the same system can have multiple algebraic descriptions; only the simplified, equivalent description should be used to judge memory.
Linearity is a fundamental property often expressed by the principle of superposition. A system is linear if a linear combination of inputs produces the same linear combination of corresponding outputs.
Formally, if a system operator is denoted by T{·}, linearity means that for arbitrary (allowed) signals x1(t) and x2(t), and arbitrary scalars a and b,
T{a x1(t) + b x2(t)} = a T{x1(t)} + b T{x2(t)}
Linearity is meaningful even when input and output have different independent variables (for example, discrete input and continuous output), and the definition is analogous for discrete-time systems.
Passive linear circuit elements-capacitor, inductor, resistor-or linear combinations of them are linear systems when voltage is the input and current is the output, as they obey superposition within their linear operating ranges.
Linearity can be decomposed into two separate properties:
Both properties together are equivalent to linearity.
Proof outline that additivity and homogeneity imply linearity
Assume the system is additive and homogeneous.
For inputs x1(t) and x2(t) and scalars a, b:
By homogeneity, the system response to a x1(t) is a y1(t), and to b x2(t) is b y2(t).
By additivity, the response to their sum is a y1(t) + b y2(t).
Hence T{a x1 + b x2} = a T{x1} + b T{x2}, which is linearity.
Conversely, linearity implies additivity and homogeneity by choosing scalars appropriately in the linearity relation: setting both scalars = 1 yields additivity; setting one scalar = 0 yields homogeneity.
This example is additive but not homogeneous for complex scaling (it might be homogeneous for real scalars but fails for complex scalars); see the specific expression in the figure for details.
The figure above shows a system that is homogeneous but not additive. From such examples one can generalise classes of systems that satisfy only one of the properties.
Reason: For inputs x1(t) and x2(t) with outputs y1(t) = t x1(t) and y2(t) = t x2(t), the response to a x1 + b x2 is
t (a x1(t) + b x2(t)) = a t x1(t) + b t x2(t) = a y1(t) + b y2(t).
Reason: squaring is nonlinear; the response to a sum does not equal the sum of responses, and scaling fails homogeneity.
Shift invariance (also called time-invariance) applies to systems whose input and output signals have the same independent variable. It formalises the idea that the system's characteristics do not change with shifts along the independent variable axis.
Definition: If an input x(t) produces output y(t), and for every shift t0 the shifted input x(t − t0) produces the correspondingly shifted output y(t − t0), the system is shift-invariant.
Formally, for every permissible x(t) and every t0,
If T{x(t)} = y(t) then T{x(t − t0)} = y(t − t0)
In other words, shifting the input by t0 shifts the output by the same amount for shift-invariant systems. This property need not hold for all systems.
The two inputs x(t) and x(t − t0) are different signals; a general system could map them to outputs that are not shifts of each other. If the mapping preserves shifts, the system is shift-invariant; otherwise it is shift-variant.
Stability describes whether the output of a system remains bounded when the input is bounded. Several mathematical notions of stability exist; the most commonly used in signals and systems is BIBO stability (Bounded-Input, Bounded-Output).
Informally, a stable system does not produce unbounded outputs in response to bounded inputs. A small bounded input leads to a predictable, bounded response.
Definition (BIBO): A system is BIBO stable if every bounded input produces a bounded output. That is, if there exists a finite constant Mx such that |x(t)| ≤ Mx for all t (or |x[n]| ≤ Mx for discrete time), then there exists a finite constant My (possibly dependent on Mx) such that |y(t)| ≤ My for all t.
This definition applies to continuous-time, discrete-time, and hybrid systems. BIBO stability is a practical criterion used widely in signal processing and control.
41 videos|70 docs|33 tests |
| 1. What are the properties of systems in Electronics and Communication Engineering? | ![]() |
| 2. Why is memory an important property of systems in ECE? | ![]() |
| 3. How does linearity play a role in systems in Electronics and Communication Engineering? | ![]() |
| 4. What is shift invariance and why is it significant in ECE systems? | ![]() |
| 5. How does stability impact the performance of systems in Electronics and Communication Engineering? | ![]() |