Courses
ElectronicsFree

Signals & Systems

Convolution, Fourier series & transform, sampling theorem, Laplace & Z-transforms, Bode plots and modulation — ECE exam + interview core

4 modules8 lessons2 hrIntermediate
Intermediate
8 lessons in 4 modules
1h 44m of material
8 challenges
English audio
English captions
Certificate on completion

What you'll get

  • Verifiable certificate

  • XP on the leaderboard

Your certificate

TTieEduCertificate of Completionawarded toyour nameSignals & SystemsProfessional Tier

Preview of the certificate this course issues. Yours will carry your name, score and a verifiable serial — signed, not editable.

What you will build

Signals analysis notebook

Pick one real signal (voice clip, sensor CSV, or generated square wave + channel model) and analyse it end-to-end in a markdown/PDF notebook (or Jupyter export): (1) classify it (energy/power, periodicity, bandwidth estimate); (2) compute or sketch its spectrum (Fourier series or transform) with symmetry notes; (3) if sampling, state the Nyquist rate, choose fs, and show one aliased vs non-aliased scenario; (4) design a simple first- or second-order filter (write H(s), mark cutoff on a Bode sketch) and state what it removes; (5) if using modulation, draw the before/after spectrum. Include any code or hand calculations as an appendix.

You will submit: PDF, public markdown, or a GitHub link with the notebook — plots can be from Python/MATLAB or hand-sketched and photographed; the reasoning text matters more than production polish.

Signals & System Properties

Continuous vs discrete, energy vs power, periodicity; then the four properties every exam asks: linearity, time-invariance, causality, BIBO stability.

What you will learn
  • Classify signals: CT/DT, energy/power, periodic/aperiodic, even/odd
  • Test a system for linearity and time-invariance with standard inputs
  • State causality and BIBO stability and test each on given systems

Every ECE exam paper in signals starts the same way: "Check whether the system y(t) = x(t)cos(t0) is linear, causal and stable." Four tests, ten minutes, full marks — if you know the tests by heart.

Signal vocabulary:

  • CT vs DT: x(t) continuous argument vs x[n] integer index.
  • Energy vs power: E = ∫|x(t)|²dt (finite energy ⇒ energy signal, zero average power); P = lim(1/T)∫|x|² over T. Power signals have infinite energy (e.g. periodic). A zero signal is both (trivially).
  • Periodic: x(t) = x(t+T0), fundamental T0 = smallest such T. DT: x[n] = x[n+N], fundamental N smallest positive integer. Sum of two periodic signals is periodic only if T1/T2 is rational.
  • Even/odd: x(t)=x(−t) even; x(t)=−x(−t) odd; any signal = even part + odd part.

System properties (the four exam tests):

  1. Linearity: T{a·x1 + b·x2} = a·T{x1} + b·T{x2}. Test with weighted sum of two inputs. Breaks on: amplitude nonlinearity (x²), offsets (x + 1), modulations by t·x(t).
  2. Time-invariance (TI): input delayed by t0 ⇒ output delayed by t0. Test: y(t,t0) = T{x(t−t0)} equals y(t−t0). Breaks on: coefficients that vary with t (t·x(t), cos(t)x(t)).
  3. Causality: output at time t depends only on present/past inputs, never future. Test: x1 = x2 on (−∞, t0] ⇒ outputs equal there. Any system writing y(t) = x(t+1) is noncausal.
  4. BIBO stability: every bounded input (|x| ≤ Mx < ∞) gives bounded output (|y| ≤ My < ∞). For LTI: stable iff impulse response absolutely integrable, ∫|h(t)|dt < ∞ (DT: Σ|h[n]| < ∞).

LTI = Linear + Time-Invariant. Only for LTI systems do convolution, transfer functions, frequency response and the whole transform toolkit apply. That is why the first two tests come first in every question.

Property
One-line test
LinearityWeighted-sum input gives weighted-sum output
Time-invarianceDelay input by t0 ⇒ output delayed by t0
CausalityNo dependence on future input values
BIBO stabilityBounded input ⇒ bounded output (∫|h| < ∞ for LTI)
Instant nonlinearity/non-TI detectors

x², |x|, offset (+1) kill linearity; any t multiplying x kills TI.

Stability test for non-LTI

Without LTI there is no ∫|h| shortcut — argue directly with bounded inputs.

