Warped, Chirp Z-Transform: Radar Signal Processing

Similar documents
The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j

The Z-Transform. Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer, and Buck, Prentice Hall Inc.

Generalizing the DTFT. The z Transform. Complex Exponential Excitation. The Transfer Function. Systems Described by Difference Equations

Chapter 7: The z-transform. Chih-Wei Liu

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement

Chapter 1. Complex Numbers. Dr. Pulak Sahoo

Fall 2011, EE123 Digital Signal Processing

ADVANCED DIGITAL SIGNAL PROCESSING

6.003 Homework #3 Solutions

Course Outline. Designing Control Systems. Proportional Controller. Amme 3500 : System Dynamics and Control. Root Locus. Dr. Stefan B.

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Chapter 8. DFT : The Discrete Fourier Transform

Complex Algorithms for Lattice Adaptive IIR Notch Filter

The z-transform can be used to obtain compact transform-domain representations of signals and systems. It

Frequency Response of FIR Filters

Chapter 7 z-transform

1the 1it is said to be overdamped. When 1, the roots of

Finite-length Discrete Transforms. Chapter 5, Sections

FIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser

from definition we note that for sequences which are zero for n < 0, X[z] involves only negative powers of z.

Ch3 Discrete Time Fourier Transform

Signal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform

Frequency Domain Filtering

Direction of Arrival Estimation Method in Underdetermined Condition Zhang Youzhi a, Li Weibo b, Wang Hanli c

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science. BACKGROUND EXAM September 30, 2004.

(s)h(s) = K( s + 8 ) = 5 and one finite zero is located at z 1

Exponential Moving Average Pieter P

Solution of Differential Equation from the Transform Technique

Polynomial Multiplication and Fast Fourier Transform

Introduction to Digital Signal Processing

Question1 Multiple choices (circle the most appropriate one):

METHOD OF FUNDAMENTAL SOLUTIONS FOR HELMHOLTZ EIGENVALUE PROBLEMS IN ELLIPTICAL DOMAINS

Definition of z-transform.

4.3 Growth Rates of Solutions to Recurrences

Discrete-Time Signals and Systems. Signals and Systems. Digital Signals. Discrete-Time Signals. Operations on Sequences: Basic Operations

DIGITAL SIGNAL PROCESSING LECTURE 3

Modified Ratio Estimators Using Known Median and Co-Efficent of Kurtosis

Run-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE

EE Midterm Test 1 - Solutions

Wavelet Transform and its relation to multirate filter banks

x[0] x[1] x[2] Figure 2.1 Graphical representation of a discrete-time signal.

Module 18 Discrete Time Signals and Z-Transforms Objective: Introduction : Description: Discrete Time Signal representation

Research Article Health Monitoring for a Structure Using Its Nonstationary Vibration

Linear time invariant systems

MAXIMALLY FLAT FIR FILTERS

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course

Estimation of Population Mean Using Co-Efficient of Variation and Median of an Auxiliary Variable

Formation of A Supergain Array and Its Application in Radar

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

Chapter 2 Systems and Signals

