Radar itself is an abbreviation for RAdio Detection and Ranging. Radar systems send out modulated waveforms using antennas in order to transmit electromagnetic energy into a specific volume of space to search for targets. Objects (i.e. targets) within a certain volume will reflect part of the energy (radar returns or echoes) back to the radar. From these radar returns, the radar reciever then extracts information such as velocity and range, angular position, and other identifying characteristics.
In our project, we decided to keep the level of complexity of how rader is utilized down to a manageable level for a group size of two. As a result we made the following assumptions in our approach to modeling radar inside of Matlab.
We will now examine the concept of one of the most commonly used signals to do radar processing, the Linear Frequency Modulated Chirp (LFM Chirp) and its characteristics. Following that, the important concept of match filtering is discussed since it is implemented for calculating the range of a target.
A linear frequency modulated chirp signal for radar is defined by the equation (1)
t = time on the range of [-T/2,T/2], T =time duration in seconds of LFM signal pulse, W = swept bandwitdth over the life of the pulse in Hz
The changing frequency of the chirp signal sweeps from (-1/2)W to +(1/2)W Hz. It is interesting to note that the phase of s(t) varies quadratically versus t while the frequency changes linearly versus time. The deriviative of phase determines the instantaneous frequency of the signal. The signal is complex valued in this case because it is the baseband form of the linear frequency modulation. See Figure(1.1 ) below for example.
Thus, it would seem like the frequency spectrum S(f) would have most of its energy in the range of | f | < (W/2). However, this is in fact only true if the frequency sweeps slowly enough or if T is large enough.
In Matlab however, the chirp signal has to be represented as a discrete time signal. A solution to this problem is to just oversample s(t) enough so that we can effectively simulate the continuous time version. Otherwise, if we just wanted to have a discrete time signal, the sampling frequency would be kept approximately equal to the swept bandwidth W. But, we will need to oversample by at least a factor of 5 at least in order to properly simulate the continous time signal.
| Figure(1.1) Continuous-time LFM chirp radar signal |
|---|
![]() |
The sampling frequency fs = 1 / Ts. The sampling rate can also be tied to W, the swept bandwidth of the chirp, because in many cases the chirp is more or less bandlimited to a frequency extent of W. Therefore, it is convenient to let fs = p*W where p>(or equal to) 1 represents the oversampling factor. Thus, the equation for our discretized chirp changes into equation (2).
with 0<(or equal to) n < T
| Figure(1.2) Fourier Transform of LFM |
|---|
![]() |
The transmitted signals are designed differently for range and velocity processing. In the case of range processing, the output SNR and range resolution must be maximized. Thus, LFM chirp signals with large TW products are used in conjunction with a "pulse compression" match filter.
A match filter is defined by its frequency response H(f) = S*(f) (i.e. the complex conjugate of the Fourier transform of the transmitted signal s(t)) or by its impulse response which in turn is determined by the transmitted waveform (the LFM chirp radar signal is the s(t) in the case of range processing). Note that t is on the range of [-T/2,T/2].
Note: (1)The recieved signal in terms of range processing is going to be a time delayed and weighted version of the transmitted signal s(t) (i.e. due to a target at a certain range and G is the weighting of the signal due to, for example, noise in the channel. (2) The match filter is Linear Time Invariant.
By taking the convolution of the recieved signal with the original transmitted signal ( a chirp) you are basically sliding across your time reversed h(t) across your receievd signal doing a point wise multiplication and then integrating over the area of that product. Thus, the peak in the real part of the output is only going to occur when the chirp in h(t) is exactly lined up with a chirp in the recieved signal. In other words, the spike output corresponds to where the greatest area underneath the curve is produced from the pointwise multiplication. The location of the spike itself corresponds to the location of where the right most edge of a chirp is located in the recieved signal. Moreover, even in the presence of noise, the output of the match filter will still produce a compressed peak output corresponding to the location of a chirp in the recieved signal. In the "Approach for Range" module, we discuss how this value is useful in calculating range. See also Professor Richard Baraniuk's ELEC 301 course webpage at Rice University under "Demos and Applets" for visual aids in understanding the concept of convolution.
Next, look at "Approach for Range" as next step.