Cargando…
Fast Recursive Computation of Sliding DHT with Arbitrary Step
Short-time (sliding) transform based on discrete Hartley transform (DHT) is often used to estimate the power spectrum of a quasi-stationary process such as speech, audio, radar, communication, and biomedical signals. Sliding transform calculates the transform coefficients of the signal in a fixed-si...
Autor principal: | Kober, Vitaly |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7582812/ https://www.ncbi.nlm.nih.gov/pubmed/32998346 http://dx.doi.org/10.3390/s20195556 |
Ejemplares similares
-
Flexibility of Boolean Network Reservoir Computers in Approximating Arbitrary Recursive and Non-Recursive Binary Filters
por: Echlin, Moriah, et al.
Publicado: (2018) -
Loop equations and topological recursion for the arbitrary-$\beta$ two-matrix model
por: Bergere, Michel, et al.
Publicado: (2011) -
Recursion-Transform method to a non-regular m×n cobweb with an arbitrary longitude
por: Tan, Zhi-Zhong
Publicado: (2015) -
Sparse Sliding-Window Kernel Recursive Least-Squares Channel Prediction for Fast Time-Varying MIMO Systems
por: Ai, Xingxing, et al.
Publicado: (2022) -
Fault Tolerant DHT-Based Routing in MANET
por: Zahid, Saleem, et al.
Publicado: (2022)