The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
주파수 선택성 페이딩을 적용한 시변 채널에 적용 가능한 블라인드 채널 추정 알고리즘을 제안한다. 시간적, 공간적으로 오버샘플링된 데이터를 이용한 블라인드 채널 식별 가능성에 대한 조건이 표시됩니다. 제안하는 알고리즘은 두 단계로 구성된다. 첫 번째 단계에서는 채널의 시변 특성을 고려하여 채널 등화 행렬을 추정합니다. 두 번째 단계에서는 전송된 심볼의 유한 알파벳 속성을 이용하여 신호와 채널 행렬을 교대로 추정한다. 두 번째 단계에서 첫 번째 단계로의 주기적 복귀는 빠른 페이딩을 갖는 시변 채널에 대해 블라인드 추정 알고리즘을 가능하게 합니다. 시뮬레이션 결과는 주파수 선택성 페이딩에 대한 빠른 수렴 특성과 제안된 알고리즘의 효율성을 확인합니다.
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.
부
Koji SHIBATA, Takuma YAGI, Takakazu SAKAI, Atsushi NAKAGAKI, "Blind Channel Estimation for Time-Varying Frequency-Selective Fading Channels" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 10, pp. 1904-1913, October 2000, doi: .
Abstract: Blind channel estimation algorithm which is applicable to the time-variant channel under frequency-selective fading is proposed. The condition on the blind channel identifiability using temporally and spatially oversampled data is shown. The proposed algorithm consists of two stages. At the first stage, the channel equalization matrix is estimated by taking account of the time-variant characteristics of the channel. At the second stage, the signals and the channel matrix are alternately estimated by using the finite alphabet property of the transmitted symbols. Periodical return from the second stage to the first makes the blind estimation algorithm feasible for the time-variant channel with fast fading. The simulation results confirm the fast convergence property and the effectiveness of the proposed algorithm in coping with the frequency-selective fading.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_10_1904/_p
부
@ARTICLE{e83-a_10_1904,
author={Koji SHIBATA, Takuma YAGI, Takakazu SAKAI, Atsushi NAKAGAKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Blind Channel Estimation for Time-Varying Frequency-Selective Fading Channels},
year={2000},
volume={E83-A},
number={10},
pages={1904-1913},
abstract={Blind channel estimation algorithm which is applicable to the time-variant channel under frequency-selective fading is proposed. The condition on the blind channel identifiability using temporally and spatially oversampled data is shown. The proposed algorithm consists of two stages. At the first stage, the channel equalization matrix is estimated by taking account of the time-variant characteristics of the channel. At the second stage, the signals and the channel matrix are alternately estimated by using the finite alphabet property of the transmitted symbols. Periodical return from the second stage to the first makes the blind estimation algorithm feasible for the time-variant channel with fast fading. The simulation results confirm the fast convergence property and the effectiveness of the proposed algorithm in coping with the frequency-selective fading.},
keywords={},
doi={},
ISSN={},
month={October},}
부
TY - JOUR
TI - Blind Channel Estimation for Time-Varying Frequency-Selective Fading Channels
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1904
EP - 1913
AU - Koji SHIBATA
AU - Takuma YAGI
AU - Takakazu SAKAI
AU - Atsushi NAKAGAKI
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2000
AB - Blind channel estimation algorithm which is applicable to the time-variant channel under frequency-selective fading is proposed. The condition on the blind channel identifiability using temporally and spatially oversampled data is shown. The proposed algorithm consists of two stages. At the first stage, the channel equalization matrix is estimated by taking account of the time-variant characteristics of the channel. At the second stage, the signals and the channel matrix are alternately estimated by using the finite alphabet property of the transmitted symbols. Periodical return from the second stage to the first makes the blind estimation algorithm feasible for the time-variant channel with fast fading. The simulation results confirm the fast convergence property and the effectiveness of the proposed algorithm in coping with the frequency-selective fading.
ER -