Name
Title | ||
|---|---|---|
A Subspace Blind Identification Algorithm with Reduced Computational Complexity—Colored Noise Case— |
Abstract | ||
|---|---|---|
We have proposed in [5] a practical blind channel identification algorithm for the white observation noise. In this paper, we examine the effectiveness of the algorithm given in [5] for the colored observation noise. The proposed algorithm utilizes Gram-Schmidt orthogonalization procedure and estimates (1) the channel order, (2) the noise variance and then (3) the channel impulse response with less computational complexity compared to the conventional algorithms using eigenvalue decomposition. It can be shown through numerical examples that the algorithm proposed in [5] is quite effective in the colored noise case. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1093/ietfec/e88-a.7.2015 | IEICE Transactions |
Keywords | Field | DocType |
eigenvalue decomposition,colored noise case,noise case,observation noise,practical blind channel identification,conventional algorithm,noise variance,channel order,white observation noise,computational complexity,subspace blind identification algorithm,channel impulse response,reduced computational complexity,principal component analysis,colored noise | Value noise,Colored,Colors of noise,Subspace topology,Algorithm,Eigendecomposition of a matrix,Gaussian noise,Orthogonalization,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
E88-A | 7 | 1745-1337 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nari Tanabe | 1 | 5 | 1.95 |
| Toshihiro Furukawa | 2 | 52 | 22.17 |
| Kohichi Sakaniwa | 3 | 330 | 47.69 |
| Shigeo Tsujii | 4 | 598 | 131.15 |