Fast and accurate linear canonical transform algorithms

Date

2015

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

Source Title

Proceedings of the 23nd Signal Processing and Communications Applications Conference, SIU 2015

Print ISSN

Electronic ISSN

Publisher

IEEE

Volume

Issue

Pages

1409 - 1412

Language

Turkish

Journal Title

Journal ISSN

Volume Title

Citation Stats
Attention Stats
Usage Stats
2
views
8
downloads

Series

Abstract

Linear canonical transforms are encountered in many areas of science and engineering. Important transformations such as the fractional Fourier transform and the ordinary Fourier transform are special cases of this transform family. This family of transforms is especially important for the modelling of wave propagation. It has many applications such as noise removal, image encryption, and analysis of optical systems. Here we discuss algorithms for fast and accurate computation of these transforms. These algorithms can achieve the same accuracy and speed as fast Fourier transform algorithms, so that they can be viewed as optimal algorithms. Efficient sampling of signals plays an important part in the development of these algorithms.

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)