You are on page 1of 10

International Journal of Microwave and Wireless Technologies, 2011, 3(3), 355364.

# Cambridge University Press and the European Microwave Association, 2011


doi:10.1017/S175907871100033X

research paper

Recongurable digital receiver design


and application for instantaneous
polarimetric measurement
zongbo wang, oleg a. krasnov, galina p. babur, leo p. ligthart and fred van der zwan

This paper presents the development of a recongurable receiver to undertake challenging signal processing tasks for a novel
polarimetric radar system. The eld-programmable gate arrays (FPGAs)-based digital receiver samples incoming signals at
intermediate frequency (IF) and processes signals digitally instead of using conventional analog approaches. It offers more
robust system stability and avoids unnecessary multichannel calibrations of analog circuits for a full polarimetric radar.
Two kinds of dual-orthogonal signals together with corresponding processing algorithms have been investigated; the digital
implementation architectures for all algorithms are then presented. Processing algorithms implemented in FPGA chips can
be recongured adaptively regarding to different transmitted waveforms without modication of hardware. The successful
development of such recongurable receiver extends our radar capacity and thus yields tremendous experimental exibility
for atmospheric remote sensing and polarimetric studies of ground-based targets.

Keywords: Radar signal processing and system modeling, Radar architecture and systems

Received 15 October 2010; Revised 14 February 2011; rst published online 6 April 2011

I. INTRODUCTION system and provides the special capacity of simultaneous


BSM measurement. It simultaneously transmits and receives
Polarimetric information can be used to improve the radar periodic signals with dual-orthogonality both in polarimetric
performance for target detection, identication, and par- and in timefrequency spaces within the periodicity time
ameters estimation. It has been widely used in many appli- interval. Such types of transmitted signals provide the
cation areas such as terrain observation, disaster unique possibility to split all elements of the BSM and to
surveillance, and atmospheric remote sensing [13]. The full measure all of them simultaneously within one single period-
polarimetric nature of electromagnetic wave information icity time interval. The four complex elements of the BSM can
can so be obtained by measuring the full polarimetric back- be retrieved on reception by processing the received signals on
scattering matrix (BSM) from a target by transmission and each polarization channel with different reference signals.
reception of two orthogonal polarizations. In this paper we Many types of sophisticated signals taking the feature of
focus our attention on two orthogonal linear polarizations, orthogonality in timefrequency spaces have been investi-
i.e. horizontal and vertical polarization. In the majority of gated in [4, 5]. In the rst stage of the PARSAX radar
existing radars with polarimetric capabilities, pulse-to-pulse system development, special attentions are given to linear fre-
based switching of the transmitted and/or received polariz- quency modulated (LFM) and phase-code modulated (PCM)
ation is used to measure the elements of the scattering signals.
matrix and the BSM is measured in a sequence of two When utilizing dual-orthogonal signals for simultaneous
measurements. This introduces temporal, frequency, and BSM measurements, the receiver of the radar system must
phase ambiguities in the polarimetric results. meet a series of requirements. First, the receiver should be
To overcome the limitation created by polarimetric switch- able to receive and process two-channel signals at the same
ing, the PARSAX (Polarimetric Agile Radar for S- and X- time, in order to provide accurate BSM estimation, all receiver
bands) radar has been developed at IRCTR, TU Delft [1]. channels must have the same characteristics in phase and
The PARSAX radar is a continuous wave (CW) radar amplitude. Second, owing to the volume of raw data produced
by such radar cannot be efciently stored, real-time processing
is a must and the processor should therefore possess high-
International Research Centre for Telecommunications and Radar (IRCTR), Delft performance front-end signal processing capacity. In addition,
University of Technology, Mekelweg 4, 2628 CD, Delft, The Netherlands. Phone: since different kinds of orthogonal signals can be utilized in
+31 64 254 6893.
Corresponding author:
simultaneous BSM measurement, when transmitting different
Z. Wang orthogonal signals, corresponding different algorithms should
Email: Zongbo.Wang@tudelft.nl be applied to process the received signal and generate the

355
356 zongbo wang, oleg a. krasnov, galina p. babur, leo p. ligthart and fred van der zwan

estimated BSM, so the processor should be capable of per- polarization characteristics of target. It can be expressed as:
forming all required receiver functions such as ltering and
    
