Professional Documents
Culture Documents
Efficient Implementation of CFAR Based Algorithms Using The ADSP TigerSHARC 201S Processor
Efficient Implementation of CFAR Based Algorithms Using The ADSP TigerSHARC 201S Processor
Abstract— In this paper, we propose an efficient DSP In this paper, we propose new and efficient DSP
implementation of the CA-CFAR, the SO-CFAR, the GO-CFAR implementation procedures of CFAR based detectors using the
and the OS-CFAR detectors using the ADSP TigerSHARC 201S ADSP TigerSHARC 201S processor. In section 2, we present
processor from Analog Devices and the VisualDSP++5.0 the considered detectors architecture. In section 3, we describe
development tools. The main contribution of this paper involves the TS201S processor and the development tools
two parts. The first one concerns the extension of the GASW specifications. Section 4 deals with the real-time constraints
technique developed initially for the CA-CFAR threshold and the implementation results and finally we provide some
estimate implementation to the SO-CFAR and the GO-CFAR comments on the opportunity of the application of the proposed
detectors. In the second part, a new and efficient procedure for procedures in a radar system.
the OS-CFAR detector implementation is investigated. The real-
time constraints are managed so as to satisfy the requirements of II. THE DETECTION ALGORITHMS
the ASR-12 radar. It should be noticed that the developed
architectures are fully reconfigurable and can be extended to Several kinds of CFAR techniques have been proposed in
other CFAR detectors easily. The DSP implementation results the literature [1], based on the method to obtain the adaptive
are presented and discussed in this paper. threshold from the reference window or data set. The Cell-
Averaged CFAR (CA-CFAR) is the most common CFAR
Key words: ADSP T201 processor , CFAR, Implementation. detector used in adaptive signal processing for target
detection. In the CA-CFAR all the cells in the reference
window are summed up to compute their average, and hence
the adaptive threshold. There are other algorithms such as the
I. INTRODUCTION
Order Statistics CFAR that computes an order statistic of the
Detection of target in a background of clutter is a problem reference cells to compute the threshold.
of interest in radar field. In order to improve such system This work is focused in the CA-CFAR algorithm, two
detection, the designer usually prefers Constant False Alarm versions of it, the Smallest Of CFAR and the Greatest Of
Rate detection, CFAR, procedures. CFAR, and the OS-CFAR detectors.
Many different CFAR algorithms have been developed to For the GO-CFAR detector, the leading and the lagging
effectively deal with the various types of backgrounds that are samples are separately summed and the larger of the two is
encountered. However, any single algorithm is likely to be used to set the threshold. The GO-CFAR has been introduced
inadequate in a dynamically changing environment. in [7] to alleviate the problem of increase in the false alarm
The most basic forms of the adaptive threshold processor probability due to step discontinuity (clutter edge).
are the well-known cell-averaging CFAR (CA-CFAR) [2] for In the SO-CFAR detector, the estimate of the noise level is the
homogeneous environment and the ordered statistics (OS- minimum of the sums of the outputs of the leading and the
CFAR) [3] in presence of interfering targets. lagging range cells. The SO-CFAR detector was proposed in
[6] in order to improve the resolution of closely spaced targets.
The application of digital signal processing in radar systems More details will be provided in the full paper.
began from signal detection in video frequency and is now
developing into signal processing in intermediate frequency. It III. THE ADSP-TS201S PROCESSOR AND
seems possible to process the RF signal directly owing to the DEVELOPMENT TOOLS DESCRIPTION
development of digital devices. The percentage of digitized
The ADSP-TS201S TigerSHARC processor is an ultra-
parts in radar system becomes larger since it is a cost-effective
high performance, static superscalar processor optimized for
way to improve the performance of the entire radar system.
large signal processing tasks and communications
Real-time performance of adaptive digital signal processing infrastructure. The DSP combines very wide memory widths
algorithms is required in many applications but it often means a with dual computation blocks supporting 32 and 40-bit
high computational load for many conventional processors. floating-point and supporting 8, 16, 32, and 64-bit fixed-point
processing to set a new standard of performance for digital
signal processors. The TigerSHARC static superscalar
architecture lets the DSP execute up to four instructions each GO-CFAR:
cycle, performing twenty four 16-bit fixed-point operations or
six floating-point operations [8]. 5
Four independent 128-bit wide internal data buses, each
connecting to the six 4M bit memory banks, enable quad-word
data, instruction, and I/O accesses and provide 33.6G bytes per 6
second of internal memory bandwidth. Operating at 600 MHz,
the ADSP-TS201S processor’s core has a 1.67 ns instruction , 7
cycle time. Using its Single-Instruction, Multiple-Data (SIMD)
features, the ADSP-TS201S processor can perform 4.8 billion OS-CFAR:
40-bit MACs or 1.2 billion 80-bit MACs per second [9,10]. ,… 1 ,
The VisualDSP++ development tools are used for code 1 ,… 8
generation, loading, debugging and evaluation of the proposed _ 9
implementation procedures for the considered detectors. It 3
_ 10
includes all the tools needed to build and manage processor 2
Projects. The VisualDSP++ IDDE provides complete graphical
control of the edit, build, and debug process. In this integrated OS-CFAR ):
environment, we can move easily between editing, building,
and debugging activities. ,… 1 ,
1 1 18
1 1 1 19
SO-CFAR: 1 1 , 1 20
2 GO-CFAR:
21
3
, 4
The evaluation of the processing time is in number of
22 cycles. The total time will be computed for a cycle time of
1.7ns.
In table 1, we present the obtained execution time of the
1 23 CA, the SO, the GO and the OS-CFAR detectors using
1 1 1 24 ordinary procedures for different sizes of the reference
1 1 , 1 25 window, N.
For the OS-CFAR implementation, two procedures are
considered, the classical ordering procedure and the direct
determination of the (N-k) maximum proposed in [4]. K is the
The OS-CFAR implementation procedure is illustrated in order of the OS-CFAR detector.
the following bloc diagram.
TABLE I. EXECUTION TIMES FOR ORDINARY PROCEDURES
N
Step k=0 Vect_sort Detector 8 16 32 40
CA 28 041 40 113 72 149 88 239
Step k k=k+1 SO 32 843 51 291 96 145 118 553
GO
32 843 51 291 96 145 118 553
k<kmax OS
END 579 756 1 847 491 6331925 9512051
(ordinary)
OS
264 304 657 209 1 923 233 2 792 278
(N-k)
k=k+1 Detector 8 16 32 40
Figure 1. Bloc diagram of the optimized OS-CFAR implementation CA 14 459 14 493 14 555 14 595