Bit error rate

<h2 id="example">Example</h2>
As an example, assume this transmitted bit sequence:
1 1 0 0 0 1 0 1 1 
and the following received bit sequence:
0 1 0 1 0 1 0 0 1,
The number of bit errors (the underlined bits) is, in this case, 3. The BER is 3 incorrect bits divided by 9 transferred bits, resulting in a BER of 0.333 or 33.3%.

<h2 id="packet-error-ratio">Packet error ratio</h2>
The packet error ratio (PER) is the number of incorrectly received <a href="/facts/Network_packet/xCYf8SJu">data packets</a> divided by the total number of received packets. A packet is declared incorrect if at least one bit is erroneous. The expectation value of the PER is denoted packet error probability pp, which for a data packet length of N bits can be expressed as

p
 
 p
 
 
 =
 1
 −
 (
 1
 −
 
 p
 
 e
 
 
 
 )
 
 N
 
 
 =
 1
 −
 
 e
 
 N
 ln
 ⁡
 (
 1
 −
 
 p
 
 e
 
 
 )
 
 
 
 
 {\displaystyle p_{p}=1-(1-p_{e})^{N}=1-e^{N\ln(1-p_{e})}}
 
,
assuming that the bit errors are independent of each other. For small bit error probabilities and large data packets, this is approximately

p
          
            p
          
        
        ≈
        
          p
          
            e
          
        
        N
        .
      
    
    {\displaystyle p_{p}\approx p_{e}N.}

Similar measurements can be carried out for the transmission of <a href="/facts/Frame_(networking)/ltGCbJIq">frames</a>, <a href="/facts/Block_(data_storage)/S3vT7c6N">blocks</a>, or <a href="/facts/Symbol_(data)/YlQ3JHVr">symbols</a>.
The above expression can be rearranged to express the corresponding BER (pe) as a function of the PER (pp) and the data packet length N in bits:

p
          
            e
          
        
        =
        1
        −
        
          
            
              (
              1
              −
              
                p
                
                  p
                
              
              )
            
            
              N
            
          
        
      
    
    {\displaystyle p_{e}=1-{\sqrt[{N}]{(1-p_{p})}}}

<h2 id="factors-affecting-the-ber">Factors affecting the BER</h2>
In a communication system, the receiver side BER may be affected by transmission channel <a href="/facts/Noise_(telecommunications)/Izbv38Rr">noise</a>, <a href="/facts/Interference_(communication)/BVce5g8d">interference</a>, <a href="/facts/Distortion/z8RJcwNy">distortion</a>, <a href="/facts/Bit_synchronization/5SJJwxAK">bit synchronization</a> problems, <a href="/facts/Attenuation/XP4vX360">attenuation</a>, wireless <a href="/facts/Multipath_propagation/dJFXvAbW">multipath</a> <a href="/facts/Fading/RsDwBbdz">fading</a>, etc.
The BER may be improved by choosing a strong signal strength (unless this causes cross-talk and more bit errors), by choosing a slow and robust <a href="/facts/Modulation/aAXPjINv">modulation</a> scheme or <a href="/facts/Line_coding/x9IuaYNL">line coding</a> scheme, and by applying <a href="/facts/Channel_coding/cLUTUJrA">channel coding</a> schemes such as redundant <a href="/facts/Forward_error_correction/cLUTUJrA">forward error correction</a> codes.
The transmission BER is the number of detected bits that are incorrect before error correction, divided by the total number of transferred bits (including redundant error codes). The information BER, approximately equal to the decoding error probability, is the number of decoded bits that remain incorrect after the error correction, divided by the total number of decoded bits (the useful information). Normally the transmission BER is larger than the information BER. The information BER is affected by the strength of the forward error correction code.

<h2 id="analysis-of-the-ber">Analysis of the BER</h2>
The BER may be evaluated using stochastic (<a href="/facts/Monte_Carlo_method/AkHjY7jc">Monte Carlo</a>) computer simulations. If a simple transmission <a href="/facts/Channel_model/MtlxEShV">channel model</a> and <a href="/facts/Traffic_generation_model/0QYccoax">data source</a> model is assumed, the BER may also be calculated analytically. An example of such a data source model is the <a href="/facts/Bernoulli_distribution/ChCtYyvs">Bernoulli</a> source.
Examples of simple channel models used in <a href="/facts/Information_theory/qNLH3U5P">information theory</a> are:

<ul><li><a href="/facts/Binary_symmetric_channel/bFPGGghC">Binary symmetric channel</a> (used in analysis of decoding error probability in case of <a href="/facts/Error_burst/UXkhCd2D">non-bursty bit errors</a> on the transmission channel)</li>
<li><a href="/facts/Additive_white_Gaussian_noise/IE4Gof7T">Additive white Gaussian noise</a> (AWGN) channel without fading.</li></ul>
A worst-case scenario is a completely random channel, where noise totally dominates over the useful signal. This results in a transmission BER of 50% (provided that a <a href="/facts/Bernoulli_distribution/ChCtYyvs">Bernoulli</a> binary data source and a binary symmetrical channel are assumed, see below).

In a noisy channel, the BER is often expressed as a function of the normalized <a href="/facts/Carrier-to-noise_ratio/DP42mbjT">carrier-to-noise ratio</a> measure denoted <a href="/facts/Eb%2fN0/DU5sMhd6">Eb/N0</a>, (energy per bit to noise power spectral density ratio), or <a href="/facts/Es%2fN0/DU5sMhd6">Es/N0</a> (energy per modulation symbol to noise spectral density).
For example, in the case of <a href="/facts/BPSK/TFnpYe64">BPSK</a> modulation and AWGN channel, the BER as function of the Eb/N0 is given by:

 
 
 
 BER
 =
 Q
 (
 
 
 2
 
 E
 
 b
 
 
 
 /
 
 
 N
 
 0
 
 
 
 
 )
 
 
 {\displaystyle \operatorname {BER} =Q({\sqrt {2E_{b}/N_{0}}})}
 
,
where

Q
 (
 x
 )
 :=
 
 
 1
 
 2
 π
 
 
 
 
 ∫
 
 x
 
 
 ∞
 
 
 
 e
 
 −
 
 t
 
 2
 
 
 
 /
 
 2
 
 
 d
 t
 
 
 {\displaystyle Q(x):={\frac {1}{\sqrt {2\pi }}}\int _{x}^{\infty }e^{-t^{2}/2}dt}
 
. <a class="footnote-ref" id="fnref:2" href="#fn:2">2</a>
People usually plot the BER curves to describe the performance of a digital communication system. In optical communication, BER(dB) vs. Received Power(dBm) is usually used; while in wireless communication, BER(dB) vs. SNR(dB) is used.
Measuring the bit error ratio helps people choose the appropriate <a href="/facts/Forward_error_correction/cLUTUJrA">forward error correction</a> codes. Since most such codes correct only bit-flips, but not bit-insertions or bit-deletions, the <a href="/facts/Hamming_distance/MgdtbYPo">Hamming distance</a> metric is the appropriate way to measure the number of bit errors. Many FEC coders also continuously measure the current BER.
A more general way of measuring the number of bit errors is the <a href="/facts/Levenshtein_distance/F0otyNSl">Levenshtein distance</a>.
The Levenshtein distance measurement is more appropriate for measuring raw channel performance before <a href="/facts/Frame_synchronization/uCRQnA4J">frame synchronization</a>, and when using error correction codes designed to correct bit-insertions and bit-deletions, such as Marker Codes and Watermark Codes.<a class="footnote-ref" id="fnref:3" href="#fn:3">3</a>

<h2 id="mathematical-draft">Mathematical draft</h2>
The BER is the likelihood of a bit misinterpretation due to electrical noise 
 
 
 
 w
 (
 t
 )
 
 
 {\displaystyle w(t)}
 
