Вернуться к поиску Вернуться к таблице

 Выделить слова:

 
Патент США N 4237461
Cantrell ,   et al. December 2, 1980
High-speed digital pulse compressor

РЕФЕРАТ

A pulse expansion and compression system, especially useful for radar ranging, comprising a pulse coder for expanding an input pulse and a pulse compressor of the matched-filter type. The coder consists of a plurality of delay stages into which the input pulse is fed, a discrete Fourier transform (DFT) circuit to which the output signals of the delay stages are fed, a time-dispersionmeans (TDM) comprising an arrangement of delay stages for differently delaying the output signals from the DFT, and a coherent summer for adding the real and imaginary parts of the signals from the TDM. The summer output is fed to a phase modulator and then to the transmitter. The echo signals are conjugated, time-inverted, and passed through the same DFT as the input pulse signal. The outputs of the DFT are then passed through a TDM of the same type as the first TDM, but this time in coherent summer and an envelope detector to provide a cross-correlated facsimile of the original input pulse.

Автор(ы): Cantrell; Ben H. (Springfield, VA), Lewis; Bernard L. (Oxon Hill, MD)
Заявитель: The United States of America as represented by the Secretary of the Navy (Washington, DC)
Family ID: 21754826
N заявки: 06/012,409
Приоритет: February 15, 1979

Current U.S. Class: 342/194 ; 342/196; 342/201
Класс МПК: G01S 13/00 (20060101); G01S 13/28 (20060101); G01S 013/28 ()
Current CPC Class: G01S 13/288 (20130101)
Field of Search: 343/5FT,17.2PC

Ссылки на источники [Referenced By]
Патентные документы США
3987285 October 1976 Perry
4028700 June 1977 Carey et al.
4156876 May 1979 Debuisser
4167737 September 1979 Freedman

Другие ссылки

"An Introduction to Matched Filters", by George L. Turin, IRE Transactions n Information Theory, vol. IT-6, pp. 311-328, Jun., 1960. .
"On Digital Filtering", by G-AE Concepts Subcommittee, C. M. Rader, Chairman, IEEE Transactions on Audio and Electroacoustics, Sep., 1968, pp. 303-314..

Primary Examiner: Hubler; Malcolm F.
Attorney, Agent or Firm: Sciascia; R. S. Schneider; Philip
ФОРМУЛА ИЗОБРЕТЕНИЯ


What is claimed and desired to be secured by Letters Patent of the United States is:

1. Signal-processing means comprising:

pulse coder means for providing a series of weighted pulses from a single input pulse, the time interval of the series being greater than that of said input pulse,

said coder means including input-signal expansion means (ISEM) into which the input signal is fed, said ISEM comprising at least one delay stage, weighting means comprising a discrete Fourier transform circuit to which the output of the ISEM is fed, and a first time-dispersion means to which the outputs of said weighting means are fed for spreading the series of weighted pulses over a still greater time interval; and

pulse-compression means, of the matched filter type including weighting means which is the same as that employed in said coder means, for receiving and processing echo signals corresponding to the output signals of said time-dispersion means.

2. Signal-processing means as in claim 1, wherein:

said weighting means comprises a discrete Fourier transform circuit providing outputs in accordance with the formula ##EQU2## where n is the sequence number of the clocking pulse; N is the number of delay stages plus one; k is the number of the output signal from the transform circuit.

3. Signal-processing means as in claim 2, wherein said coder means includes:

first coherent summer means, to which the output signals of said first time-dispersion means are fed, for separately summing the real and the imaginary parts of its input signals.

4. Signal-processing means as in claim 2, wherein said matched filter comprises:

means for obtaining the complex conjugate of a signal corresponding to the coded output signal of said coder means, it being permissible for the coded signal and the corresponding signal to differ in phase; signal expansion means being fed to said weighting means;

second time-dispersion means to which the output signals of said weighting means are fed, the configuration of the second time-dispersion means being the same as that of the first time-dispersion means, except that delays are provided for input

5. Signal-dispersion means as in claim 4, further including:

