2016
DOI: 10.1016/j.aej.2016.06.017
|View full text |Cite
|
Sign up to set email alerts
|

Fast calculation algorithm for discrete resonance-based band-pass filter

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 1 publication
0
1
0
Order By: Relevance
“…The bandpass filter is highly amenable to optimization: the individual columns of the matrix can be parallelized for linear speedup, and the fft itself can be offloaded onto a GPU if the data will fit into the GPU's memory. It may also be possible to reduce the complexity of the bandpass to O(N × T ) using the approach of (Pankovski 2016) in the future. Second, in the current version, limited data formats are supported.…”
Section: Limitations and Future Workmentioning
confidence: 99%
“…The bandpass filter is highly amenable to optimization: the individual columns of the matrix can be parallelized for linear speedup, and the fft itself can be offloaded onto a GPU if the data will fit into the GPU's memory. It may also be possible to reduce the complexity of the bandpass to O(N × T ) using the approach of (Pankovski 2016) in the future. Second, in the current version, limited data formats are supported.…”
Section: Limitations and Future Workmentioning
confidence: 99%