HOME

TheInfoList



OR:

The spectrum of a
chirp A chirp is a signal in which the frequency increases (''up-chirp'') or decreases (''down-chirp'') with time. In some sources, the term ''chirp'' is used interchangeably with sweep signal. It is commonly applied to sonar, radar, and laser system ...
pulse describes its characteristics in terms of its frequency components. This frequency-domain representation is an alternative to the more familiar time-domain waveform, and the two versions are mathematically related by the
Fourier transform A Fourier transform (FT) is a mathematical transform that decomposes functions into frequency components, which are represented by the output of the transform as a function of frequency. Most commonly functions of time or space are transformed, ...
.
The spectrum is of particular interest when pulses are subject to
signal processing Signal processing is an electrical engineering subfield that focuses on analyzing, modifying and synthesizing '' signals'', such as sound, images, and scientific measurements. Signal processing techniques are used to optimize transmissions, ...
. For example, when a chirp pulse is compressed by its
matched filter In signal processing, a matched filter is obtained by correlating a known delayed signal, or ''template'', with an unknown signal to detect the presence of the template in the unknown signal. This is equivalent to convolving the unknown signal w ...
, the resulting waveform contains not only a main narrow pulse but, also, a variety of unwanted artifacts many of which are directly attributable to features in the chirp's spectral characteristics.
The simplest way to derive the spectrum of a chirp, now that computers are widely available, is to sample the time-domain waveform at a frequency well above the
Nyquist limit In signal processing, the Nyquist frequency (or folding frequency), named after Harry Nyquist, is a characteristic of a sampler, which converts a continuous function or signal into a discrete sequence. In units of cycles per second ( Hz), i ...
and call up an
FFT A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). Fourier analysis converts a signal from its original domain (often time or space) to a representation in th ...
algorithm to obtain the desired result. As this approach was not an option for the early designers, they resorted to analytic analysis, where possible, or to graphical or approximation methods, otherwise. These early methods still remain helpful, however, as they give additional insight into the behavior and properties of chirps.


Chirp pulse