pulse compression, with regard to different types of trans- eHr (t) sHH sVH eH (t t)
mitted signals. The receiver development becomes a challen- er (t) = =
eVr (t) sHV sVV eV (t t)
ging task for such full polarimetric radar.  
sHH eH (t t) + sVH eV (t t)
In combination of state-of-the-art Analog-to-digital con- = , (2)
verter (ADC) techniques and recongurable computing sHV eH (t t) + sVV eV (t t)
techniques, a eld-programmable gate arrays (FPGA)-based
digital receive has been successfully developed for the where eHr(t) and eVr(t) represent received signal from hori-
PARSAX radar. The new receiver brings ADCs closer to the zontal and vertical polarization channel, respectively;
radar antenna, samples incoming signals at intermediate fre-  
quency (IF), and processes signals digitally instead of execut- sHH sVH
S=
ing the signal processing in analogue devices, this simplies sHV sVV
the analogue circuits design and avoids multichannel calibra-
tions for full polarimetric radar. The concept of recongurable is the full polarimetric BSM for single point target; t is the
computing has been deployed in the last few years at various round-trip propagation delay.
levels utilizing different approaches. Current high-end FPGAs The simultaneous polarimetric signal processing aims at
have been specically designed to perform high-speed digital extracting the target BSM within one sweep for CW radar
signal processing [6, 7], and are thus ideally suited to be the (or one pulse repetition for pulse radar). In the general case,
processor of recongurable fully digital receiver for our to obtain an estimate of all BSM elements, both received
radar. The high-speed ADCs and high-performance signals eHr(t) and eVr(t) are then simultaneously processed
FPGAs combined digital receiver allows for the features of in two separate branches with both the delayed replicas of
broadband coverage, high performance real-time processing eH(t) and eV(t), or equivalently, ltered by a couple of lters
capacity, and multi-waveform adaptation. The processing matched to eH(t) and eV(t) by the expression:
algorithms and parameters programmed in FPGAs can be
dynamically recongured according to different transmitted  
eHr (t)
signals, thus yielding the maximum exibility for the whole er (t) et (t) = [ eH (t) eV (t) ]
eVr (t)
radar system. 
The structure of the paper is the following. Section II intro- sHH RHH (t) + sVH RVH (t)
duces the basic principle of dual-orthogonal signal processing = (3)
sHV RHH (t) + sVV RVH (t, t)
for simultaneous polarimetric measurements, followed by an 
overview of the PARSAX radar and hardware platform used sHH RHV (t) + sVH RVV (t)
,
for recongurable digital receiver. Section III presents two sHV RVH (t) + sVV RVV (t)
kinds of signals used in the current stage of PARSAX develop-
ment, then the corresponding processing algorithms are where Rij(t) is the correlation function of two elements:
theoretically studied, and it is shown how FPGA implemen-
tation architectures and digital interpretations of the proces- T
sing output have been generalized. Section IV introduces the Rij (t) = ei (t)ej (t + t)dt, i, j = H, V. (4)
0
model-oriented FPGA design ow and the implementation
feasibility and resource utilization study are presented.
Section V includes conclusions and future plans. Hence, RHH(t) and RVV(t) are the autocorrelation func-
tions, RHV(t) and RVH(t) are the cross-correlation function
of eH(t) and eV(t). The estimation of the BSM can be retrieved
from the four elements of equation (3). If RHV(t) and RVH(t)
II. PARSAX RADAR AND satisfy the condition
RECONFIGURABLE PROCESSOR
RHV (t) = RVH (t) = 0, (5)
A) Simultaneous polarimetric measurement
the four-channel outputs of equation (3) provide a precise
and signal processing estimation of the BSM. Equation (5) expresses the signal
A technique using two separate transmitting channels for sim- orthogonality requirement, which typically requires a proper
ultaneous scattering matrix measurement has been originally waveform selection of the transmitted signals. In practice,
proposed in [5] and now applied in the PARSAX radar. Let the ideal condition of (5) can only be met approximately.
eH(t) and eV(t) be two transmitted signals with duration T, The isolation problem in case of one point target has been
simultaneously and separately transmitted with horizontal studied in [1, 4], the isolation (I ) parameter to estimate cross-
and vertical polarizations. The transmitted signal can be channel isolation level is dened as
given in vector form by  
  |Rii (0)|
Ii W min 20 log10 , i, j = 1, 2, (6)
et (t) =
eH (t)
. (1) t |Rij (t)|
eV (t)
where Rii(t)and Rij(t) are the autocorrelation and cross-
In stationary scenarios, the received signal er (t) is the correlation functions of the transmitted signals, the index
delayed version of the transmitted vector, and includes the denotes the waveform that is considered between those
reconfigurable digital receiver design and application 357