. Considering a bipolar NRZ transmission, we have

 
 
 
 
 x
 
 1
 
 
 (
 t
 )
 =
 A
 +
 w
 (
 t
 )
 
 
 {\displaystyle x_{1}(t)=A+w(t)}
 
 for a "1" and 
 
 
 
 
 x
 
 0
 
 
 (
 t
 )
 =
 −
 A
 +
 w
 (
 t
 )
 
 
 {\displaystyle x_{0}(t)=-A+w(t)}
 
 for a "0". Each of 
 
 
 
 
 x
 
 1
 
 
 (
 t
 )
 
 
 {\displaystyle x_{1}(t)}
 
 and 
 
 
 
 
 x
 
 0
 
 
 (
 t
 )
 
 
 {\displaystyle x_{0}(t)}
 
 has a period of 
 
 
 
 T
 
 
 {\displaystyle T}
 
.
Knowing that the noise has a bilateral spectral density 
 
 
 
 
 
 
 N
 
 0
 
 
 2
 
 
 
 
 {\displaystyle {\frac {N_{0}}{2}}}
 
,

 
 
 
 
 x
 
 1
 
 
 (
 t
 )
 
 
 {\displaystyle x_{1}(t)}
 
 is 
 
 
 
 
 
 N
 
 
 
 (
 
 A
 ,
 
 
 
 N
 
 0
 
 
 
 2
 T
 
 
 
 
 )
 
 
 
 {\displaystyle {\mathcal {N}}\left(A,{\frac {N_{0}}{2T}}\right)}

and 
 
 
 
 
 x
 
 0
 
 
 (
 t
 )
 
 
 {\displaystyle x_{0}(t)}
 
 is 
 
 
 
 
 
 N
 
 
 
 (
 
 −
 A
 ,
 
 
 
 N
 
 0
 
 
 
 2
 T
 
 
 
 
 )
 
 
 
 {\displaystyle {\mathcal {N}}\left(-A,{\frac {N_{0}}{2T}}\right)}
 
.
Returning to BER, we have the likelihood of a bit misinterpretation 
 
 
 
 
 p
 
 e
 
 
 =
 p
 (
 0
 
 |
 
 1
 )
 
 p
 
 1
 
 
 +
 p
 (
 1
 
 |
 
 0
 )
 
 p
 
 0
 
 
 
 
 {\displaystyle p_{e}=p(0|1)p_{1}+p(1|0)p_{0}}
 
.

 
 
 
 p
 (
 1
 
 |
 
 0
 )
 =
 0.5
 
 erfc
 ⁡
 
 (
 
 
 
 A
 +
 λ
 
 
 
 N
 
 o
 
 
 
 /
 
 T
 
 
 
 )
 
 
 
 {\displaystyle p(1|0)=0.5\,\operatorname {erfc} \left({\frac {A+\lambda }{\sqrt {N_{o}/T}}}\right)}
 
 and 
 
 
 
 p
 (
 0
 
 |
 
 1
 )
 =
 0.5
 
 erfc
 ⁡
 
 (
 
 
 
 A
 −
 λ
 
 
 
 N
 
 o
 
 
 
 /
 
 T
 
 
 
 )
 
 
 
 {\displaystyle p(0|1)=0.5\,\operatorname {erfc} \left({\frac {A-\lambda }{\sqrt {N_{o}/T}}}\right)}

where 
 
 
 
 λ
 
 
 {\displaystyle \lambda }
 
 is the threshold of decision, set to 0 when 
 
 
 
 
 p
 
 1
 
 
 =
 
 p
 
 0
 
 
 =
 0.5
 
 
 {\displaystyle p_{1}=p_{0}=0.5}
 
.
We can use the average energy of the signal 
 
 
 
 E
 =
 
 A
 
 2
 
 
 T
 
 
 {\displaystyle E=A^{2}T}
 
 to find the final expression :

 
 
 
 
 p
 
 e
 
 
 =
 0.5
 
 erfc
 ⁡
 
 (
 
 
 
 E
 
 N
 
 o
 
 
 
 
 
 )
 
 .
 
 
 {\displaystyle p_{e}=0.5\,\operatorname {erfc} \left({\sqrt {\frac {E}{N_{o}}}}\right).}

±§

