Uniqueness of the generalized Barker sequence of length 6

1990 ◽  
Vol 36 (5) ◽  
pp. 1167-1170 ◽  
Author(s):  
N. Zhang ◽  
S.W. Golomb
Keyword(s):  
Barker Sequence

scholarly journals Design of Binary Coded Pulse Trains with Good Autocorrelation Properties for Radar Communications

2018 ◽  
Vol 150 ◽  
pp. 06016 ◽  
Author(s):  
Siti Julia Rosli ◽  
Hasliza Rahim ◽  
Ruzelita Ngadiran ◽  
K. N. Abdul Rani ◽  
Muhammad Imran Ahmad ◽  
...  
Keyword(s):  
Communication Systems ◽  
Pulse Compression ◽  
Binary Sequence ◽  
Digital Processing ◽  
Side Lobe ◽  
Sidelobe Level ◽  
Pulse Trains ◽  
Specific Parameter ◽  
Ideal Autocorrelation ◽  
Barker Sequence

Finite length of sequences that are modulated both in phase and amplitude and have an ideal autocorrelation function (ACF) consisting of merely a pulse have many applications in control and communication systems. They are widely applied in control and communication systems, such as in pulse compression systems for radar and deep-space ranging problems [1-5]. In radar design, the important part is to choose a waveform, which is suitable to be transmitted because the waveform controls resolution in clutter performance. In addition, it can solve a general signal problem particularly related to the digital processing. Energy ratio (ER), total side lobe energy (SLE), and peak sidelobe level (PSL) are three properties of such sequences interest. This paper presents a method using the Complementation, Cyclic Shift and Bit Addition for synthesizing and optimizing a binary sequence implemented to improve the sequences of a similar quality with the Barker sequence, particularly for lengths greater than 13. All of these methods are guided by the specific parameter with good characteristics in ACF (ER, SLE, and PSL) [6,7,8]. Such sequences can then be effectively used to improve the range and Doppler resolution of radars.

scholarly journals Wieferich pairs and Barker sequences, II

2014 ◽  
Vol 17 (1) ◽  
pp. 24-32 ◽  
Author(s):  
Peter Borwein ◽  
Michael J. Mossinghoff
Keyword(s):  
Lower Bound ◽  
Hadamard Matrix ◽  
Matrix Problem ◽  
Barker Sequence

AbstractWe show that if a Barker sequence of length $n>13$ exists, then either n $=$ 3 979 201 339 721 749 133 016 171 583 224 100, or $n > 4\cdot 10^{33}$. This improves the lower bound on the length of a long Barker sequence by a factor of nearly $2000$. We also obtain eighteen additional integers $n<10^{50}$ that cannot be ruled out as the length of a Barker sequence, and find more than 237 000 additional candidates $n<10^{100}$. These results are obtained by completing extensive searches for Wieferich prime pairs and using them, together with a number of arithmetic restrictions on $n$, to construct qualifying integers below a given bound. We also report on some updated computations regarding open cases of the circulant Hadamard matrix problem.

Why The Barker Sequence Bit Length Does Not Exceed Thirteen?

1988 ◽  
Vol 34 (6) ◽  
pp. 461-462
Author(s):  
B V Rao ◽  
A A Deshpaade
Keyword(s):  
Barker Sequence
Sign in / Sign up

Export Citation Format

Share Document