The hyper H∞ filter derived in our previous work provides excellent convergence, tracking, and robust performances for linear time-varying system identification. Additionally, a fast algorithm of the hyper H∞ filter, called the fast H∞ filter, is successfully developed so that identification of linear system with impulse response of length N is performed at a computational complexity of O(N). The gain matrix of the fast filter is recursively calculated through estimating the forward and backward linear prediction coefficients of an input signal. This suggests that the fast H∞ filter may be applicable to linear prediction of the signal. On the other hand, an alternative fast version of the hyper H∞ filter, called the J-fast H∞ filter, is derived using a J-unitary array form, which is amenable to parallel processing. However, the J-fast H∞ filter explicitly includes no linear prediction of input signals in the algorithm. This work reveals that the forward and backward linear prediction coefficients and error powers of the input signal are indeed included in the recursive variables of the J-fast H∞ filter. These findings are verified by computer simulations.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Kiyoshi NISHIYAMA, "Algorithm Understanding of the J-Fast H∞ Filter Based on Linear Prediction of Input Signal" in IEICE TRANSACTIONS on Fundamentals,
vol. E95-A, no. 7, pp. 1175-1179, July 2012, doi: 10.1587/transfun.E95.A.1175.
Abstract: The hyper H∞ filter derived in our previous work provides excellent convergence, tracking, and robust performances for linear time-varying system identification. Additionally, a fast algorithm of the hyper H∞ filter, called the fast H∞ filter, is successfully developed so that identification of linear system with impulse response of length N is performed at a computational complexity of O(N). The gain matrix of the fast filter is recursively calculated through estimating the forward and backward linear prediction coefficients of an input signal. This suggests that the fast H∞ filter may be applicable to linear prediction of the signal. On the other hand, an alternative fast version of the hyper H∞ filter, called the J-fast H∞ filter, is derived using a J-unitary array form, which is amenable to parallel processing. However, the J-fast H∞ filter explicitly includes no linear prediction of input signals in the algorithm. This work reveals that the forward and backward linear prediction coefficients and error powers of the input signal are indeed included in the recursive variables of the J-fast H∞ filter. These findings are verified by computer simulations.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E95.A.1175/_p
Copy
@ARTICLE{e95-a_7_1175,
author={Kiyoshi NISHIYAMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Algorithm Understanding of the J-Fast H∞ Filter Based on Linear Prediction of Input Signal},
year={2012},
volume={E95-A},
number={7},
pages={1175-1179},
abstract={The hyper H∞ filter derived in our previous work provides excellent convergence, tracking, and robust performances for linear time-varying system identification. Additionally, a fast algorithm of the hyper H∞ filter, called the fast H∞ filter, is successfully developed so that identification of linear system with impulse response of length N is performed at a computational complexity of O(N). The gain matrix of the fast filter is recursively calculated through estimating the forward and backward linear prediction coefficients of an input signal. This suggests that the fast H∞ filter may be applicable to linear prediction of the signal. On the other hand, an alternative fast version of the hyper H∞ filter, called the J-fast H∞ filter, is derived using a J-unitary array form, which is amenable to parallel processing. However, the J-fast H∞ filter explicitly includes no linear prediction of input signals in the algorithm. This work reveals that the forward and backward linear prediction coefficients and error powers of the input signal are indeed included in the recursive variables of the J-fast H∞ filter. These findings are verified by computer simulations.},
keywords={},
doi={10.1587/transfun.E95.A.1175},
ISSN={1745-1337},
month={July},}
Copy
TY - JOUR
TI - Algorithm Understanding of the J-Fast H∞ Filter Based on Linear Prediction of Input Signal
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1175
EP - 1179
AU - Kiyoshi NISHIYAMA
PY - 2012
DO - 10.1587/transfun.E95.A.1175
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E95-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2012
AB - The hyper H∞ filter derived in our previous work provides excellent convergence, tracking, and robust performances for linear time-varying system identification. Additionally, a fast algorithm of the hyper H∞ filter, called the fast H∞ filter, is successfully developed so that identification of linear system with impulse response of length N is performed at a computational complexity of O(N). The gain matrix of the fast filter is recursively calculated through estimating the forward and backward linear prediction coefficients of an input signal. This suggests that the fast H∞ filter may be applicable to linear prediction of the signal. On the other hand, an alternative fast version of the hyper H∞ filter, called the J-fast H∞ filter, is derived using a J-unitary array form, which is amenable to parallel processing. However, the J-fast H∞ filter explicitly includes no linear prediction of input signals in the algorithm. This work reveals that the forward and backward linear prediction coefficients and error powers of the input signal are indeed included in the recursive variables of the J-fast H∞ filter. These findings are verified by computer simulations.
ER -