simultaneously transmitted signals. The isolation I is a converted from RF to IF. The amplitudes and phases of
measure for protection from the maximum residual cross- eHr(t) and eVr(t) describe the orthogonally polarized com-
channel return owing to either the same target or owing to ponents of the received eld. The recongurable multichannel
an interfering target. digital receiver, shown within the dotted line in Fig. 1, is com-
posed of four synchronized sub-processing branches; An esti-
mate of all BSM elements can be obtained after both received
signals, eHr(t) and eVr(t), are simultaneously processed by four
B) PARSAX radar architecture separate sub-processing branches using different reference
Applying the principle described above, the PARSAX radar signals. The processing which is congured in sub-processors
has been developed by IRCTR, TU Delft to provide a can be scene-adaptive to employ algorithms appropriate for
unique simultaneous BSM measurements capacity the four any given waveforms and signal parameters.
elements in BSM can be retrieved within one sweep, instead
of using polarimetric switching in two sweeps or pulses for
the majority of existing full polarimetric radar. C) Recongurable receiver
Taking advantages of start-of-the-art microelectronics and
digital processing techniques, the PARSAX radar established a
hardware architecture
novel software-dened architecture as depicted in Fig. 1. In FPGAs have become a popular implementation technology
the main operational mode, the radar will be used for atmos- for radar signal processing because they offer a combination
pheric remote sensing, polarimetric studies of ground-based of high performance, low cost, and exibility. In simplest
targets, and sea clutters. These tasks have to be solved in the term, FPGAs are composed by large arrays of look-up
framework of different missions and in variable scenarios, tables, Digital signal processing (DSP) slices, and memory
environment, and weather conditions. Such requirements blocks with exible interconnects which allow building
cannot be satised with traditional xed radar architecture. complex circuits for data processing or logic control.
In our software-dened radar architecture, the wideband arbi- Because of their in-system recongurability, a FPGA-based
trary waveform generator (AWG) is selected as the signal recongurable platform has been selected for the PARSAX
source to generate a pair of transmitted orthogonal signals; radar to receive the IF sample data from ADCs, to undertake
the FPGAs in digital receiver are programmed with suitable real-time processing tasks and to transfer the processed data
algorithms to undertake data processing tasks. Owing to the to the host computer.
recongurable features of AWG and FPGAs, both transmitted Each sub-processing branch illustrated in Fig. 1 is com-
waveforms and corresponding processing algorithms can be posed by one FPGA-based recongurable digital signal pro-
run-time recongured and adaptive with different mission cessing board using the latest technology. The block
and scenarios, thus yielding tremendous experimental exi- diagram of the board is shown in Fig. 2. Two A/D converters
bility for scientic research. are 14-bits devices with sampling rates up to 400 MSPS, the
Figure 1 depicts the simplied block diagram of the sampling clock is synchronously provided from the RF
PARSAX radar, the whole system operates as follows. A pair block of the radar system. Data acquisition and processing
of selected orthogonal signals eH(t), eV(t) are generated at IF for each sweep is started by the external trigger signal which
from the AWG. According to the orthogonality requirements, is generated by the given frequency reference and synchro-
these two signals are digitally calculated in advance and can be nized with the AWG and other parts of the radar. The
changed at software level. Signals eH(t) and eV(t) are FPGA chip Virtex5SX95T from Xilinx has high computation
up-converted to the S-band (carrier frequency of 3 GHz) in power and can be congured with different processing algor-
two radio frequency (RF) channels, the horizontal ithms which are customized designs and can so be
(H)-channel and vertical (V)-channel, respectively. The implemented. Processed data can be transported to the host
up-converted signals are then loaded to the feeders of the computer via the PCI-E bus for post-processing and visualiza-
transmitting antenna through an ortho-mode transducer tion, two DDR2 DRAM banks are used as data buffer between
(OMT) and simultaneously transmitted. FPGA and PCI-E bus. Our processing board for each channel
On the receiver site, the signals eHr(t) and eVr(t), as the contains two ADCs; both the received and the reference
outputs of the RF blocks of the H-channel and V-channel, signals can be sampled and processed. Since reference signal
are amplied by low noise ampliers (LNA) and down is digitally calculated and generated from an AWG, the

Fig. 1. PARSAX radar block-diagram.


358 zongbo wang, oleg a. krasnov, galina p. babur, leo p. ligthart and fred van der zwan

the PARSAX radar, two kinds of signals, (1) linear frequency


modulation (LFM) signals with opposite modulation slope
and (2) orthogonal phase coded modulation (PCM) signals,
have been employed. Related processing algorithms have
been designed according to signal specications, and can be
recongured in FPGA chips adapting to different transmitted
waveforms.

A) LFM Mode and de-ramping processing


Fig. 2. Hardware platform for each sub-processor. A pair of LFM signals with opposite modulation slopes
approximately subjects the condition in equation (5), thus
reference digital sequence can also be stored in the memory can be used for simultaneous BSM measurement. The trans-
blocks of FPGA chip, and then only the received signal need mitted signal vector composed of two LFM signals can then
to be sampled. This alternative will consume more memory be written as:
resources in the FPGA chip, and the pre-stored reference  
  1
information need to be updated according to different trans- exp j2p( fc t + at 2 )
eH (t)  2
mitted waveforms. et (t) =
eV (t)
= 1 2  ,
The whole recongurable receiver diagram composed of exp j2p( fc t at )
2
four FPGA boards is illustrated in Fig. 3. All the four boards
T T
work in parallel and are placed in one ASUS P677WS ,t , (7)
Supercomputer motherboard. In comparison with conven- 2 2
tional analog processing approaches, the digital processing
where eH(t) and eV(t) are the up-going and down-going LFM
boards for the PARSAX radar avoid unnecessary multichannel
signals, fc is the IF carrier frequency, t is the time variable
calibrations of analog hardware owing to component drifts
varying within the pulse-repetition time (PRT) T, and a is
with time and temperature. This results into more robust
the frequency sweep rate equal to the ratio between the trans-
system stability and thus an improved system performance.
mitted bandwidth B and the PRT.
The FPGA-based architecture also provides the exibility to
implement digital down-conversion, in-phase and quadrature
(I/Q) demodulation, and subsequent waveforms specic algor- 1) de-ramping processing
ithm, without modication of the hardware platform. LFM signals can be processed using one multiplication with a
matched reference signal. The range information can then be
resolved using spectral analysis of the product. This technique
III. WAVEFORM AND PROCESSING is called de-ramping compression processing [8].
ALGORITHM SELECTION Figure 4 shows a simplied scheme of the de-ramping
algorithm for polarimetric radar with simultaneous measure-
Different types of sophisticated signals taking the feature of ment of BSM. In order to obtain the estimations of all BSM
orthogonality in timefrequency can be employed for simul- elements, each of the received signals (eHr(t), eVr(t)) is
taneous BSM measurements. In the rst operational stage of mixed with the conjugated replicas of the transmitted

