We propose a practical blind channel identification algorithm based on the principal component analysis. The algorithm estimates (1) the channel order, (2) the noise variance, and then identifies (3) the channel impulse response, from the autocorrelation of the channel output signal without using the eigenvalue and singular-value decomposition. The special features of the proposed algorithm are (1) practical method to find the channel order and (2) reduction of computational complexity. Numerical examples show the effectiveness of the proposed algorithm.
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
Nari TANABE, Toshihiro FURUKAWA, Kohichi SAKANIWA, Shigeo TSUJII, "A Practical Subspace Blind Identification Algorithm with Reduced Computational Complexity" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 12, pp. 3360-3371, December 2004, doi: .
Abstract: We propose a practical blind channel identification algorithm based on the principal component analysis. The algorithm estimates (1) the channel order, (2) the noise variance, and then identifies (3) the channel impulse response, from the autocorrelation of the channel output signal without using the eigenvalue and singular-value decomposition. The special features of the proposed algorithm are (1) practical method to find the channel order and (2) reduction of computational complexity. Numerical examples show the effectiveness of the proposed algorithm.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_12_3360/_p
Copy
@ARTICLE{e87-a_12_3360,
author={Nari TANABE, Toshihiro FURUKAWA, Kohichi SAKANIWA, Shigeo TSUJII, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Practical Subspace Blind Identification Algorithm with Reduced Computational Complexity},
year={2004},
volume={E87-A},
number={12},
pages={3360-3371},
abstract={We propose a practical blind channel identification algorithm based on the principal component analysis. The algorithm estimates (1) the channel order, (2) the noise variance, and then identifies (3) the channel impulse response, from the autocorrelation of the channel output signal without using the eigenvalue and singular-value decomposition. The special features of the proposed algorithm are (1) practical method to find the channel order and (2) reduction of computational complexity. Numerical examples show the effectiveness of the proposed algorithm.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - A Practical Subspace Blind Identification Algorithm with Reduced Computational Complexity
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3360
EP - 3371
AU - Nari TANABE
AU - Toshihiro FURUKAWA
AU - Kohichi SAKANIWA
AU - Shigeo TSUJII
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2004
AB - We propose a practical blind channel identification algorithm based on the principal component analysis. The algorithm estimates (1) the channel order, (2) the noise variance, and then identifies (3) the channel impulse response, from the autocorrelation of the channel output signal without using the eigenvalue and singular-value decomposition. The special features of the proposed algorithm are (1) practical method to find the channel order and (2) reduction of computational complexity. Numerical examples show the effectiveness of the proposed algorithm.
ER -