1993 DiscreteGaborTransform
- (Qian & Chen, 1993) ⇒ Shie Qian, and Dapang Chen. (1993). “Discrete Gabor Transform.” In: Signal Processing, IEEE Transactions on, 41(7).
Subject Headings: Gabor Transform.
Notes
Cited By
Quotes
Abstract
A feasible algorithm for implementing the Gabor expansion, the coefficients of which are computed by the discrete Gabor transform (DGT), is presented. For a given synthesis window and sampling pattern, computing the auxiliary biorthogonal function of the DGT is nothing more than solving a linear system. The DGT presented applies for both finite as well as infinite sequences. By exploiting the nonuniqueness of the auxiliary biorthogonal function at oversampling an orthogonal like DGT is obtained. As the discrete Fourier transform (DFT) is a discrete realization of the continuous-time Fourier transform, similarly, the DGT introduced provides a feasible vehicle to implement the useful Gabor expansion
I. INTRODUCTION
Half century ago, Gabor [7] presented an approach to characterize a time function in time and frequency simultaneously, which later became known asthe Gabor expansion. For signal s (t),the Gabor expansion is defined as
- [math]\displaystyle{ s(t) = Crn.nhrn,n(t) }[/math]
- [math]\displaystyle{ h_{m,n}(t) = h(t - mT)e^{jn\Omega t} \ \ (1)\lt /math where T and \lt math\gt \Omega }[/math] represent time and frequency sampling intervals, respectively. The synthesis function [math]\displaystyle{ h(t) }[/math] is subject to a unit energy constraint. The existence of (1) has been found to be possible for arbitrary s (r) only for [math]\displaystyle{ T \Omega \lt = 2 \pi }[/math] [2], [9]. [math]\displaystyle{ T \Omega = 2 \pi }[/math] is called critical sampling and [math]\displaystyle{ T \Omega \lt 2 \pi }[/math] is oversampling.
Although the Gabor expansion has been recognized as very useful for signal processing, its applications were limited due to the difficulties associated with computing the Gabor coefficients [math]\displaystyle{ C_{m,n} }[/math]. According to the Balian-Low theorem, h,,,(t) do not form an orthogonal basis unless the corresponding elementary function h(t) is badly localized in either time or frequency [9]. Therefore, the selection of the Gabor coefficient Cm,n in general is not unique. There are two problems that have continued to draw much research - how to define the Gabor coefficients and to what extent the resulting coefficients represent the analyzed signal [1], [2], [7], [8].
…
References
[1] Auslander, I. C. Gertner, and R. Tolimieri,"The discrete Zak transformapplication to time-frequency analysis and synthesis of nonstationary signals," IEEE Trans. Signal Processing. vol. 39, no. 4,pp. 825-835, Apr.1991.
[2] M.J. Bastiaans,"Gabor's expansion of a signal into Gaussian elementary signals, Proceedings of I€€€, vol. 68,pp.594-598.Apr. 1980
[3] M. 1. Bastiaans,"Sampling theorem for the complex spectrogram and Gabor's expansion of a signal in Gaussian elementary signals, Opt. Eng., vol. 20, no. 4, pp. 594-598,JulyiAug. 1981.
[4] I.Daubechies,"The wavelet transform:Amethod for time-frequency localization.” in Advances in Spectrum Analysis and Array Processing. S. HaykinEd.Englewood Cliffs, NJ: Prentice Hall. 1990, ch. 8, pp.366-417.
[5] P.D. Einziger. “Gabor expansion of an aperture field in exponential elementary beams," IEEElecrron. Leu., vol. 24, pp. 665-666, 1988.
[6] B. Friedlander and B.Porat,"Detection of transientsignal by the Gabor representation.” IEEE Trans. Acous~..Speech, Signal Processing, vol. 37, no. 2, pp.169-180,Feh. 1989.
[7] D. Gabor, (1946). “Theory of Communication," In: J. Inst. Elec. Eng., 93(III).
[8] T. Genossarand and M. Porat, "Can one evaluate the Gahor expansion using Gabor's Iterative algorithm.” /€E€ Trunc. Signul Processing. voI, 40, no, 8, pp, 1852-1861, 1992,
191 H. E. Jensen. T. Hohold. I. Justesen, series represen and "Double tationsignals."01' bounded /€€E Truns. IrifiJrm. Tlleor). rol. 34. no. 1,pp. 613-625. July I488
[IO] A. J. E. .L1 Janssen."Gaborrepresentatlon of generalized func- tlonh," J. Marh .4nul. .4ppl.. vol 83. pp. 377-394.198L.
11 I]R. S. Orr. “Theorderofcomputation ot fmitedlscreteGabortrans- forms.” /€E€ Trurr.5. Sipnal Processing. YOI.31. no. I, pp. 122-130.
...;
| Author | volume | Date Value | title | type | journal | titleUrl | doi | note | year | |
|---|---|---|---|---|---|---|---|---|---|---|
| 1993 DiscreteGaborTransform | Shie Qian Dapang Chen | Discrete Gabor Transform | 1993 |