Interleaver Depth and Finite-Coherence Fading

Where the "Fully Interleaved" Assumption Breaks

The diversity theorem of s03 relied on the fully-interleaved Rayleigh assumption: every coded bit rides an INDEPENDENT fading realisation. Real propagation channels do not oblige. They have a coherence time TcT_c — measured in symbol periods — during which the fading amplitude h|h| changes negligibly. Within a coherence block of TcT_c symbols, all coded bits share the same h|h|. If the interleaver spans NN symbols with NTcN \gg T_c, the fully-interleaved picture is a good approximation. If NTcN \lesssim T_c, multiple coded bits see the same fade, and diversity is lost.

This section quantifies that loss: the effective diversity is min(dH,N/Tc)\min(d_H, \lceil N / T_c \rceil). The formula has immediate engineering consequences — it tells the standards designer how long the interleaver must be to extract the code's full dHd_H-order diversity on a specific channel.

The tradeoff is between diversity and latency: a longer interleaver gives more diversity but more buffering delay. Every wireless standard has had to make this tradeoff, and the choices made — 3G HSPA's 20 ms turbo interleaver, LTE's 1\sim 1 ms sub-block interleaver, 5G NR's 0.5\leq 0.5 ms URLLC interleaver — reveal how the application tolerances drive the design.

Definition:

Coherence Time TcT_c of a Fading Channel

For a time-varying Rayleigh fading channel with Doppler spread fdf_d, the coherence time is approximately Tccfd1symbol period(in symbols),T_c \approx \frac{c}{f_d} \cdot \frac{1}{\text{symbol period}} \quad\text{(in symbols)}, where cc is a proportionality constant of order 0.10.10.40.4. More precisely, TcT_c is the duration over which the normalised autocorrelation E[hihi+Tc]1/2|\mathbb{E}[h_i^* h_{i + T_c}]| \approx 1/2. A block-fading model idealises this: the channel is constant for TcT_c symbols, then independently redrawn.

At 3 GHz carrier and pedestrian speed (1 m/s), fd10f_d \approx 10 Hz, so at symbol rate 1 MHz we have Tc30T_c \sim 30100×103100 \times 10^3 symbols. At vehicular speed (30 m/s) the same carrier gives Tc103T_c \sim 10^3 symbols. A minimum-latency interleaver of 1 ms at 1 Msymb/s spans 10310^3 symbols — marginal for vehicular UEs, fine for stationary ones.

Definition:

Effective Number of Independent Fading Samples NeffN_{\rm eff}

For a block-fading channel with coherence TcT_c and interleaver of length NN symbols, the effective number of independent fading samples seen by a single codeword is Neff=NTc.N_{\rm eff} = \left\lceil \frac{N}{T_c} \right\rceil. This is the number of distinct fading blocks that the coded symbols span. In the limit Tc1T_c \to 1 (fast fading), Neff=NN_{\rm eff} = N, and we recover the fully-interleaved model. In the limit TcNT_c \to N (quasi- static fading), Neff=1N_{\rm eff} = 1.

Theorem: BICM Diversity with Finite Interleaver Depth

For BICM with binary code of minimum Hamming distance dHd_H, labelling μ\mu, and interleaver of length NN symbols, transmitted over a block- fading Rayleigh channel with coherence time TcT_c symbols, the effective diversity order is   deff=min ⁣(dHLmin(μ),  NeffLmin(μ))=Lmin(μ)min(dH,Neff),  \boxed{\; d_{\rm eff} = \min\!\left(d_H \cdot L_{\min}(\mu), \; N_{\rm eff} \cdot L_{\min}(\mu)\right) = L_{\min}(\mu) \cdot \min(d_H, N_{\rm eff}), \;} where Neff=N/TcN_{\rm eff} = \lceil N / T_c \rceil. In particular, for Gray labelling (Lmin=1L_{\min} = 1), deff(μG)=min(dH,Neff).d_{\rm eff}(\mu_G) = \min(d_H, N_{\rm eff}). When NeffdHN_{\rm eff} \ge d_H the interleaver extracts the full code diversity; when Neff<dHN_{\rm eff} < d_H the interleaver length caps the diversity at NeffN_{\rm eff}.

Intuitively, the channel provides NeffN_{\rm eff} independent fading samples over the codeword span. The code can harvest at most dHd_H of them (through its minimum Hamming distance), but it cannot harvest more than the channel provides. Hence the min. The message for the standards designer is: scale the interleaver so NeffdHN_{\rm eff} \ge d_H, or the code's full power is wasted. If latency caps NN, one should then cap dHd_H accordingly — no point in paying for a rate-1/61/6, dH=30d_H = 30 code if Neff=8N_{\rm eff} = 8.

,

Key Takeaway