A general expression for an oscillatory waveform, centered on frequency is s(t)= a(t) \cdot \exp (\omega_0 \cdot t + \theta(t))/math> where a(t) and (t) give the amplitude and phase variations of the waveform s, with time.
The frequency spectrum of this waveform is obtained by calculating the
Fourier Transform A Fourier transform (FT) is a mathematical transform that decomposes functions into frequency components, which are represented by the output of the transform as a function of frequency. Most commonly functions of time or space are transformed, ...
of s(t), i.e. S(\omega) =\int_^s(t) \cdot \exp(-j\omega t) \cdot dt = \int_^a(t) \cdot \exp (\omega_0 t + \theta(t))\cdot \exp(-j\omega t) \cdot dt
so
S(\omega)=\int_^a(t) \cdot \exp \left \\cdot dt In a few special cases, the integral can be solved to give an
analytical expression In mathematics, a closed-form expression is a mathematical expression that uses a finite number of standard operations. It may contain constants, variables, certain well-known operations (e.g., + − × ÷), and functions (e.g., ''n''th r ...
, but often the characteristics of a(t) and (t) are such that the integral can only be evaluated by an
approximation algorithm In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems (in particular NP-hard problems) with provable guarantees on the distance of the returned solu ...
or by
numerical integration In analysis, numerical integration comprises a broad family of algorithms for calculating the numerical value of a definite integral, and by extension, the term is also sometimes used to describe the numerical solution of differential equations ...
.


Linear chirp

In the special case where s(t) is constrained to be a down-chirp, flat topped pulse with its instantaneous frequency varying as a linear function of time, then an analytical solution is possible. For convenience, the pulse is considered to have unit amplitude and be of duration T, with the amplitude and phase defined over the time interval -T/2 to +T/2. The total frequency sweep is F, varying in a linear manner from -F/2 to +F/2 in the defined time interval. When the frequency is a linear function of time, the phase is a
quadratic function In mathematics, a quadratic polynomial is a polynomial of degree two in one or more variables. A quadratic function is the polynomial function defined by a quadratic polynomial. Before 20th century, the distinction was unclear between a polynomi ...
, and s(t) can be written :s(t)= 1 \cdot \exp (\Delta \Omega \cdot t + \frac \cdot t^2)qquad \text \quad\Delta \Omega=2\pi \cdot \Delta F \qquad \text \quad\frac < t < \frac The spectrum of this linear FM signal is :S(\omega)=\int_^\exp \left (\Delta \Omega \cdot t+\frac \cdot t^2) \right\cdot \exp(-j\omega \cdot t) \cdot dt =\int_^\exp \left j \left\ \right\cdot dt By
completing the square : In elementary algebra, completing the square is a technique for converting a quadratic polynomial of the form :ax^2 + bx + c to the form :a(x-h)^2 + k for some values of ''h'' and ''k''. In other words, completing the square places a perfe ...
and using the Fresnel integrals C(X) and S(X),Jahnke E. and Emde F., "Tables of functions", Dover Publications N.Y. 1945Abramowitz M. and Stegun I.A.,"Handbook of Mathematical Functions", Nat. Bur. Standards 1964, reprinted by Dover Publications N.Y. 1965 (9th ed.1972) defined by : C(X)=\int_^\cos \frac \cdot dy \qquad \text \qquad S(X)=\int_^\sin \frac \cdot dy the expression can be evaluatedCook C.E. and Bernfeld M., "Radar Signals - An Introduction to Theory and Application", Academic Press 1967,1987, reprinted by Artech House 1993. to give: :S(\omega)= \sqrt \cdot \exp \left j\left((\omega-\Delta \Omega)^2 \cdot \frac\right)\right\cdot (X_1)+j \cdot S(X_1)+C(X_2)+j \cdot S(X_2)/math> where X_1 and X_2 are given by :\quad X_1=\frac \quad \text \quad X_2=\frac The linear FM spectrum can be considered to have three major components, namely * an Amplitude Term, , S(\omega), = \sqrt \cdot \left left(C(X_1)+C(X_2)\right)^2+\left(S(X_1)+S(X_2)\right)^2\right\frac * a Square Law Phase term, \quad -\Phi_1(\omega)=(\omega-\Delta \Omega)^2 \cdot \frac * and a Residual Phase Term \quad \Phi_2(\omega) = \arctan\left frac\right The ratio \left frac\right is approximately unity over a large part of frequency range of interest so approximates to a constant phase angle /4 there. If a frequency scaling term n is introduced, where n=2 \cdot \frac, then the expressions for the Fresnel arguments become :X_1=\frac \cdot (1+n) and :X_2=\frac \cdot (1-n) The spectra are now functions of the product T.F, independent of any particular values of center frequency and bandwidth. This product, T.F, is often referred to as the time-bandwidth product of the chirp. Tables of the Fresnel integrals have been published, together with mathematical routines with which to compute the integrals manually or by means of a computer program. In addition, a number of mathematical software programs, such as
Mathcad Mathcad is computer software for the verification, validation, documentation and re-use of mathematical calculations in engineering and science, notably mechanical, chemical, electrical, and civil engineering. Released in 1986 on DOS, it introduc ...
,
MATLAB MATLAB (an abbreviation of "MATrix LABoratory") is a proprietary multi-paradigm programming language and numeric computing environment developed by MathWorks. MATLAB allows matrix manipulations, plotting of functions and data, implementa ...
and
Mathematica Wolfram Mathematica is a software system with built-in libraries for several areas of technical computing that allow machine learning, statistics, symbolic computation, data manipulation, network analysis, time series analysis, NLP, optimi ...
have built-in routines to evaluate the integrals, either as standard functions or in extension packages. Some plots of the power spectrum , S(), 2 as a function of frequency are shown, for time-bandwidth products of 25, 100, 250 and 1000. When the product is small, the Fresnel ripples are very much in evidence, but the spectrum does tend to a more rectangular profile for larger values.
In the case of the plots of residual phase, 2(), the profiles tend to be very similar over a wide range of time-bandwidth products. Two examples, for TxB = 100 and 250 are shown below. They have a phase angle close to a value of /4 within the chirp range \omega_0\pm\Delta\Omega/2 and they only start to change significantly for frequencies beyond this range. Consequently, for frequencies within the sweep range of the chirp, it is the square-law phase term 1() and its group delay function ( = -d1/d() ) that are of most interest. There is a plot of the group delay shown below. Both this function and the phase 1() are independent of the value of the time-bandwidth product. As expected, the group delay is a linear function with a duration T secs, over a frequency sweep of rads. The residual phase term adds only minor perturbations to this characteristic within the frequency range \Delta \Omega\pm\Delta\Omega/2. At frequencies outside this range, 2() deviates rapidly from /4, and so the total phase will deviate seriously from a square law there. Fortunately, the energy content of the chirp spectrum is very small at these frequencies (as is demonstrated in a later section).


Non-linear chirps

When the Frequency-Time characteristic is non-linear, the Fourier integral is difficult to evaluate. In such cases, it is possible to resort to an approximation method such as the
stationary phase approximation In mathematics, the stationary phase approximation is a basic principle of asymptotic analysis, applying to the limit as k \to \infty . This method originates from the 19th century, and is due to George Gabriel Stokes and Lord Kelvin. It is close ...
, or to use numerical methods.


Via stationary phase method

Often (as in radar applications) a(t) is a slowly varying function of time and the phase (t) is oscillatory and varies rapidly, over the range of integration. With such waveforms, the stationary phase approximation can be used to investigate the spectrum.Fowle E.N., "The design of FM pulse compression signals", IEEE Trans. IT-10, 1964, (pp.61-67)Key E.L., Fowle E.N., Haggarty R.D.., "A Method of Designing Signals of Large Time-Bandwidth Product", Proc. IRE Int. Con. Rec. Pt.4, March 1961 (pp.146-154) The method relies on the fact that the major contributions to the Fourier integral come from the region where the rate of change of phase is minimal, i.e. when \frac \omega_0-\omega)t + \theta(t)0\qquad or\qquad (\omega - \omega_0) -\theta'(t)=0 Unless (t) is a constant, the point in time ts at which the phase is stationary will vary according to the instantaneous frequency .
Expressing the difference between (-).t and (t) as a
Taylor series In mathematics, the Taylor series or Taylor expansion of a function is an infinite sum of terms that are expressed in terms of the function's derivatives at a single point. For most common functions, the function and the sum of its Taylor se ...
about the time ts, but discarding all but the first three terms (of which the second term is zero, here), the Fourier integral can be written, approximately, as S(\omega)\approxeq a(t_s)\int_^ \exp \left -j \left \ \right \cdot dt In this equation ts represents a constant time point, so terms depending on ts alone may be taken outside the integral. The expression simplifies to
S(\omega)\approxeq \sqrt \cdot \frac \cdot \exp \left \left \ \right /math>
so
, S(\omega_t), ^2 \approxeq 2\pi \cdot \frac where is used to indicate the dependence of the frequency variable on t.
This is a very useful expression linking, as it does, the spectrum profile to the amplitude and phase characteristics of the chirp. To carry out the inverse process, i.e. to find the time domain function s(t) given frequency domain data, the inverse Fourier transform is derived. s(t)=\frac\int_^, S(\omega), \cdot \exp (\Phi(\omega)+\omega \cdot t)\cdot d\omega where (x) is the phase function of the spectrum. The stationary phase points for this integrand are located at \Phi'(\omega)=-t and the corollary relationship, equivalent to that derived for the spectrum, can be obtained by the stationary phase method, and is a^2(t_\omega)\approxeq \frac \cdot \frac In effect, stationary phase analysis gives the following (approximate) Fourier pair relationships:
a(t) \cdot \exp \theta(t)\approxeq \frac \cdot \int_^S(\omega), \cdot \exp \\cdot d\omega
and
, S(\omega), \cdot \exp \Phi(\omega)\approxeq \int_^a(t) \cdot \exp j\t Consequently, approximate expressions for a(t) and (t) can be obtained when the spectrum, including its phase function () is given and, similarly, approximate expressions for , S(, and () can be obtained when the signal characteristics are given. Several examples of the procedure are given in the literature Although the relationships are only approximate, their accuracy improves as the time-bandwidth product increases. In cases where the signal envelope and spectrum modulus are defined by smoothly varying
Gaussian function In mathematics, a Gaussian function, often simply referred to as a Gaussian, is a function of the base form f(x) = \exp (-x^2) and with parametric extension f(x) = a \exp\left( -\frac \right) for arbitrary real constants , and non-zero . It i ...
then a T.F product as low as 15 will give acceptable results, but if both a(t) and , S(), are defined by rectangular functions, then the product T.F needs to be much greater, typically over 100. ;Examples Typically, in the radar case, a(t) is a constant over the duration of the signal and, for convenience, is assumed here to be unity. So the phase and amplitude characteristics, in the frequency domain, are related by \Phi''(\omega)=\pm \frac \cdot , S(\omega), ^2 There are two solutions for (), which are complex conjugates of each other. The two filters with these characteristics can be used as the transmitter and receiver filters of a radar system and are interchangeable.
The
group delay In signal processing, group delay and phase delay are delay times experienced by a signal's various frequency components when the signal passes through a system that is linear time-invariant (LTI), such as a microphone, coaxial cable, amplifier, ...
characteristic D(), (where D()=-d/d), is D(\omega)=-\Phi'(\omega)=-\int_^\Phi''(\omega) \cdot d\omega + K
so
D(\omega)=\pm \frac \cdot \int_^, S(\omega), ^2 \cdot d\omega+K So in the case of a rectangular time envelope, the dispersive delay characteristic is given by the integral of the square of the envelope. If the positive sign is taken, then the group delay increases with increasing frequency and vice versa. The result is only approximate, but is more accurate for large values of the time bandwidth product.
Consider, as an example, the case of a spectrum that is uniform over the range -/2 to /2, then , S(\omega), ^2=A \qquad for \qquad , \omega, < \frac
so
D(\omega)=\frac \cdot \int A \cdot d\omega+K = \frac \cdot \omega + K Put D(-/2) = 0 and D(/2) = T, where T is the pulse duration, then K = T/2 and A = (2πT)/ωmax
so, finally
D(\omega)= T \cdot \left \frac +\frac \right /math> As expected, a flat topped frequency spectrum corresponds to a linear frequency sweep. The linear chirp is just one special case which, in any case, can be calculated more precisely by the methods of the earlier section. The particular usefulness of the stationary phase method lies in its ability to provide results when the frequency sweep is non linear. In such cases the spectral response can be shaped to meet some desired design criteria, for example, low side-lobes when a chirp is compressed. One such family of spectral functions that has been studied is given by , S(\omega), ^2 = A_n \cdot cos^n \left (\frac \right ) \qquad where \qquad , \omega, < \frac \qquad and\ n\ is\ an\ integer It is possible to find the group delay characteristics of these functions in a similar manner to that carried out above and the results for n = 1 to 4 have been calculated.
Although these cosine functions are amenable to mathematical manipulation, they are rarely chosen to define the spectral characteristics of a chirp, in practice, because when compressed they give broad main pulses with high side-lobe levels. A better characteristic (among many)Harris F.J., "On the Use of Windows for Harmonic Analysis with the Discrete Fourier Transform", Proc. IEEE Vol.66, Jan 1978 is the Hamming function, given by , S(\omega), ^2 = A \cdot \left 0.54+0.46 \cdot cos \left ( \frac \right ) \right = A \cdot \left 0.08 + 0.92 \cdot cos^2 \left ( \frac \right ) \right /math> A plot of this characteristic is shown, plotted over the range -/2 to /2. Applying the equations given above, the group delay characteristic which achieves this spectral shape can be obtained. It is D_H(\omega)= T \cdot \left \frac + \frac + \frac \cdot sin \left ( \frac \right ) \right Now because the principle of stationary phase shows that there is a direct relationship between elapsed time and the instantaneous signal delay then, for the Hamming window, t/T can be related to / by \frac= \frac + \frac + \frac \cdot sin \left ( \frac \right ) This characteristic which is time as a function of frequency is shown here. Inverting the plot gives the more usual (and more useful) plot of frequency as a function of time, which is also shown.
Other spectral shapes can be investigated in the same way and the results, although approximate, are surprisingly accurate, especially when the time bandwidth product of the pulse is high. The stationary phase method does not predict or deal with Fresnell ripples, so it is unable to offer any means by which these ripples can be minimized. As an example, the figure below shows a chirp spectrum with T.F =250 obtained for a non-linear chirp aiming to match the Hamming window, using the methods described above. The figure shows that the spectral profile matches the Hamming characteristic quite well, but Fresnell ripples, not predicted by the method, are very much in evidence.


Via numerical methods


Sampling

Whenever a Fourier integral cannot be evaluated by analytical means, an approximate solution is usually possible by
numerical analysis Numerical analysis is the study of algorithms that use numerical approximation (as opposed to symbolic manipulations) for the problems of mathematical analysis (as distinguished from discrete mathematics). It is the study of numerical methods th ...
. Such a procedure requires the function to be sampled, usually at equi-spaced intervals in time.
One consequence of sampling is that the resultant spectrum is periodic in the frequency domain. In addition to the (desired) baseband spectrum, additional versions of the spectrum occur, centered on multiples of the sampling frequency. To ensure that there is no overlapping of frequency data (i.e. no
aliasing In signal processing and related disciplines, aliasing is an effect that causes different signals to become indistinguishable (or ''aliases'' of one another) when sampled. It also often refers to the distortion or artifact that results when ...
) the
Nyquist Nyquist may refer to: *Nyquist (surname) *Nyquist (horse), winner of the 2016 Kentucky Derby *Nyquist (programming language), computer programming language for sound synthesis and music composition See also *Johnson–Nyquist noise, thermal noise ...
sampling theorem must be satisfied. In practice, a sampling rate substantially higher than that dictated by the sampling theorem is advisableBurrus C.S. and Parks T.W., "DFT/FFT and Convolution Algorithms", Wiley & Sons, Interscience 1985.


Spectrum of a sampled Signal - the Fourier transform of a discrete time signal

A straightforward way to approximate an integral, such as a Fourier integral, is to use the standard '
rectangle rule In mathematics, a Riemann sum is a certain kind of approximation of an integral by a finite sum. It is named after nineteenth century German mathematician Bernhard Riemann. One very common application is approximating the area of functions or l ...
' for numerical integration. The method assumes the signal value taken at a sample instant remains constant for one sampling interval, until the next sample is taken. This procedure is sometimes referred to as a 'box-car generator', or a zero order sample and hold.Tou J.T., "Digital and Sampled-data Control Systems", McGraw-Hill N.Y. 1959Ragazzini J.R. and Franklin G.F., "Sampled-Data Control Systems", McGraw-Hill N.Y. 1958 If the time interval between samples is W, then sn = s(nW), and the desired integral is obtained, approximately, by summing the rectangular areas.
The result so obtained is the convolution of a rectangular pulse with step size W with the impulses located at the sampling instants with weights equal to the sample values. In consequence, the spectrum of interest will have superimposed upon it the frequency response of the sample and hold, and the spectrum of the sampled singnal Ss is given by: Ss(\omega))= W\frac \cdot \left sum_^ s_n \cdot \exp(-jn \omega W) \right /math> The first part of the expression, i.e. the 'sin(x)/x' part, is the frequency response of the sample and hold. Its amplitude decreases with frequency and it falls to 63% of its peak value at half the sampling frequency and it is zero at multiples of that frequency (since fs =1/W).
The second term in the equation is called the Fourier transform of the discrete signal sn.Stearns S.D. and Hush D.R., "Digital signal Analysis", Prentice-Hall, 1990 (p.61) It is a continuous function over all and involves an infinite number of summations. In practice the summation process can be truncated to a finite number of samples, N, possibly because the waveform is periodic or zero outside the range of samples. Furthermore, because the same spectrum is endlessly repeated, it is possible to confine interest to spectral data within the range -/2 to +/2. As an example, an exponential chirp (with its top frequency well below the Nyquist limit) is sampled at 256 points, as shown.
The sampled spectrum, Ss() of this waveform, calculated using the equation given above, is shown. To simplify the plot, only the results at positive frequencies have been displayed. The influence of the frequency spectrum of the zero order hold circuit is clearly seen in the diagram.
The baseband portion of the spectrum is shown in more detail in the next figure and the response shows a distinct slope, being significantly lower at the higher frequencies.

