Concept

Barker code

In telecommunication technology, a Barker code, or Barker sequence, is a finite sequence of digital values with the ideal autocorrelation property. It is used as a synchronising pattern between sender and receiver. Binary digits have very little meaning unless the significance of the individual digits is known. The transmission of a pre-arranged synchronising pattern of digits can enable a signal to be regenerated by a receiver with a low probability of error. In simple terms it is equivalent to tying a label to one digit after which others may be related by counting. This is achieved by transmitting a special pattern of digits which is unambiguously recognised by the receiver. The longer the pattern the more accurately the data can be synchronised and errors due to distortion omitted. These patterns, called Barker Sequences are better known as Barker code after the inventor Ronald Hugh Barker. The process is “Group Synchronisation of Binary Digital Systems” first published in 1953. Initially developed for radar, telemetry and digital speech encryption in 1940 / 50's 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.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.