A finite interleaver caps the diversity at Neff=N/TcN_{\rm eff} = N / T_c. The code's minimum distance dHd_H gives an UPPER BOUND on diversity, but the interleaver's ability to spread coded bits across independent coherence blocks gives another upper bound. The actual diversity is the smaller of the two: deff=Lmin(μ)min(dH,Neff)d_{\rm eff} = L_{\min}(\mu) \cdot \min(d_H, N_{\rm eff}). Design rule: size NN so that NdHTcN \ge d_H \cdot T_c. Making NN larger than this does not help; making it smaller throws away code diversity.

Example: Interleaver Depth for Diversity 4 at Tc=10T_c = 10 Symbols

A system uses rate-1/21/2 convolutional code with dH,free=4d_{H, {\rm free}} = 4 and Gray-QPSK on a block-Rayleigh channel with coherence time Tc=10T_c = 10 symbol periods. What is the minimum interleaver length NN needed to achieve full diversity deff=4d_{\rm eff} = 4? What happens to the BER if N=20N = 20 (i.e., half the needed length)?

BER vs Interleaver Length at Fixed Coherence Time

Average BER versus Es/N0E_s/N_0 for BICM with Gray-16-QAM and a binary code of dH=8d_H = 8, over a block-Rayleigh channel with coherence time TcT_c symbols, plotted for a range of interleaver lengths NN. Observe that: (a) curves for NeffdHN_{\rm eff} \ge d_H overlap (full diversity achieved); (b) curves for smaller NN exhibit progressively smaller slopes, converging onto the flat uncoded SNR1\text{SNR}^{-1} line as NTcN \to T_c. The transition cliff at Neff=dHN_{\rm eff} = d_H is the "latency-diversity knee" that every wireless standards designer must navigate.

Parameters
4
8

Common Mistake: Longer Interleavers Do NOT Always Help

Mistake:

A naive design rule "make the interleaver as long as possible" is both unhelpful and occasionally damaging. The rule is unhelpful because the diversity saturates at dHLmin(μ)d_H \cdot L_{\min}(\mu) once NeffdHN_{\rm eff} \ge d_H: making NN longer than dHTcd_H \cdot T_c gives no diversity gain, only extra latency. It is damaging because very long interleavers couple with channel coherence VARIATION — the assumption of independent h|h| across blocks breaks if the statistics shift across NN symbols (e.g., due to changing Doppler in a moving terminal).

Correction:

Size the interleaver to just exceed dHTcd_H \cdot T_c, with a modest margin (say, 2×2\times) for interleaver non-uniformity and channel coherence variability. Further increases do not help and may expose the system to non-stationary fading. This is why real standards specify interleaver lengths matched to the expected fading rate, not maximum possible lengths.

⚠️Engineering Note

LTE Sub-Block Interleaver and HARQ

LTE's turbo code is rate 1/31/3 with dH,free=10d_{H,{\rm free}} = 10 (approximate). The sub-block interleaver (TS 36.212 §5.1.4) is 32×N/3232 \times \lceil N/32 \rceil rectangular, spanning up to 6000\sim 6000 information bits. At LTE symbol rate (15 kHz subcarrier, OFDM), this corresponds to about 1 ms of time-domain span — the LTE TTI. Against vehicular-channel coherence time of 1\sim 1 ms (30 m/s, 2 GHz), this gives Neff1N_{\rm eff} \approx 1 within a single transmission. Full diversity is only recovered through HARQ retransmissions, which spread the codeword across multiple TTIs. This is why LTE with mobile UEs relies so heavily on HARQ: without it, the single-transmission diversity is insufficient for the turbo code's dH=10d_H = 10.

Practical Constraints
  • Sub-block interleaver: 32×N/3232 \times \lceil N/32 \rceil rectangular.

  • TTI: 1 ms (14 OFDM symbols, Type-1 FDD).

  • Maximum block: 6144 info bits (before segmentation).

  • HARQ: up to 4 retransmissions, adaptive asynchronous.

📋 Ref: 3GPP TS 36.212 §5.1.4
🔧Engineering Note

DVB-S2 Block LDPC Interleaver and the 64 800-Bit Frame

The DVB-S2 satellite-TV standard uses LDPC codes of length 64 800 bits (or short frames of 16 200 bits) with effective dHd_H in the range 30305050 for the high-rate MODCODs. Combined with 16-APSK or 32-APSK modulation and a block-level bit interleaver, a single FEC frame spans N=64800/LN = 64800/L symbols (e.g., 16 200 symbols for 16-APSK). Against atmospheric scintillation coherence times of 1–10 seconds at Ku-band (1 kHz to 10 kHz symbol rates), this is Neff103N_{\rm eff} \sim 10^3 — far exceeding dHd_H, so the code achieves its full asymptotic diversity. This is why DVB-S2 performance under rain-fade scintillation is close to the theoretical BICM bound.

Practical Constraints
  • Normal frame: 64 800 coded bits (long LDPC).

  • Short frame: 16 200 coded bits (1/4 the span).

  • Modulations: QPSK, 8-PSK, 16-APSK, 32-APSK.

  • Per-stream interleaver: block-level, symbol-aligned.

📋 Ref: ETSI EN 302 307-1 §5.1–5.3
🚨Critical Engineering Note

