You do not have permission to edit this page, for the following reasons:

This IP address has been blocked from editing Wikipedia.
This does not affect your ability to read Wikipedia pages.
Most people who see this message have done nothing wrong. Some kinds of blocks restrict editing from specific service providers or telecom companies in response to recent abuse or vandalism, and can sometimes affect other users who are unrelated to that abuse. Review the information below for assistance if you do not believe that you have done anything wrong.

The IP address or range 3.238.0.0/16 has been blocked by ‪ST47‬ for the following reason(s):

The IP address that you are currently using has been blocked because it is believed to be a web host provider. To prevent abuse, web hosts may be blocked from editing Wikipedia.
You will not be able to edit Wikipedia using a web host provider because it hides your IP address, much like a proxy or VPN.
We recommend that you attempt to use another connection to edit. For example, if you use a proxy or VPN to connect to the internet, turn it off when editing Wikipedia. If you edit using a mobile connection, try using a Wi-Fi connection, and vice versa. If you are using a corporate internet connection, switch to a different Wi-Fi network. If you have a Wikipedia account, please log in.
If you do not have any other way to edit Wikipedia, you will need to request an IP block exemption.

How to appeal if you are confident that your connection does not use a web host's IP address:
If you are confident that you are not using a web host, you may appeal this block by adding the following text on your talk page: ((unblock|reason=Caught by a web host block but this host or IP is not a web host. My IP address is _______. Place any further information here. ~~~~)). You must fill in the blank with your IP address for this block to be investigated. Your IP address can be determined here. Alternatively, if you wish to keep your IP address private you can use the unblock ticket request system. There are several reasons you might be editing using the IP address of a web host (such as if you are using VPN software or a business network); please use this method of appeal only if you think your IP address is in fact not a web host.

Administrators: The IP block exemption user right should only be applied to allow users to edit using web host in exceptional circumstances, and they should usually be directed to the functionaries team via email. If you intend to give the IPBE user right, a CheckUser needs to take a look at the account. This can be requested most easily at SPI Quick Checkuser Requests. Unblocking an IP or IP range with this template is highly discouraged without at least contacting the blocking administrator.

This block will expire on 05:34, 21 January 2026. Your current IP address is 3.238.27.177.

Even when blocked, you will usually still be able to edit your user talk page, as well as email administrators and other editors.

For information on how to proceed, please read the FAQ for blocked users and the guideline on block appeals. The guide to appealing blocks may also be helpful.

Other useful links: Blocking policy · Help:I have been blocked
This IP address range has been globally blocked.
This does not affect your ability to read Wikipedia pages.
Most people who see this message have done nothing wrong. Some kinds of blocks restrict editing from specific service providers or telecom companies in response to recent abuse or vandalism, and can sometimes affect other users who are unrelated to that abuse. Review the information below for assistance if you do not believe that you have done anything wrong.

This block affects editing on all Wikimedia wikis.
The IP address or range 3.238.0.0/16 has been globally blocked by ‪Jon Kolbert‬ for the following reason(s):

Open proxy/Webhost: See the help page if you are affected

This block will expire on 05:35, 21 February 2029. Your current IP address is 3.238.27.177.

Even while globally blocked, you will usually still be able to edit pages on Meta-Wiki.

If you believe you were blocked by mistake, you can find additional information and instructions in the No open proxies global policy. Otherwise, to discuss the block please post a request for review on Meta-Wiki. You could also send an email to the stewards VRT queue at stewards@wikimedia.org including all above details.

Other useful links: Global blocks · Help:I have been blocked

You can view and copy the source of this page:

((Short description|Number of incorrect bits transmitted))
((more citations needed|date=March 2013))

In [[digital transmission]], the number of '''bit errors''' is the number of received [[bit]]s of a [[data stream]] over a [[communication channel]] that have been altered due to [[noise (telecommunications)|noise]], [[interference (communication)|interference]], [[distortion]] or [[bit synchronization]] errors.

