Preface¶
About this book: who it is for, how it is organised and how to use it
About this book¶
Signals and systems is the subject that gives engineers a common language for everything that varies in time: the voltage from a microphone, the position of a robot arm, the samples of a digital photograph, the radio waves of a mobile phone. Its central ideas (convolution, the frequency domain, poles and zeros, sampling) appear again in electronics, communication, control, audio, image processing, instrumentation and machine learning. A student who understands them well will meet them as old friends in every later course.
This book is a complete first course in the subject. It treats continuous-time and discrete-time signals side by side, because modern engineering uses both: physical systems are continuous, while the computers that measure and control them are discrete. Each idea is built up from intuition to a precise statement, illustrated with worked numerical examples, and checked with a short Python program whose output is printed beside it.
Who it is for¶
The book is written for students in a first university course on signals and systems, typically in electrical, electronic, communication, computer, instrumentation or mechanical engineering, and for practising engineers who want a clear refresher. It assumes:
- calculus of one variable, including integration by parts, and the idea of an infinite series;
- complex numbers (reviewed in Chapter 1, since everything depends on them);
- a little linear algebra (matrices, determinants, eigenvalues) for Chapter 13;
- for the programs, some familiarity with Python. The programs use only NumPy (version 2 or later), and were run as printed.
No previous course in circuits is needed, although readers who have taken one will recognise many of the examples.
How the book is organised¶
The fourteen chapters fall into four parts.
| Part | Chapters | Topics |
|---|---|---|
| Foundations | 1 to 4 | classification of signals; elementary signals and operations on them; properties of systems; LTI systems and convolution |
| Fourier analysis | 5 to 9 | Fourier series; the continuous-time and discrete-time Fourier transforms; the DFT and FFT; sampling and aliasing |
| Transforms for systems | 10 to 13 | the Laplace transform; the z-transform; frequency response and filter design; state-space models |
| Applications | 14 | audio, communication and control |
Table P.1. The structure of the book.
The parts depend on one another in order, but within them there is some freedom. A course that concentrates on continuous time can take Chapters 1 to 6, 9 (sampling), 10 and 12, with the discrete-time sections as optional reading. A course centred on digital signal processing can move quickly through Chapter 5 and spend more time on Chapters 7, 8, 11 and 12. Chapter 13 can be read at any time after Chapter 10. Reference tables of transform pairs and properties are collected at the end of the book, followed by a glossary and a list of further reading.
How to use it¶
Every chapter has the same structure:
- learning outcomes at the start, so that you know what to look for;
- numbered sections that move from motivation to definitions, properties and methods;
- worked examples in shaded boxes, each solved step by step; try them yourself before reading the solution;
- boxes for key ideas, notes and common mistakes;
- figures of signals, spectra, block diagrams and pole-zero plots, and at least one short NumPy program with its output;
- a summary of the chapter;
- exercises with answers that stay folded until you open them;
- a short quiz to check your understanding.
The best way to learn the subject is to do it. Work the examples on paper, then run the programs and change them: alter a pole, lengthen a window, sample more slowly, and see what happens. A result that you have predicted, computed and then seen on the screen is a result you will remember.
Notation¶
The book follows the conventions that are most common in engineering texts.
| Symbol | Meaning |
|---|---|
| \(x(t)\), \(x[n]\) | continuous-time signal; discrete-time signal (sequence) |
| \(u(t)\), \(u[n]\); \(\delta(t)\), \(\delta[n]\) | unit step; unit impulse |
| \(j\) | the imaginary unit, \(j^2 = -1\) |
| \(\omega\) | continuous-time frequency, in radians per second (\(\omega = 2\pi f\), with \(f\) in hertz) |
| \(\Omega\) | discrete-time frequency, in radians per sample |
| \(T\) or \(T_s\), \(f_s\), \(\omega_s\) | sampling interval; sampling rate in hertz; sampling rate in rad/s |
| \(h(t)\), \(h[n]\) | impulse response |
| \(X(j\omega)\), \(X(e^{j\Omega})\) | Fourier transform; discrete-time Fourier transform |
| \(X(s)\), \(X(z)\) | Laplace transform; z-transform |
| \(X[k]\) | discrete Fourier transform (DFT) |
| \(a_k\) | Fourier series coefficients |
| \(*\) | convolution |
| \(\mathrm{sinc}(x)\) | \(\sin(\pi x)/(\pi x)\), the normalised sinc, as in NumPy |
Table P.2. Notation used in the book.
Square brackets always mean a discrete variable and round brackets a continuous one. Sections are numbered within chapters (Section 6.4 is the fourth section of Chapter 6), and examples, figures, tables and exercises are numbered in the same way.