second coherent summer means, to which the output signals of said second time-dispersion means are fed, for separately summing the real and imaginary parts of its input signals.

6. Signal-processing means as in claim 5, further including:

envelope detecting means to which the output signals of said second coherent summer means are fed.
ОПИСАНИЕ ИЗОБРЕТЕНИЯ


BACKGROUND OF THE INVENTION

This invention relates to pulse-compression techniques and especially to a pulse-compression technique utilizing a fast Fourier transform circuit in a matched filter. can be put on the target. The received echo is processed through a matched filter which produces a narrow pulse peak when the received echo matches the propagated signal. Pulse compression provides better range resolution and greater clutter reduction. A disadvantage of conventional matched filters is that they require a large amount of electronic hardware before significant results can be obtained and ways of reducing the amount of hardware have been sought. This invention provides for reduction of the amount of hardware used in conventional pulse expansion-compression systems.

SUMMARY OF THE INVENTION

The advantages of the invention are obtained by utilizing a discrete Fourier transform circuit for the weighting means of the conventional matched-filter circuit used in pulse-compression systems and passing the signal to be coded and the return signal through the same discrete Fourier transform circuit for weighting purposes.

BRIEF DESCRIPTION OF THE DRAWING

FIG. 1 is a block diagram of an embodiment of the invention.

FIG. 2 is an illustration of the waveforms of the input signals to the transmitted-signal coherent summer 50 and of its output signal.

FIG. 3 is an illustration of the real and imaginary parts of the input to the matched-signal coherent summer 34 on line s(3).

FIG. 4 is an illustration of the input to the matched-signal coherent summer on line s(2).

FIG. 5 is an illustration of the input to the matched-signal coherent summer on line s(1).

FIG. 6 is an illustration of the input to the matched-signal coherent summer on line s(0).

FIG. 7 is an illustration of the output of the envelope detector 36.

FIG. 8 is a block diagram of a conventional, simple, pulse code generator.

FIG. 9 is a block diagram of a conventional, simple matched filter.

FIG. 10 is a block diagram of a simplified coder in accordance with the present invention.

FIG. 11 is a block diagram of a simplified matched filter in accordance with the present invention.

DETAILED DESCRIPTION OF THE INVENTION

An embodiment of the invention is shown in FIG. 1, as it might be used as part of a pulse-compression radar. The components of the invention are shown enclosed in the dashed lines. The input signal is a pulse produced by a pulse generator 12, for example. The pulse is clocked into an input-signal expansion means (ISEM) 13 providing three equal intervals of delay. The ISEM may comprise three stages 14, 16, 18 of a shift register or a delay line tapped at equal delay intervals, for example. Outputs are taken from the input to the first delay stage, the output of the first delay stage, the output of the second delay stage, and the output of the third delay stage, viz, x(0), x(1), x(2), x(3), respectively. Time zero (0) corresponds to the interval of the first clocking pulse when the pulse to be coded is clocked out of the pulse generator 12 and put on the input line to the first delay stage 14; time (1) corresponds to the interval of the second clocking pulse which permits the pulse at the input of the first delay stage 14 to pass through the stage and appear at its output with the proper delay; and so on. The clocking circuit is shown in simplified form in block 66. The ISEM 13 essentially provides for time expansion of the input pulse. It provides four input signals to the DFT, viz, 1000, 0100, 0010 and 0001, in a time which is four times as long as that of the input pulse. (Presence of a pulse is denoted by a 1, absence of a pulse by a 0.)

The signals x(0), x(1), x(2) and x(3) are fed into a weighting means 20 which weights the signals in accordance with the formula ##EQU1## The particular type of weighting means used in this invention is a fast Fourier transform (FFT) circuit which forms discrete Fourier transform (DFT) signals equivalent to the formula given above. The weighting means 20 provides four output signals, s(0), s(1), s(2) and s(3). In the formula, n is the sequence number of the clocking signal; N is the number of delay stages plus one, since a pulse is being taken off just prior to the first delay stage; k is the number of the output signal being taken from the weighting means 20. In the example, shown n=0, . . . 3, k=0, . . . 3, N=4, although many more delay stages and outputs from the weighting means could be used, as well as fewer. In fact, as little as one delay stage could be used. A detailed discussion of the discrete Fourier transform can be read in "Digital Signal Processing," Oppenheim and Schafer, published in 1975 by Prentice-Hall, Inc., Englewood Cliffs, N.J. Various ways of implementing the weighting means are shown; in particular, see chap. 6, FIG. 6.10.

