In this work, we examine a computationally efficient block-updating scheme for estimating the spectral content of signals with missing samples. The work is an extension of our recent single-sample data interpolation u...
详细信息
ISBN:
(纸本)9781479928934
In this work, we examine a computationally efficient block-updating scheme for estimating the spectral content of signals with missing samples. The work is an extension of our recent single-sample data interpolation updating of the Iterative Adaptive Approach (IAA), being reformulated to incorporate blocks of samples. The proposed implementation offers a substantial complexity reduction as compared to earlier presented updating schemes, without sacrificing the quality of the resulting spectral estimates more than marginally (if at all).
In this work, we propose a computationally efficient time-updating algorithm for estimating the spectral content of a signal with missing samples. The algorithm extends earlier work on the topic by formulating a data-...
详细信息
ISBN:
(纸本)9781479903566
In this work, we propose a computationally efficient time-updating algorithm for estimating the spectral content of a signal with missing samples. The algorithm extends earlier work on the topic by formulating a data-interpolation scheme reducing the required complexity to a fraction of the earlier efficient implementation, without resulting in any noticeable loss of performance for even a quite large degree of missing samples.
In this work, we propose a computationally efficient time-updating algorithm for estimating the spectral content of a signal with missing samples. The algorithm extends earlier work on the topic by formulating a data-...
详细信息
ISBN:
(纸本)9781479903573
In this work, we propose a computationally efficient time-updating algorithm for estimating the spectral content of a signal with missing samples. The algorithm extends earlier work on the topic by formulating a data-interpolation scheme reducing the required complexity to a fraction of the earlier efficient implementation, without resulting in any noticeable loss of performance for even a quite large degree of missing samples.
This paper presents computationally efficient implementations for several recent algorithms based on the iterative adaptive approach (IAA) for uniformly sampled one-and two-dimensional data sets, considering both the ...
详细信息
This paper presents computationally efficient implementations for several recent algorithms based on the iterative adaptive approach (IAA) for uniformly sampled one-and two-dimensional data sets, considering both the complete data case, and the cases when the data sets are missing samples, either lacking arbitrary locations, or having gaps or periodically reoccurring gaps. By exploiting the method's inherent low displacement rank, together with the development of suitable Gohberg-Semencul representations, and the use of data dependent trigonometric polynomials, the proposed implementations are shown to offer a reduction of the necessary computational complexity by at least one order of magnitude. Numerical simulations together with theoretical complexity measures illustrate the achieved performance gain.
暂无评论