Open access

Introductory Chapter: The Generalizations of the Fourier Transform

Written By

Mohammad Younus Bhat

Published: 13 September 2023

DOI: 10.5772/intechopen.112175

From the Edited Volume

Time Frequency Analysis of Some Generalized Fourier Transforms

Edited by Mohammad Younus Bhat

Chapter metrics overview

55 Chapter Downloads

View Full Metrics

1. Introduction

In the world of physical science, important physical quantities such as sound, pressure, electric current, voltage, and electromagnetic fields vary with time t. Such quantities are labeled as signals/waveforms. Exemplified by signals with examples such as oral signals, optical signals, acoustic signals, biomedical signals, radar, and sonar. Indeed, signals are very common in the real world. Time-frequency analysis is a vital aid in signal analysis, which is concerned with how the frequency of a function(or signal) behaves in time, and it has evolved into a widely recognized applied discipline of signal processing. The signals can be classified under various categories. It could be done in terms of continuity (continuous v/s discrete), periodicity(periodic v/s aperiodic), stationarity(stationary v/s non-stationary), and so on. Most of the signals in nature are non-stationary (i.e., whose spectral components change with time) and apt presentation of such non-stationary signals need frequency analysis, which is local in time, resulting in the time-frequency analysis of signals. Although time frequency analysis of signals had its origin almost 70 years ago, there has been major development of the time-frequency distribution approach in the last three decades. The basic idea of these methods is to develop a joint function of time and frequency, known as a time-frequency distribution, that can describe the energy density of a signal simultaneously in both time and frequency domains. In signal processing, time-frequency analysis comprises those techniques that study signal in both the time and frequency domains simultaneously, using various time-frequency representations/tools known as integral transformations. An integral transform maps a function/signal from one function space into another function space via integration, where some of the properties of the original function might be more easily characterized and manipulated than in the original function space. The integral transforms are essentially considered from the functional analysis viewpoint and as a useful technique of mathematical physics.

The classical Fourier transform (FT) is an integral transform introduced by Joseph Fourier in 1807 [1], is one of the most valuable and widely-used integral transforms that converts a signal from time versus amplitude to frequency versus amplitude. Thus FT can be considered as the time-frequency representation tool in signal processing and analysis. A fundamental limitation of the Fourier transform is that the all properties of a signal are global in scope. Information about local features of the signal, such as changes in frequency, becomes a global property of the signal in the frequency domain. In order to circumvent these drawbacks of FT, authors in Ref. [2] introduced the generalizations of FT that includes short-time Fourier transform (STFT) by performing the FT on a block-by-block basis rather than to process the entire signal at once. In spite of the fact that STFT did much to ameliorate the limitations of FT, still in some cases the STFT cannot track the signal dynamics properly for a signal with both very high frequencies of short duration and very low frequencies of long duration. To overcome these drawbacks of FT and STFT different novel generalizations of the classical Fourier transform came into existence viz.: the fractional Fourier transform (FRFT), the Fresnal transform, the linear canonical transform (LCT), the quadratic-phase Fourier transform (QPFT), and so on. As a generalization of classical Fourier transform, the FRFT, the LCT, the QPFT gained its ground intermittently and profoundly influenced several branches of science and engineering including signal and image processing, quantum mechanics, neural networks, differential equations, optics, pattern recognition, radar, sonar, and communication systems.

Advertisement

2. Fourier transform and its generalizations

2.1 Fourier transform

Joseph Fourier [1] in 1822 published first work about Fourier transform, which is an integral transform that converts a mathematical function from the time domain to the frequency domain. Fourier transform measures the frequency component of a given function. The Fourier transform has evolved into a widely recognized discipline of harmonic analysis and has been successfully applied in diverse scientific and engineering pursuits [3, 4, 5, 6].

Let us begin with definition of the classical Fourier transform.

Definition 1.The FT of any signalxtL2is defined and denoted as

xtξ=x̂ξ=12πeiξtxtdt,E1

and corresponding inversion formula is given by

1xtξt=12πeiξtxtξ.E2

Example 1.Consider a functionxt=eαtfort0,α>0,0otherwise;, then the Fourier transform ofxtis obtained as

