The Wigner-Ville distribution (WVD) is of great significance in time-frequency signal analysis. In the letter we present a new method to evaluate the WVD of a real signal using the fast Hartley transform (FHT). This is compared with the existing fast Fourier transform (FFT) method in terms of computation time. The FHT method presented turns out to be much faster than the FFT method. © 1989, The Institution of Electrical Engineers. All rights reserved.

Siva Bala Narayanan

K. M.Muraleedhara Prabhu

SIGNAL PROCESSING--ANALYSIS

FAST HARTLEY TRANSFORM

TIME-FREQUENCY SIGNAL ANALYSIS

WIGNER-VILLE DISTRIBUTION

Mathematical transformations

IIT Madras is a public technical and research university located in Chennai, Tamil Nadu. Founded in 1959, it is recognised as an Institute of National Importance.

IIT Madras has been ranked as the top engineering institute in India for four years in a row by the National Institutional Ranking Framework of the MHRD

It currently offers undergraduate, postgraduate and research degrees across 16 disciplines in Engineering, Sciences, Humanities and Management. About 596 faculty belonging to science and engineering departments and centres of the Institute are engaged in teaching, research and industrial consultancy.

IIT Madras

Electronics Letters

The Wigner-Ville distribution (WVD) has been a powerful signal processing tool for time-frequency signal analysis. Consequently, many algorithms have been proposed in the literature for computing the WVD in real-time applications [2, 8, 7, 5]. Recently, Pei and Yang proposed an efficient algorithm which uses discrete Hartley transform (DHT) to evaluate the WVD entirely in the real domain [5]. In this paper, a fixed-point error analysis of this algorithm has been carried out. An expression for output noise-to-signal ratio (NSR) is derived. The results indicate that this algorithm has better noise properties when compared to the FFT-based algorithm, even though the FFT has better noise properties than the FHT.

Signal Processing

Some results on fixed-point error analysis of Wigner-Ville distribution

A new fast algorithm is proposed to compute pseudodiscrete Wignér-Ville distribution (PDWVD) in real-time applications. The proposed algorithm uses the moving discrete Hartley transform to compute the Hubert 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. © lEE, 1996.

IEE Proceedings: Vision, Image and Signal Processing

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

IEEE Transactions on Acoustics, Speech, and Signal Processing

An efficient real-time implementation of the Wigner-Ville distribution

On computing the discrete Hartley transform

Fast Hartley transform algorithm

Journal of the Optical Society of America

Discrete Hartley transform

Physik in unserer Zeit

Theory and Application of Digital Signal Processing. L. Rabiner und B. Gold; Prentice Hall Inc., Englewood Cliffs, N. J. (1975) 762 Seiten, $ 27.50

New Method of Computing Wigner-Ville Distribution

Journal	Electronics Letters
ISSN	00135194
Open Access	No