The output signals from the DFT 20 are individually fed to Fourier signal time-dispersion means 37 (FS TDM). This comprises a plurality of delay stages 38-48, each of which supplies a delay equal to four clock intervals. Thus, signal s(0) has no delay, signal 2(1) has a delay of four intervals, signal s(2) a delay of 8 intervals, and s(3) a delay of 12 intervals. The particular arrangement of the delays and the number of the delays is not fixed by any rule but is a matter of choice by the designer, the more delays inserted, the more the outgoing signal is time-expanded. As a matter of fact, the device would operate with no delays at all in the s(0), s(1), s(2) and s(3) lines but this would be undesirable since the object is to time-stretch the outgoing signal so that the increased detection capability of a long-pulse radar system can be achieved.

The outputs of the FSTDM 37 are a series of complex signals which are fed to a coherent summer 50. The summer separately adds the real parts and the imaginary parts of its input signals so that a single signal with a real and an imaginary part is formed for each clocking interval. These signals are fed to a phase modulator 52 which phase-modulates the carrier signal of the transmitter, and the modulated carrier is propagated into space by the antenna.

The return signals are received, processed by the receiver 60, and fed to a sampler-and-A/D converter 62 which returns them to sample digital form. which the original input pulse passed through the ISEM 13. The delayed outputs are again fed to the weighting means 20 whose output signals are now fed to a second Fourier signal time-dispersion means (FSTDM) 21 which is arranged to provide delays for

The outputs of the FSTDM 21 are summed in a coherent summer 34 to separately add the real and the imaginary parts of its input signals for each clock period, the output signal of the summer being a cross-correlated signal which is then detected by an envelope detector 36.

The output of the coherent summer 34 is the impulse response of a matched filter which comprises complex conjugator 64, input-signal expansion means 13, weighting means 20, time-dispersion means 21 and coherent summer 34. A matched filter provides an impulse response which is the complex-conjugate, time-inverted, equivalent of the input pulse. The conjugator 64 provides the complex conjugation of the echo signals and the expansion means 13 and time-dispersion means 21 provide the time inversion of the echo signal. The matched filter also effects convolution of the received signals with the input signal. The replica of the input signal in this device is actually a product of the operation of the Fourier transform network 20.

The operation of the present invention may be explained as follows:

______________________________________ The x outputs from the ISEM (13) are x(0) x(1) x(2) x(3) ______________________________________ 1st clock pulse: 1 0 0 0 2nd clock pulse: 0 1 0 0 3rd clock pulse: 0 0 1 0 4th clock pulse: 0 0 0 1 5th, etc. clock pulse: 0 0 0 0 ______________________________________

To find the outputs of the DFT circuit for each clock pulse (CP) period, proceed as follows:

______________________________________ CP 1 .fwdarw. x(0) = 1, x(1) = 0, x(2) = 0, x(3) = 0 n = 0 . . . 3 s(0) = .SIGMA.[x(0)e.sup.-j2.pi.(0)(0)/4 + x(1)e.sup.-j2.pi.(1)(0 )/4 k = 0 + x(2)e.sup.-j2.pi.(2)0/4 + x(3)e.sup.-j2.pi.(3)0/4 ] = .SIGMA.[1(1) + 0(1) + 0(1) + 0(1)] = 1 n = 0 . . . 3 s(1) = .SIGMA.[x(0)e.sup.-j2.pi.(2)1/4 + x(1)e.sup.-j2.pi.(1)(1)/ 4 k = 1 + x(2)e.sup.-j2.pi.(2)(1)/4 + x(3)e.sup.-j2.pi.(3)1/4 ] = .SIGMA.[1(1) + 0(-1) + 0(-1) + 0(-j)] = 1 n = 0 . . . 3 s(2) = .SIGMA.[x(0)e.sup.-j2.pi.(0)2/4 + x(1)e.sup.-j2.pi.(1)2/4 . k = 2 + x(2)e.sup.-j2.pi.(2)2/4 + x(3)e.sup.-j2.pi.(3)2/4 ] = .SIGMA.[1(1) + 0(-1) + 0(1) + 0(-1)] = 1 n = 0 . . . 3 s(3) = .SIGMA.[x(0)e.sup.-j2.pi.(0)3/4 + x(1)e.sup.-j2.pi.(1)3/4 k = 3 + x(2)e.sup.-j2.pi.(2)3/4 + x(3)e.sup.-j2.pi.(3)3/4 ] = .SIGMA.[1(1) + 0(-1) + 0(-1) + 0(-1)] = 1 CP 2 .fwdarw. x(0) = 0, x(1) = 1, x(2) = 0, x(3) = 0 n = 0 . . . 3 s(0) = .SIGMA.[x(0)e.sup.-j2.pi.(0)0/4 + x(1)e.sup.-j2.pi.(1)0/4 k = 0 + x(2)e.sup.-j2.pi.(2)0/4 + x(3)e.sup.-j2.pi.(3)0/4 ] = .SIGMA.[0(1) + 1(1) + 0(1) + 0(1)] = 1 n = 0 . . . 3 s(1) = .SIGMA.[x(0)e.sup.-j2.pi.(0)1/4 + x(1)e.sup.-j2.pi.(1)(1) /4 k = 1 + x(2)e.sup.-j2.pi.(2)1/4 + x(3)e.sup.-j2.pi.(3)1/4 ] = .SIGMA.[0(1) + 1(-j) + 0(-1) + 0(j)] = -j n = 0 . . . 3 s(2) = .SIGMA.[x(0)e.sup.-j2.pi. (0)2/4 + x(1)e.sup.-j2(1)2/4 k = 2 + x(2)e.sup.-j2.pi.(2)2/4 + x(3)e.sup.-j2.pi.(3)2/4 ] = .SIGMA.[0(1) + 1(-1) + 0(1) + 0(-1)] = -1 n = 0 . . . 3 s(3) = .SIGMA.[x(0)e.sup.-j2.pi.(0)3/4 + x(1)e.sup.-j2.pi.(1)3/4 k = 3 + x(2)e.sup.-j2.pi.(2)3/4 + x(3)e.sup.-j2.pi.(3)3/4 ] = .SIGMA.[0(1) + 1(+j) + 0(-1) + 0(-1)] = +j ______________________________________

The same calculations can be made for clock pulses 3 and 4. A tabulation of the (s) outputs is provided below:

______________________________________ CP 1 CP 2 CP 3 CP 4 ______________________________________ s(0) 1 1 1 1 s(1) 1 -j -1 +j s(2) 1 -1 1 -1 s(3) 1 +j -1 -j ______________________________________

These outputs are fed to the output-, or transmitted-, signal coherent summer 50 through the FSTDM delays. For the first four clock pulses, the only inputs to the summer are the signals on the s(0) line; for the next four clock pulses, the signals on the s(1) line; for the next four, the signals on the s(2) line; and for the next four, the signals on the s(3) line. These are shown graphically in FIG. 2. For example, the figure shows the real [s.sub.R (1)] and the imaginary [s.sub.I (1)] parts of the signal on the s(1) line. The last two lines labelled R and I are the real and imaginary parts of the output from the coherent summer 50. This signal modulates the phase of the transmitter carrier wave. Note that the output signal extends over 16 clock pulse periods. The signal fed to the phase modulator 52 is (l) (l) (l) (l) (l) (-j) (-l) (+j) (l) (-l) (l) (-l) (l) (+j) (-l) (-j).