Although the characteristic of the zero order hold has a small influence on this result, the slope is mainly due to the properties of the chirp. The waveform sweeps relatively quickly over the high frequencies and spends more time sweeping the low frequencies, consequently there is less energy content at the high frequencies with more at the lower ones. (A linear chirp, on the other hand, has a nominally flat spectrum because its frequencies are swept at the same rate, as shown in some earlier plots).


Via the discrete Fourier transform

If we limit interest in the output spectrum to a finite number of discrete data points (= N), at frequencies given by
\omega_m= \frac \qquad for \qquad m=0,1,2,...N-1 then the formula for calculating the
discrete Fourier transform In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced Sampling (signal processing), samples of a function (mathematics), function into a same-length sequence of equally-spaced samples of the discre ...
is Ss_m \quad = Ss \left ( j \frac \right ) \quad = \quad \sum_^ s_n \cdot exp(-j \left( \frac \right ) The calculations can be carried out by means of a straightforward computer algorithm, but this is not very efficient in computer usage. Consequently, more efficient algorithms have been developed, especially
Fast Fourier Transforms A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). Fourier analysis converts a signal from its original domain (often time or space) to a representation in t ...
(FFT). Computer programs which implement the FFT are widely available in the literature and in proprietary CAD programs such as
Mathcad Mathcad is computer software for the verification, validation, documentation and re-use of mathematical calculations in engineering and science, notably mechanical, chemical, electrical, and civil engineering. Released in 1986 on DOS, it introduc ...
,
MATLAB MATLAB (an abbreviation of "MATrix LABoratory") is a proprietary multi-paradigm programming language and numeric computing environment developed by MathWorks. MATLAB allows matrix manipulations, plotting of functions and data, implementa ...
, and
Mathematica Wolfram Mathematica is a software system with built-in libraries for several areas of technical computing that allow machine learning, statistics, symbolic computation, data manipulation, network analysis, time series analysis, NLP, optimi ...
.
In the following example a linear chirp with time bandwidth product of 25 is sampled at 128 points (i.e. N = 128). In the figure samples of the real part of the waveform are shown - note that these are samples in the time domain. The FFT process assumes the waveform is cyclic, so these 128 data points can be considered to be part of an endlessly repeating sequence in time.
By calculating the N-point FFT of this data, the discrete spectrum of the sequence is obtained. The magnitude of this spectrum is shown in the attached figure, where these data points are samples in frequency. The data is cyclic so, in the plot, the zero frequency point is at n = 0 and also at n = 128 (i.e. both points are the same frequency). The point n = 64 corresponds to +fs/2 (and also to -fs/2). To display the spectrum in more detail (but not necessarily with more resolution), the time sequence can be extended by zero padding. For example, extending the 128 point time sequence with zeros to give N = 4096 results in that part of the spectrum originally presented in 16 samples, now being presented in 512 samples, as shown.