Classify y(t) = t·x(t)
System: y(t) = t x(t). Test linearity, time-invariance, causality, stability.
  1. 1

    Linearity

    T{a x1 + b x2} = t(a x1 + b x2) = a t x1 + b t x2 — linear (scaling/additivity hold).

  2. 2

    TI test

    Input x(t−t0) gives t·x(t−t0); desired output is (t−t0)x(t−t0). Not equal ⇒ NOT time-invariant.

  3. 3

    Causality

    y(t) depends only on x(t) at the same instant ⇒ causal.

  4. 4

    Stability

    x = u(t) bounded (M=1): y(t) = t → grows unbounded ⇒ NOT BIBO stable.

  5. 5

    Verdict

    Linear, causal, not TI, not stable — so no convolution/transfer-function analysis.

Solution

Linear + causal; not TI (t coefficient), not stable (ramp gain).

Detect the offset

y(t) = x(t) + 3. Linear? Time-invariant? Why does the offset break linearity?

Hint: Test T{0} — linearity requires the zero input to give zero output.

Common mistakes
  • Testing TI by delaying the output expression and calling it done

    Both sides: response to delayed input must equal delayed original response.

  • Saying causal systems are always stable

    Causality and stability are independent properties — t·x(t) is causal but unstable.

Exam / interview angle

State BIBO stability for LTI systems in terms of the impulse response.

The system is BIBO stable iff h(t) is absolutely integrable: ∫|h(t)|dt < ∞ (DT: Σ|h[n]| < ∞).

Source: Standard 4–6 mark question.

Lesson summary
  • Energy vs power; periodicity requires rational period ratio for sums.
  • Linearity, TI, causality, BIBO — four standard tests.
  • LTI unlocks convolution and transforms; ∫|h| < ∞ ⇔ stable.

Semester exam prep

University mid-terms and finals; GATE EC/EE core; placement ECE rounds

Units, important questions and previous-year papers — revisit before every exam.

1

Signals, Systems & Convolution

CT/DT, energy/power, periodicity (rational ratio for sums), even/odd. Four tests: linearity (weighted sums), TI (delay input ⇒ delayed output), causality (no future input), BIBO (∫|h| < ∞ for LTI). LTI ⇒ convolution; graphical flip–shift–multiply–integrate; commutative, widths add, δ identity; rect*rect = triangle.

4 important questions
  1. Test y(t) = t·x(t) for all four properties.
  2. State BIBO stability in terms of h(t).
  3. Compute u(t)*u(t) by stages.
  4. Why does convolution require LTI?
2

Fourier Series, Transform & Sampling

Trig/exponential FS with symmetry shortcuts (even ⇒ cosine, odd ⇒ sine, half-wave ⇒ odd harmonics). FT pairs: δ↔1, e^{−at}u ↔ 1/(a+jω), rect ↔ sinc, cos ↔ impulses. Properties: time shift (phase), frequency shift (modulation), convolution ↔ multiplication, Parseval. Sampling: x_s spectrum = copies spaced fs; Nyquist fs > 2B; anti-alias LPF before ADC; reconstruction LPF.

4 important questions
  1. FS of an odd half-wave symmetric square wave.
  2. State the convolution property and its LTI significance.
  3. Nyquist rate of a two-tone composite signal.
  4. Why must anti-alias filtering precede sampling?
3

Laplace & Z-Transforms

Bilateral Laplace with ROC strip; causal ⇒ right of rightmost pole; stable ⇔ ROC includes jω ⇔ all poles LHP. Unilateral derivative rule turns ODEs into algebra. H(s) = Y/X; poles = natural modes. Z-transform: unit circle = DTFT slice; pairs for u[n], aⁿu[n]; causal stable ⇔ all poles inside |z| < 1; difference equations via z-algebra.

4 important questions
  1. State the causal LTI stability condition on H(s) poles.
  2. Find ROC of 1/(s+2) for causal vs anticausal.
  3. Solve y[n] − 0.5y[n−1] = u[n] via z-transform.
  4. DT stability rule for poles of H(z).
4

Bode Plots & Modulation

Bode: log-ω axis, dB magnitude, straight-line rules (±20 dB/dec per pole/zero, −40 for 2nd-order), −3 dB at corner. Second-order ζ/Q: resonance if ζ < 0.707. Filters: LPF/HPF/BPF/notch; Butterworth flat, Chebyshev steep. AM: m(t)cos(ωc t) ⇒ copies at ±ωc; conventional AM with μ ≤ 1 for envelope detection; DSB-SC coherent; SSB half-bandwidth.