Fig. 3. Recongurable receiver diagram for the PARSAX radar.


reconfigurable digital receiver design and application 359

respectively. After the multiplication of these two signals,


the digitized beat frequency signal sBF(n) is generated; the
maximum frequency fbmax in sBF(n) is proportional to the
maximum range of observation.
When fbmax , ,fs/2, the digitalized beat frequency signal
sBF(n) is over sampled, a decimation operation can be per-
formed to reduce the data rate and data volume for further
processing. Before decimation, it is necessary to ensure that
the re-sampling will not introduce new aliasing signals, so a
LPF has to be implemented as fstop fbmax, where fstop is the
stop band of the lter. In order to avoid aliasing the
maximum decimation rate D must meet the condition:

Fig. 4. Multichannel de-ramping processing. fs


D, , (9)
2fbmax
waveforms (eH(t), eV(t)) and is reduced in slope, i.e. the signals
are de-ramped. The signals after multiplication and low-pass where fs is the IF sampling frequency. The input signal for the N
ltering (LPF) are called the beat signals. By applying a points FFT is the D-time decimated beat frequency signal which
Fourier transform (i.e. the fast Fourier transform FFT) is expressed as sBF(Dn) in Fig. 5. The processing output
onto the beat signals, the resulting spectrum as a function of sequence s(k) in frequency domain covers the frequency from
beat frequencies (fb) for each ramp corresponds to range pro- 0 to fs/(2.D). According to LFM signals timefrequency
les for all four elements of the scattering matrix. The proces- relationship dened from equation (7), the frequency infor-
sing is summarized by mation existing in beat signal sBF(Dn) is proportional to
range information from targets, thus the corresponding range
 
sHH ( fb ) sHV ( fb ) span covered by de-ramping processing is
sVH ( fb )
sVV ( fb )  
  cfs T
eHr (t)eH (t) eHr (t)eV (t) (8) 0,
4DB
. (10)
= FFT LPF ,
eVr (t)eH (t) eVr (t)eV (t)
t [ [tmax . . . T], The range prole covering above range span is composed
by N discrete numbers, thus the digitalized range resolution is

cfs T
where FFT means Fast Fourier transform, tmax is maximum DRd = . (11)
time delay of the received signal and T is the LFM-signals 4DBN
sweep time which equals the duty cycle of the radar with con-
tinuous waveforms. Beat frequencies are analyzed in the fre-
quency band (0. . .fbmax]. The maximum beat frequency B) Phase code modulation (PCM) signals
(fbmax) is dened in the LPFs and determines the maximum mode and related processing algorithms
time delay (tmax) and therefore, the maximum observed
range (Rmax). A pair of orthogonal signals with PCM has been recognized as
another promising solution for simultaneously scattering
matrix measurements [5]. The carrier frequency of trans-
2 ) digital de-ramping architecture mitted PCM signal is modulated by the phase-code sequence
When the de-ramping processing is performed in digital
at a given xed rate (chip rate), so the whole signal is divided
domain, both received the signal and the reference signal is
into a number of chips with equal duration DT. The chip rate
sampled in discrete number and processed digitally. The pro-
Df is the reciprocal of DT, and determines the bandwidth of
cessing diagram of one digital de-ramping branch is shown in
PCM signals. The cross-correlation level for PCM signals
Fig. 5. When conducting IF sampling, the ADC sampling fre-
is lower than LFM signals when the Bandwidth-time (BT)-
quency fs is determined by the LFM bandwidth B and IF
products are equal. Besides, there is no range-Doppler
carrier frequency fc according to Nyquist sampling theorem.
coupling for PCM signals in comparison with LFM signals.
One such received signal and reference signal are digitized
So PCM signals are preferable in scenarios with fast moving
in discrete samples and expressed as e(n) and er(n),
targets [1].
PCM signals are applicable to correlation processing and
matched lter processing and cannot be applied to
de-ramping processing. For this reason, our selected FPGA
implementation architecture and feasibility study for corre-
lation processing and matched lter processing are summar-
ized in the following.

1) correlation processing
When applying correlation processing in polarimetric radar,
Fig. 5. Digital de-ramping processing implementation diagram. in order to obtain the estimations of all BSM elements, the
360 zongbo wang, oleg a. krasnov, galina p. babur, leo p. ligthart and fred van der zwan

band. The decimation operation can then be followed to


reduce the data rate and volume. The decimation rate D in
such case is determined by the chip rate Df of PCM signals,
and must meet the condition

fs
D, , (13)
2Df

where fs is the IF ADC sampling frequency.


