BER Analysis: Asymptotic and Monte Carlo
Numbers, Not Just Slopes
The diversity theorem gives an asymptotic slope. For deployment we need actual numbers: BER at SNR = 10 dB, BER at SNR = 25 dB, and so on. This section derives explicit closed-form BER expressions for OTFS under canonical channel models and validates them against Monte Carlo simulations. The result is a concrete performance calculator for OTFS links.
Theorem: Uncoded BER for QPSK-OTFS Over a -Path Rayleigh Channel
For QPSK input, ML detection, and a -path channel with equal-power Rayleigh paths (), the uncoded BER is where . At high SNR this simplifies to
The result is the standard maximal-ratio-combining (MRC) BER for -fold Rayleigh diversity. OTFS's DD-domain spreading acts as an inherent -fold combiner β every data symbol is received through independent fading realizations and combined coherently by the ML detector.
The binomial coefficient is the "penalty" for having Rayleigh fades instead of a single AWGN channel. For : . For : .
PEP for QPSK
. For QPSK nearest-neighbor error, .
Channel PDF
(for a suitable error vector that spreads over cells). This is chi-squared with DoF, mean 1.
Average over channel
. This integral evaluates to the closed form above.
High-SNR asymptote
Using the expansion , the integral becomes a Gamma-function moment, yielding .
Closed-Form BER vs Monte Carlo: -Path OTFS
Plot the closed-form BER formula alongside a Monte Carlo simulation for validation. The two curves should agree within a fraction of a dB for reasonable sample counts. Different values give different slopes. The asymptotic BER formula is the dashed straight line in log-log coordinates.
Parameters
Theorem: QAM BER and Constellation Penalty
For -QAM with (e.g., 16-QAM with ), the uncoded BER in a -path OTFS channel has the same scaling but with a constellation-dependent multiplier: At high , the BER is larger (more constellation points = more nearest-neighbor collisions), but the slope is still .
Higher-order QAM packs more bits per symbol but places constellation points closer together, increasing the nearest- neighbor error rate. The factor in the SNR term represents this: effectively, at SNR , the QAM detector operates at "effective SNR" . For QPSK (), factor is ; for 64-QAM (), factor is , so 16 dB extra SNR needed for same BER.
OTFS preserves this scaling with its -fold diversity β a system at 64-QAM with SNR = 25 dB still achieves , well above the OFDM baseline.
Example: Link Budget for 16-QAM OTFS
An OTFS link uses 16-QAM over a -path channel. The target BER is (uncoded). What SNR is required?
BER formula
.
Solve for $\rho$
( dB).
OFDM comparison
For OFDM with single-tap Rayleigh: 16-QAM at needs ( dB). OTFS saves 18 dB in this case β enormous margin.
Caveat: coded performance
Channel coding changes the comparison. With rate-1/2 LDPC, OFDM can reach at around 15 dB and OTFS at around 13 dB β the gap shrinks to dB. The uncoded comparison is the extreme case.
OTFS BER for Multiple QAM Orders
Plot uncoded BER vs SNR for QPSK, 16-QAM, 64-QAM, 256-QAM in an OTFS system with . All curves have diversity slope 4, but different coding-gain offsets. 256-QAM requires dB more than QPSK at equivalent BER. Observe where each curve crosses the BER target line for link-budget design.
Parameters
Theorem: Outage Probability in OTFS
The -outage capacity of an OTFS channel β the maximum rate achievable with failure probability β is where is the -quantile of the chi-squared distribution with degrees of freedom. At small , , and the outage capacity is approximately β much better than OFDM's .
Outage capacity is the rate guaranteed with high probability, not the average. Under single-tap Rayleigh (OFDM), the worst-case 10%-outage capacity is very small β deep fades are not averaged out. Under -fold diversity (OTFS), the chance of simultaneous deep fades in all paths is , making the outage probability much smaller. This is the operational advantage of OTFS for URLLC (ultra-reliable low-latency) traffic.
Effective SNR
For OTFS with ML combining, the effective SNR is . For equal-power Rayleigh, this is (after normalization).
Outage definition
. Setting this to gives the formula.
Quantile approximation
For small , the chi-squared lower-tail has the approximation . The outage capacity is therefore .
OFDM comparison
For : OFDM's outage capacity is . For : OTFS's outage is . OFDM: . At : OTFS outage = bits; OFDM outage = bit. OTFS 12Γ higher outage rate.
Key Takeaway
OTFS's outage advantage scales exponentially with . The probability of a deep fade in all paths is , giving the OTFS outage capacity the quantile scaling. For URLLC applications requiring outage at moderate SNR, OTFS with is decisively better than OFDM. This is the quantitative argument behind OTFS's suitability for URLLC traffic in 6G.
Practical BER at Typical Deployment Parameters
Representative BER numbers at SNR = 20 dB for key deployment scenarios:
- Pedestrian, 5 GHz, : , . OTFS 3 orders better.
- Urban vehicular, 3.5 GHz, : , (with ICI).
- HST, 3.5 GHz, : , (floor due to ICI).
- LEO sat, 10 GHz, : , OFDM: fails (, ICI dominant).
These are uncoded numbers; coded BER is 3-5 orders better, but the OTFS advantage ratio remains.
- β’
Numbers assume ML detection. MP/LCD add 1-2 dB
- β’
Monte Carlo simulation gives curves within 0.5 dB at trials
- β’
URLLC (10^-6 target) is where OTFS diversity pays most