sponsored by abstract 1 ritamar siurano – undergraduate student prof. domingo rodriguez –...

1
0 0.5 1 1.5 2 2.5 3 3.5 4 4.5 x 10 -4 -400 -200 0 200 400 600 800 C orrelation O utputfrom C ode C om poserS tudio Tim e in S econds C orrelation N orm alized V alue Sponsored By Abstract 1 Ritamar Siurano – Undergraduate Student Prof. Domingo Rodriguez – Advisor Abigail Fuentes – Graduate Student Prof. Ana B. Ramirez – Collaborator RASP Group, ECE Department, AIP Group - UPRM, ICPS Group - UIS University of Puerto Rico at Mayaguez E-mail: [email protected] Rapid Systems Prototyping Laboratory (RASP) www.ece.uprm.edu/rasp This work presents the design of DSP support algorithms for synthetic aperture radar (SAR) image formation operations. Computational results are presented for fast Fourier transforms (FFTs), matrix corner turning operations and the convolution process based on FFTs. Correlation implementation of transmitted and received SAR signals are also presented in this work. Introduction 2 Synthetic aperture radar (SAR) image formation is a technique for obtaining images of the Earth’s surface through pulsed microwave transmitted and received signals. This system transmits a series of pulses at a fixed repetition rate and it collects the backscattered signals. Through signal processing techniques the transmitted and received signals are treated by a SAR image formation system to produce an image that is usually enhanced in the azimuth direction when compared with standard real (vs. synthetic) aperture images. The main benefit of using a SAR instead of a RAR is that the length of the antenna is significantly reduced to obtain a more detailed image. Methodology 3 The following procedure was used for the implementation of the algorithms: i) A TMS320C6713 DSP Starter Kit (DSK) was utilized as development platform; ii) The TMS320C6713 DSP(figure2) was configured to test the various FFT algorithms; iii) These FFT algorithms were used to develop the indirect convolution process, the correlation algorithm(figure3) and corner turning implementation; iv) Computational results were obtained in terms of number of cycles and execution times; v) Range and Azimuth compression algorithms were developed using MATLAB. Results 4 Conclusions 5 This work presents the results for implementation efforts of FFT and of corner turning algorithms on the TMS320C6713 DSP unit. For these algorithms, the execution times obtained on the DSP unit were faster using internal memory. It also validates correlation algorithm results from CCS, and presents the image formation algorithms using range and azimuth compression in MATLAB. References 6 [1] A. Ramirez, M. Rodriguez, D. Rodriguez, “TMS320C6713 User’s Guide, ”University of Puerto Rico Mayaguez Campus, Mayaguez, Puerto Rico, 2007. [2] R. Chassaing, Digital Signal Processing and Application with the C6713 and C6416 DSK, Wiley-Interscience, John Wiley & Sons, Inc., NY, 2005. DSP Implementation of SAR Support Algorithms Figure 2 (a) – TMS320C6713 Board sin 2 } { c R res Range Resolution Range Resolution Azimuth Resolution Azimuth Resolution RADAR TRAJECTORY RADAR FOOTPRINT RADAR PULSE L swath Courtesy of RADARSAT r L r A res r } { RAR 2 } { L A res s SAR Figure 1 – SAR Imaging Infrastructure TI’s Complex FFT Function Table 1: Internal Memory (196KB) Table 2: External Memory (16MB) Blind Test Correlation 0 0.5 1 1.5 2 2.5 3 3.5 4 4.5 x 10 -4 -1 0 1 Chirp signaltransm itted Tim e in seconds Magnitude 0 0.5 1 1.5 2 2.5 3 3.5 4 4.5 x 10 -4 -20 0 20 C hirp signalreceived Tim e in seconds Magnitude 0 0.5 1 1.5 2 2.5 3 3.5 4 4.5 x 10 -4 -0.5 0 0.5 1 C orrelation betw een the chirp signals com puted through IndirectC yclic C onvolution Tim e delay (sec) Magnitude Figure 4: MATLAB Figure 5: Code Composer Studio Corner Turning Operation Table 3: Corner Turning Execution Times *Clock Frequency 225MHz *Clock Frequency 225MHz TI’s Complex FFT function C TI’s Complex FFT function Assembly Number of Points Average Number of Cycles Average Execution Time (s) Average Number of Cycles Average Execution Time (s) 32 4102 1.82E-05 504 2.24E-06 64 9369 4.16E-05 974 4.33E-06 128 21164 9.41E-05 2061 9.16E-06 256 47303 2.10E-04 4579 2.04E-05 512 105850 4.70E-04 11528 5.12E-05 1024 239697 1.07E-03 32860 1.46E-04 2048 522636 2.32E-03 71934 3.19E-04 4096 1130999 5.03E-03 155658 6.92E-04 TI’s Complex FFT function C TI’s Complex FFT function Assembly Number of Points Average Number of Cycles Average Execution Time (s) Average Number of Cycles Average Execution Time (s) 32 32391 1.44E-04 17735 7.88E-05 64 78381 3.48E-04 39666 1.76E-04 128 180840 8.04E-04 89046.39 3.96E-04 256 412667 1.83E-03 199190.27 8.85E-04 512 928654 4.13E-03 443742 1.96E-03 1024 2045460 9.09E-03 966894 4.30E-03 2048 4502977 2.00E-02 2114933.3 9.40E-03 4096 9829573 4.37E-02 4595090 2.04E-02 Corner Turning IRAM (196Kb) Corner Turning SDRAM (16Mb) Number of Points Average Number of Cycles Average Execution Time (s) Average Number of Cycles Average Execution Time (s) 32x32 29976 1.3323E-04 80676.8 3.59E-04 64x64 118264 5.2562E-04 321115.5 1.427E-03 128x128 469944 2.08864E- 03 1280994 5.693E-03 256x256 -- -- 5117224 2.2743E-02 512x512 -- -- 20455588 9.0914E-02 1024x1024 -- -- 73543745 3.26861E- 01 Zero-padding DFT DFT ID FT r T,R [n] Zero-padding s R s T Index R eversal Figure 3 – FFT Based Correlation Algorithm Image Formation Results in MATLAB Figure 6 128X128 Image 20 40 60 80 100 120 20 40 60 80 100 120 20 40 60 80 100 120 20 40 60 80 100 120 20 40 60 80 100 120 20 40 60 80 100 120 20 40 60 80 100 120 20 40 60 80 100 120 Range Compression Azimuth Compression Final Image Raw Data Figure 7 256X256 Image Figure 8 2048X1024 Image 200 400 600 800 1000 1200 1400 1600 1800 2000 100 200 300 400 500 600 700 800 900 1000 200 400 600 800 1000 1200 1400 1600 1800 2000 100 200 300 400 500 600 700 800 900 1000 Range Compression Azimuth Compression Final Image Raw Data 200 400 600 800 1000 1200 1400 1600 1800 2000 100 200 300 400 500 600 700 800 900 1000 100 200 300 400 500 600 700 800 900 1000 200 400 600 800 1000 1200 1400 1600 1800 2000 Range Compression Azimuth Compression Final Image Raw Data 50 100 150 200 250 50 100 150 200 250 50 100 150 200 250 50 100 150 200 250 50 100 150 200 250 50 100 150 200 250 50 100 150 200 250 50 100 150 200 250

Upload: sheena-underwood

Post on 19-Jan-2016

219 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Sponsored By Abstract 1 Ritamar Siurano – Undergraduate Student Prof. Domingo Rodriguez – Advisor Abigail Fuentes – Graduate Student Prof. Ana B. Ramirez

0 0.5 1 1.5 2 2.5 3 3.5 4 4.5

x 10-4

-400

-200

0

200

400

600

800Correlation Output from Code Composer Studio

Time in Seconds

Cor

rela

tion

Nor

mal

ized

Val

ue

Sponsored By

Abstract1

Ritamar Siurano – Undergraduate Student Prof. Domingo Rodriguez – AdvisorAbigail Fuentes – Graduate Student Prof. Ana B. Ramirez – Collaborator RASP Group, ECE Department, AIP Group - UPRM, ICPS Group - UIS University of Puerto Rico at Mayaguez E-mail: [email protected]

Rapid Systems Prototyping Laboratory (RASP) www.ece.uprm.edu/rasp

This work presents the design of DSP support algorithms for synthetic aperture radar (SAR) image formation operations. Computational results are presented for fast Fourier transforms (FFTs), matrix corner turning operations and the convolution process based on FFTs. Correlation implementation of transmitted and received SAR signals are also presented in this work.

Introduction2Synthetic aperture radar (SAR) image formation is a technique for obtaining images of the Earth’s surface through pulsed microwave transmitted and received signals. This system transmits a series of pulses at a fixed repetition rate and it collects the backscattered signals.

Through signal processing techniques the transmitted and received signals are treated by a SAR image formation system to produce an image that is usually enhanced in the azimuth direction when compared with standard real (vs. synthetic) aperture images. The main benefit of using a SAR instead of a RAR is that the length of the antenna is significantly reduced to obtain a more detailed image.

Methodology3The following procedure was used for the implementation of the algorithms: i) A TMS320C6713 DSP Starter Kit (DSK) was utilized as development platform; ii) The TMS320C6713 DSP(figure2) was configured to test the various FFT algorithms; iii) These FFT algorithms were used to develop the indirect convolution process, the correlation algorithm(figure3) and corner turning implementation; iv) Computational results were obtained in terms of number of cycles and execution times; v) Range and Azimuth compression algorithms were developed using MATLAB.