xtξ=12π0eiξteαtdt=12π0cosξtisinξteαtdt=12π0cosξteαtdti0sinξteαtdt=12παα2+ξ2α2+ξ2.

Example 2.Consider the function

xt=sin3tforπtπ,0otherwise.

Then the Fourier transform ofxtis obtained as

xtξ=12πcosξtisinξtsin3tdt=i2πππsinξtsin3tdt=i32sinξππξ29.

Next, we shall study some properties of FT.

Theorem 1 (Translation).The Fourier transform of any functionxtkis given by

xtkξ=eiξkxtξ.E3

Proof. From Definition 1, we have

xtkξ=12πeiξtxtkdt=12πeu+kxudu=12πeiξkeiξu)xudu=12πeiξkeiξu)xudu=eiξkxtξ.

This completes the proof. □

Theorem 2 (Modulation).The Fourier transform of any functioneiξ0txtis given by

eiξ0txtξ=xtξξ0.E4

Proof. From Definition 1, we have

eiξ0txtξ=12πeiξteiξ0txtdt=12πeiξξ0txtdt=xtξξ0.

This completes the proof. □

Theorem 3 (Orthogonality relation).The Fourier transform of the functionsxtandytinL2satisfies the following orthogonality relation

xtyu=xtyu.E5

Proof. We have

xtyu=xtξyuξ¯=xtξ12πeiξuyudu¯=12πeiξtxtdt12πeiξuyu¯du=2xtyu¯12πeutdtdu=xtyu¯δutdtdu=xtyu¯dt=xtyu.

This completes the proof. □

Note: If we take xt=yt, the orthogonality relation yields Plancherel’ s Theorem for the Fourier transforms that states the energy of a signal ln the time domain, is the same as the energy in the frequency domain given as

xt=xt.E6

Next, we show that the inverse Fourier operator is the adjoint of the Fourier operator.

Theorem 4.LetxtandytinL2, then

xtξyξ=xt1yt.E7

Proof. We have

xtyt=xtξyξ¯=12πeiξtxtdtyξ¯=xt12πeiξtyξ¯dt=xt12πeiξtyξ¯dt=xt1yt¯dt=xt1yt.

This completes the proof. □

Theorem 5.LetxtandytinL2, then

xyξ=2πxtξytξ,E8

where xy denotes the convolution of the functions xt and yt and is given by

xyt=xtyutdt.

Proof. By applying definition of Fourier transform to the convolution of the functions xt and yt, we obtain

xyξ=12πxyueiξudu=12πxtyutdteiξudu=12πxtyvet+vdvdt=12πeiξtxtyveiξvdvdt=2π12πeiξtxtdt12πeiξvyvdv=2πxtξytξ.

This completes the proof. □

2.2 Windowed Fourier transform

Definition 2.LetΨbe a given window function inL2,then the window Fourier transform (WFT) of any functionxtL2is defined and denoted as

VΨxtbξ=12πeiξtxtΨtb¯dt,b,ξ.E9

Further, the WFT (9) can be rewritten as

VΨxtbξ=xtΨtb¯.E10

Applying inverse FT (2), (10) yields

xtΨtb¯=1VΨxtbξ=12πeiξtVΨxtbξE11

Multiplying (11) both sides by Ψtb and then integrating with respect to db, we get

xtΨ2=12πeiξtVΨxtbξΨtbdξdb.

Equivalently, we have

xt=12πΨ2eiξtVΨxtbξΨtbdξdb.E12

Eq. (12) gives the inversion formula corresponding to WFT (9).

Theorem 6 (Orthogonality relation).For any two functionsxt,ytinL2,we have following relation

VΨxt(bξ)VΨyt(bξ)=Ψ2xtyt.E13

Proof. By Definition (2), we have

VΨxt(bξ)VΨyt(bξ)=VΨxtbξVΨytbξ¯dξdb=VΨxtbξ12πeiξtytΨtb¯dt¯dξdb=12πeiξtVΨxt(bξ)yt¯Ψtbdtdb.E14

By virtue of Eq. (11), (14) yields

VΨxt(bξ)VΨyt(bξ)=xtΨtb¯Ψtbyt¯dtdb=xtyt¯dtΨtb¯Ψtbdb=Ψ2xtyt.E15

This completes the proof. □