The phase-modulated carrier is propagated through space and, if the signal strikes a target, an echo signal is returned. This echo signal is processed through the receiver 60 and sent through a sampler-and-A/D converter circuit 62 which converts the phase-modulated carrier into a digitized signal again. The complex conjugate of the digitized signal is taken and fed to the ISEM 13. The output of the complex conjugator is: (l) (l) (l) (l) (l) (j) (-l) (-j) (l) (-l) (l) (-l) (l) (-j) (-l) (j). twelve units of delay in s(0). No matter how many units of delay are used in whatever arrangement in the first FSTDM 37, it is essential for a matched filter that the arrangement be the same for the second FSTDM 21 except that it must be time-inverted.

The inputs to the matched-signal coherent summer 34 are shown in FIGS. 3-6, FIG. 3 being the signal on line s(3), FIG. 4 the output of delay 32, FIG. 5 the output of delay 30, and FIG. 6 the output of delay 26. These figures show the real (R) and imaginary (I) parts of the signals and the assumption has been made herein that the echo signals have not been phase-shifted upon reflection from the target. The output of the coherent summer has a peak pulse in the sixteenth clock pulse interval, which can be seen in FIG. 7, the output of the envelope detector 36.

It will be observed that this output signal is typically the type of signal which results from convolution, a process which occurs as a result of passing the echo signal through the matched filter of the invention. To show this, let us consider what happens in a simple conventional code generator and cross-correlation receiver. FIG. 8 shows a simple code generator wherein an input pulse is clocked through three delay stages 14, 16, and 18 as in the present invention. The weighting circuit consists of four weights W.sub.11, W.sub.12, W.sub.21 and W.sub.22 which weight the pulses, the real and imaginary parts of the weighted signals being separately added in the coherent summer 50 to provide four output signals which correspond to the weights W.sub.11, W.sub.12, W.sub.21 and W.sub.22. weights, i.e., W.sub.11 *, W.sub.12 *, W.sub.21 *, and W.sub.22 *. The outputs on successive pulse samples are given below:

______________________________________ CP 1 W.sub.11 W.sub.22 * CP 2 W.sub.11 W.sub.21 * + W.sub.12 W.sub.22 * CP 3 W.sub.11 W.sub.12 * + W.sub.12 W.sub.21 * + W.sub.21 W.sub.22 * CP 4 W.sub.11 W.sub.11 * + W.sub.12 W.sub.12 * + W.sub.21 W.sub.21 * + W.sub.22 W.sub.22 * (matched output) CP 5 W.sub.12 W.sub.11 * + W.sub.21 W.sub.12 * + W.sub.22 W.sub.21 * CP 6 W.sub.21 W.sub.11 * + W.sub.22 W.sub.12 * CP 7 W.sub.22 W.sub.11 * CP 8 0 ______________________________________

The output on the fourth clock pulse is the matched output.

Now consider a simple coder and matched filter in accordance with the present invention, as shown in FIGS. 10 and 11. The weighting means provides weights W.sub.11, W.sub.12, W.sub.21 and W.sub.22, as in the conventional coder, and is designed to provide the following outputs:

s(0)=x(0)W.sub.11 +x(1)W.sub.12 and

s(1)=x(0)W.sub.21 +x(1)W.sub.22

The following shows the values of the various signals on four clock pulses:

______________________________________ CP 1: x(0) = 1 s(0) = W.sub.11 y(0) = W.sub.11 output W.sub.11 x(1) = 0 s(1) = W.sub.21 y(1) = 0 CP 2: x(0) = 0 s(0) = W.sub.12 y(0) = W.sub.12 output W.sub.12 x(1) = 1 s(1) = W.sub.22 y(1) =0 CP 3: x(0) = 0 s(0) = 0 y(0) =0 output W.sub.21 x(1) = 0 s(1) = 0 y(1) = W.sub.21 CP 4: x(0) = 0 s(0) = 0 y(0) = 0 output W.sub.22 x(1) = 0 s(1) = 0 y(1) = W.sub.22 ______________________________________

The s values are obtained by substituting the x values in the equations for s. The y values are obtained by taking into account the two delay units inserted by delay circuit 20.

