Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181
DOI: 10.1109/icassp.1998.681699
|View full text |Cite
|
Sign up to set email alerts
|

Recursive methods for estimating multiple missing values of a multivariate stationary process

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…We have confirmed experimentally that, if we can use the data of more than about 2 s of data, we can obtain sufficiently converged LP coefficients, and the algorithm performance become relatively stable. We employed the Levinson-Durbin algorithm for single-channel long-term multi-step LP [21], and the class of Schur's algorithm for multichannel long-term multistep LP [21], [28]- [30] to calculate the prediction coefficients efficiently. These fast algorithms enable us to run the whole process at a real-time factor of less than 1, for example, on the Intel Pentium IV 3.4-GHz processor used in our experiments.…”
Section: ) Parameters For Dereverberationmentioning
confidence: 99%
See 1 more Smart Citation
“…We have confirmed experimentally that, if we can use the data of more than about 2 s of data, we can obtain sufficiently converged LP coefficients, and the algorithm performance become relatively stable. We employed the Levinson-Durbin algorithm for single-channel long-term multi-step LP [21], and the class of Schur's algorithm for multichannel long-term multistep LP [21], [28]- [30] to calculate the prediction coefficients efficiently. These fast algorithms enable us to run the whole process at a real-time factor of less than 1, for example, on the Intel Pentium IV 3.4-GHz processor used in our experiments.…”
Section: ) Parameters For Dereverberationmentioning
confidence: 99%
“…Now, can be rewritten as (27) where Note that, (25) can be efficiently solved by, for example, the class of Schur's algorithm, which is able to determine a least square solution for general block-Toeplitz matrix equations [21], [28]- [30].…”
Section: Appendix III Estimation Of Pre-whitening Filtermentioning
confidence: 99%