Spectral spread

There is very little spectral content beyond the sweep frequency range of a chirp pulse and this is especially true for waveforms where the time-bandwidth product is large. The full line on the graph of the adjacent figure shows results for linear chirps. It shows, for example, that only about 2% of the total power resides at frequencies outside the sweep range F when the time-bandwidth is 100, and it is less than 1/2% when T.F is 500.
In the case of a non-linear chirp, or a linear chirp shaped by amplitude weighting, the fraction of power outside F is even lower, as is shown on the graph, where the dashed line is for spectra with Hamming profiles.
This low spectral spread is particularly significant when baseband signals are to be digitized since it permits a sampling frequency to be chosen which is only slightly higher than twice the maximum frequency excursion of the chirp.


Reducing Spectral Ripple

The Fresnel ripples on a chirp spectrum are very obtrusive, especially when time-bandwidth products are low (under 50, say) and their presence leads to high time sidelobe levels when chirps are subject to
pulse compression Pulse compression is a signal processing technique commonly used by radar, sonar and echography to increase the range resolution as well as the signal to noise ratio. This is achieved by modulating the transmitted pulse and then correlating th ...
as in
radar Radar is a detection system that uses radio waves to determine the distance ('' ranging''), angle, and radial velocity of objects relative to the site. It can be used to detect aircraft, ships, spacecraft, guided missiles, motor vehicles, w ...
and
sonar Sonar (sound navigation and ranging or sonic navigation and ranging) is a technique that uses sound propagation (usually underwater, as in submarine navigation) to navigate, measure distances ( ranging), communicate with or detect objects on ...
systems. They arise because of the sudden discontinuities in the chirp waveform at the commencement and termination of the pulse.
Although there are a number of procedures that can be applied to reduce the ripple levels, they are not all equally effective. Furthermore, some of the methods require amplitude shaping, or amplitude modulation, of the chirp pulse and this makes those methods unsuitable when, for example, the chirp pulses are to be transmitted by a power amplifier operating in a near-limiting condition. For such systems only the methods using frequency (or phase) pre-distortion are appropriate.


