Intuition What this page is for
The parent note gave you two capacity laws and a few examples. Here we drill every scenario you can meet: noiseless vs noisy, dB vs linear, "find the levels", degenerate inputs (zero noise, zero bandwidth), limiting behaviour, a real-world word problem, and an exam twist. Guess before you read each solution — that is how the numbers stick.
Before we compute anything, let's re-anchor the symbols so no notation is used before it is earned.
Definition The symbols we will use everywhere
B = bandwidth in hertz (Hz). Picture a "pipe" of frequencies; B is how wide that pipe is. Wider pipe ⇒ faster wiggles allowed.
M = number of distinct voltage levels one symbol can take. Picture a staircase with M steps; each step is a value the signal can hold.
S / N = signal-to-noise ratio , a power ratio (a plain number, not decibels). Picture signal loudness ÷ background hiss.
C = channel capacity in bits per second (bit/s): the fastest error-free bit rate.
Definition Two logarithms — know which base you're using
log 2 x ("log base 2") answers "2 to what power gives x ?" — e.g. log 2 8 = 3 because 2 3 = 8 . This is the bits log; it appears inside both capacity laws . See Bandwidth vs Bit Rate for why bits and log 2 go together.
log 10 x ("log base 10") answers "10 to what power gives x ?" — e.g. log 10 1000 = 3 because 1 0 3 = 1000 . This one appears only in the decibel conversion, never inside the capacity formula.
Whenever you see a bare "log " below, we will write the base explicitly so you never guess.
The two laws (both from the parent):
Before the examples, one bridge idea we'll reuse in the "beat Shannon?" twist:
M m a x — the most levels noise lets you use
Call M m a x the largest number of levels a noisy channel can reliably tell apart . Picture the staircase again: noise "blurs" each step by a fuzzy band; if two steps sit closer than the blur, the receiver confuses them. How to find it — derived from the two laws themselves: the honest Nyquist rate can never exceed Shannon, so
2 B log 2 M ≤ B log 2 ( 1 + N S ) .
Divide both sides by B and by 2: log 2 M ≤ 2 1 log 2 ( 1 + S / N ) = log 2 1 + S / N . Since log 2 only grows, this means
M m a x = 1 + N S .
What it looks like: signal amplitude ∝ S , smallest safe gap ∝ N , so the number of gaps you can pack is their ratio 1 + S / N — exactly the algebra above. We'll cash this in at Example 9.
Every capacity question is one (or a blend) of these cells. The worked examples below each carry a tag like [Cell A2] so you can see the coverage.
#
Cell
What makes it special
Which law
A1
Noiseless, given M
plug straight in
Nyquist
A2
Noiseless, solve for M
invert the log
Nyquist
B1
Noisy, SNR linear
plug straight into Shannon
Shannon
B2
Noisy, SNR in dB
convert dB→linear first
Shannon
B3
Noisy, S / N < 1 (negative dB)
1 + S / N between 1 and 2
Shannon
C
Both limits given
take the smaller; find M to reach ceiling
Both
D1
Degenerate: S / N = 0 (no signal)
capacity collapses
Shannon
D2
Degenerate: B = 0 (no pipe)
capacity collapses
either
E
Limiting: S / N → ∞ or huge dB
log grows slowly
Shannon
F
Real-world word problem
translate English → symbols
Both
G
Exam twist
dB trap / units trap / "beat Shannon?"
Both
The examples: A1, A2, B1, B2, B3, C, D (both), E, F, G — together they touch every cell.
A noiseless channel has B = 4000 Hz and each symbol uses M = 8 levels. Find C .
Forecast: guess whether C is above or below 8000 bit/s before reading on.
Choose the law. No noise mentioned ⇒ Nyquist. Why this step? Shannon needs an S / N ; none is given, so noise isn't the limiter here.
Bits per symbol. log 2 8 = 3 . Why? 8 = 2 3 , and log 2 asks "2 to what power is 8?" → 3 bits ride on each symbol.
Plug in. C = 2 B log 2 M = 2 ( 4000 ) ( 3 ) = 24000 bit/s.
Verify: units check — ( symbols/s ) × ( bits/symbol ) = bits/s . ✓ And 24000 > 8000 , matching the forecast that more levels beat the guess.
You must push C = 30000 bit/s through a noiseless channel of B = 5000 Hz. How many levels M do you need?
Forecast: guess M — is it 4, 8, or 16?
Choose the law. Noiseless ⇒ Nyquist, but now C is known and M is the unknown. Why? We're inverting the formula, not evaluating it.
Isolate the log. 30000 = 2 ( 5000 ) log 2 M ⇒ log 2 M = 10000 30000 = 3 . Why divide? To peel M out of the log we first get log 2 M alone.
Undo the log. log 2 M = 3 ⇒ M = 2 3 = 8 . Why 2 ( ⋅ ) ? Exponentiation base 2 is the inverse of log 2 — it's the machine that undoes "2 to what power".
Verify: put M = 8 back: 2 ( 5000 ) log 2 8 = 10000 × 3 = 30000 bit/s. ✓ Forecast was 8.
A noisy channel: B = 4000 Hz, and the signal-to-noise ratio is given directly as S / N = 15 (a plain number, already linear — no decibels in sight). Find C .
Forecast: guess whether C is closer to 4000 or to 16000 bit/s.
Choose the law. Noise present ⇒ Shannon. Why? M isn't ours to choose; noise sets the ceiling.
Check the units of the SNR. It's already a linear power ratio (no "dB" written), so no conversion is needed — we drop it straight in. Why check? Half of all mistakes are converting a number that was already linear.
Plug in. C = B log 2 ( 1 + S / N ) = 4000 log 2 ( 1 + 15 ) = 4000 log 2 16 .
Evaluate. log 2 16 = 4 (since 16 = 2 4 ), so C = 4000 × 4 = 16000 bit/s.
Verify: 1 + 15 = 16 = 2 4 makes the log land exactly on 4. ✓ Forecast: 16000 bit/s. This is the cleanest cell — nothing to convert, nothing to combine.
A noisy line: B = 3000 Hz, SNR = 20 dB. Find C .
Forecast: dB "20" is small — but is the linear ratio small too? Guess S / N linear.
Convert dB → linear. N S = 1 0 20/10 = 1 0 2 = 100 . Why first? Shannon's formula eats a linear power ratio ; the dB formula uses log 10 , so undoing it needs 1 0 ( ⋅ ) . Feeding "20" raw is the classic trap in the parent's mistake box.
Choose the law. Noise present ⇒ Shannon. Why? Noise, not our choice of M , sets the ceiling.
Plug in. C = 3000 log 2 ( 1 + 100 ) = 3000 log 2 ( 101 ) .
Evaluate the log. log 2 ( 101 ) ≈ 6.658 , so C ≈ 3000 × 6.658 ≈ 19975 bit/s.
Verify: 2 6.658 ≈ 101 ✓. Sanity: 20 dB is a decent line, giving ~20 kbit/s over a phone-grade pipe — the right ballpark. See Signal-to-Noise Ratio for the dB definition.
A weak link: B = 2000 Hz, SNR = − 3 dB (yes, negative decibels — the signal is below the noise). Find C .
Forecast: guess whether C is zero, near B , or above 2 B .
Convert dB → linear. N S = 1 0 − 3/10 = 1 0 − 0.3 ≈ 0.501 . Why? Negative dB just means the power ratio is less than 1 — signal quieter than noise, but not silent.
Watch what happens inside the log. 1 + S / N = 1 + 0.501 = 1.501 , which sits between 1 and 2 . Why does this matter? Shannon's formula still applies; the "1 + " guarantees the argument stays above 1, so log 2 ( 1.501 ) > 0 — capacity is small but not zero .
Evaluate. log 2 ( 1.501 ) ≈ 0.586 , so C = 2000 × 0.586 ≈ 1172 bit/s.
Verify: 2 0.586 ≈ 1.501 ✓, and 0 < 1172 < 2000 = B , exactly what "a channel worse than 0 dB but still alive" should give. The "+ 1 " inside the log is what keeps a below-noise channel from collapsing to zero. ✓
Channel: B = 2 × 1 0 6 Hz (2 MHz), SNR = 255 (linear). (a) What is the ceiling? (b) How many levels reach it?
Forecast: guess whether M is a nice power of 2.
Shannon ceiling. C = 2 × 1 0 6 log 2 ( 1 + 255 ) = 2 × 1 0 6 log 2 ( 256 ) . Why Shannon first? It's the hard physical ceiling no encoding can beat.
Evaluate. log 2 256 = 8 (since 256 = 2 8 ), so C = 2 × 1 0 6 × 8 = 16 × 1 0 6 = 1.6 × 1 0 7 bit/s.
Now Nyquist to find M . Set 2 B log 2 M = C : 2 ( 2 × 1 0 6 ) log 2 M = 16 × 1 0 6 . Why? Nyquist tells us the staircase height needed to actually deliver Shannon's ceiling.
Solve. 4 × 1 0 6 log 2 M = 16 × 1 0 6 ⇒ log 2 M = 4 ⇒ M = 2 4 = 16 .
Verify: Nyquist with M = 16 : 4 × 1 0 6 × 4 = 16 × 1 0 6 ✓ = Shannon. Both agree, so 16 × 1 0 6 bit/s is achievable with 16 levels. See how 16 levels become 16-QAM .
(a) SNR = 0 (a "dead" channel — signal power zero). (b) B = 0 (no frequency pipe at all). What is C in each?
Forecast: guess both answers before computing.
(a) S / N = 0 . C = B log 2 ( 1 + 0 ) = B log 2 1 = B × 0 = 0 bit/s. Why zero? log 2 1 = 0 because 2 0 = 1 ; with no signal above noise, no distinguishable levels exist. What it means: pure noise carries no information.
(b) B = 0 . Any capacity has B as a factor : C = 0 × ( ⋯ ) = 0 bit/s (for both Nyquist and Shannon). Why? No frequency pipe ⇒ no signal changes per second ⇒ nothing gets through.
Verify: both give 0 . Sanity: a channel that is either silent (no signal) or non-existent (no bandwidth) must carry zero bits — matches the algebra. ✓
Same B = 3000 Hz. Compare C at SNR = 30 dB versus SNR = 60 dB (double the dB). Does doubling the dB double the capacity?
Forecast: guess yes/no before computing.
Convert both. 30 dB ⇒ 1 0 3 = 1000 ; 60 dB ⇒ 1 0 6 = 1000000 . Why? dB is logarithmic — doubling dB squares-and-more the linear ratio, so intuition from dB alone misleads.
Capacity at 30 dB. C 30 = 3000 log 2 ( 1001 ) ≈ 3000 × 9.967 ≈ 29901 bit/s.
Capacity at 60 dB. C 60 = 3000 log 2 ( 1000001 ) ≈ 3000 × 19.93 ≈ 59794 bit/s.
Compare. Ratio C 60 / C 30 ≈ 59794/29901 ≈ 2.0 . Why roughly 2? Inside the log, S / N went from 1 0 3 to 1 0 6 ; log 2 ( 1 0 6 ) / log 2 ( 1 0 3 ) ≈ 2 . The log tames the huge SNR jump into a mere doubling.
The figure below draws exactly this: capacity vs SNR, with the two dots you just computed.
Intuition Read the figure
The orange curve is C = B log 2 ( 1 + S / N ) with B = 3000 Hz, and the horizontal axis is S / N on a log scale (each tick is × 10 ). Notice the curve is almost a straight climb on this log axis but flattens against ordinary numbers: the blue dot (30 dB) and the green dot (60 dB) are 1000 × apart in raw SNR yet only ≈ 2 × apart in height. Each equal step in S / N buys a smaller slice of capacity — that is "the log tames it" made visible.
Verify: 2 9.967 ≈ 1001 ✓, 2 19.93 ≈ 1000001 ✓. Lesson: capacity grows only logarithmically with power — you can't buy speed cheaply by shouting louder.
A modem vendor claims 56 kbit/s over a phone line with B = 3400 Hz. What SNR (in dB) would the pure Shannon limit demand — and is the claim physically comfortable?
Forecast: guess whether the required SNR is around 20 dB, 40 dB, or 50 dB.
Translate. Need C = 56000 bit/s, B = 3400 Hz. Set Shannon: 56000 = 3400 log 2 ( 1 + S / N ) . Why Shannon? Real phone lines are noisy; this is the true ceiling.
Isolate the log. log 2 ( 1 + S / N ) = 3400 56000 ≈ 16.47 . Why divide by B ? To free the log so we can undo it.
Undo log 2 . 1 + S / N = 2 16.47 ≈ 90800 , so S / N ≈ 90800 . Why 2 ( ⋅ ) ? Inverse of log 2 .
Back to dB. ( S / N ) d B = 10 log 10 ( 90800 ) ≈ 10 × 4.958 ≈ 49.6 dB. Why log 10 here? dB is defined with base-10 log, not base-2 — different log for a different job.
Verify: feed S / N = 90800 back: 3400 log 2 ( 90801 ) ≈ 3400 × 16.47 ≈ 56000 ✓. Interpretation: ~50 dB is very clean — real lines sit near 30–40 dB, which is why raw 56k is hard downstream and needs digital tricks. Ballpark forecast (~50 dB) confirmed.
Exam claim: "A noisy channel has B = 1 MHz, S / N = 63 . Shannon says C = 6 × 1 0 6 bit/s. If I just use M = 64 levels, Nyquist gives 2 ( 1 0 6 ) log 2 64 = 12 × 1 0 6 bit/s — so I beat Shannon!" Where is the error, and what is the real achievable rate?
Forecast: guess which number is the true ceiling.
Compute both. Shannon: 1 0 6 log 2 ( 1 + 63 ) = 1 0 6 log 2 64 = 1 0 6 × 6 = 6 × 1 0 6 bit/s. Nyquist with M = 64 : 2 × 1 0 6 × 6 = 12 × 1 0 6 bit/s. Why both? To expose the trap the twist relies on.
Spot the fallacy. Nyquist assumes you can reliably distinguish all 64 levels. But we already derived M m a x = 1 + S / N up top: M m a x = 1 + 63 = 64 = 8 , not 64. Why ⋅ ? Because the honest Nyquist rate can't exceed Shannon — that inequality forced M ≤ 1 + S / N .
Honest Nyquist. With M = 8 : 2 × 1 0 6 log 2 8 = 2 × 1 0 6 × 3 = 6 × 1 0 6 bit/s. Why? Now Nyquist and Shannon agree — noise already fixed the level count.
Conclusion. The real ceiling is the smaller : 6 × 1 0 6 bit/s. You cannot beat Shannon by inventing levels the noise will smear together.
Verify: 64 = 8 ✓, Nyquist( M = 8 ) = 6 × 1 0 6 = Shannon ✓. The "12 × 1 0 6 " is a mirage from illegal levels — exactly the parent's "Using Nyquist on a noisy channel" mistake.
Recall Cover the answers
Which cell is "solve for M "? ::: A2 — invert Nyquist: log 2 M = C / ( 2 B ) , then M = 2 l o g 2 M
If SNR is given as a plain number (no dB), do you convert? ::: No — it's already linear; drop it straight into Shannon (Cell B1)
First move when SNR is in dB? ::: Convert to linear: S / N = 1 0 dB /10
What happens when S / N < 1 (negative dB)? ::: 1 + S / N lands between 1 and 2, so C is small but still positive
What is C when S / N = 0 ? ::: Zero — log 2 ( 1 + 0 ) = log 2 1 = 0
What is C when B = 0 ? ::: Zero — B is a factor in both laws
Formula for the most levels noise allows? ::: M m a x = 1 + S / N , from 2 B log 2 M ≤ B log 2 ( 1 + S / N )
Doubling SNR in dB does what to C ? ::: Roughly doubles it (the log tames a squared linear jump)
Mnemonic Two-question filter for any problem
"Noise given? → Shannon. Levels asked/allowed? → Nyquist. Both? → take the smaller."
And: "'dB' in the number? convert with 1 0 dB /10 first."
Parent topic
Signal-to-Noise Ratio — the dB↔linear conversions used throughout
Modulation (ASK, FSK, PSK, QAM) — where the M levels physically live
Bandwidth vs Bit Rate — the log 2 M bits-per-symbol link
Sampling Theorem — origin of the 2 B factor in Nyquist