Module 6 ยท Lesson 2

Nyquist Rate and Symbol Rate

12 min read
Article

Shannon told us the ceiling on bits per second. This lesson is about the symbols that carry them: how many distinct symbols per second a band of a given width can hold before they start smearing into one another. The answer is another number from the early days of the field — Nyquist’s, from 1928 — and it, together with the bits-per-symbol of Module 5, sets the data rate of every real link.

The Nyquist Rate

Send symbols too fast through a band-limited channel and each one’s tail spills onto its neighbours — inter-symbol interference (ISI). Nyquist found the exact boundary: a baseband channel of bandwidth W can carry at most 2W symbols per second free of ISI. Equivalently, to send Rs symbols per second you need at least Rs/2 of baseband bandwidth:

Nyquist Signalling Rate
R_s \le 2W \qquad\Longleftrightarrow\qquad W_{\min} = \tfrac{R_s}{2}
Rs is the symbol rate (symbols/s, or baud) and W the baseband bandwidth in Hz. The minimum bandwidth to carry Rs baud is therefore Wmin = Rs/2. (A passband/RF channel of width B carries Rs = B baud at this ideal.)

Symbol Rate Is Not Bit Rate

This is where Module 5 rejoins the story. The Nyquist rate limits symbols, but each symbol can carry several bits — that was the whole point of QAM. The bit rate is the symbol rate multiplied by the bits each symbol carries:

Bit Rate from Symbol Rate
R_b = R_s \times \log_2 M
A 1 Mbaud link sends 1 million symbols/s regardless of scheme — but that is 1 Mbps with BPSK, 2 Mbps with QPSK, and 6 Mbps with 64-QAM. Baud and bits per second are different units; confusing them is the classic mistake.

Why the Ideal Is Impossible

Nyquist’s 2W limit is reached only by a perfect brick-wall filter — a spectrum that is flat to Rs/2 and then vertical. In the time domain that filter is a sinc pulse: it rings on forever in both directions and is non-causal, so it cannot be built, and even a truncated version is disastrously sensitive to timing error. Real systems trade a little extra bandwidth for a pulse that is actually realizable.

Raised-Cosine Pulse Shaping

The standard fix is the raised-cosine pulse. It keeps Nyquist’s crucial property — the pulse is exactly zero at every other symbol instant, so a matched receiver sees no ISI — while softening the brick wall into a gentle cosine roll-off. A single parameter, the roll-off factor α (between 0 and 1), sets how gentle:

Raised-Cosine Bandwidth
B = \frac{R_s}{2}\,(1 + \alpha), \qquad 0 \le \alpha \le 1
The occupied baseband bandwidth grows from the Nyquist minimum Rs/2 by the factor (1 + α). The excess bandwidth — the price of realizability — is α × Rs/2, i.e. α expressed as a percentage over Nyquist.

The roll-off trade-off

Root-raised-cosine and the matched filter. In practice the raised-cosine shape is split in half — a root-raised-cosine (RRC) filter at the transmitter and an identical one at the receiver. Cascaded, the two multiply to a full raised cosine, giving zero ISI; and because the receive filter is a copy of the transmit pulse, it is also the matched filter that maximizes SNR (the best possible detector in Gaussian noise). One design choice does two jobs at once.

Putting It Together

A real link’s data rate now falls out of two independent choices. The available RF bandwidth B and the roll-off fix the symbol rate, Rs = B / (1 + α); the modulation order fixes the bits per symbol, log₂M. Multiply them for the bit rate:

Bandwidth BRoll-off αSymbol rate RsModulationBit rate
1 MHz0.250.8 MbaudQPSK (2 b)1.6 Mbps
1 MHz0.250.8 Mbaud64-QAM (6 b)4.8 Mbps
20 MHz0.118.2 Mbaud256-QAM (8 b)145 Mbps

Notice the two levers are separate: bandwidth and roll-off buy symbols, modulation order buys bits per symbol. The next lesson combines them into a single figure of merit — spectral efficiency, in bits per second per hertz — and measures every scheme against Shannon’s ceiling.

Key Takeaways

Previous: Shannon’s Capacity Theorem Overview Next: Spectral Efficiency