Network numerical analysis for the smoother and the lagged joint-process estimator

Authors:
Yang Sun Lee;Dong Kyoo Kim;Leonard Barolli
Affiliations:
Division of Computer Engineering, Mokwon University, Daejeon, Korea;Electronics and Telecommunication Research Institute (ETRI), Daejeon, Korea;Department of Information and Communication Engineering, Fukuoka Institute of Technology (FIT), Higashi-Ku, Fukuoka, Japan 811-0295
Venue:
The Journal of Supercomputing
Year:
2013

Citing 9
Cited 0

Adaptive filter theory (3rd ed.)

Adaptive filter theory (3rd ed.)
The normalized least-squares order-recursive lattice smoother

Signal Processing
Performance Surface Prediction for WAN-Based Clusters

The Journal of Supercomputing
Error accumulation effects for the a posteriori RLSL predictionfilter

IEEE Transactions on Signal Processing
Least squares order-recursive lattice smoothers

IEEE Transactions on Signal Processing
Adaptive blind channel estimation by least squares smoothing

IEEE Transactions on Signal Processing
A note on the error propagation analysis of recursive least squaresalgorithms

IEEE Transactions on Signal Processing
Optimal and robust noncausal filter formulations

IEEE Transactions on Signal Processing
A floating-point arithmetic error analysis of direct and indirectcoefficient updating techniques for adaptive lattice filters

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by the fact that the a priori least-squares-order-recursive lattice (LSORL) smoother is more robust than the LSORL joint-process estimator with lagged desired signals in the finite precision, we model numerical properties of the two algorithms by virtue of previous efforts. Then, we give the reason why the smoother is substantially more robust than the lagged joint-process estimator by providing the explicit analysis for the performance difference of the two algorithms.