The signals generated after DDC and D-time decimation
are shown as e(Dn) and er(Dn) in Fig. 7. The initial time-delay
t0 indicated in (12) are realized via initial delay register in the
digital domain, the delay clock cycles N0 is determined by
Fig. 6. Multichannel correlation processing. t0 f s
N0 = . (14)
D
orthogonally polarized components of the received signal are
simultaneously correlated in separate branches with the In order to cover a certain range span, a series of such mul-
delayed replicas of eH(t) and eV(t), as shown in Fig. 6. The pro- tiplieraccumulators should be applied. The time delay
cessing of the received signals with orthogonal polarizations between each multiplieraccumulator can be realized via
(eHr(t) and eVr(t)) takes place in channels H and V, respectively. serial shift registers. Assuming the stepped delay time is N
The receiver calculates the correlation
integral between
T clock cycles between two shift registers, the time delay
the received vector signal, er (t) = eHr (t) eVr (t) , and created by this register is

conjugated transmitted signals e (t t0 ) = eH (t t0 )
eV (t t0 )]T , with the expected time shift, t0, the superscript ND
T denotes transpose of the vector. We derive Dt = . (15)
fs

  t0 +T
sHH (t0 ) sHV (t0 ) eHr (t)eH (t t0 )dt The corresponding digitalized range step is
= t00 +T
t
sVH (t0 ) sVV (t0 )
t0
eVr (t)eH (t t0 )dt cND
(12) DRd = . (16)
t0 +T 2fs
eHr (t)eV (t t0 )dt
t0
t0 +T ,
t0
eVr (t)eV (t t0 )dt equation (15) stands for the time differences between each
digitalized range bin. On the other hand, the radar range res-
olution determined by signal bandwidth B is expressed by
where t0 is constant, sij (t0 ), i, j H, V, are the estimations of
the BSM for a predetermined (expected) time delay t0, which c
is a constant for one measurement, T is the transmitting signal DR = . (17)
2B
duration (CW radar duty cycle). The integrals are calculated
within the time interval [t0. . .t0 + T ]. The boundaries for To guarantee that there is no resolution degradation after
integration are xed because the signals are assumed to be digitalization, N, determined by equations (16) and (17)
synchronized with each other and all having T-duration. should satisfy the condition of:
The digital correlation-processing diagram is shown
in Fig. 7. When the correlation processing is implemented DTfs
in digital domain, the integration processing indicated in N . (18)
D
equation (12) can be realized by a discrete multiplier followed
by an accumulator with accumulation time interval of T. Since Assuming the initial delay time is N0 clock cycles and the
the correlation processing can be applied at base band without stepped delay time is N clock cycles, the output sequence of
regarding the carrier frequency, the digital down converter correlation processing s(m) is given by
(DDC) can be rstly implemented to convert the IF digitalized
received signal er(n) and the reference signal e(n) into base
s
DT/f
s(m) = r(Dn N0 Nm)e(n),
n=1 (19)
m = 0, 1, . . . , M 1,

where M is the total number of stepped shift registers, deter-


mined by the interested range span and limited by the compu-
tational resources in chosen FPGA chip. The corresponding
range span covered by the digital correlation processing equals
 
cN0 D cN0 D cNMD
, + . (20)
Fig. 7. Digital correlation processing implementation diagram. 2fs 2fs 2fs
reconfigurable digital receiver design and application 361

decimation processing are used to reduce the data rate and


processing intensity. So the implementation of the matched
lter in frequency domain can be expressed by

s(Dn) = IFFT[FFT(er (Dn))conj(FFT(e(Dn)))], (22)

where er(Dn) and e(Dn) represent the received signal and


reference signal after DDC and D-time decimation.
In CW radar case, if both the received signal and the refer-
ence signal is sampled in the whole duty cycle T, the length of
Fig. 8. Multichannel matched lter processing.
the FFT is thus determined by the IF sampling frequency fs
and decimation rate D, thus the FFT length and inverse FFT
2 ) matched filter processing length NFFT can be expressed by
By denition the matched lter is a lter which, for a specied
Tfs
signal waveform, will result in the maximum attainable NFFT = . (23)
signal-to-noise ratio at the lter output when both signal D
and additive white Gaussian noise have passed the lter [9].
The idea behind the matched lter is correlation using For the same processing length, the time-domain proces-
convolution [10]. For polarimetric radar with simultaneous sing requires on the order of NFFT2 operations (multiplications
measurement of BSM elements, the receiver processing and additions), while frequency-domain processing composed
includes four matched lters as depicted in Fig. 8, whose by two FFT and one inverse FFT requires on the order of
impulse responses (hH(t) and hV(t)) are the time-reverse 3NFFT lg(NFFT) operations, where lg(NFFT) denotes the
conjugate of the vector sounding signal components (eH(t) logarithm-base-2 of NFFT. For processing length longer than
and eV(t)). 64 points, the frequency processing is more efcient than
The estimations of the scattering matrix elements in case of the time-domain processing [10], thus, the frequency-domain
matched ltering for polarimetric radar with continuous matched-lter processing consumes less computational
waveforms are calculated from resources for FPGA implementation.
The matched-lter processing output s(Dn) is the discrete
   T sequence with the length of NFFT, it stands for time interval