Introducing Rise and Fall Times of Finite Duration

If the transitions at the start and end of the chirp are made less sudden (or more 'rounded'), then a reduction in ripple amplitude is achieved.Cook C.E. & Paolillo J., "A Pulse Compression Predistortion Function for Efficient Sidelobe Reduction in a High-Power Radar", Proc. IEEE Vol.52, April 1964 (pp.377-384)Kowatsch M. and Stocker H.R., "Effect of Fresnel ripples on sidelobe suppression in low time-bandwidth product linear FM pulse compression", IEE Proc. Vol. 129, Pf. F, No.1 Feb 1982 The durations of the two transition regions need only be a small fraction of the pulse duration, and suggested values are between 2/F and 3/F but, as expected, when the time-bandwidth product of the pulse is small, longer transition periods are needed. The actual profiles of these rise and fall regions of a pulse do not seem to be critical and may be provided, for example, by band limiting filters in analogue implementations and a linear slope in digital ones.
Two examples show the spectra of linear chirps with finite rise-times. The first is for a chirp with time-bandwidth of 250, where the rise and fall times are 4% of the total pulse duration and the second is for a chirp with time-bandwidth of 25, where the rise and fall times are 10% of the total. These two spectra show a marked reduction in ripple amplitude compared to the spectra of unmodified linear chirps shown earlier.


Applying Phase or Frequency Distortion to the Chirp Pulse

A analogous technique can be applied to the frequency characteristic of the chirp waveform by adding linear FM distortion segments (quadratic phase modulation distortion) to the frequency characteristic of the chirp, as shown. The method is effective because amplitude and phase distortions having functional similarity can produce similar effects when the distortion factors are small.
Suggested values for these distortion regions, to give good results are:
\Delta f_p=0.75 \Delta F \qquad and \qquad \delta = 1/\Delta F Later work proposed slightly different values, namely:
\Delta f_p=0.73 \Delta F \qquad and \qquad \delta = 0.86/\Delta F
but the outcome can doubtless be improved by optimizing values for each particular situation.
Two plots show the effects of frequency pre-correction and can be compared to the results in the earlier sections.
The ripple reduction achieved by frequency pre-correction, although significant, is seen to be less successful than that achieved by the amplitude modulation methods of the previous section. However, it has been suggested that by implementing cubic (rather than quadratic) phase pre-correction, comparable results can be achieved.


Deriving a Waveform from a Target Frequency Spectrum

This method uses an inverse Fourier transform in order to derive a waveform which has a spectrum with the phase characteristic of a chosen chirp but a new amplitude profile which is rectangular and ripple free. The method is very effective but, unfortunately, the waveform that is so derived has a semi-infinite time duration. If, for convenience, the newly derived waveform is truncated to a practical length, then some ripple is reintroduced onto the spectrum.
As an example, a linear chirp waveform with a time bandwidth of 25 is shown together with its spectrum magnitude (shown by a full line) which, as demonstrated earlier, has a large ripple component. It is possible to find, by means of an inverse FFT, a chirp waveform which, in the frequency domain, has the same phase characteristic as before, but with the rectangular magnitude characteristic shown by the dashed line on the plot. The chirp waveform resulting from this process has a very long time duration, but when it is truncated to say, a length 2T, then the spectrum acquires some ripple once more, as shown.


