Barker code

Historical background

During and after WWII digital technology became a key subject for research e.g. for radar, missile and gun fire control and encryption. In the 1950s scientists were trying various methods around the world to reduce errors in transmissions using code and to synchronise the received data. The problem being transmission noise, time delay and accuracy of received data. In 1948 the mathematician Claude Shannon published an article '"A mathematical Theory of Communication"' which laid out the basic elements of communication. In it he discusses the problems of noise.

Shannon realised that “communication signals must be treated in isolation from the meaning of the messages that they transmit” and laid down the theoretical foundations for digital circuits. “The problem of communication was primarily viewed as a deterministic signal-reconstruction problem: how to transform a received signal, distorted by the physical medium, to reconstruct the original as accurately as possible” or see original. In 1948 electronics was advancing fast but the problem of receiving accurate data had not. This is demonstrated in an article on Frequency Shift Keying published by Wireless World. In 1953 RH Barker published a paper demonstrating how this problem to synchronise the data in transmissions could be overcome. The process is described in “Group Synchronisation of Binary Digital Systems”. When used in data transmissions the receiver can read and if necessary correct the data to be error free by autocorrelation and cross correlation by achieving zero autocorrelation except at the incidence position using specific codes. The Barker sequence process at the time produced great interest, particularly in the United States as his method solved the problem, initiating a huge leap forward in telecommunications. The process has remained at the forefront of radar, data transmission and telemetry and is now a very well known industry standard, still being researched in many technology fields. “In a pioneering examination of group synchronization of binary digital systems, Barker reasoned it would be desirable to start with an autocorrelation function having very low sidelobes. The governing code pattern, he insisted, could be unambiguously recognized by the detector. To assure this premise, Barker contended the selected pattern should be sufficiently unlikely to occur by chance, in a random series of noise generated bits”

Definition

A Barker code or Barker sequence is a finite sequence of N values of +1 and −1,

${\displaystyle a_j\text{ for }j=1,2,\dots ,N}$

with the ideal autocorrelation property, such that the off-peak (non-cyclic) autocorrelation coefficients

${\displaystyle c_v=\sum _{j=1}^{N-v}{a}_j{a}_{j+v}}$

are as small as possible:

${\displaystyle |c_v|\le 1}$

for all ${\displaystyle 1\le v<N}$.

Only nine Barker sequences are known, all of length N at most 13. Barker's 1953 paper asked for sequences with the stronger condition

${\displaystyle c_v\in \{-1,0\}.}$

Only four such sequences are known, shown in bold in the table below.

Known Barker codes

Here is a table of all known Barker codes, where negations and reversals of the codes have been omitted. A Barker code has a maximum autocorrelation sequence which has sidelobes no larger than 1. It is generally accepted that no other perfect binary phase codes exist. (It has been proven that there are no further odd-length codes, nor even-length codes of N < 10²².)

Barker codes of length N equal to 11 and 13 are used in direct-sequence spread spectrum and pulse compression radar systems because of their low autocorrelation properties (the sidelobe level of amplitude of the Barker codes is 1/N that of the peak signal). A Barker code resembles a discrete version of a continuous chirp, another low-autocorrelation signal used in other pulse compression radars.

The positive and negative amplitudes of the pulses forming the Barker codes imply the use of biphase modulation or binary phase-shift keying; that is, the change of phase in the carrier wave is 180 degrees.

Similar to the Barker codes are the complementary sequences, which cancel sidelobes exactly when summed; the even-length Barker code pairs are also complementary pairs. There is a simple constructive method to create arbitrarily long complementary sequences.

For the case of cyclic autocorrelation, other sequences have the same property of having perfect (and uniform) sidelobes, such as prime-length Legendre sequences, Zadoff–Chu sequences (used in 3rd- and 4th-generation cellular radio) and ${\displaystyle 2^n-1}$ maximum length sequences (MLS). Arbitrarily long cyclic sequences can be constructed.

Barker modulation

In wireless communications, sequences are usually chosen for their spectral properties and for low cross correlation with other sequences likely to interfere. In the 802.11 standard, an 11-chip Barker sequence is used for the 1 and 2 Mbit/s rates. The value of the autocorrelation function for the Barker sequence is 0 or −1 at all offsets except zero, where it is +11. This makes for a more uniform spectrum, and better performance in the receivers.

Examples of applications

Applications of Barker codes are found in radar, mobile phone, telemetry, ultrasound imaging and testing, GPS, and Wi-Fi.

Many of these technologies use DSSS. This technique incorporates Barker code to improve the received signal quality and improve security.

These codes also used in radio frequency identification RFID. Some examples where Barker code is used are: pet and livestock tracking, bar code scanners, inventory management, vehicle, parcel, asset and equipment tracking, inventory control, cargo and supply chain logistics. It is also used extensively for Intelligent Transport Systems (ITS) i.e. for vehicle guidance

Acceptance probability

Barker's algorithm is an alternative to Metropolis–Hastings, which doesn't satisfy the detailed balance condition. Barker's algorithm does converge to the target distribution. Given the current state, x, and the proposed state, x', the acceptance probability is defined as: ${\displaystyle \alpha \left(x\to x^{\mathrm{\prime }}\right)=\frac{P\left(x^{\mathrm{\prime }}\right)}{P\left(x\right)+P\left(x^{\mathrm{\prime }}\right)}}$
The formula doesn't satisfy detailed balance, but makes sure that the balanced condition is met.