Results4

Conclusions5This work presents the results for implementation efforts of FFT and of corner turning algorithms on the TMS320C6713 DSP unit. For these algorithms, the execution times obtained on the DSP unit were faster using internal memory. It also validates correlation algorithm results from CCS, and presents the image formation algorithms using range and azimuth compression in MATLAB.

References6[1] A. Ramirez, M. Rodriguez, D. Rodriguez, “TMS320C6713 User’s Guide, ”University of Puerto Rico Mayaguez Campus, Mayaguez, Puerto Rico, 2007.

[2] R. Chassaing, Digital Signal Processing and Application with the C6713 and C6416 DSK, Wiley-Interscience, John Wiley & Sons, Inc., NY, 2005.

DSP Implementation of SAR Support Algorithms

Figure 2 (a) – TMS320C6713 Board

sin2

}{c

Rres

Range ResolutionRange Resolution

Azimuth ResolutionAzimuth Resolution

RADARTRAJECTORY

RADARFOOTPRINT

RADAR PULSE

L

swath

Courtesy of RADARSAT

r

L

rAres r

}{RAR

2}{L

Ares s SAR

Figure 1 – SAR Imaging Infrastructure

TI’s Complex FFT Function

Table 1: Internal Memory (196KB)

Table 2: External Memory (16MB)

Blind Test Correlation

0 0.5 1 1.5 2 2.5 3 3.5 4 4.5

x 10-4

-1

0

1Chirp signal transmitted

Time in seconds

Mag

nitu

de

0 0.5 1 1.5 2 2.5 3 3.5 4 4.5

x 10-4

-20

0

20Chirp signal received

Time in seconds

Mag

nitu

de

0 0.5 1 1.5 2 2.5 3 3.5 4 4.5

x 10-4

-0.5

0

0.5

1Correlation between the chirp signals computed through Indirect Cyclic Convolution

Time delay (sec)

Mag

nitu

de

Figure 4: MATLAB

Figure 5: Code Composer Studio

Corner Turning Operation

Table 3: Corner Turning Execution Times

*Clock Frequency 225MHz

*Clock Frequency 225MHz

TI’s Complex FFT functionC

TI’s Complex FFT functionAssembly

Number of Points

Average Number of

Cycles

Average Execution

Time(s)

Average Number of

Cycles

Average Execution

Time(s)

32 4102 1.82E-05 504 2.24E-0664 9369 4.16E-05 974 4.33E-06128 21164 9.41E-05 2061 9.16E-06256 47303 2.10E-04 4579 2.04E-05512 105850 4.70E-04 11528 5.12E-051024 239697 1.07E-03 32860 1.46E-042048 522636 2.32E-03 71934 3.19E-044096 1130999 5.03E-03 155658 6.92E-04

TI’s Complex FFT functionC

TI’s Complex FFT functionAssembly

Number of Points

Average Number of

Cycles

Average Execution

Time(s)

Average Number of

Cycles

Average Execution

Time(s)

32 32391 1.44E-04 17735 7.88E-0564 78381 3.48E-04 39666 1.76E-04128 180840 8.04E-04 89046.39 3.96E-04256 412667 1.83E-03 199190.27 8.85E-04512 928654 4.13E-03 443742 1.96E-031024 2045460 9.09E-03 966894 4.30E-032048 4502977 2.00E-02 2114933.3 9.40E-034096 9829573 4.37E-02 4595090 2.04E-02

Corner TurningIRAM (196Kb)

Corner TurningSDRAM (16Mb)

Number of Points

Average Number of

Cycles

Average Execution

Time(s)

Average Number of

Cycles

Average Execution

Time(s)

32x32 29976 1.3323E-04 80676.8 3.59E-0464x64 118264 5.2562E-04 321115.5 1.427E-03128x128 469944 2.08864E-03 1280994 5.693E-03256x256 -- -- 5117224 2.2743E-02512x512 -- -- 20455588 9.0914E-021024x1024 -- -- 73543745 3.26861E-01

Zero-padding DFT

DFT

IDFT

rT,R [n]

Zero-padding

sR

sT Index Reversal

Figure 3 – FFT Based Correlation Algorithm

Image Formation Results in MATLABFigure 6 128X128 Image

20 40 60 80 100 120

20

40

60

80

100

120

20 40 60 80 100 120

20

40

60

80

100

120

20 40 60 80 100 120

20

40

60

80

100

120

20 40 60 80 100 120

20

40

60

80

100

120

Range Compression

Azimuth Compression

Final Image

Raw Data

Figure 7 256X256 Image Figure 8 2048X1024 Image

200 400 600 800 1000 1200 1400 1600 1800 2000

100

200

300

400

500

600

700

800

900

1000

200 400 600 800 1000 1200 1400 1600 1800 2000

100

200

300

400

500

600

700

800

900

1000

Range Compression

Azimuth Compression

Final Image

Raw Data

200 400 600 800 1000 1200 1400 1600 1800 2000

100

200

300

400

500

600

700

800

900

1000

100 200 300 400 500 600 700 800 900 1000

200

400

600

800

1000

1200

1400

1600

1800

2000

Range Compression

Azimuth Compression

Final Image

Raw Data

50 100 150 200 250

50

100

150

200

250

50 100 150 200 250

50

100

150

200

250

50 100 150 200 250

50

100

150

200

250

50 100 150 200 250

50

100

150

200

250