Академический Документы
Профессиональный Документы
Культура Документы
Barker codes!
Polyphase codes!
Nonlinear FM!
Linear period modulation!
Step-CW and step-chirp!
Barker Codes
Barker codes are a set of binary (biphase) codes with perfect autocorrelation
properties (in the sense that the sidelobes are either zero or + 1.!
The codes are as follows :!
Code length
2
3
4
5
7
11
13
Code elements
+,++
++
+ + +, + + +
++++
++++
+++++
+++++++++
Sidelobe level, dB
6.0
9.5
12.0
14.0
16.9
20.8
22.3
Barker Codes
+ + + +
+ + + +
Barker Codes
+ + + +
+ + + +
Barker Codes
+ + + +
+ + + +
Barker Codes
+ + + +
+ + + +
Barker Codes
+ + + +
+ + + +
Barker Codes
+ + + +
+ + + +
Barker Codes
+ + + +
+ + + +
Barker Codes
+ + + +
+ + + +
Barker codes
+ + + +
+ + + +
Barker Codes
+ + + +
+ + + +
Barker Codes
+ + + +
+ + + +
Barker Codes
Barker Codes
input
time domain!
!
!
!
!
!
!
!
!
!
frequency domain!
W1
W3
WNf
. . . . .
compressed
waveform
input
g ( t ) h ( t ) = F - 1 F ( g ( t ) ) F ( h ( t ) )
inverse
FT
forward
FT
replica
spectrum
F ( g ( t ) h ( t ) ) = F ( g (t ) ) F ( h (t ) )
W2
compressed
signal
For example take a 5-bit Barker code and a 4-bit Barker code :!
!
!
+ ! #"
+ ! #"
+ ! #"
! #"
+!
#
"
!
+++ +++ +++ +++ +++
!
!
The matched filter is built up by cascading the matched filters for the
individual codes :!
+ - + +
+ 0 0 0 - 0 0 0 + 0 0 0 + 0 0 0 +
Polyphase Codes
Frank Codes
Greater flexibility over biphase codes is provided by polyphase codes, though the
processing involved in generation and compression is more complicated than for
biphase codes. Several of these have been proposed and studied; most are
based on approximations to linear FM.!
!
Examples considered here are Frank codes, Huffman codes, and the P-codes
developed by Kretschmer and Lewis. !
Costas Codes
N
M(N)
M(N)|N!
3
4
0.67
4
12
0.5
fc+f6
fc+f5
fc+f4
fc+f3
fc+f2
fc+f1
fc
f/t
12
7,852
1.610-5
*
*
*
*
*
t0
t1
*
t2
t3
t4
t5
t6
The permutation matrix shown is one of 200 possible Costas arrays for N = 7.
Costas codes
Ambiguity diagrams
Barker
Costas
Code!
Code!
Code!
h
r
Welti Codes
frequency
time
s0 ( ) =
*
~
~
{
}
s
(
t
)
s
(
t
)
g
(
t
)
dt
1 1
*
~
~
{
}
s
(
t
)
s
(
t
)
g
(
t
)
dt
2 1
*
~
~
{
}
s
(
t
)
s
(
t
)
g
(
t
)
dt
1
2
*
~
~
{
}
s
(
t
)
s
(
t
)
g
(
t
)
dt
2 2
= R1( ) + R2 ( ) + R3 ( ) + R4 ( )
R3(t) and R4(t) are negligible.
(i) R1(t) ; (ii) R2(t) ; (iii) s0(t) for optimised
waveform
M .t
f i, pos = M .t +
T
fi =
f i , pos
f
i , pos
0 t t1
2t
t1 < t t2
t2 < t T 2
T 2 t < 0
0t T 2
t1 = T 2
t2 = T 2 ( + B 2 )
dB
dB
Further reading
Cook, C.E. and Bernfeld, M., Radar Signals, Academic Press, New York, 1967.!
!
Rihaczek, A.W., Principles of High Resolution Radar, McGraw-Hill, New York,
1969.!
!
Cohen, M., Radar waveforms and applications, Chapter 15 in Principles of
Modern Radar (Eaves, J.L. and Reedy, E.K. eds), Chapman & Hall, 1987.!
!
Levanon, N. and Mozeson, E., Radar Signals, Wiley, 2004!
!
Pace, P.E., Detecting and Classifying Low Probability of Intercept Radar, Artech
House, 2004.!