<h2 id="bit-error-rate-test">Bit error rate test</h2>
BERT or bit error rate test is a testing method for <a href="/facts/Digital_electronics/3kJcKbkw">digital communication circuits</a> that uses predetermined stress patterns consisting of a sequence of logical ones and zeros generated by a test pattern generator.
A BERT typically consists of a test pattern generator and a receiver that can be set to the same pattern. They can be used in pairs, with one at either end of a transmission link, or singularly at one end with a <a href="/facts/Loopback/NvRL5LTG">loopback</a> at the remote end. BERTs are typically stand-alone specialised instruments, but can be <a href="/facts/Personal_computer/koaYfNce">personal computer</a>–based. In use, the number of errors, if any, are counted and presented as a ratio such as 1 in 1,000,000, or 1 in 1e06.

<h3>Common types of BERT stress patterns</h3>
<ul><li>PRBS (<a href="/facts/Pseudorandom_binary_sequence/fFSVtEE4">pseudorandom binary sequence</a>) – A pseudorandom binary sequencer of N Bits. These pattern sequences are used to measure <a href="/facts/Jitter/UpLIJDVQ">jitter</a> and eye mask of TX-Data in electrical and optical data links.</li>
<li>QRSS (quasi random signal source) – A pseudorandom binary sequencer which generates every combination of a 20-bit word, repeats every 1,048,575 words, and suppresses consecutive zeros to no more than 14. It contains high-density sequences, low-density sequences, and sequences that change from low to high and vice versa. This pattern is also the standard pattern used to measure jitter.</li>
<li>3 in 24 – Pattern contains the longest string of consecutive zeros (15) with the lowest ones density (12.5%). This pattern simultaneously stresses minimum ones density and the maximum number of consecutive zeros. The <a href="/facts/D4_framing_standard/jUj3oBYv">D4</a> frame format of 3 in 24 may cause a D4 yellow alarm for frame circuits depending on the alignment of one bits to a frame.</li>
<li>1:7 – Also referred to as 1 in 8. It has only a single one in an eight-bit repeating sequence. This pattern stresses the minimum ones density of 12.5% and should be used when testing facilities set for <a href="/facts/B8ZS/0XxtLVYs">B8ZS</a> coding as the 3 in 24 pattern increases to 29.5% when converted to B8ZS.</li>
<li>Min/max – Pattern rapid sequence changes from low density to high density. Most useful when stressing the repeater's ALBO feature.</li>
<li>All ones (or mark) – A pattern composed of ones only. This pattern causes the repeater to consume the maximum amount of power. If DC to the repeater is regulated properly, the repeater will have no trouble transmitting the long ones sequence. This pattern should be used when measuring span power regulation. An unframed all ones pattern is used to indicate an <a href="/facts/Alarm_indication_signal/IJdEdAYK">AIS</a> (also known as a blue alarm).</li>
<li>All zeros – A pattern composed of zeros only. It is effective in finding equipment misoptioned for <a href="/facts/Alternate_Mark_Inversion/I84wDjmR">AMI</a>, such as fiber/radio multiplex low-speed inputs.</li>
<li>Alternating 0s and 1s - A pattern composed of alternating ones and zeroes.</li>
<li>2 in 8 – Pattern contains a maximum of four consecutive zeros. It will not invoke a B8ZS sequence because eight consecutive zeros are required to cause a B8ZS substitution. The pattern is effective in finding equipment misoptioned for B8ZS.</li>
<li>Bridgetap - <a href="/facts/Bridge_tap/rgDnEXMS">Bridge taps</a> within a span can be detected by employing a number of test patterns with a variety of ones and zeros densities. This test generates 21 test patterns and runs for 15 minutes. If a signal error occurs, the span may have one or more bridge taps. This pattern is only effective for T1 spans that transmit the signal raw. Modulation used in <a href="/facts/HDSL/x09Ct0HJ">HDSL</a> spans negates the bridgetap patterns' ability to uncover bridge taps.</li>
<li>Multipat - This test generates five commonly used test patterns to allow <a href="/facts/Digital_Signal_1/cghJPRpQ">DS1</a> span testing without having to select each test pattern individually. Patterns are: all ones, 1:7, 2 in 8, 3 in 24, and QRSS.</li>
<li>T1-DALY and 55 OCTET - Each of these patterns contain fifty-five (55), eight bit octets of data in a sequence that changes rapidly between low and high density. These patterns are used primarily to stress the ALBO and equalizer circuitry but they will also stress timing recovery. 55 OCTET has fifteen (15) consecutive zeroes and can only be used unframed without violating one's density requirements. For framed signals, the T1-DALY pattern should be used. Both patterns will force a B8ZS code in circuits optioned for B8ZS.</li></ul>
<h2 id="bit-error-rate-tester">Bit error rate tester</h2>
A bit error rate tester (BERT), also known as a "bit error ratio tester"<a class="footnote-ref" id="fnref:4" href="#fn:4">4</a> or bit error rate test solution (BERTs) is electronic test equipment used to test the quality of signal transmission of single components or complete systems.
The main building blocks of a BERT are:

<ul><li><a href="/facts/Digital_pattern_generator/y3PUDGoh">Pattern generator</a>, which transmits a defined test pattern to the <a href="/facts/Device_under_test/TTNCRQXm">DUT</a> or test system</li>
<li>Error detector connected to the DUT or test system, to count the errors generated by the DUT or test system</li>
<li>Clock signal generator to synchronize the pattern generator and the error detector</li>
<li>Digital communication analyser is optional to display the transmitted or received signal</li>
<li>Electrical-optical converter and optical-electrical converter for testing optical communication signals</li></ul>
<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Burst_error/UXkhCd2D">Burst error</a></li>
<li><a href="/facts/Error_correction_code/cLUTUJrA">Error correction code</a></li>
<li><a href="/facts/Errored_second/J6D7WgXk">Errored second</a></li>
<li><a href="/facts/Pseudo_bit_error_ratio/HCvJdftQ">Pseudo bit error ratio</a></li>
<li><a href="/facts/Viterbi_Error_Rate/lMwYd7HD">Viterbi Error Rate</a></li></ul>

This article incorporates <a href="/facts/Copyright_status_of_works_by_the_federal_government_of_the_United_States/Q1jvr96g">public domain material</a> from <a href="https://web.archive.org/web/20220122224547/https://www.its.bldrdoc.gov/fs-1037/fs-1037c.htm">Federal Standard 1037C</a>. <a href="/facts/General_Services_Administration/Np3opv9x">General Services Administration</a>. Archived from <a href="https://www.its.bldrdoc.gov/fs-1037/fs-1037c.htm">the original</a> on 2022-01-22. (in support of <a href="/facts/MIL-STD-188/D5rsvdsW">MIL-STD-188</a>).

<h2 id="external-links">External links</h2>
<ul><li><a href="http://www.etti.unibw.de/labalive/experiment/qpskber/">QPSK BER for AWGN channel – online experiment</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Jit Lim (14 December 2010). "Is BER the bit error ratio or the bit error rate?". EDN. Retrieved 14 October 2024. <a href="https://www.edn.com/is-ber-the-bit-error-ratio-or-the-bit-error-rate/" target="_blank">https://www.edn.com/is-ber-the-bit-error-ratio-or-the-bit-error-rate/</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">BER calculation, Vahid Meghdadi, Université de Limoges, January, 2008 <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">"Keyboards and Covert Channels"
by Gaurav Shah, Andres Molina, and Matt Blaze (2006?) <a href="https://www.usenix.org/legacy/event/sec06/tech/full_papers/shah/shah_html/jbug-Usenix06.html" target="_blank">https://www.usenix.org/legacy/event/sec06/tech/full_papers/shah/shah_html/jbug-Usenix06.html</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">"Bit Error Rate Testing: BER Test BERT » Electronics Notes". www.electronics-notes.com. Retrieved 2020-04-11. <a href="https://www.electronics-notes.com/articles/radio/bit-error-rate-ber/testing-bert.php" target="_blank">https://www.electronics-notes.com/articles/radio/bit-error-rate-ber/testing-bert.php</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
</ol>

Bit error rate open-in-new

Bit error rate