Next, we introduce the fractional Fourier transform as a generalization of the classical Fourier transform.

2.3 Fractional Fourier transform

It is well known that when one performs the FT two times, the time-reverse operation is obtained. When one performs the FT three times, the inverse FT is obtained. Furthermore, performing the FT four times is equivalent to performing an identity operation. Now, one may think what will be obtained when the FT is performed a non-integer number of times The fractional Fourier transform (FRFT) can be viewed as performing the FT 2α/π times, where 2α/π can be a non-integer value. The fractional Fourier transform (FRFT) has played an important role in signal processing [7] optics [8, 9], image processing [10], and quantum mechanics [11]. As a generalization of the conventional Fourier transform (FT), the FRFT implements an order parameter which acts on the conventional Fourier transform operator and can process time-varying signals and non-stationary signals. With variation of the fractional parameter, the FRFT transforms the signal into the fractional Fourier domain representation, which is oriented by corresponding rotation angle with respect to the time axis in the counter-clockwise direction. Using a global kernel, the FRFT shows the overall fractional Fourier domain contents. Hence, the time-frequency representation should be extended to the time-fractional Fourier frequency domain. Let us define fractional Fourier transform.

Definition 3.Letxtbe a signal inL2, then the fractional Fourier transform ofxtis defined as

αxtξ=Kαtξxtdt,E16

where α is a angular parameter and Kαtξ is the kernel of the FRFT and is given by

Kαtξ=1icotα2πei2t2+ξ2cotαiξtcscαforα,δtξforα=2,δt+ξforα=2n±1π,n.E17

and the corresponding inversion formula is also a FRFT with angle α and is given by

xt=ααxtξt=αxtξKαtξ.E18

It is easy to see that, when α=0,π/2,π and 3π/2, the FRFT is reduced to the identity operation, the FT, time-reverse operation, and the IFT, respectively.

Assuming that ut=eit2cotα/2xt, then for α the FRFT (16) can be rewritten as

αxtξ=1icotα2πeiξ2cotα/212πeiξtcscαutE19
=1icotα2πeiξ2cotα/2uξcscα.E20

It is clear from (20) that the FRFT can be viewed as a chirp-Fourier-chirp transformation.

Next, we highlight some properties of FRFT.

Theorem 7.Letxt,ytL2andk,ξ0, then the FRFT satisfies following properties:

  1. Translation:αxtkξ=e12ik2cosαsinαikξsinααxtξξkcosα.

  2. Modulation:αeiξ0txtξ=eiξ0ξcosαi2ξ02sinαcosααxtξξ0sinα.

  3. Orthogonality Relation:αxtαyt=xtyt.

Proof. For the sake of brevity, we omit proof of translation and modulation properties and prove only orthogonality relation.

We have

αxtαyt=αxtξαytξ¯=KαtξxtKαsξysds¯dtdξ=xtys¯KαtξKαsξ¯dsdt=xtys¯δtsdsdt=xtys¯dt=xtyt.

This completes the proof. □

Since the FRFT is a generalization of the FT, many properties, applications, and operations associated with FT can be generalized by using the FRFT. The FRFT is more flexible than the FT and performs even better in many signal processing and optical system analysis applications.

In the sequel, we introduce linear canonical transform, which is a generalized version of the classical Fourier transform with four parameters.

2.4 Linear canonical transform

The linear canonical transform (LCT) introduced by Moshinsky and Quesne [12] has a total of four parameters. It is not only a generalization of the FT, but also a generation of the FRFT, the scaling operation. As the FRFT, the LCT was first used for solving differential equations and analyzing optical systems. Recently, after the applications of FRFT were developed, the roles of the LCT for signal processing have also been examined. Due to the extra degrees of freedom and simple geometrical manifestation, the LCT is more flexible than other transforms and is as such suitable as well as powerful tool for investigating deep problems in science and engineering [13, 14, 15, 16]. Now, we shall define linear canonical transform (LCT).

Definition 4.Consider the second order matrixM2×2=abcd. Then the linear canonical transform of anyxtL2with respect to the uni-modular matrixM2×2=abcdis defined by

Mxtξ=KMtξxtdtb0dexpcdξ22fb=0.E21

