scispace - formally typeset
Journal ArticleDOI

Fast algorithm for pseudodiscrete Wigner-Ville distribution using moving discrete Hartley transform

Reads0
Chats0
TLDR
A new fast algorithm is proposed to compute pseudodiscrete Wigner-Ville distribution in real-time applications that uses the moving discrete Hartley transform to compute the Hilbert transform and implements the PDWVD in real domain.
Abstract
A new fast algorithm is proposed to compute pseudodiscrete Wigner-Ville distribution (PDWVD) in real-time applications. The proposed algorithm uses the moving discrete Hartley transform to compute the Hilbert transform and thereby implements the PDWVD in real domain. The computational complexity of the proposed algorithm is derived and compared with the existing algorithm to compute the PDWVD.

read more

Citations
More filters
Journal ArticleDOI

Binary Discrete Cosine and Hartley Transforms

TL;DR: A systematic method for developing a binary version of a given transform by using the Walsh-Hadamard transform (WHT) is proposed and it is shown that the resulting BDCT corresponds to the well-known sequency-ordered WHT, whereas the BDHT can be considered as a new Hartley-ordering WHT.
Journal ArticleDOI

Application of Wigner-Ville distribution in electromigration noise analysis

TL;DR: In this paper, the Wigner-Ville distribution is used for the analysis of electromigration noise data for the first time, and it is found that much hidden and useful information in the noise data can be revealed by using this distribution.
Journal ArticleDOI

D14: FPGA-based implementation of the instantaneous frequency estimation of phonocardiographic signals

TL;DR: To compute in real time the instantaneous frequency of a signal, the algorithms have been implemented in a FPGA device, exploiting the high performance and flexibility of reconfigurable hardware.
References
More filters
Book

Signal processing with lapped transforms

TL;DR: Applications of transforms in signal processing signal processing in subbands lapped orthogonal transforms the modulated lapped transform heirarchical lapped transforms applications of lapping transforms.
Journal ArticleDOI

The fast Hartley transform

TL;DR: The Fast Hartley Transform (FHT) is as fast as or faster than the Fast Fourier Transform (FFT) and serves for all the uses such as spectral analysis, digital processing, and convolution to which the FFT is at present applied.
Journal ArticleDOI

Running DHT and real-time dht analyser

TL;DR: In this article, the recursive Hartley transform (RHF) is shown to have the ability to calculate both the running DHT and the running discrete Fourier transform (DFT).
Journal ArticleDOI

New method of computing Wigner-Ville distribution

TL;DR: A new method to evaluate the WVD of a real signal using the fast Hartley transform (FHT) is presented, compared with the existing fast Fourier transform (FFT) method in terms of computation time.
Proceedings ArticleDOI

Fast computation of wavelet transforms with the extended lapped transform

H.S. Malvar
TL;DR: The use of the extended lapped transform (ELT) to implement orthogonal wavelet transforms (WTs) is suggested, and a fast algorithm is presented for the ELT-based WT.
Related Papers (5)