Mixed Fourier transforms and image encryption

Authors:
Nan Du;Sree Devineni;Artyom M. Grigoryan
Affiliations:
The University of Texas at San Antonio, Department of Electrical and Computer Engineering, San Antonio, TX;The University of Texas at San Antonio, Department of Electrical and Computer Engineering, San Antonio, TX;The University of Texas at San Antonio, Department of Electrical and Computer Engineering, San Antonio, TX
Venue:
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Year:
2009

Citing 6
Cited 0

A multi-input-multi-output system approach for the computation of discrete fractional Fourier transform

Signal Processing
Fast Transforms: Algorithms, Analyses, Applications

Fast Transforms: Algorithms, Analyses, Applications
Orthogonal Transforms for Digital Signal Processing

Orthogonal Transforms for Digital Signal Processing
The DRFT-a rotation in time-frequency space

ICASSP '95 Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02
The discrete rotational Fourier transform

IEEE Transactions on Signal Processing
Discrete fractional Fourier transform based on orthogonalprojections

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we discuss a concept of the mixed Fourier transformation, when signals are transformed to the time-frequency domain, where the difference between the time and frequency is disappeared. Both cases of continuous-time and discrete-time signals are considered, and properties of the mixed transformations are described. The concept of mixed Fourier transform includes the fractional power of the discrete Fourier transform (DFT) which is referred to as a discrete version of the fractional Fourier transform. Mixed Fourier transformations can be used for calculation of roots of the Fourier and identity transformations. Examples of such root transforms for signal processing and image encryption are given.