Oscillator mismatch and jitter compensation in concurrent codecs

Abstract

Abstract-The advent of concurrent coding theory means that omnidirectional communication systems can possess a level of keyless jam-resistance comparable to that of traditional spread spectrum systems, all of which rely on shared secret keys. To achieve this, concurrent codecs possess the ability to efficiently separate multiple legitimate codewords that have been superimposed. This is achieved by leveraging a highly asymmetric sensitivity to bit errors and, consequently, a reliance on communication channels having correspondingly high degrees of asymmetry in their bit error probabilities. While suitable physical channels must possess inherently high degrees of asymmetry, this asymmetry can be artificially enhanced using post processing techniques with the effect that system designers can trade small amounts of jam-resistance for increases in noise immunity. Furthermore, to rob potential adversaries of the option of attacking the receiver's ability to synchronize with the transmitted signal, concurrent codecs do not perform real-time adaptive synchronization and instead use asynchronous protocols. To avoid bit misalignments over the length of the packet, such protocols normally require that transmitters and receivers have oscillators with frequency tolerances on the order of one part in ten times the packet length. However, a concurrent codec can use simple post-processing techniques to exploit the asymmetry in bit error sensitivity to give receivers high degrees of immunity to timing jitter as well as high tolerances to oscillator mismatch. This has implications not only for processing gain, but also for implementation cost since transceivers can utilize oscillators having greatly relaxed specifications compared to that required by traditional systems. This paper presents these techniques and analyzes their impact on jam-resistance and oscillator performance requirements.

Developing concurrent coding: an unconventional encoding scheme applied to visible light communications

“…In this case misplaced marks lead to a failure to correctly decode the full contents of transmission. This was understood and pointed out by Bahn [[24], [25]] who quantifed the precision with which oscillators should be matched and suggested the use of 'Bookend marks' to define the start and end of the codeword. As has been stated for the ideal modelling case, the nature of indelible marks means that encoded messages cannot be removed and will always be decoded.…”

“…The first involves adding to the beginning of the codeword a 16-bit code that can be identified by correlation. The second involves distributing throughout the codeword a small number of static synchronisation marks (similar to the bookend marks[ [25]] but not at the ends of the codeword) . The first approach is simple and adds to the codeword length a little.…”

A new encoding scheme for visible light communications with applications to mobile connections

“…The first involves adding to the beginning of the codeword a 16 bit code that can be identified by correlation. The second involves distributing throughout the codeword a small number of static synchronisation marks (similar to the bookend marks [24] but not at the ends of the codeword) . The first approach is simple and adds to the codeword length a little.…”

Exhaustive attack analysis of BBC with glowworm for unkeyed jam resistance

“…An extreme example would be GPS satellites, where a secret cannot be shared with the receiver and kept secret from the adversary, because the "receiver" is every person on earth, including the adversaries. There is currently only one algorithm for achieving jam resistance with no shared secret in the presence of an adversary assumed to have infinite computational power: the BBC (Baird, Bahn, Collins) concurrent code [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20].…”