1 1 2 = show that: over variables x and y. [2 marks] Write down necessary conditions involving first and second-order partial derivatives for ( x0, y

Solutions of Chapter 5 Part 1/2

Ellipsoid Method for Linear Programming made simple

Computational Tutorial of Steepest Descent Method and Its Implementation in Digital Image Processing

Review of Discrete-time Signals. ELEC 635 Prof. Siripong Potisuk

Solutions. Number of Problems: 4. None. Use only the prepared sheets for your solutions. Additional paper is available from the supervisors.

Discrete-Time Signals and Systems. Discrete-Time Signals and Systems. Signal Symmetry. Elementary Discrete-Time Signals.

The Mathematical Model and the Simulation Modelling Algoritm of the Multitiered Mechanical System

Signal Processing in Mechatronics

Quantum Annealing for Heisenberg Spin Chains

On Orlicz N-frames. 1 Introduction. Renu Chugh 1,, Shashank Goel 2

COMM 602: Digital Signal Processing

OPTIMAL PIECEWISE UNIFORM VECTOR QUANTIZATION OF THE MEMORYLESS LAPLACIAN SOURCE

Vibratory Motion. Prof. Zheng-yi Feng NCHU SWC. National CHung Hsing University, Department of Soil and Water Conservation

A. Basics of Discrete Fourier Transform

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series

The Discrete Fourier Transform

Digital signal processing: Lecture 5. z-transformation - I. Produced by Qiangfu Zhao (Since 1995), All rights reserved

The Z-Transform. (t-t 0 ) Figure 1: Simplified graph of an impulse function. For an impulse, it can be shown that (1)

Section 1.1. Calculus: Areas And Tangents. Difference Equations to Differential Equations

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

Numerical Conformal Mapping via a Fredholm Integral Equation using Fourier Method ABSTRACT INTRODUCTION

Chapter 2 Feedback Control Theory Continued

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.

Introduction to Signals and Systems, Part V: Lecture Summary

The z transform is the discrete-time counterpart of the Laplace transform. Other description: see page 553, textbook.

Block-by Block Convolution, FFT/IFFT, Digital Spectral Analysis

j=1 dz Res(f, z j ) = 1 d k 1 dz k 1 (z c)k f(z) Res(f, c) = lim z c (k 1)! Res g, c = f(c) g (c)

University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences

Fourier and Periodogram Transform Temperature Analysis in Soil

ECEN 644 HOMEWORK #5 SOLUTION SET

Research Article Health Monitoring for a Structure Using Its Nonstationary Vibration

2.004 Dynamics and Control II Spring 2008

Chapter 3. z-transform

Pipelined and Parallel Recursive and Adaptive Filters

Lecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016

Internal Information Representation and Processing

Module 2: z-transform and Discrete Systems

Discrete Orthogonal Moment Features Using Chebyshev Polynomials

Classroom. We investigate and further explore the problem of dividing x = n + m (m, n are coprime) sheep in

Orthogonal Gaussian Filters for Signal Processing

2D DSP Basics: 2D Systems

BIBECHANA A Multidisciplinary Journal of Science, Technology and Mathematics

BUSINESS STATISTICS (PART-9) AVERAGE OR MEASURES OF CENTRAL TENDENCY: THE GEOMETRIC AND HARMONIC MEANS

Signals & Systems Chapter3

Chapter 9 - CD companion 1. A Generic Implementation; The Common-Merge Amplifier. 1 τ is. ω ch. τ io

Written exam Digital Signal Processing for BMT (8E070). Tuesday November 1, 2011, 09:00 12:00.

POWER AKASH DISTRIBUTION AND ITS APPLICATION

Transcription:

arped, Chirp Z-Trasform: Radar Sigal Processig by Garimella Ramamurthy Report o: IIIT/TR// Cetre for Commuicatios Iteratioal Istitute of Iformatio Techology Hyderabad - 5 3, IDIA Jauary

ARPED, CHIRP Z TRASFORM : RADAR SIGAL PROCESSIG Garimella Rama Murthy, Associate Professor, Iteratioal Istitute of Iformatio Techology, Gachibowli, Hyderabad 3, AP, Idia ABSTRACT It is well realied that arped Discrete Fourier Trasform has bee utilied i may sigal processig applicatios. Also, Chirp Z Trasform algorithm eables samplig the trasform of a fiite legth sequece o a spiral cotour. Combiig the advatages of these trasforms, the author iovated the cocept of arped, Chirp Z trasform. Applicatio to radar sigal processig is briefly discussed. Itroductio: Fourier aalysis has bee successfully utilied i may braches of egieerig ad sciece. Particularly, i the research area of digital sigal processig, Fourier aalysis of discrete time sigals was etesively studied ad may iterestig results / algorithms were developed. Specifically Z trasform cocept is proposed as a geeraliatio of discrete time Fourier trasform. It is realied that Fast Fourier Trasform algorithm ca be utilied for efficiet computatio of samples of the trasform of a fiite legth sequece tae at equally spaced poits aroud the uit circle [OpS]. e may be iterested i samplig the trasform o a cotour other tha the uit circle or we may ot require samples of the trasform over the etire uit circle. ith this motivatio, researchers proposed the Chirp Z Tasform CZT algorithm [OpS]. Also, researchers proposed the cocept of arped Discrete Fourier Trasform DFT which eables samplig the trasform at o uiformly spaced poits o the uit circle [Mitra]. After carefully uderstadig the logical basis of CZT ad DFT, the author proposed the cocept of arped Chirp Z trasform CZT i this paper. This trasform eables

samplig the trasform at o uiformly spaced poits o may iterestig cotours i the plae. Based o well ow ideas, this ovel trasform is proposed for applicatio i radar sigal processig. This research paper is orgaied as follows. I Sectio, the cocept of arped Discrete Fourier Trasform is discussed. I Sectio 3, the Chirp Z Trasform is briefly summaried. I Sectio 4, the ovel cocept of arped Chirp Z trasform is proposed. Applicatio of CZT to radar sigal processig is briefly discussed i Sectio 5. The research paper cocludes i Sectio 6.. arped, Discrete Fourier Trasform: Let us first review the Discrete Fourier Trasform DFT. The followig discussio is etracted from [Mitra]. It is well ow that the poit DFT X [ ],, of a sequece of legth, [ ],, is defied as X[ ] X j π,... where X is the Z trasform of the sequece []. It is give by e X [ ].. The descriptio of the iovative idea of warped discrete Fourier trasform requires the followig cocept of all pass fuctio.. All Pass Fuctios: ω The frequecy respose A e j of a all pass filter A ehibits uit magitude respose at all frequecies i.e. ω A e j for all ω...3 The trasfer fuctio A of such a filter has poles ad eros occurrig i cojugate reciprocal pairs: M * jθ λ A e..4 λ To esure stability, it is assumed that all the poles of A lie iside the uit circle i.e. λ < for all.5

If A is a real coefficiet all pass fuctio, the θ or θ π, ad ay comple pole at λ must be * accompaied by a comple cojugate pole at λ. Thus, i this case A ca be epressed as A D D D M..6 ow we relate the above discussio to that of Discrete Fourier Trasform. The result will be a iterestig trasform called the arped Discrete Fourier Trasform DFT: arped Discrete Fourier Trasform DFT: The poit DFT X [] of a legth [ is give by the equally spaced frequecy sequece ] samples of a modified Z trasform X by applyig the trasformatio X obtaied from C.7 where C is a M th order real coefficiet all pass fuctio as discussed above. It should be oted that the all pass fuctio warps the frequecy scale. Thus, uiformly spaced samples o the uit circle i the plae are mapped oto ouiformly spaced poits o the uit circle i the plae. e readily have that Hece we have X [ ] C P X [ ] Q j π e j π e P Q.8 P[ ],.9 Q[ ] where P [ ] ad Q[ ] are poit Discrete Fourier Trasforms. Also Q [] does ot deped o [] ad ca be pre computed. Applicatios: arped Discrete Fourier Trasform DFT was successfully utilied i may sigal processig applicatios. Some of them iclude i Spectral Aalysis: Usig a short legth DFT, higher frequecy resolutio is achieved. ii Tuable FIR filter desig

iii ouiform perfect recostructio filter ba desig. 3. Chirp Z Trasform : The chirp trasform algorithm is directed toward computatio of samples of the trasform o a spiral cotour equally spaced i agle over some portio of the spiral. The followig discussio is tae from [OpS]. To be precise, let desigate a poit sequece ad X desigate its trasform. Usig the chirp trasform algorithm, X ca be computed at the poits give by A,,, M where.3. jφ e ad.3. jθ A A e 3.3 I the above equatios, ad A are positive real umbers. Cosequetly, the cotour alog which samples are obtaied is a spiral i the plae. The parameter cotrols the rate at which the cotour spirals: if is greater tha uity, the cotour spirals toward the origi as icreases, ad if is less tha uity, the cotour spirals outward as icreases. The parameters A ad θ are the locatio i radius ad agle, respectively, of the first sample, i.e. for. The remaiig samples are located alog the spiral cotour with a agular spacig of φ. Cosequetly, if, the spiral is, ifact, a circular arc ad also if A, this circular arc is part of the uit circle. 4. arped, Chirp Z Trasform: The mai cotributio of this research paper is to propose the iovative idea of combiig the trasforms proposed i sectios ad 3. e first cosider oe possible way of combiig warpig the frequecy scale ad chirpig. The other possibility is briefly discussed at the ed of this sectio. Thus, we are aturally led to the followig sequece of ideas. For the purpose of clarity, we utilie the same otatio as that proposed i Sectio. Specifically, we have that

] [ C X Q P.4. ow usig the idea of sectio 3, the warped chirp trasform is computed i the followig maer: A A A D P X Y.4. Thus, i this case, the frequecy scale is first warped ad the usig the idea of chirp trasform algorithm, X is computed at fiitely may poits o a spiral cotour. The other approach is to evaluate the trasform o a spiral cotour first ad the warp the frequecy scale. 5. Applicatio to Radar Sigal Processig: To uderstad the utility of warped chirp trasform, we eed to tae a closer loo at the chirp trasform algorithm. The followig iterpretatio is well documeted i [OpS]. ith the values of give by a equatio of the form i 3., we readily have that X.,,,...,, M A 5. Usig the followig idetity ] [ +,..5. Equatio 5. ca be rewritte as. A A X 5.3 ow lettig A g,. 5.4 e readily have that

X g,,,,..., M... 5.5 I the above epressio, we recogie that the summatio term as correspodig to the covolutio of the sequece g with the sequece. Thus the computatio of equatio 5.5 is as depicted i the followig Figure, where h. Figure : Spectrum Aalysis i Radar usig CZT he A ad are uity, the sequece h ca be thought of as a comple epoetial sequece with liearly icreasig frequecy. I radar systems, such sigals are called chirp sigals. A system similar to the oe i the above figure is commoly used for spectrum aalysis i radar problems. Usig the ovel arped Chirp Z trasform, we propose to develop high resolutio spectral aalysis for applicatio i radar problems. 6. Coclusios: I this research paper, the well uderstood cocepts of arped Discrete Fourier Trasform DFT as well as Chirp Z Trasform CZT are summaried. Combiig the advatages of these trasforms, a ovel trasform called arped

Chirp Z Trasform is iovated. It is epected that this ovel trasform will fid may applicatios i sigal processig. Refereces: [OpS] A.V. Oppeheim ad R..Schafer, Digital Sigal Processig, Pretice Hall of Idia Private Limited, ew Delhi, [Mitra] S.K.Mitra, Digital Allpass Filter : A Versatile Sigal Processig Buildig Bloc, Ivited Tal delivered at the Iteratioal Coferece o Recet Advaces i Commuicatio Egieerig RACE 8, Osmaia Uiversity December 3, 8.