The '''bit error rate''' ('''BER''') is the number of bit errors per unit time. The '''bit error ratio''' (also '''BER''') is the number of bit errors divided by the total number of transferred bits during a studied time interval. Bit error ratio is a unitless performance measure, often expressed as a [[percentage]].<ref>((cite magazine |url=http://www.edn.com/electronics-blogs/scope-guru-on-signal-integrity/4311086/Is-BER-the-bit-error-ratio-or-the-bit-error-rate- |title=Is BER the bit error ratio or the bit error rate? |date=14 December 2010 |author=Jit Lim |publisher=EDN |access-date=2015-02-16))</ref>

The '''bit error probability''' ''p<sub>e</sub>'' is the [[expected value]] of the bit error ratio. The bit error ratio can be considered as an approximate estimate of the bit error probability. This estimate is accurate for a long time interval and a high number of bit errors.

==Example==
As an example, assume this transmitted bit sequence:

1 1 0 0 0 1 0 1 1 

and the following received bit sequence:

<u>0</u> 1 0 <u>1</u> 0 1 0 <u>0</u> 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%.

==Packet error ratio==
The '''packet error ratio''' (PER) is the number of incorrectly received [[network packet|data packet]]s 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''' ''p<sub>p</sub>'', which for a data packet length of ''N'' bits can be expressed as

:<math>p_p = 1 - (1 - p_e)^N = 1 - e^{N \ln(1 - p_e)}</math>,

assuming that the bit errors are independent of each other. For small bit error probabilities and large data packets, this is approximately

:<math>p_p \approx p_eN.</math>

Similar measurements can be carried out for the transmission of [[frame (networking)|frame]]s, [[block (data storage)|block]]s, or [[symbol (data)|symbol]]s.

The above expression can be rearranged to express the corresponding BER (''p<sub>e</sub>'') as a function of the PER (''p<sub>p</sub>'') and the data packet length ''N'' in bits:

:<math>p_e = 1 - \sqrt[N]{(1 - p_p)}</math>

==Factors affecting the BER==
In a communication system, the receiver side BER may be affected by transmission channel [[noise (telecommunications)|noise]], [[interference (communication)|interference]], [[distortion]], [[bit synchronization]] problems, [[attenuation]], wireless [[Multipath propagation|multipath]] [[fading]], 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 [[modulation]] scheme or [[line coding]] scheme, and by applying [[channel coding]] schemes such as redundant [[forward error correction]] 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.

==Analysis of the BER==
The BER may be evaluated using stochastic ([[Monte Carlo method|Monte Carlo]]) computer simulations. If a simple transmission [[channel model]] and [[traffic generation model|data source]] model is assumed, the BER may also be calculated analytically. An example of such a data source model is the [[Bernoulli distribution|Bernoulli]] source.

Examples of simple channel models used in [[information theory]] are:
* [[Binary symmetric channel]] (used in analysis of decoding error probability in case of [[error burst|non-bursty bit errors]] on the transmission channel)
* [[Additive white Gaussian noise]] (AWGN) channel without fading.

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 [[Bernoulli distribution|Bernoulli]] binary data source and a binary symmetrical channel are assumed, see below).

[[Image:PSK BER curves.svg|thumb|right|280px|Bit-error rate curves for [[BPSK]], [[QPSK]], 8-PSK and 16-PSK, [[AWGN]] channel.]]
[[Image:Diff enc BPSK BER curves.svg|thumb|right|280px|BER comparison between BPSK and [[DPSK|differentially encoded BPSK]] with gray-coding operating in white noise.]]

In a noisy channel, the BER is often expressed as a function of the normalized [[carrier-to-noise ratio]] measure denoted [[Eb/N0]], (energy per bit to noise power spectral density ratio), or [[Es/N0]] (energy per modulation symbol to noise spectral density).

For example, in the case of [[BPSK]] modulation and AWGN channel, the BER as function of the Eb/N0 is given by:

<math>\operatorname{BER}=Q(\sqrt{2E_b/N_0})</math>,

where
<math>Q(x) := \frac{1}{\sqrt{2\pi)) \int_{x}^{ \infty } e^{-x^2/2}dx</math>. <ref>
BER calculation, Vahid Meghdadi, Université de Limoges, January, 2008
</ref>

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 [[forward error correction]] codes. Since most such codes correct only bit-flips, but not bit-insertions or bit-deletions, the [[Hamming distance]] 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 [[Levenshtein distance]].
The Levenshtein distance measurement is more appropriate for measuring raw channel performance before [[frame synchronization]], and when using error correction codes designed to correct bit-insertions and bit-deletions, such as Marker Codes and Watermark Codes.<ref>
[https://www.usenix.org/legacy/event/sec06/tech/full_papers/shah/shah_html/jbug-Usenix06.html "Keyboards and Covert Channels"]
by Gaurav Shah, Andres Molina, and Matt Blaze (2006?)
</ref>

==Mathematical draft==
The BER is the likelihood of a bit misinterpretation due to electrical noise <math>w(t)</math>. Considering a bipolar NRZ transmission, we have

<math>x_1(t) = A + w(t)</math> for a "1" and <math>x_0(t) = -A + w(t)</math> for a "0". Each of <math>x_1(t)</math> and <math>x_0(t)</math> has a period of <math>T</math>.

Knowing that the noise has a bilateral spectral density  <math>\frac{N_0}{2} </math>,

<math>x_1(t)</math> is <math>\mathcal{N}\left(A,\frac{N_0}{2T}\right)</math>

and <math>x_0(t)</math> is <math>\mathcal{N}\left(-A,\frac{N_0}{2T}\right)</math>.

Returning to BER, we have the likelihood of a bit misinterpretation <math>p_e = p(0|1) p_1 + p(1|0) p_0</math>.

<math> p(1|0) = 0.5\, \operatorname{erfc}\left(\frac{A+\lambda}{\sqrt{N_o/T))\right)</math> and  <math> p(0|1) = 0.5\, \operatorname{erfc}\left(\frac{A-\lambda}{\sqrt{N_o/T))\right)</math>

where <math> \lambda</math> is the threshold of decision, set to 0 when <math>p_1 = p_0 = 0.5</math>.

We can use the average energy of the signal <math>E = A^2 T</math> to find the final expression :

<math>p_e = 0.5\, \operatorname{erfc}\left(\sqrt{\frac{E}{N_o))\right).</math>
±§

==Bit error rate test==
'''BERT''' or '''bit error rate test''' is a testing method for [[Digital electronics|digital communication circuits]] 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 [[loopback]] at the remote end.  BERTs are typically stand-alone specialised instruments, but can be [[personal computer]]–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.

===((anchor|QRSS))Common types of BERT stress patterns===
*'''PRBS''' ([[pseudorandom binary sequence]]) – A pseudorandom binary sequencer of N Bits. These pattern sequences are used to measure [[jitter]] and eye mask of TX-Data in electrical and optical data links.
*'''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.
*'''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 [[D4 framing standard|D4]] frame format of 3 in 24 may cause a D4 [[Remote alarm indication|yellow alarm]] for frame circuits depending on the alignment of one bits to a frame.
*'''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 [[B8ZS]] coding as the 3 in 24 pattern increases to 29.5% when converted to B8ZS.
*'''Min/max''' – Pattern rapid sequence changes from low density to high density.  Most useful when stressing the repeater's [[Automatic Line Build Out|ALBO]] feature.
*'''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 [[Alarm indication signal|AIS]] (also known as a ''blue alarm'').
*'''All zeros''' – A pattern composed of zeros only.  It is effective in finding equipment misoptioned for [[Alternate Mark Inversion|AMI]], such as fiber/radio multiplex low-speed inputs.
*'''Alternating 0s and 1s''' - A pattern composed of alternating ones and zeroes.
*'''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.
*'''Bridgetap''' - [[Bridge tap]]s 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 [[HDSL]] spans negates the bridgetap patterns' ability to uncover bridge taps.
*'''Multipat''' - This test generates five commonly used test patterns to allow [[Digital Signal 1|DS1]] span testing without having to select each test pattern individually.  Patterns are: all ones, 1:7, 2 in 8, 3 in 24, and QRSS.
*'''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.

==Bit error rate tester==
A bit error rate tester (BERT), also known as a "bit error ratio tester"<ref>((Cite web|url=https://www.electronics-notes.com/articles/radio/bit-error-rate-ber/testing-bert.php|title=Bit Error Rate Testing: BER Test BERT » Electronics Notes|website=www.electronics-notes.com|access-date=2020-04-11))</ref> 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:
* [[Digital pattern generator|Pattern generator]], which transmits a defined test pattern to the [[Device under test|DUT]] or test system
* Error detector connected to the DUT or test system, to count the errors generated by the DUT or test system
* Clock signal generator to synchronize the pattern generator and the error detector
* Digital communication analyser is optional to display the transmitted or received signal
* Electrical-optical converter and optical-electrical converter for testing optical communication signals

==See also==
* [[Burst error]]
* [[Error correction code]]
* [[Errored second]]
* [[Pseudo bit error ratio]]
* [[Viterbi Error Rate]]

==References==
((Reflist))
((FS1037C MS188))

==External links==
*[http://www.etti.unibw.de/labalive/experiment/qpskber/ QPSK BER for AWGN channel – online experiment]

((DEFAULTSORT:Bit Error Ratio))
[[Category:Ratios]]
[[Category:Data transmission]]
[[Category:Network performance]]
[[Category:Error measures]]

[[cs:BER]]

Pages transcluded onto the current version of this page (help):

Bit error rate (edit)
Template:Ambox (view source) (template editor protected)
Template:Anchor (view source) (template editor protected)
Template:Citation (view source) (protected)
Template:Citation/styles.css (view source) (template editor protected)
Template:Cite USGov (view source) (template editor protected)
Template:Cite magazine (view source) (protected)
Template:Cite web (view source) (protected)
Template:Delink (view source) (protected)
Template:FS1037C MS188 (view source) (semi-protected)
Template:Find sources mainspace (view source) (template editor protected)
Template:If empty (view source) (protected)
Template:Include-USGov (view source) (template editor protected)
Template:Link if exists (view source) (template editor protected)
Template:Main other (view source) (protected)
Template:More citations needed (view source) (template editor protected)
Template:Pagetype (view source) (protected)
Template:Reflist (view source) (protected)
Template:Reflist/styles.css (view source) (protected)
Template:SDcat (view source) (protected)
Template:Short description (view source) (protected)
Template:Short description/lowercasecheck (view source) (protected)
Module:Anchor (view source) (template editor protected)
Module:Arguments (view source) (protected)
Module:Category handler (view source) (protected)
Module:Category handler/blacklist (view source) (protected)
Module:Category handler/config (view source) (protected)
Module:Category handler/data (view source) (protected)
Module:Category handler/shared (view source) (protected)
Module:Check for unknown parameters (view source) (protected)
Module:Citation/CS1 (view source) (protected)
Module:Citation/CS1/COinS (view source) (protected)
Module:Citation/CS1/Configuration (view source) (protected)
Module:Citation/CS1/Date validation (view source) (protected)
Module:Citation/CS1/Identifiers (view source) (protected)
Module:Citation/CS1/Utilities (view source) (protected)
Module:Citation/CS1/Whitelist (view source) (protected)
Module:Citation/CS1/styles.css (view source) (protected)
Module:Delink (view source) (protected)
Module:Disambiguation/templates (view source) (protected)
Module:Find sources (view source) (template editor protected)
Module:Find sources/config (view source) (template editor protected)
Module:Find sources/links (view source) (template editor protected)
Module:Find sources/templates/Find sources mainspace (view source) (template editor protected)
Module:If empty (view source) (protected)
Module:Message box (view source) (protected)
Module:Message box/ambox.css (view source) (protected)
Module:Message box/configuration (view source) (protected)
Module:Namespace detect/config (view source) (protected)
Module:Namespace detect/data (view source) (protected)
Module:Pagetype (view source) (protected)
Module:Pagetype/config (view source) (protected)
Module:Pagetype/disambiguation (view source) (protected)
Module:Pagetype/rfd (view source) (template editor protected)
Module:Pagetype/setindex (view source) (protected)
Module:Pagetype/softredirect (view source) (protected)
Module:SDcat (view source) (protected)
Module:String (view source) (protected)
Module:TableTools (view source) (protected)
Module:Template wrapper (view source) (template editor protected)
Module:Unsubst (view source) (protected)
Module:Wikitext Parsing (view source) (protected)
Module:Yesno (view source) (protected)

Return to Bit error rate.

Retrieved from "https://en.wikipedia.org/wiki/Bit_error_rate"