sHH (t) sHV (t) eHr (t)eH (t t)dt
= 0
T from 0 to T; so the range span covered by matched-lter pro-
sVH (t) sVV (t)
0
eVr (t)eH (t t)dt cessing equals
T  (21)
 

0
e Hr (t)e V ( t t)dt cT
T . 0, . (24)
e (t)eV (t t)dt
0 Vr
2

As expressed in (21), matched lter processing is equival- The range prole covering the whole range span is com-
ent to convolving the received signals with a conjugated time- posed by NFFT discrete numbers, thus the digitalized range
reversed version of the reference signal (cross-correlation). It resolution can be generalized from (23) and (24) as
can be implemented computationally efcient in frequency
domain based on the convolution theorem [11]. cD
DRd = . (25)
Figure 9 shows our digital matched lter processing 2fs
implementation diagram. Using the principle that multipli-
cation in the frequency domain corresponds to convolution In order to make sure there is no range resolution degra-
in the time domain. Both received signal and reference dation after digitalization, the decimation rate D should
signal are transformed into the frequency domain using the meet the following conditions:
FFT, multiplied in frequency domain after conjugation for
reference signal, and then transformed back into the time fs
D . (26)
domain using the Inverse FFT. In order to implement 2B
matched lter processing in real time, the same DDC and

IV. FPGA IMPLEMENTATION


PROCEDURE AND
FEASIBILITY STUDY

A) FPGA implementation
Traditional FPGA design ows have historically mirrored
processes originally developed for building application specic
integrated circuits (ASICs), the algorithms are typically
Fig. 9. Digital matched lter processing implementation diagram. described in a hardware description language (HDL) like
362 zongbo wang, oleg a. krasnov, galina p. babur, leo p. ligthart and fred van der zwan

VHDL or Verilog. In contrast, a model-oriented FPGA design B) Resource utilization and feasibility study
ow has been established to develop the algorithms described
above for the PARSAX radar, all algorithms are modeled by All the above investigated waveform sets form a waveform
high-level blocksets in system generator environment library for the PARSAX radar, while all algorithms
instead of writing raw HDL codes. compose an algorithm library. As soon as scenario preferred
The general procedure for our FPGA implementation is waveform sets are selected to congure the AWG, the bit-
illustrated in Fig. 10. The whole FPGA design task is divided stream le containing corresponding processing algorithm
into two parts from initial stage: the algorithm design and per- can then download into FPGA chips and recongure the
ipheral interface design. The left branch in Fig. 10 illustrates the digital receiver to conduct different signal processing tasks.
design ow for model-oriented algorithm design; all signal pro- Such fast recongurable feature from waveforms to processing
cessing algorithms following the FPGA implementation archi- algorithms tremendously extends the radar capability and
tecture and described in Figs 5, 7 and 9 are rstly modeled in exibility.
the system generator; then two times packaged ASCII netlist Nevertheless, correlation processing and matched-lter
(NGC) le can be generated. The right branch in Fig. 10 processing can also be applied to LFM signals [8].
shows the board-related peripheral interface design ow; all De-ramping processing for LFM signals and correlation/
hard-wire connection and control logics between FPGA and matched lter processing for PCM signals have been tested
other peripheral chips are described by VHDL, the compatible and validated with the specied FPGA implementation archi-
NGC le is generated after VHDL synthesis. These two tecture, the corresponding bitstream les are generated fol-
NGC-les are then joined together for further NGC building lowing the design procedure illustrated in Fig. 10. One
processing, after a chip-dependent place and route (PAR) pro- FPGA chip of Xilinx Virtex5sx95T is used for the feasibility
cessing in Xilinx ISEw ISE is the name of the software tool from study and responsible for one channels data processing.
Xilinx Company design tool suite, the nal bitstream le can Regarding the PARSAX radar signal specications ( fs
then be generated and downloaded to FPGA. 400 MHz, fc 125 MHz, B 50 MHz) and FPGA compu-
Following the implementation procedure depicted in tational resources, the processing parameters and capacities
Fig. 10, each algorithm nally generates a standalone bit- for different waveforms are summarized in Table 1.
stream le. Each bitstream le can then be used to congure For the de-ramping processing with 400 MHz IF sampling
the FPGA chip to conduct different signal processing task. frequency, the anti-aliasing LPF with 512 taps is applied to
For the algorithm design, the system generator-based high- select 5 MHz from beat frequency, then 22-time decimation
level design approach provides increased productivity, can be applied to reduce the data volume, the FFT length
especially greater ability to explore architecture and debug for timefrequency conversion is 16K, the generated range
complex algorithms realized in hardware; for peripheral inter- prole covers the range spectra from 0 to 15 km; For the
face design, in order to meet critical timing constrains, this correlation processing and matched lter processing, the
part of the design is described by low-level VHDL codes. LPF stop bands decimation rate is limited by signal band-
The established design procedure separates the algorithm width B 50 MHz, 64-tap LPF is applied after converting
design from peripheral interface design using different the IF signals to base band and the maximum decimation
design methodologies, thus increases the reliability and ef- rate is 3. Because of relatively low decimation rate for
ciency for FPGA implementation. the correlation processing and the matched lter processing,
the data volume for these two processing is increased in
comparison with the de-ramping processing, the
observation range for correlation processing is 750 m and
limited by the computational resources in FPGA, while
maximum FFT length for matched lter processing is 8K
and limited by the memory resources in FPGA. Figure 11
shows the physical FPGA resource utilization for
each algorithm.
The logic resources and computational resources in Xilinx
Virtex4 FPGA can be divided into four categories: basic ip-
ops, logic slice composed by look-up table, Block RAMs,
and DSP slices composed by dedicated multiplieraccumula-
tor for signal processing. As depicted in Fig. 11, in the
de-ramping algorithm, it averagely consumes approximate
50% of the FPGA recourses, DSP slices are mainly used for