If the outputs are then fed through a conjugator 64, they become W.sub.11 *, W.sub.12 *, W.sub.21 * and W.sub.22 *. The matched filter is shown in FIG. 11. The same delay means 14 and weighting means 20 are used but the conjugated signals are time-inverted through the delay means 14. The s equations of the weighting means are the same as before (see FIG. 10). The signals for the various clock pulses are given below:

__________________________________________________________________________ CP 1: x(0) = 0 s(0) = W.sub.11 * W.sub.12 y(0) = 0 x(1) = W.sub.11 * s(1) = W.sub.11 * W.sub.22 y(1) = W.sub.11 * W.sub.22 = sum CP 2: x(0) = W.sub.11 * s(0) = W.sub.11 W.sub.11 * + W.sub.12 W.sub.12 * y(0) = 0 x(1) = W.sub.12 * s(1) = W.sub.11 *W.sub.21 + W.sub.12 *W.sub.22 y(1) = W.sub.11 *W.sub.21 + W.sub.12 *W.sub.22 = sum CP 3: x(0) = W.sub.12 * s(0) = W.sub.12 *W.sub.11 + W.sub.21 *W.sub.12 y(0) = W.sub.11 *W.sub.12 x(1) = W.sub.21 * s(1) = W.sub.12 *W.sub.21 + W.sub.21 *W.sub.22 y(1) = W.sub.12 *W.sub.21 + W.sub.21 *W.sub.22 Sum = W.sub.11 *W.sub.12 + W.sub.12 *W.sub.21 + W.sub.21 *W.sub.22 CP 4: x(0) = W.sub.21 * s(0) = W.sub.21 *W.sub.11 + W.sub.22 *W.sub.12 y(0) = W.sub.11 W.sub.11 * + W.sub.12 W.sub.12 * x(1) = W.sub.22 * s(1) = W.sub.21 * W.sub.21 + W.sub.22 *W.sub.22 y(1) = W.sub.21 * W.sub.21 + W.sub.22 *W.sub.22 Sum = W.sub.11 W.sub.11 * + W.sub.12 W.sub.12 * + W.sub.21 *W.sub.21 + W.sub.22 *W.sub.22 (matched output) CP 5: x(0) = W.sub.22 * s(0) = W.sub.22 *W.sub.11 y(0) = W.sub.12 *W.sub.11 + W.sub.21 *W.sub.12 x(1) = 0 s(1) = W.sub.22 *W.sub.21 y(1) = W.sub.22 *W.sub.21 Sum = W.sub.12 *W.sub.11 + W.sub.21 *W.sub.12 + W.sub.22 *W.sub.21 CP 6: x(0) = 0 s(0) = 0 y(0) = W.sub.21 *W.sub.11 + W.sub.22 *W.sub.12 = Sum x(1) = 0 s(1) = 0 y(1) = 0 CP 7: x(0) = 0 s(0) = 0 y(0) = W.sub.22 *W.sub.11 = Sum x(1) = 0 s(1) = 0 y(1) = 0 CP 8: x(0) = 0 s(0) = 0 y(0) = 0 x(1) = 0 s(1) = 0 y(1) = 0 __________________________________________________________________________

Note that the output from the coherent summer in the present invention on the fourth clock pulse is the same as the output from the conventional coder and matched filter, showing the equivalence of the conjugator, weighting means and time-inverted delay means to a matched filter.

The advantage of the present invention over conventional matched filters is the large reduction of hardware that can be obtained for the same degree of performance. Thirty-two delay stages in the ISEM replace 1024 delay stages that would have to be used in a conventional matched filter to give the same results and a single DFT replaces many separate weighting circuits.

It should also be apparent that in the DFT circuit, the factor e.sup.-j2.pi.mk/N could actually be any weight, or factor, indexed with respect to n and k.

Obviously many modifications and variations of the present invention are possible in light of the above teachings. It is therefore to be understood that within the scope of the appended claims the invention may be practiced otherwise than as specifically described.

* * * * *