Skip to content

Viterbi Error Rate

Measure post-Viterbi decoding quality as the fraction of output bits that disagree with a known or reconstructed reference over a declared window, keeping decoder interface, code, denominator, and zero-error confidence explicit.

Version
v2 · 2026-09-06 · History
Domain-specific #
3075
Origin domain
engineering
Subdomain
digital communications
Aliases
VBER, Viterbi bit error rate, Post-Viterbi BER, BER after Viterbi decoding

Core Idea

The Viterbi error rate or Viterbi bit error rate (VBER) is the bit error ratio measured after a Viterbi decoding or correction stage. Given a decoded sequence and a synchronized known or reconstructed reference, \(\mathrm{VBER}=N_{\mathrm{wrong}}/N_{\mathrm{compared}}\) over the declared observation window. The interface is load-bearing: pre-Viterbi channel BER, post-Viterbi BER, and post–outer-code BER measure different residual error populations.

In first-generation DVB practice, VBER commonly means post-Viterbi BER before the outer Reed–Solomon decoder. ETSI measurement guidance explicitly locates BER measurements before and after the Viterbi decoder and ties quasi-error-free operating points to those interfaces.[1]

Structural Signature

  • A digital transmitted or test bit sequence.
  • A convolutional code and stated code rate or puncturing scheme.
  • A receiver path containing a Viterbi decoder.
  • A declared measurement interface at the decoder output.
  • A synchronized reference bit sequence.
  • A comparison rule identifying bit disagreements.
  • An observation window or compared-bit count.
  • An error count and denominator.
  • The ratio \(N_{\mathrm{wrong}}/N_{\mathrm{compared}}\).
  • A method for known-data, null-packet, loopback, or reconstructed-reference testing.
  • Confidence or censoring treatment when few or no errors are observed.
  • Separation from pre-decoder and post–outer-code error ratios.
  • A threshold tied to a declared broadcast or link-quality requirement.

What It Is Not

It is not bit rate, modulation error ratio, carrier-to-noise ratio, packet error rate, or raw channel BER. It is not the probability that the Viterbi algorithm selects the wrong entire path unless that probability is explicitly converted to a bit-level error statistic. Zero observed errors over a finite window does not establish a mathematically zero error probability.

Scope of Application

VBER is used in digital television and other convolutionally coded links to assess residual quality after inner decoding and before a subsequent outer correction stage. It helps distinguish a noisy channel that the decoder is successfully correcting from a decoder output already near failure. Australian communications guidance identifies VBER as post-Viterbi BER and uses \(2\times10^{-4}\) as a practical good-reception reference for legacy DVB-T measurement.[2]

The term is tied to systems that actually contain a Viterbi stage. Later systems using LDPC, turbo, polar, or other decoders require decoder-specific pre/post BER labels rather than inheriting “VBER.”

Clarity

Report the system, code, code rate, puncturing, modulation, channel conditions, hard- or soft-decision decoder, measurement interface, bit count, error count, reference-generation method, and threshold. Specify whether the number is measured, estimated by re-encoding, or bounded because the counter observed no errors.

Manages Complexity

The metric pins a large receiver chain to one diagnostic boundary. Comparing CBER with VBER isolates the Viterbi stage's correction effect; comparing VBER with post–outer-code BER isolates the next stage. This staged accounting turns “poor signal” into a location-specific residual-error diagnosis.

Abstract Reasoning

  1. Identify the exact decoder interface.
  2. Produce or reconstruct a synchronized reference sequence.
  3. Exclude acquisition transients or declare them part of the window.
  4. Compare decoded and reference bits position by position.
  5. Count disagreements and total compared bits.
  6. Calculate the observed ratio.
  7. Attach the observation duration, sample size, and confidence statement.
  8. Compare with a system-specific threshold.
  9. Examine adjacent-interface BERs to localize degradation.

Viterbi's original maximum-likelihood sequence-decoding formulation and Forney's exposition explain why decoder output errors have burst and path-merging structure rather than behaving as independent raw channel errors.[3][4]

Knowledge Transfer

The portable pattern is measure residual error immediately after a named correction stage, then compare neighboring stage-boundary measurements to locate how much error that stage removed and how much remains. The proposed immediate parent is Measurement.

Examples

If 20 post-Viterbi bits disagree among 100,000 compared bits, the observed VBER is \(2\times10^{-4}\). If no errors occur in one million bits, report “0 observed in \(10^6\) bits” or a confidence bound rather than an unqualified zero rate.

A high CBER with a low VBER indicates successful inner correction. A rising VBER approaching the outer code's capacity warns of a reception cliff even when the final audiovisual output still appears clean.

Structural Tensions

  • Raw channel impairment versus corrected residual error.
  • Short measurement latency versus confidence at low rates.
  • Known-reference accuracy versus in-service measurement.
  • One scalar threshold versus code- and system-specific behavior.
  • Corrected output quality versus impending cliff failure.

Structural–Framed Character

Stage-boundary residual measurement is structural. Bits, convolutional coding, Viterbi sequence decoding, synchronization, and receiver interfaces are constitutive. The abstraction is domain-specific.

Structural Core vs. Domain Accent

The structural core is named correction stage -> compare output with reference -> residual-error fraction. The domain accent is post-Viterbi digital-communications measurement.

Measurement is the proposed immediate parent. Error Correction, Ratio, Probability, Observability, and Threshold are related primes.

The prospective queue contains one strict edge to prime:measurement. No live DAG mutation is authorized.

Relationships to Other Abstractions

Local relationship map for Viterbi Error RateParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Viterbi Error RateDOMAINPrime abstraction: Measurement — is a kind ofMeasurementPRIME

Current abstraction Viterbi Error Rate Domain-specific

Parents (1) — more general patterns this builds on

  • Viterbi Error Rate is a kind of Measurement Prime

    Measurement is the proposed immediate parent.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Viterbi Error Rate sits in a sparse region of the domain-specific corpus (94th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With

  • Channel BER or CBER before correction.
  • BER after an outer Reed–Solomon stage.
  • Bit rate in bits per second.
  • Modulation error ratio.
  • Packet error rate.
  • Whole-path decoding-error probability.
  • Zero observed errors treated as zero true rate.

References

[1] European Telecommunications Standards Institute, Digital Video Broadcasting (DVB); Measurement Guidelines for DVB Systems, ETSI TR 101 290 V1.2.1 (2001), sections 8.1–8.2. registry

[2] Australian Communications and Media Authority, “Steps for Antenna Installers to Fix TV Reception,” measurement guidance defining CBER and post-Viterbi VBER, updated 2023. registry

[3] Andrew J. Viterbi, “Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm,” IEEE Transactions on Information Theory 13, no. 2 (1967): 260–269, doi:10.1109/TIT.1967.1054010. registry

[4] G. David Forney Jr., “The Viterbi Algorithm,” Proceedings of the IEEE 61, no. 3 (1973): 268–278, doi:10.1109/PROC.1973.9030. registry