Applying Window Functions

There are many applications in which a spectrum with a rectangular magnitude profile is not ideal. For example, when a chirp waveform is compressed by means of its matched filter, then the resultant waveform approximates to the
sinc In mathematics, physics and engineering, the sinc function, denoted by , has two forms, normalized and unnormalized.. In mathematics, the historical unnormalized sinc function is defined for by \operatornamex = \frac. Alternatively, the ...
function and, consequently, has annoyingly high sidelobes. Often, to improve the characteristics of the pulse and lower the sidelobe levels, its spectrum is modified, typically to a bell-shaped profile. Similar problems arise in
digital signal processing Digital signal processing (DSP) is the use of digital processing, such as by computers or more specialized digital signal processors, to perform a wide variety of signal processing operations. The digital signals processed in this manner ar ...
where the spectral shaping is provided by a
window function In signal processing and statistics, a window function (also known as an apodization function or tapering function) is a mathematical function that is zero-valued outside of some chosen interval, normally symmetric around the middle of the in ...
, a process sometimes called
apodization In signal processing, apodization (from Greek language, Greek "removing the foot") is the modification of the shape of a mathematical function. The function may represent an electrical signal, an optical transmission or a mechanical structure. In ...
. In the case of an antenna array, similar profiling by "weighting functions" is used to reduce the spatial sidelobes of the radiation pattern.
Although spectral shaping of a chirp could be applied in the frequency domain, better results are obtained if the shaping is carried out in the time domain.McCue J.J.G., "A Note on the Hamming Weighting of Linear-FM Pulses", Proc. IEEE, Vol. 67, No. 11, Nov 1979, pp.1575-1577.
Examples of this process are shown for linear chirps with time-bandwidth products of 250 and 25. They have been shaped by a 3-term Blackman-Harris window given by
, U(\omega), ^2 = 0.42323-0.49755\cos \left(\frac \right)+0.07922\cos \left(\frac \right)
The spectra, now bell-shaped, are seen to be free of ripples. Non-linear chirps can be devised that have a bell shaped spectrum, such as the Blackman-Harris window just discussed, and consequently will exhibit reduced ripple compared to the linear chirp. By means of the stationary phase method described earlier, an approximate relationship between time and frequency can be obtained and is:
\frac= \frac + \frac+0.1871 \sin \left(\frac \right)+0.014895 \sin \left(\frac{\omega_{max \right)
Rearranging the equation, a plot of frequency against time can be plotted, as shown. As examples, plots of the spectral magnitudes of non-linear chirps with spectral profiles of Blackman-Harris windows and with time-bandwidth products of 250 and 25 are shown below. As can be seen, there is some ripple reduction, but the disappointing performance can be attributed to the fact that these chirps, although they have reduced energy content in their outer frequency regions, they still have amplitude profiles with fast rise and fall times.


See also

*
Pulse compression Pulse compression is a signal processing technique commonly used by radar, sonar and echography to increase the range resolution as well as the signal to noise ratio. This is achieved by modulating the transmitted pulse and then correlating th ...
, a process which uses frequency or phase coded waveforms to improve the signal to noise of received signals. * Chirp compression, a compression process for chirps only.


References

Signal processing