Table 1. Processing algorithms comparison for the PARSAX radar.

De-ramping Correlation Matched lter

Applicable waveform LFM LFM, PCM LFM, PCM


FIR taps 512 64 64
Decimation rate 22 3 3
FFT length 16 K 8K
Observation range 015 km 0750 m 018.75 km
Fig. 10. Model-oriented FPGA design procedure.
reconfigurable digital receiver design and application 363

with the start-of-the-art microelectronics and digital proces-


sing techniques, the PARSAX radar established novel
software-dened architecture. Based on software-dened
architecture, both transmitted waveforms and correspond-
ing processing algorithms can be run-time recongured
without any hardware modication, thus the whole radar
system is adaptive with different mission and scenarios.
An FPGA-based multichannel recongurable digital recei-
ver has been developed to undertake the high throughput
real-time data processing tasks. In comparison with con-
ventional analog processing approaches, the digital proces-
sing boards for the PARSAX radar avoid unnecessary
multichannel calibrations of analog hardware owing to
component drifts with time and temperature, this result
into a more robust system stability and thus an improved
Fig. 11. Resource utilization on Virtex4sx95t FPGA.
system performance.
De-ramping processing for LFM signals, correlation pro-
cessing, and matched lter processing for PCM signals with
long-tap FIR lter and FFT, block RAMs are consumed for suitable FPGA implementation architectures has been ana-
frame data storage for 64K FFT. In the correlation lyzed in detail. The advantages and disadvantages for each
algorithm, each correlation tap contains one 18-bits multipli- algorithm have been generalized based on the results from
cation and one summation; the overall DSP slices in one our FPGA implementation feasibility and recourse utilization
FPGA chip can only afford 250 correlation taps thus the study. Each proposed processing algorithm forms a down-
range coverage is limited by this fact; in addition, because loadable bitstream le, which is ready to congure the
the need for a shift-register between two correlation taps, FPGA chips in different scenarios and adaptive to different
the correlation processing also consumes more ip-ops in transmitted waveforms.
comparison with the two other algorithms. In the matched
lter algorithm, the major limitation is the block
RAMs, since two FFTs and one IFFT processing are all
ACKNOWLEDGEMENTS
frame-based, so data buffers must be created between input
data and FFT processing core, thus the matched lter con-
At the International Research Centre for Telecommunications
sumes more memory resources, the data ow control for the
and Radar (IRCTR), Delft University of Technology a major
matched lter algorithm is more complicated than for the
research project PARSAX is executed concerning the design
other two algorithms, and as a result, it consumes relative
and development of full polarimetric FMCW radar with
more logic slices.
dual-orthogonal signals for simultaneous measurement of all
According to the analysis from Table 1 and Fig. 10, the
elements of radar targets polarization scattering matrix.
de-ramping processing offers the best computational ef-
This project is performed under a contract with the Dutch
ciency and the observation range can be easily congured
Technology Foundation STW.
according to users requirements. However, it is only appli-
cable for LFM signals [12]. The correlation processing and
matched lter processing can be applied to all pulse-
compression waveforms but consumes more computational REFERENCES
resources, especially the correlation processing in time
domain. The feasibility study of R. Fratila [13] shows that [1] Krasnov, O.A. et al.: The PARSAX-full polarimetric
FMCW radar with dual-orthogonal signals, in Proc. EuRAD, 2008,
when even using all DSP resources within one chip of the
8487.
FPGA, the observation range can be only around 750 m for
the PARSAX radar. However, the observation range spectra [2] Nakamura, M.; Yamaguchi, Y.; Yamada, H.: Real-time and
and digitalized resolution of correlation processing can be full polarimetric FM-CW radar and its application to the
easily congured by changing the initial delay and delay classication of targets. IEEE Trans.Instrum. Meas., 47(2) (1998),
572577.
step between shift registers, this feature can be useful when
the radar operates to cover different range spectra using differ- [3] Xu, F.; Jin, Y.Q.: Imaging simulation of polarimetric SAR for a com-
ent range resolution. Matched-lter processing illustrated in prehensive terrain scene using the mapping and projection algor-
Fig. 9 reduced the computational resources by transforming ithm. IEEE Trans. Geosci. Remote Sens., 44(11 Part 2), (2006),
from time domain to frequency domain, but the implemen- 32193234.
tation architecture is relatively complicated and it consumes [4] Babur, G.: Processing of Dual-Orthogonal CW Polarimetric
more memory resources in comparison with other two pro- Radar Signals, Ph.D dissertation, TU Delft, 2009, ISBN:
cessing algorithms. 978-90-76928-16-6.
[5] Giuli, D.; Fossi, M.; Facheris, L.: Radar target scattering matrix
measurement through orthogonal signals. IEE Proc. Radar Signal
V. CONCLUSIONS Process., F, 140(4) (1993), 233242.
[6] Martinez, D.R.; Moeller, T.J.; Teitelbaum, K.: Application of recon-
This article outlines the work on the design of a recon- gurable computing to a high performance front-end radar signal
gurable receiver for the PARSAX radar. In combination processor. J. VLSI Signal Process., 28(1) (2001), 6383.
364 zongbo wang, oleg a. krasnov, galina p. babur, leo p. ligthart and fred van der zwan

