DOI : 10.17577/IJERTCONV2IS14007
- Open Access
- Total Downloads : 15
- Authors : Jeevitha T
- Paper ID : IJERTCONV2IS14007
- Volume & Issue : CSECONF – 2014 (Volume 2 – Issue 14)
- Published (First Online): 30-07-2018
- ISSN (Online) : 2278-0181
- Publisher Name : IJERT
- License:
This work is licensed under a Creative Commons Attribution 4.0 International License
Evaluation of Polyphase Filter Architecture for pulse detection and measurement
Jeevitha T
Digital electronics and communication,Dayananda Sagar College of engineering, Bangalore.
Abstract: This paper addresses the design of polyphase filter architecture for pulse detection and measurement as applied to the current EW(Electronic Warfare) systems. The filter is designed for a rectangular input of length 256.The comparison is made based on the simulation results.
-
INTRODUCTION:
An EW system is used to protect military resources from enemy threats. The field of EW is recognized as having three components. They are:
-
Electronic Support Measure: collects the information on the electronic environment.
-
Electronic Countermeasures: jams or disturbs the enemy systems.
-
Electronic Counter countermeasures: protects the equipment against ECM.
Wideband and narrowband digital receivers are the two important types of systems used in EW and communications. However Wideband receivers have a very wide instantaneous input bandwidth of about 1GHz or larger. Another difference between the two is that wideband intercept receivers operate in an environment where the information of the input signal is unknown. Another major difference between the two is EW receivers output pulse descriptor words(PDWs), which describe the characteristics of the detected signal.
The basic block diagram of the digital wideband EW receiver is as shown figure:
Spectrum Estimator
ADC
RF
converter
IF freq Digitized data
The antenna at the left captures pulsed RF signals that are generated by most radars. RF ranges from 2GHz- 100GHz, but for radar , the most popular frequency range is from 2GHz-18GHz. Next an RF converter down converts the frequency signal into a lower intermediate frequency(IF) signal so that the EW receiver can more easily process the same bandwidth signal at a lower frequency. The signal then proliferates into the spectrum estimator. Spectrum estimation is commonly done using Fast Fourier Transform. The digital representation of the frequency spectrum is then output to the parameter encoder which generates PDWs.
The performance of an EW receiver mainly depends upon its update rate or its time resolution. Improved time resolution results in quicker and accurate TOA and pulse width measurements. For a digital EW receiver , the spectrum estimator is the limiting factor for the update rate.
The proposed method in this research for increasing time resolution is to use decimation in frequency domain. By decimating in the frequency domain, the computational load on the spectrum estimator is greatly reduced. This decimation in the frequency domain is implemented through channelized filtering structure.
Polyphase filtering is a multirate signal processing operation leads to an efficient filtering structure for hardware implementation. Polyphase filtering parallelizes the filtering operation there by reducing the computational load on the spectrum estimator.
Digital processor
Digitized words
Para encoder
Digitized data
The paper is organized as follows, first a brief introduction on the topic is given. Next the design procedure is discussed, followed by the algorithm and then based on the simulation results conclusions are drawn.
figure1 :digital wideband EW receiver
-
-
DESIGN PROCEDURE:
The basic block diagram of the Polyphase FFT filter architecture is as shown in the figure:
255
8 = .
=0
28
256
x(n)
z-1
x1(n)
M
H1(z)
H2(z)
M
M point FFT
x2(n)
Y1(m)
Y2(m)
255
16 = .
=0
216 256
z-1
=0
248 = 255 .
2 248 256
(2)
z-1
M
xM-1(n)
YM-1(m)
Let us arbitrarily choose a frequency component k=16 and rewrite it by decomposing it into its polyphase components. The result is:
2 16 2 2
=0
=0
16 = 255 . 256 = 255 . 32
HM-1(z)
figure 2 : polyphase FFT architecture
= [x(0) +x(32) +x(64) +..+x(224)]
2 2
The incoming N data samples are distributed into M branches and an M point FFT is performed. The number of points M is selected based on the time resolution
+[x(1)+x(33)+x(65)+..+x(225)].
[x(2)+x(34)+x(66) ++x(226)].32 +
2 22
32 +
required. The decimation results in gaps in the frequency domain. Hence each FFT filter must be widened to cover the gaps in the frequency domain. This is done by applying time domain window to the incoming data.
-
Algorithm: Decimation in Frequency domain through polyphase filtering:
The frequency domain decimation operation is best viewed visually in the context of a filter bank. A filter bank is simply the filter response of each sub band in the
.
2 231
+[x(31)+x(63)+x(95) ++x(225)]. 32 (3)
In the above equation the relation 2 = 1 where n is an integer. Now let us define a new quantity y(n) as:
y(n) = x(n)+x(n+32)+x(n+64)+ + x(n+224)
spectrum overlapped on each other. Let us assume that one frequency component from the FFT output is equivalent to
7
=
=0
+ 32 .
(4)
one filter output at a specific point in time from a filter bank. Let us assume that the 256 point FFT is decimated by a factor of 8.
A 256 point FFT can be written as:
where n=0 to 31. This y(n) represents the values in the bracket of the above equation. Each y(n) contains a total of 8 data points.
Using these y(n) values , the FFT results from (3 )can be rewritten as :
=0
= 1 .
2
(1) 31
where N=256.There are 256 outputs in the frequency domain. If every 8th output is kept and the other outputs are discarded , the resulting outputs are k=0,8,16,,248. There are a total of 32(256/8) outputs. These outputs can be written as:
=0
0 = 255 ()
0 = ()
=0
31
2
8 = . 32
=0
32
16 = .
=0
2 31
=0
248 = 31 . 32
22
32
(5)
The window function that is used here is a Parks McClellan window function.
The input data x(n) will be modified by the window function h(n).Here, h(n) instead of w(n) is used for the window function because h(n) will be used to represent the impulse function of the filter. The resulting data xm(n)
used as the input of the FFT can be written as:
All these equations can be written into one equation as:
2
xm(n) = x(n).h(n) (10)
=0
8 = 31
. 32
(6)
where n= 0,1,2,., 255.As stated previously the outputs are
where k=0,1,2,..,31 and n=0,1,2,..,31.
=0
=0
The output X(8k) can be relabeled as Y(k), thus the above
decimated by 8. Under this condition the modified data can be used in (4) to find the y(n) as:
equation can be written as:
= 7
+ 32 = 7
+ 32 . +
32 (11)
=0
= 31
.
2 32
(7)
where n= 0,1,2,..,31. A 32 point FFT is performed on
This equation represents a 32 point FFT. In order to obtain the ouputs of a 256 point FFT decimated by 8, a 32 point FFT can achieve the goal. Thus the design of the FFT can be simplified. The input must be manipulated, however in order to obtain the desired result.
A general statement without further proof will be presented here. If one wants to perform an N point FFT and the outputs in the frequency domain are decimated by M, one can achieve the goal by performing an N/M point FFT. A new input format y(n) must be built first. The generalization of the y(n) can be written as:
these y(n) values , and the individual filter response as well as the filter bank is plotted to observe the improved filter shape.
-
SIMULATION RESULTS:
The simulations are done by means of Matlab. A rectangular window was used as the input.As stated earlier the sample size was considered to be N= 256 and the decimation factor as M= 8. The sampling frequency was assumed to be 1350MHz.The filter designed to widen each filter output was generated using FDATOOL Matlab for the following parameters:
=0
= 1 + / .
(8)
Fs= 1350MHz;
Fp= Fs*(M/N) = 42.1875 MHz;
where n=0,1,2,. (N/M)-1.The outputs in the frequency domain can be obtained as:
Fs= 2*Fp =84.375MHz;
wp= 1/(N/M/2) = 1/64;
1
=0
=
.
2
/
(9)
ws = 2*wp =1/32;
density factor =20;
Hence the design of the FFT can be simplified tremendously.
If the filter response is plotted for the (7), the resulting filter response will have very low side lobe level.The resulting filter bank has many gaps in the frequency domain.As a result each filter response must be widened.This is accomplished by applying a window function to the incoming data.
N=256;
-
For the FFT of a rectangular window described by the equation 1, the individual filter response and the filter bank with overlapping and non- overlapping are as shown below respectively:
figure 3: 256 FFT individual filter response
figure 4: 256 pt FFT overlapped filter bank
figure 5 : 256 pt, FFT non-overlapping filter bank.
It can be seen that the sidelobe levels are very high also the transition band is not sharp. As a result this type of a response is undesirable.
-
After applying the decimation in frequency domain algorithm to the same input and performing a 32 point FFT on the output values and plotting the individual filter response and its filter bank respectively:
figure 6: 32 pt decimated FFT individual filter response.
figure 7: 32 pt. decimated FFT filter bank
The filter bank as seen in the figure has many gaps resulting from the decimation operation. If an input signal frequency falls within one of the gaps, the receiver will not detect the signal. As a result this filter shape is not acceptable, each filter must be widened. This is accomplished by applying a window function to the incoming signal.
-
In order to widen each filter while suppressing the side lobes , a windowing function is applied to the incoming data.The magnitude and the impulse response of the filter that is used is as shown respectively below:
figure 7: magnitude response of the lowpass filter
figure 8 : impulse response of the lowpass filter
If the 32 pt. FFT is performed on the resultant y(n) values , the FFT will modulate the prototype lowpass filter co-efficients and the input data to generate a filter bank of 16 unique filters.. The resulting individual filter response and the filter bank is as shown respectively:
figure 9 : 32 pt. windowed decimated individual FFT filter response.
figure 10 : 32 pt. windowed decimated FFT filter bank.
-
-
Conclusion:
A significant advantage of the decimation in frequency domain is the improvement in the time resolution, which improves the TOA and pulse width measurements.
For the original 256 point FFT with the sampling frequency of 1350MHz the time resolution is 189ns. For the decimated case with 32 point FFT the time resolution is 23ns. There is as eight fold improvement in the time resolution.
For the windowed filter bank , there are no missed frequencies, but its ability to resolve two frequencies that are close together is limited. For this reason the decimation in frequency domain has a direct effect on frequency resolution.
-
REFERENCES: