2016 International Conference on Signal Processing and Communications (SPCOM) 2016
DOI: 10.1109/spcom.2016.7746686
|View full text |Cite
|
Sign up to set email alerts
|

Low complexity, low latency resampling of asynchronously sampled signals

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 14 publications
0
7
0
Order By: Relevance
“…Only the method described in [21] focused both on processing and group delay. The Akima algorithm provides low-complexity and fast calculation.…”
Section: Research Gapmentioning
confidence: 99%
See 3 more Smart Citations
“…Only the method described in [21] focused both on processing and group delay. The Akima algorithm provides low-complexity and fast calculation.…”
Section: Research Gapmentioning
confidence: 99%
“…The Akima algorithm provides low-complexity and fast calculation. It requires a low number of future samples, equivalent to the group delay, namely three for standard implementation, and 2 for the improved version in [21]. These advantages must be paid for by a high OSR, which determines how many more samples are needed compared to the Nyquist rate.…”
Section: Research Gapmentioning
confidence: 99%
See 2 more Smart Citations
“…Most of these methods are difficult to perform with asynchronous so it is desirable to convert them to uniform sampled data using resampling algorithms. For example, in [32], two algorithms were proposed for an asynchronous-to-synchronous resampling scheme. Signal resampling is one of the steps of the data-preprocessing process, used in many applications, such as prognosis and health management (e.g., [33]) and state identification (e.g., [34]).…”
Section: Related Workmentioning
confidence: 99%