where KMtξ is the kernel of linear canonical transform and is given by

KMtξ=12πibei2bat22+dξ2,b0.E22

Whenb0,the inverse LCT is given by

ft=M1{M[x(t]ξ}t=MxtξKMtξ¯E23

where the kernel KMtξ¯=KM1tξ and M1 denotes the inverse of matrix M.

For typographical convenience we write the matrix M=abcd.

By changing the matrix parameter M=abcd, the LCT boils down to various integral transforms such as:

  • When M=0110, the LCT turns out to be Fourier transform(FT):

Mxt=ixt.

  • When M=01,1,0, the LCT turns out to be inverse Fourier transform(IFT):

Mxt=i1xt.

  • When M=cosαsinαsinαcosα, the LCT becomes the FRFT:

Mxt=eαxt.

  • When M=λ001λ, the LCT becomes a scaling operation:

Mxt=1λxξλ.

  • When M=10β1, the LCT becomes a chirp multiplication operation:

Mxt=ei2βξ2xξ.

Moreover Fresnel transform can be viewed with matrix 1b,0,1 and the Laplace transform can be obtained with 0ii0.

From (21), we have for b0

Mxtξ=KMtξxtdt=12πibei2bat22+dξ2xtdt=12πibei2bdξ2eibξtxtei2bat2dt=12πibei2bdξ2gtξ/b,E24

where gt=xtei2bat2.

Thus, it is clear from (24), that LCT can be regarded as a chirp-Fourier-chirp transformation.

Next, we investigate some basic properties associated with LCT.

Theorem 8.Letxt,ytL2andk,ξ0, then the LCT satisfies following properties:

  1. Translation:Mxtkξ=eikcξi2k2acMxtξak.

  2. Modulation:Meiξ0txtξ=eidξ0ξi2bξ02Mxtξbξ0.

  3. Parity:Mxtξ=Mxtξ.

  4. Orthogonality Relation:MxtMyt=xtyt.

Proof. To be specific, we shall only prove the translation property, the rest of the properties follows similarly.

For any real k, we have

Mxtkξ=KMtξxtkdt=12πibei2bat22+dξ2xtdt=12πibei2bas+k22s+kξ+dξ2xsds=eikcξi2k2ac12πibei2bas22sξak+dξak2xsds=eikcξi2k2acMxtξak.

This completes the proof. □

Finally, we will define quadratic-phase Fourier transform.

2.5 Quadratic-phase Fourier transform

The most neoteric generalization of the classical Fourier transform (FT) with five real parameters appeared via the theory of reproducing kernels is known as the quadratic-phase Fourier transform (QPFT) [17]. It treats both the stationary and non-stationary signals in a simple and insightful way that are involved in radar, signal processing, and other communication systems [18, 19, 20, 21, 22, 23, 24, 25]. Here, we gave the notation and definition of the quadratic-phase Fourier transform and study some of its properties.

Definition 5.For a real parameter setΛ=abcdewithb0,the quadratic-phase Fourier transform of any signalfL2is defined as

QΛxtξ=KΛtξxtdt,E25

where kΛtξ is the kernel signal of the QPFT and is given by

KΛtξ=12πeiat2+bξt+cξ2+dt+,E26

and corresponding inversion formula is given by

xt=QΛ1QΛxtξt=KΛtξ¯QΛxtξ.E27

The novel QPFT (5) can be considered as a cluster of several existing integral transforms ranging from the classical Fourier to the much recent special affine Fourier transform. Nevertheless, many signal processing operations, such as scaling,shifting and time reversal, can also be performed via the QPFT (5).

Now, we will establish some properties of the quadratic-phase Fourier transform.

Theorem 9.Letxt,ytL2andk,ξ0, then the QPFT satisfies following properties:

  1. Modulation:QΛeiξ0txtξ=eicb2ξ022b1ξξ0eb1ξ0Qλxtξb1ξ0.

  2. Parity:QΛxtξ=QΛ'xtξ,whereΛ'=abcde.

  3. conjugation:QΛxt¯ξ=QΛxtξ¯,whereΛ=abcde.

  4. Orthogonality Relation:QΛxtQΛyt=1bxtyt.

Proof. For the sake of brevity, we avoid proof. □

References

  1. 1. Fourier JB. Theorie analytique de la chaleur. Paris: Chez Firmin Didot, Pere et Fils; 1822;499-508
  2. 2. Durak L, Arikan O. Short-time Fourier transform: Two fundamental properties and an optimal implementation. IEEE Transactions on Signal Processing. 2003;51(1231):42
  3. 3. Boggess A, Narcowich FJ. A First Course in Wavelets with Fourier Analysis. Upper Saddle River, New Jersey: Prentice Hall; 2001
  4. 4. Bracewell RN. The Fourier Transform and its Applications. Third ed. Boston: McGraw-Hill; 2000
  5. 5. Howell KB. Principles of Fourier Analysis. Boca Raton: Chapman & Hall/CRC; 2001
  6. 6. Olson T. Applied Fourier Analysis. NewYork: Birkhauser; 2017
  7. 7. Almeida L. The fractional Fourier transform and time-frequency representations. IEEE Transactions on Signal Processing. 2022;42(11):3084-3091
  8. 8. Ozaktas HM, Mendlovic D. Fourier transforms of fractional order and their optical interpretation. Optics Communication. 1993;101(3–4):163-169
  9. 9. Ozaktas HM, Zalevsky Z, Kutay M. The Fractional Fourier Transform with Applications in Optics and Signal Processing. New York: Wiley; 2001
  10. 10. Djurovic I, Stankovic S, Pitas I. Digital watermarking in the fractional Fourier transformation domain. Journal of Network and Computer Applications. 2001;24(2):167-173
  11. 11. Namias V. The fractional order Fourier transform and its application to quantum mechanics. IMA Journal of Applied Mathematics. 1980;25(3):241-265
  12. 12. Moshinsky M, Quesne C. Linear canonical transformations and their unitary representations. Journal of Mathematical Physics. 1971;12(8):1772-1780
  13. 13. Barshan B, Kutay MA, Ozaktas HM. Optimal filtering with linear canonical transformations. Optics Communication. 1997;135:32-36
  14. 14. Healy JJ, Kutay MA, Ozaktas HM, Sheridan JT. Linear Canonical Transforms. New York: Springer; 2016
  15. 15. Hennelly BM, Sheridan JT. Fast numerical algorithm for the linear canonical transform. Journal of the Optical Society of America A. 2005;22:928-937
  16. 16. Pei SC, Ding JJ. Eigen functions of linear canonical transform. IEEE Transactions on Signal Processing. 2002;50:11-26
  17. 17. Saitoh S. Theory of reproducing kernels: Applications to approximate solutions of bounded linear operator functions on Hilbert spaces. American Mathematical Society Transformation Series. 2010;230(2):107-134
  18. 18. Castro LP, Minh LT, Tuan NM. New convolutions for quadratic-phase Fourier integral operators and their applications. Mediterranean Journal of Mathematics. 2018;15:1-17
  19. 19. Castro LP, Haque MR, Murshed MM, Saitoh S, Tuan NM. Quadratic Fourier transforms. Annals of Functional Analysis AFA. 2014;5(1):10-23
  20. 20. Bhat MY, Dar AH, Urynbassarova D, Urynbassarova A. Quadratic-phase wave packet transform. Optik - International Journal for Light and Electron Optics. 2022;261:169120
  21. 21. Sharma PB. The Wigner-Ville distribution associate with quadratic-phase Fourier transform. AIP Conferenc Proceeding. 2022;2435(1):020028
  22. 22. Prasad A, Sharma PB. Convolution and product theorems for the quadratic-phase Fourier transform. Georgian Mathematical Journal. 2022;29(4):595-602
  23. 23. Prasad A, Sharma PB. The quadratic-phase Fourier wavelet transform. Mathematicsl Methods in the Applied Sciences. DOI: 10.1002/mma.6018
  24. 24. Bhat MY, Dar AH. Quadratic-phase scaled wigner distribution: Convolution and correlation. SIViP. 2023;17:2779-2788
  25. 25. Bhat MY, Dar AH. Quadratic-phase s–transform.e-prime. Advanced Electrical Engineering Electronics Energy. 2023. DOI: 10.1016/j.prime.2023.100162

Written By

Mohammad Younus Bhat

Published: 13 September 2023