4 important questions
  1. Sketch Bode mag of 100/(s+10): DC gain, corner, slope.
  2. Envelope-detection condition with modulation index.
  3. Bandwidth comparison: AM vs DSB-SC vs SSB for same Wm.
  4. Map a real product (EQ, radio, PID) onto the transform toolkit.

What you will be able to do

  • Classify signals and test systems for linearity, TI, causality and BIBO stability
  • Compute convolutions graphically and analytically (CT and DT)
  • Use Fourier series symmetry rules and compute standard Fourier transform pairs
  • Apply the sampling theorem: Nyquist rate, aliasing diagnosis and reconstruction
  • Compute Laplace and Z-transforms with correct ROCs and read stability off poles
  • Sketch Bode magnitude plots and identify cutoff, Q and filter type
  • Explain AM as frequency shifting and state the envelope-detection condition

About this course

University Signals & Systems papers reward a fixed method: classify first, test the four properties, choose the transform that kills the hard part, apply the algebraic property, invert, and interpret stability or bandwidth in the original domain. This course drills exactly that method across convolution, Fourier, Laplace and Z, so exam answers follow a checkable sequence instead of guesswork.

The sampling and modulation lessons are written for people who will build real systems: Nyquist is not a mnemonic, it is the reason your phone microphone is digital; AM is not a formula to memorise, it is the frequency-shift property in a trench coat. The Bode lesson closes with the straight-line sketch method interviewers expect you to draw live on a whiteboard.

The final exam draws from a 30-question bank; the certificate project is a small analysis note you can show as proof of skill.

Who this course is for

  • ECE/EE students in semester 3–5 facing university Signals & Systems exams
  • GATE EC/EE aspirants building transform fundamentals
  • Placement candidates preparing for core ECE interview rounds
  • CS/AI students who want signal processing foundations for audio/ML

What you should know before you start

Anything here is assumed, not taught. If it is not on the list, the course explains it.

  • Basic calculus (integration) and complex numbers
  • Comfort with exponentials and trigonometry

Questions before you start

How much time does Signals & Systems take?

The course is 4 modules and 8 lessons — about 2 hr of material in total. Lessons unlock in order, so the time it takes you depends on how much of each lesson you actually read.

Do I get a certificate?

Yes. Finish every lesson and a certificate is issued automatically. Its serial is public: anyone can check it at https://tieedu.com/verify without an account, and a revoked certificate stops verifying.

Is it really free?

Yes — this course is free, and there is nothing to buy to start it.

How is my progress tracked?

On the server, lesson by lesson. Time is credited at real-time speed and capped, so a lesson cannot be marked complete faster than it can be read. That is why the percentage survives a new device.

How do ratings work?

Only learners who finished the course can rate it, and the average shown is calculated from those ratings alone. A course nobody has finished yet carries no rating rather than a default one.

See all

Digital Electronics

Beginner · Electronics

Number systems, Boolean algebra, K-maps, combinational and sequential circuits — the ECE exam and Viva foundation

4 modules8 lessons1 hr 22 min
FreeNew

Computer Networks

Intermediate · Computer Science

OSI to TCP/IP, subnetting, TCP internals, DNS/HTTP/DHCP, TLS security and modern delivery — exam + interview core

4 modules8 lessons1 hr 37 min
FreeNew

DBMS

Intermediate · Computer Science

ER models, SQL, normalization, transactions, concurrency control and crash recovery — exam + interview core

4 modules8 lessons2 hr
FreeNew

Fluid Mechanics

Intermediate · Mechanical

Fluid statics, Bernoulli, flow measurement, momentum forces, pipe losses, dimensional analysis and open-channel flow — ME exam + interview core

4 modules8 lessons2 hr
FreeNew

Free · lifetime access

Candidate Verified

Real interview questions verified by candidates placed at top tech firms.

View-Only PDF Security

Watermarked licensed PDFs, server-side unlock checks — no raw download paths.

Honest, Server-Driven

Pricing, coupons and unlocks are verified by the backend — no bypasses.

TieEdu — Learn, Evolve, Develop

© 2026 TieEdu Technologies. All rights reserved.

Built for placement season within India

Visitors who arrive through an email link are remembered with a first-party cookie so we can see which pages that mail led them to — never the other way round, never on login or admin pages, and never for anonymous visitors. Every email carries a one-click unsubscribe that stops both mailings and tracking.