5G NR URLLC: Diversity-Latency Tradeoff Cranked to 11

5G NR Ultra-Reliable Low-Latency Communications (URLLC) aims for 1 ms user-plane latency and 10510^{-5} BER. The 1 ms budget includes transmission, decoding, and HARQ turnaround — leaving only 0.2\sim 0.2 ms for the interleaver itself. At 30 kHz subcarrier (120 μs OFDM symbol duration) this is only 2\sim 2 OFDM symbols, or about 400 REs (resource elements). With 30 m/s mobility at 3.5 GHz, Tc1T_c \approx 1 ms \gg interleaver span — so URLLC must harvest frequency diversity instead of time diversity. The design explicitly spreads coded bits across multiple PRBs (12-subcarrier resource blocks) to get NeffN_{\rm eff} of order dH=10d_H = 101515 from frequency coherence of tens of subcarriers. The principle is the same as this section's theorem — the "fading samples" are just frequency-indexed instead of time-indexed.

Practical Constraints
  • Latency budget: 1 ms end-to-end.

  • BLER target: 10510^{-5} for URLLC services.

  • Subcarrier spacing: 30 or 60 kHz (shorter symbols).

  • Interleaver: cross-PRB frequency spreading mandatory.

📋 Ref: 3GPP TS 38.212 §5.4, 3GPP TR 38.824

Why This Matters: Backward: Ch. 5 Capacity; Forward: Ch. 7 Error Exponents and Ch. 8 BICM-ID

This chapter's error-probability analysis mirrors Ch. 5's capacity analysis. Chapter 5 asked: "What is the achievable rate under BICM?" and answered CBICM(μ)=I(Y;B)C_{\rm BICM}(\mu) = \sum_\ell I(Y; B_\ell). Chapter 6 asked: "What is the achievable error probability?" and answered PbSNRdHLmin(μ)P_b \propto \text{SNR}^{-d_H L_{\min}(\mu)} (on fading) or PbQ(dHdavg2(μ)/2Es/N0)P_b \le Q(\sqrt{d_H d^2_{\rm avg}(\mu)/2 \cdot E_s/N_0}) (on AWGN). Together, these two results give the coded-modulation designer both a rate target and a BER slope.

Chapter 7 extends the error-probability analysis to ERROR EXPONENTS: the relationship between the rate at which BER can decay and how close one operates to capacity. The central quantity there is the cutoff rate R0R_0, a tighter bound than the union bound at waterfall SNRs.

Chapter 8 revisits the labelling question once iterative decoding is added: BICM-ID feeds soft information from the decoder back to the demapper, and with enough iterations, set-partition labelling (!) can win over Gray in a regime where the EXIT-chart analysis shows convergence. The Lmin(μ)L_{\min}(\mu) quantity of this chapter will be augmented by an iterative "tunneling" condition in Ch. 8.

Historical Note: The Long Road of Interleaver Design: from GSM to 5G

1991–present

The first cellular standard — GSM, deployed in 1991 — used a diagonal convolutional interleaver of length 8 time slots (about 40 ms). This spanned roughly Neff10N_{\rm eff} \approx 10 coherence intervals at pedestrian speed and 2 GHz carrier — enough for the GSM (rate 1/2, dH=5d_H = 5) convolutional code to achieve close to full diversity on typical urban channels. At vehicular speeds the 40 ms interleaver helped less, and GSM's BER floor at high mobility was a known problem.

The IS-95 CDMA standard (1993) used a long block interleaver (20 ms span, 576 bits) designed to extract full diversity from its rate-1/31/3 convolutional code (dH=15d_H = 15) with the Rake receiver contributing additional path diversity. The combination was famously robust — IS-95 worked better than GSM at high mobility — at the cost of added end-to-end latency.

3G UMTS/HSPA introduced the turbo code (rate 1/3, dH20d_H \approx 20) with a sophisticated contention-free permutation interleaver of up to 5114 bits, spanning one TTI of 20 ms initially (later 2 ms in HSPA+). This gave effective-diversity budgets matched to the turbo code's distance profile.

4G LTE shortened the TTI to 1 ms and kept the turbo code, trading some diversity for latency — compensated by aggressive HARQ combining. 5G NR replaced the turbo code with LDPC and shortened the TTI further still, pushing interleaver depth to <0.5< 0.5 ms for URLLC.

The thread through these five generations is the same theorem of this section: effective diversity N/Tc\le N / T_c. Each generation re-tuned NN, TcT_c (by moving to higher frequency or wider subcarrier spacing), and the code's dHd_H to match its latency requirements. What looks like a parade of specialised engineering choices is, underneath, a single tradeoff curve sampled at different operating points.

Quick Check

A BICM system uses a rate-1/21/2 convolutional code with dH,free=6d_{H, {\rm free}} = 6 and Gray-QPSK on a fading channel with coherence time Tc=5T_c = 5 symbols. The interleaver length is N=40N = 40 symbols. What is the effective diversity order?

33

55

66

88