Discrete Linear Canonical Transforms An Operator Theory Approach

Slides:



Advertisements
Similar presentations
DFT & FFT Computation.
Advertisements

Signal Processing in the Discrete Time Domain Microprocessor Applications (MEE4033) Sogang University Department of Mechanical Engineering.
Test of the Stefan-Boltzmann behavior for T>0 at tree-level of perturbation theory on the lattice DESY Summer Student 2010 Carmen Ka Ki Li Imperial College.
Fourier Transform and its applications.
Digital Image Processing, 2nd ed. www. imageprocessingbook.com © 2001 R. C. Gonzalez & R. E. Woods 1 Objective To provide background material in support.
Anuj Dawar.
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.
Chapter 12 Fast Fourier Transform. 1.Metropolis algorithm for Monte Carlo 2.Simplex method for linear programming 3.Krylov subspace iteration (CG) 4.Decomposition.
Topic 7 - Fourier Transforms DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
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.
THE LAPLACE TRANSFORM LEARNING GOALS Definition The transform maps a function of time into a function of a complex variable Two important singularity functions.
Lecture 22 MA471 Fall Advection Equation Recall the 2D advection equation: We will use a Runge-Kutta time integrator and spectral representation.
Transforms. 5*sin (2  4t) Amplitude = 5 Frequency = 4 Hz seconds A sine wave.
(Lecture #08)1 Digital Signal Processing Lecture# 8 Chapter 5.
CS654: Digital Image Analysis Lecture 12: Separable Transforms.
Fourier Series. Introduction Decompose a periodic input signal into primitive periodic components. A periodic sequence T2T3T t f(t)f(t)
1 Fourier Representations of Signals & Linear Time-Invariant Systems Chapter 3.
Seismic Reflection Data Processing and Interpretation A Workshop in Cairo 28 Oct. – 9 Nov Cairo University, Egypt Dr. Sherif Mohamed Hanafy Lecturer.
Digital Signal Processing Chapter 3 Discrete transforms.
Z TRANSFORM AND DFT Z Transform
Motivation Thus far we have dealt primarily with the input/output characteristics of linear systems. State variable, or state space, representations describe.
THE LAPLACE TRANSFORM LEARNING GOALS Definition
Fourier Analysis of Signals and Systems
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
BART VANLUYTEN, JAN C. WILLEMS, BART DE MOOR 44 th IEEE Conference on Decision and Control December 2005 Model Reduction of Systems with Symmetries.
CS654: Digital Image Analysis
The Fractional Fourier Transform and Its Applications Presenter: Pao-Yen Lin Research Advisor: Jian-Jiun Ding, Ph. D. Assistant professor Digital Image.
ANALYTIC SIGNALS AND RADAR PROCESSING Wayne M. Lawton Department of Mathematics National University of Singapore Block S14, 10 Kent Ridge Road Singapore.
Lecture 5 – 6 Z - Transform By Dileep Kumar.
Laplace Transforms of Linear Control Systems Eng R. L. Nkumbwa Copperbelt University 2010.
Digital Image Processing, 2nd ed. www. imageprocessingbook.com © 2001 R. C. Gonzalez & R. E. Woods 1 Review: Linear Systems Some Definitions With reference.
1 Chapter 8 The Discrete Fourier Transform (cont.)
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Jean Baptiste Joseph Fourier
Section II Digital Signal Processing ES & BM.
DIGITAL SIGNAL PROCESSING ELECTRONICS
An Example of 1D Transform with Two Variables
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Chapter 12 Fast Fourier Transform
Lecture 4: Imaging Theory (2/6) – One-dimensional Fourier transforms
A.S. Parvan BLTP, JINR, Dubna DFT, IFIN-HH, Bucharest
Biomedical Signal processing Chapter 1 Introduction
Recap: Chapters 1-7: Signals and Systems
Chapter 15 Introduction to the Laplace Transform
Chapter 2. Fourier Representation of Signals and Systems
UNIT II Analysis of Continuous Time signal
Feedback Control Systems (FCS)
Quantum One.
2D Fourier transform is separable
EE 638: Principles of Digital Color Imaging Systems
Biomedical Signal processing Chapter 1 Introduction
Research Methods in Acoustics Lecture 9: Laplace Transform and z-Transform Jonas Braasch.
Z TRANSFORM AND DFT Z Transform
Double random fractional Fourier-domain encoding for optical security
Modeling in the Time Domain
The Fractional Fourier Transform and Its Applications
Z-Transform ENGI 4559 Signal Processing for Software Engineers
8. Stability, controllability and observability
Signals & Systems (CNET - 221) Chapter-5 Fourier Transform
Chapter 8 The Discrete Fourier Transform
 = N  N matrix multiplication N = 3 matrix N = 3 matrix N = 3 matrix
Signals and Systems Revision Lecture 1
Signals and Systems EE235 Leo Lam ©
Linear Systems Review Objective
LECTURE 11: FOURIER TRANSFORM PROPERTIES
پردازش تصاویر دیجیتالی
THE LAPLACE TRANSFORM LEARNING GOALS Definition
Presentation transcript:

Discrete Linear Canonical Transforms An Operator Theory Approach Aykut Koç and Haldun M. Ozaktas 30/06/2018

Outline Fractional Fourier Transform (FRT) Linear Canonical Transforms (LCTs) Previous Definitions Hyperdifferential Operator Theory Based DLCT The Iwasawa Decomposition The Hyperdifferential Forms The Operator Theory based DLCT Properties of Discrete Transform Results & Conclusions

Fractional Fourier Transform (FRT) Generalization to FT Fourier transform: π/2+2nπ Inverse Fourier transform: -π/2+2nπ Parity: –π+2nπ Identity: 2nπ 𝑎𝜋/2 30/06/2018

Canonical Transform Change of variables from one set of canonical coordinates to another What is the canonical coordinates? Set of coordinates that can describe a physical system at any given point in time Locates the system within phase space For quantum mechanics: position and momentum Thermodynamics: entropy-temperature, pressure-volume   30/06/2018

Linear Canonical Transforms (LCTs) Given a generic input function f(u), LCT output g(u) is given by where α, β, and γ are LCT parameters 30/06/2018

Applications Signal processing [3] Computational and applied mathematics [5], [6], including fast and efficient optimal filtering [7] radar signal processing [8], [9] speech processing [10] image representation [11] image encryption and watermarking [12], [13], [14] LCTs have also been extensively studied for their applications in optics [2], [15], [16], [17], [18], [19], [20], electromagnetics, and classical and quantum mechanics [3], [1], [21], [22]. 30/06/2018

Previous Approaches 1) Computational Approach Rely on sampling Two sub-classes: Methods that directly convert the LCT integral to a summation, [55], [56], [57], [58] Decomposing into more elemantary building blocks, [59], [60], [61], [23], [62]. 2) Defining a DLCT and then directly use it, [63], [64], [65], [66], [67], [68], [69], [70]. No single definition has been widely established 30/06/2018

Fast FRT Algorithm Objective: to get O(NlogN) algorithms Divide and Conquer FRT can be put in the form: Then, This form is a Chirp Multiplication + Chirp Convolution + Chirp Multiplication 12/13/2017

Fast LCT Algorithm Iwasawa Decomposition – Again Divide and Conquer Chirp Multiplication Scaling FRT 12/13/2017

Linear Canonical Tranform – Special Cases Scaling FRT Chirp Multip. 30/06/2018

The Iwasawa Decomposition 30/06/2018

The Hyperdifferential Forms where DUALITY! 30/06/2018

The Operator Theory based DLCT Discrete Manifestation of Iwasawa Dec. Discrete Manifestation of Operators 30/06/2018

The Operator Theory based DLCT DLCT Output: 30/06/2018

Challenge: Deriving U and D 30/06/2018

Challenge: Deriving U and D We turn our attention to the task of defining U_h. It is tempting to define the discrete version of U by simply forming a diagonal matrix with the diagonal entries being equal to the coordinate values. However, it violates the duality and elagance of our approach. We pursue a similar approach in deriving U_h to the one in D_h 30/06/2018

Challenge: Deriving U and D 30/06/2018

Properties of a Discrete Transform Unitarity Preservation of Group Structure Concatenation Property Reversibility (Special case of above) Satisfactory approximation of continuous transform However, a theorem from Group Theory states: ‘It is theoretically impossible to discretize all LCTs with a finite number of samples such that they are both unitary and they preserve the group structure.’ - K. B. Wolf, Linear Canonical Transforms: Theory and Applications. New York, NY: Springer New York, 2016, ch. Development of Linear Canonical Transforms: A Historical Sketch, pp. 3–28. - A. W. Knapp, Representation theory of semisimple groups: An overview based on examples. Princeton University Press, 2001. 30/06/2018

Proofs on Unitarity U is real diagonal, so it is Hermitian. 30/06/2018

Proofs on Unitarity 30/06/2018

Proofs on Unitarity 30/06/2018

Proofs on Unitarity 30/06/2018

Numerical Experiments As mentioned before, we cannot satisfy Group Properties analytically. So, we study numerically. Inputs: F1 F2 Transforms: T1 T2 30/06/2018

Numerical Experiments APPROXIMATION OF CONT. TRANSFORM 30/06/2018

Numerical Experiments CONCATENATION 30/06/2018

Numerical Experiments REVERSIBILITY 30/06/2018

Conclusions To our knowledge, the first application of Operator Theory to discrete transform domain A pure, elegant, anlytical approach Uses only DFT, differentiation and coordinate multiplication operations Fully compatible with the circulant and dual structure of DFT theory Important properties of DLCT are satisfied 30/06/2018

References A. Koç, B. Bartan, and H. M. Ozaktas, “Discrete Linear Canonical Transform Based on Hyperdifferential Operators,” arXiv preprint arXiv:1805.11416, 2018. A. Koç, B. Bartan, and H. M. Ozaktas, “Discrete Scaling Based on Operator Theory, ” arXiv preprint arXiv:1805.03500, 2018. and the references there in. 30/06/2018

References 30/06/2018

References 30/06/2018

THANK YOU 12/13/2017