[7] Tessier, R.; Burleson, W.: Recongurable computing for digital Galina Babur received the M.S. degree
signal processing: a survey. J. VLSI Signal Process., 28(1) (2001), in radio electronic systems from
727. Tomsk State University of Control
[8] Krasnov, O.A. et al.: Basics and rst experiments demonstrating iso- System and Radioelectronics (TUCSR),
lation improvements in the agile polarimetric FM-CW radar, in Russia, in 2003, and the Ph.D. degree
Proc. EuRAD, 2009, 1316. from Delft University of Technology
[9] Levanon, N.; Mozeson, E.: Radar Signals, Wiley, New York, 2004. (TU Delft), the Netherlands, in 2009.
She specializes in radar signal processing
[10] Cook, C.E.; Bernfeld, M.: Radar Signals-An Introduction to Theory
techniques, namely processing of
and Application, Artech House, Norwood, MA, 1993.
dual-orthogonal sophisticated radar signals and advanced
[11] Diniz, P.S.R.: Digital Signal Processing, Cambridge University Press, processing in polarimetric radars with continuous waveforms.
New York, 2002.
[12] Jankiraman, M.: Design of MultiFrequency CW Radars, SciTech
Publishing, Rayleigh, NC, 2007
[13] Fratila, R.: Feasibility Study and Implementation of FPGA-Based Leo P. Ligthart received an engineers
Correlation Receiver for the PARSAX Radar, Project Report, TU degree (cum laude) and a doctor of tech-
Delft, IRCTR-A-013-09 2009. nology degree from Delft University of
Technology in 1969 and 1985, respect-
ively. He is a Fellow of the IEE and
Zongbo Wang received the B.S. and IEEE. He received doctorates (honoris
Ph.D. degrees in electronic engineering causa) at Moscow State Technical Uni-
from Beijing Institute of Technology, versity of Civil Aviation in 1999 and
Beijing, China, in 2004 and 2009, Tomsk State University of Control Sys-
respectively. In 2007, he joined Group tems and Radioelectronics in 2001. He is an Academician of
of Microwave and Radar, Universidad the Russian Academy of Transport. Since 1992, he has held
Politecnica de Madrid, Madrid, Spain, the Chair of Microwave Transmission, Radar, and Remote Sen-
where he was engaged in high- sing in the Department of Electrical Engineering, Mathematics,
resolution LFMCW radar image pro- and Computer Science, Delft University of Technology. In
cessing. Since 2009, he joined the International Research 1994, he founded the International Research Center for Tele-
Centre for Telecommunications and Radar, the Delft Univer- communications and Radar (IRCTR), and is the Director of
sity of Technology, Delft, Netherlands, for the research of po- IRCTR. Prof. Ligtharts principal areas of specialization include
larimetric remote sensing. His interests are in the eld of radar antennas and propagation, radar, and remote sensing, but he
signal processing, real-time digital processing, and sub-band has also been active in satellite, mobile, and radio communi-
signal processing cations. He has published over 400 papers and two books.

Oleg Krasnov received the M.S. degree


in radio physics from Voronezh State Fred van der Zwan received his diploma
University, Russia, in 1982, and the in 1986 in the Electronic Technical School
Ph.D. degree from National Aerospace in The Hague. After working at institutes
University Kharkov Aviation Institute, like Toshiba, TNO, and TU-Delft, in
Ukraine, in 1994. In 1999 he jointed in 1992 he became electronic designer in
the International Research Center for the group of Telecommunications and
Telecommunications and Radar Tele-observation Technology. He devel-
(IRCTR), TU Delft. His interests are in oped and programmed several processing
the eld of algorithms development for polarimetric radar and steering systems for radar systems. A
signal and data processing, and multi-sensor atmospheric lot of experiences build up in many years is used to develop
remote sensing. new radar system aspects, upgraded MIMO test beds, and an
ultra-wide band MIMO system is proposed to measure channel
characteristics. He initiated and coordinated several new radar
projects and campaigns. He has many contacts with participating
partners in several projects. In January 2004 he became
co-applicant of the PARSAX project, which was granted in De-
cember 2005, and later became technical coordinator of the
PARSAX project.

You might also like