Fixed-frequency slice computation of discrete Cohen's bilinear class of time-frequency representations

Date

2000-02-01

Author

Ozgen, MT

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

146
views

0
downloads

This communication derives DFT-sample-based discrete formulas directly in the spectral-correlation domain for computing fixed-frequency slices of discrete Cohen's class members with reduced computational cost, both for one-dimensional and multidimensional (specifically two-dimensional (2-D)) finite-extent sequence cases. Frequency domain integral expressions that define discrete representations are discretized to obtain these discrete implementation formulas. 2-D ambiguity function domain kernels are chosen to have separable forms for analytical convenience. Simulations demonstrating the DFT-sample-based computation in particle-location analysis of in-line Fresnel holograms are presented.

Subject Keywords

Time-Frequency Representations, Space/Spatial-Frequency Representations, Wigner Distribution, Ambiguity Function, Cohen's Bilinear Class, Alias-Free Representations, In-Line Fresnel Holograms

URI

https://hdl.handle.net/11511/63809

Journal

SIGNAL PROCESSING

DOI

https://doi.org/10.1016/s0165-1684(99)00124-3

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Complexity reduction in radial basis function (RBF) networks by using radial B-spline functions Saranlı, Afşar; Baykal, Buyurman (1998-01-01) In this paper, new basis consisting of radial cubic and quadratic B-spline functions are introduced together with the CORDIC algorithm, within the context of RBF networks as a means of reducing computational complexity in real-time signal-processing applications. The new basis are compared with two other existing and popularly used basis families, namely the Gaussian functions and the inverse multiquadratic functions (IVMQ) in terms of approximation performance and computational requirements. The new basis ...
Fine resolution frequency estimation from three DFT samples: Case of windowed data Candan, Çağatay (2015-09-01) An efficient and low complexity frequency estimation method based on the discrete Fourier transform (DFT) samples is described. The suggested method can operate with an arbitrary window function in the absence or presence of zero-padding. The frequency estimation performance of the suggested method is shown to follow the Cramer-Rao bound closely without any error floor due to estimator bias, even at exceptionally high signal-to-noise-ratio (SNR) values.
On equivelar triangulations of surfaces Adıgüzel, Ebru; Pamuk, Semra; Department of Mathematics (2018) Persistent homology is an algebraic method for understanding topological features of discrete objects or data (finite set of points with metric defined on it). In algebraic topology, the Mayer Vietoris sequence is a powerful tool which allows one to study the homology groups of a given space in terms of simpler homology groups of its subspaces. In this thesis, we study to what extent does persistent homology benefit from Mayer Vietoris sequence.
Digital computation of linear canonical transforms Koc, Aykut; Ozaktas, Haldun M.; Candan, Çağatay; KUTAY, M. Alper (2008-06-01) We deal with the problem of efficient and accurate digital computation of the samples of the linear canonical transform (LCT) of a function, from the samples of the original function. Two approaches are presented and compared. The first is based on decomposition of the LCT into chirp multiplication, Fourier transformation, and scaling operations. The second is based on decomposition of the LCT into a fractional Fourier transform followed by scaling and chirp multiplication. Both algorithms take similar to N...
Fast Algorithms for Digital Computation of Linear Canonical Transforms Koc, Aykut; Öktem, Sevinç Figen; Ozaktas, Haldun M.; Kutay, M. Alper (2016-01-01) Fast and accurate algorithms for digital computation of linear canonical transforms (LCTs) are discussed. Direct numerical integration takes O.N-2/time, where N is the number of samples. Designing fast and accurate algorithms that take O. N logN/time is of importance for practical utilization of LCTs. There are several approaches to designing fast algorithms. One approach is to decompose an arbitrary LCT into blocks, all of which have fast implementations, thus obtaining an overall fast algorithm. Another a...

Citation Formats

M. Ozgen, “Fixed-frequency slice computation of discrete Cohen’s bilinear class of time-frequency representations,” SIGNAL PROCESSING, pp. 219–230, 2000, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/63809.