1 11th DSP Workshop Taos Ski Valley, NM 2004 Centered Discrete Fractional Fourier Transform & Linear Chirp Signals Balu Santhanam & Juan G. Vargas- Rubio.

Slides:



Advertisements
Similar presentations
DCSP-13 Jianfeng Feng Department of Computer Science Warwick Univ., UK
Advertisements

ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: The Linear Prediction Model The Autocorrelation Method Levinson and Durbin.
Beamforming Issues in Modern MIMO Radars with Doppler
Digital Kommunikationselektronik TNE027 Lecture 5 1 Fourier Transforms Discrete Fourier Transform (DFT) Algorithms Fast Fourier Transform (FFT) Algorithms.
IGARSS 2011, July , Vancouver, Canada Demonstration of Target Vibration Estimation in Synthetic Aperture Radar Imagery Qi Wang 1,2, Matthew Pepin.
Fast Bayesian Matching Pursuit Presenter: Changchun Zhang ECE / CMR Tennessee Technological University November 12, 2010 Reading Group (Authors: Philip.
Compressed sensing Carlos Becker, Guillaume Lemaître & Peter Rennert
Linear Transformations
Motion Analysis Slides are from RPI Registration Class.
7th IEEE Technical Exchange Meeting 2000 Hybrid Wavelet-SVD based Filtering of Noise in Harmonics By Prof. Maamar Bettayeb and Syed Faisal Ali Shah King.
Random Convolution in Compressive Sampling Michael Fleyer.
Basic Concepts and Definitions Vector and Function Space. A finite or an infinite dimensional linear vector/function space described with set of non-unique.
6 1 Linear Transformations. 6 2 Hopfield Network Questions.
Eigen-decomposition of a class of Infinite dimensional tridiagonal matrices G.V. Moustakides: Dept. of Computer Engineering, Univ. of Patras, Greece B.
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
Boot Camp in Linear Algebra Joel Barajas Karla L Caballero University of California Silicon Valley Center October 8th, 2008.
Orthogonal Transforms
Presenter: Hong Wen-Chih 2015/8/11. Outline Introduction Definition of fractional fourier transform Linear canonical transform Implementation of FRFT/LCT.
Introduction of Fractional Fourier Transform (FRFT) Speaker: Chia-Hao Tsai Research Advisor: Jian-Jiun Ding Digital Image and Signal Processing Lab Graduate.
Discrete Time Periodic Signals A discrete time signal x[n] is periodic with period N if and only if for all n. Definition: Meaning: a periodic signal keeps.
AGC DSP AGC DSP Professor A G Constantinides 1 Digital Filter Specifications Only the magnitude approximation problem Four basic types of ideal filters.
Sparsity-Aware Adaptive Algorithms Based on Alternating Optimization and Shrinkage Rodrigo C. de Lamare* + and Raimundo Sampaio-Neto * + Communications.
Linear Algebra and Image Processing
Function approximation: Fourier, Chebyshev, Lagrange
MIMO Multiple Input Multiple Output Communications © Omar Ahmad
Discrete-Time and System (A Review)
1 7.1 Discrete Fourier Transform (DFT) 7.2 DFT Properties 7.3 Cyclic Convolution 7.4 Linear Convolution via DFT Chapter 7 Discrete Fourier Transform Section.
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
Summarized by Soo-Jin Kim
8.1 Vector spaces A set of vector is said to form a linear vector space V Chapter 8 Matrices and vector spaces.
-1- ICA Based Blind Adaptive MAI Suppression in DS-CDMA Systems Malay Gupta and Balu Santhanam SPCOM Laboratory Department of E.C.E. The University of.
Lecture 22 MA471 Fall Advection Equation Recall the 2D advection equation: We will use a Runge-Kutta time integrator and spectral representation.
6 1 Linear Transformations. 6 2 Hopfield Network Questions The network output is repeatedly multiplied by the weight matrix W. What is the effect of this.
Transforms. 5*sin (2  4t) Amplitude = 5 Frequency = 4 Hz seconds A sine wave.
Lecture 12: Introduction to Discrete Fourier Transform Sections 2.2.3, 2.3.
Lecture 22 - Exam 2 Review CVEN 302 July 29, 2002.
Matrices. Definitions  A matrix is an m x n array of scalars, arranged conceptually as m rows and n columns.  m is referred to as the row dimension.
Texture scale and image segmentation using wavelet filters Stability of the features Through the study of stability of the eigenvectors and the eigenvalues.
Part I: Image Transforms DIGITAL IMAGE PROCESSING.
School of Electrical & Computer Engineering Image Denoising Using Steerable Pyramids Alex Cunningham Ben Clarke Dy narath Eang ECE November 2008.
Adaptive Fourier analysis based on the Walsh Hadamard transformation is a further development of the transform domain AFA presented Instead of the recursive.
Real time DSP Professors: Eng. Julian S. Bruno Eng. Jerónimo F. Atencio Sr. Lucio Martinez Garbino.
Wavelets and Multiresolution Processing (Wavelet Transforms)
Z TRANSFORM AND DFT Z Transform
ECE 5525 Osama Saraireh Fall 2005 Dr. Veton Kepuska
Motivation: Wavelets are building blocks that can quickly decorrelate data 2. each signal written as (possibly infinite) sum 1. what type of data? 3. new.
Digital Signal Processing
The Fractional Fourier Transform and Its Applications Presenter: Pao-Yen Lin Research Advisor: Jian-Jiun Ding, Ph. D. Assistant professor Digital Image.
Doc.: IEEE /1398r0 Submission November 2014 Slide 1 Shiwen He, Haiming Wang Preamble Sequence for IEEE aj (45GHz) Authors/contributors:
WAVELET AND IDENTIFICATION WAVELET AND IDENTIFICATION Hamed Kashani.
Orthogonal Transforms (Haar, Hartley) Algorithm Student: Payman Dehghanian Instructor: Prof. Mladen Kezunovic Course: ECEN679-Computer Relaying March,
Chapter 13 Discrete Image Transforms
Compressive Sensing Techniques for Video Acquisition EE5359 Multimedia Processing December 8,2009 Madhu P. Krishnan.
Boot Camp in Linear Algebra TIM 209 Prof. Ram Akella.
1 SYSTEM OF LINEAR EQUATIONS BASE OF VECTOR SPACE.
Signal Prediction and Transformation Trac D. Tran ECE Department The Johns Hopkins University Baltimore MD
Image Transformation Spatial domain (SD) and Frequency domain (FD)
Chapter 7. Classification and Prediction
Introduction to Transforms
Matrices and vector spaces
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
Digital Image Procesing Discrete Walsh Trasform (DWT) in Image Processing Discrete Hadamard Trasform (DHT) in Image Processing DR TANIA STATHAKI READER.
4.1 DFT In practice the Fourier components of data are obtained by digital computation rather than by analog processing. The analog values have to be.
Z TRANSFORM AND DFT Z Transform
Principal Component Analysis
Preamble Sequence for aj(45GHz)
Lecture 17 DFT: Discrete Fourier Transform
1-D DISCRETE COSINE TRANSFORM DCT
Signal Processing on Graphs: Performance of Graph Structure Estimation
Digital Image Processing
Presentation transcript:

1 11th DSP Workshop Taos Ski Valley, NM 2004 Centered Discrete Fractional Fourier Transform & Linear Chirp Signals Balu Santhanam & Juan G. Vargas- Rubio SPCOM Laboratory, Department of E.C.E. University of New Mexico, Albuquerque

2 11th DSP Workshop Taos Ski Valley, NM 2004 ABSTRACT Centered discrete fractional Fourier transform (CDFRFT), based on the Grünbaum commutor produces a impulse-like transform for discrete linear chirp signals. Relationship between chirp rate & angle of the transform approximated by a simple tangent function. Multi-angle CDFRFT computed using the FFT & used to estimate the chirp rate of monocomponent & two- component chirps.

3 11th DSP Workshop Taos Ski Valley, NM 2004 Why Grunbaum eigenvectors? Grünbaum tridiagonal commutor converges to Hermite--Gauss differential operator as N ! 1 Grünbaum commutor furnishes a full orthogonal basis of eigenvectors independent of N. Grünbaum eigenvectors are better approximations to Hermite-Gauss functions. Corresponding CDFRFT is efficient in concentrating a discrete linear chirp signal.

4 11th DSP Workshop Taos Ski Valley, NM 2004 The Centered DFRFT Define CDFRFT for parameter  as:  V T  matrix of Grünbaum eigenvectors.     diagonal matrix with elements k =e -jk   CDFRFT in terms of the individual eigenvectors v k via single expression for N even or odd :

5 11th DSP Workshop Taos Ski Valley, NM 2004 Concentrating a linear chirp CDFRFT of the chirp  =102° DFT of the chirp

6 11th DSP Workshop Taos Ski Valley, NM 2004 Concentrating a linear chirp Number of coefficients that capture 50% of the energy for signals with average frequency zero (N=128) Number of coefficients that capture 50% of the energy for signals with average frequency  /2 (N=128)

7 11th DSP Workshop Taos Ski Valley, NM 2004 Basis vectors of the CDFRFT Row index Angle (real part)

8 11th DSP Workshop Taos Ski Valley, NM 2004 IF of CDFRFT basis vectors IF estimates of the rows of the CDFRFT for  =5° IF estimates of the rows of the CDFRFT for  =85°

9 11th DSP Workshop Taos Ski Valley, NM 2004 Chirp rate Vs. angle  The chirp rate can be approximated by:

10 11th DSP Workshop Taos Ski Valley, NM 2004 Better accuracy for c r has an error slightly larger than 10%. Restricting the angle to the range 45° to 135°: The empirical relation: produces an error of less than 2% if we use the exact value of a at which the maximum occurs.

11 11th DSP Workshop Taos Ski Valley, NM 2004 Multi-angle CDFRFT The CDFRFT of a signal x[n] can be written as: For the set of equally spaced angles the CDFRFT can be rewritten using index r as Multi-angle CDFRFT (MA-CDFRFT) is a DFT & can be computed using the FFT algorithm.

12 11th DSP Workshop Taos Ski Valley, NM 2004 MA-CDFRFT: chirp rate Vs. Frequency representation

13 11th DSP Workshop Taos Ski Valley, NM 2004 Chirp rate estimation: monocomponent chirp Peak occurs at r=36 that corresponds to  = The value for the chirp rate obtained from the second empirical relation is Note that we are not obtaining the exact value of . The actual chirp rate of the signal is

14 11th DSP Workshop Taos Ski Valley, NM 2004 Chirp rate estimation: two component chirp Peaks occur at r=27 and r=36 that correspond to  = and  = respectively. The values for the chirp rate obtained from the second empirical relation are and The actual chirp rates of the signal are and

15 11th DSP Workshop Taos Ski Valley, NM 2004 Chirp rate estimation: three component chirp Peaks occur at r=24, r=30 and r=36 that correspond to  =1.1781,  = and  = respectively. The values for the chirp rate obtained from the second empirical relation are , and The actual chirp rates of the signal are , and

16 11th DSP Workshop Taos Ski Valley, NM 2004 MA-CDFRFT: nonzero average frequency Zero averageNonzero average

17 11th DSP Workshop Taos Ski Valley, NM 2004 Chirp rate estimation: Noisy chirps Noiseless3dB SNR

18 11th DSP Workshop Taos Ski Valley, NM 2004 Conclusions CDFRFT based on the Grünbaum commuting matrix can concentrate a linear chirp signal in a few coefficients. Multiangle version of the CDFRFT can be computed efficiently using the FFT algorithm. Empirical relations that relate the chirp rate & the angle of the CDFRFT that produces an impulse-like transform were developed. Multi-angle CDFRFT can be applied to chirp rate estimation of mono & multicomponent signals including noisy chirps.

19 11th DSP Workshop Taos Ski Valley, NM 2004 References B. Santhanam and J. H. McClellan, “The Discrete Rotational Fourier Transform,” IEEE Trans. Sig. Process., Vol. 44, No. 4, pp , S. Pei, M. Yeh, C. Tseng, “Discrete Fractional Fourier Transform Based on Orthogonal Projections,” IEEE Trans. Sig. Process., Vol. 47, No. 5, pp , May C. Candan, M. A. Kutay, H. M. Ozatkas, “The Discrete Fractional Fourier Transform,” IEEE Trans. Sig. Process., Vol. 48, No. 5, pp , D. H. Mugler and S. Clary, “Discrete Hermite Functions and The Fractional Fourier Transform," in Proc. Int. Conf. Sampl. Theo. And Appl. Orlando Fl, pp , S. Clary and D. H. Mugler, "Shifted Fourier Matrices and Their Tridiagonal Commutors," SIAM Jour. Matr. Anal. & Appl., Vol. 24, No. 3, pp , B. Santhanam and J. G. Vargas-Rubio, “On the Grünbaum Commutor Based Discrete Fractional Fourier Transform,” Proc. of ICASSP04, Vol. II, pp , Montreal, J. G. Vargas-Rubio and B. Santhanam, “Fast and Efficient Computation of a Class of Discrete Fractional Fourier Transforms,” Submitted Sig. Process. Lett., March 2004.