Open AccessEfficient method for the field‐programmable gate arrays calculation of Wigner‐Ville distribution
Author(s) -
Zhang XiaoWei,
Zuo Lei,
Huang WenZhun,
Guo JianXin
Publication year - 2019
Publication title -
iet signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.384
H-Index - 42
ISSN - 1751-9683
DOI - 10.1049/iet-spr.2018.5522
Subject(s) - computer science , distribution (mathematics) , wigner distribution function , field (mathematics) , gate array , field programmable gate array , algorithm , parallel computing , electronic engineering , computational science , mathematics , embedded system , physics , engineering , mathematical analysis , quantum mechanics , pure mathematics , quantum
Various signals of finite length are often analysed by the Wigner‐Ville distribution (WVD). Thus, this article deals with the implementation of their discrete WVDs on field‐programmable gate arrays (FPGAs). For the discrete WVD, its calculation procedures are composed of the autocorrelation function and Fourier transform. Since the autocorrelation procedure is the most time‐consuming step in the entire computation process, the authors analyse the calculation procedure of autocorrelation function in detail. Here the proposed efficient method just calculates partial non‐zero elements of the autocorrelation matrices in order to reduce the computation complexity. The FFT (built‐in FPGAs) is then utilised to acquire the discrete WVD. In addition, the idea of the fully‐pipelined and parallelism is borrowed to reduce the running time but at the cost of recourses. Finally, the authors provide implementations of both authors proposed method and two other algorithms on different FPGAs. The experimental results show that the Intel Arria‐10 FPGA families are the better choice in the floating point arithmetic and that authors method has the best performance.