File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Efficient computation of the discrete Wigner-Ville distribution

TitleEfficient computation of the discrete Wigner-Ville distribution
Authors
Issue Date1990
Citation
Proceedings - Ieee International Symposium On Circuits And Systems, 1990, v. 3, p. 2165-2168 How to Cite?
AbstractTo ensure that the discrete Wigner-Ville distribution (DWVD) does not contain aliasing terms, the analytic signal is normally used instead of the real signal. However, the computation of the analytic signal amounts to most of the computation time. Recently, Eilouti and Khadra (1989) made use of the overlapping between two successive sequences to develop a recursive algorithm for updating the analytic signal. The time difference between the successive sequences was taken to be one. The more general case with a time difference (lag) of P is considered here. It is shown that the analytic signal can effectively be updated by computing an aperiodic convolution. For small lag, the convolution is evaluated directly, while for a transform with larger lag, the convolution is evaluated by a real-valued pruning FFT (fast Fourier transform) based on the split-radix FFT. The DWVD is then obtained from the DFT (discrete Fourier transform) of a conjugate symmetric sequence of reduced length which can be computed with the real-valued split-radix FFT algorithms.
Persistent Identifierhttp://hdl.handle.net/10722/158079
ISSN

 

DC FieldValueLanguage
dc.contributor.authorChan, Shingchowen_US
dc.contributor.authorHo, KaLeungen_US
dc.date.accessioned2012-08-08T08:57:59Z-
dc.date.available2012-08-08T08:57:59Z-
dc.date.issued1990en_US
dc.identifier.citationProceedings - Ieee International Symposium On Circuits And Systems, 1990, v. 3, p. 2165-2168en_US
dc.identifier.issn0271-4310en_US
dc.identifier.urihttp://hdl.handle.net/10722/158079-
dc.description.abstractTo ensure that the discrete Wigner-Ville distribution (DWVD) does not contain aliasing terms, the analytic signal is normally used instead of the real signal. However, the computation of the analytic signal amounts to most of the computation time. Recently, Eilouti and Khadra (1989) made use of the overlapping between two successive sequences to develop a recursive algorithm for updating the analytic signal. The time difference between the successive sequences was taken to be one. The more general case with a time difference (lag) of P is considered here. It is shown that the analytic signal can effectively be updated by computing an aperiodic convolution. For small lag, the convolution is evaluated directly, while for a transform with larger lag, the convolution is evaluated by a real-valued pruning FFT (fast Fourier transform) based on the split-radix FFT. The DWVD is then obtained from the DFT (discrete Fourier transform) of a conjugate symmetric sequence of reduced length which can be computed with the real-valued split-radix FFT algorithms.en_US
dc.languageengen_US
dc.relation.ispartofProceedings - IEEE International Symposium on Circuits and Systemsen_US
dc.titleEfficient computation of the discrete Wigner-Ville distributionen_US
dc.typeConference_Paperen_US
dc.identifier.emailChan, Shingchow:scchan@eee.hku.hken_US
dc.identifier.emailHo, KaLeung:klho@eee.hku.hken_US
dc.identifier.authorityChan, Shingchow=rp00094en_US
dc.identifier.authorityHo, KaLeung=rp00117en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0025629655en_US
dc.identifier.volume3en_US
dc.identifier.spage2165en_US
dc.identifier.epage2168en_US
dc.identifier.scopusauthoridChan, Shingchow=13310287100en_US
dc.identifier.scopusauthoridHo, KaLeung=7403581592en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats