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
직접 시퀀스 코드 분할 다중 접속 통신 시스템에서 다중 접속 간섭을 성공적으로 억제하고 근거리 문제를 완화하기 위해 최소 평균 제곱 오차(MMSE) 선형 검출기가 제안되었습니다. 알 수 없거나 시간에 따라 변하는 채널 매개변수가 있는 경우 MMSE 선형 검출기는 초기 적응을 위해 기호의 훈련 시퀀스 대신 원하는 신호 벡터를 사용하는 블라인드 그리피스 알고리즘에 의해 구현될 수 있습니다. 본 논문에서는 특히 강한 간섭이 있을 때 수렴 속도를 가속화하기 위한 가변 스텝 크기(VSS) 그리피스 알고리즘을 제안합니다. 수치 결과는 VSS 그리피스 알고리즘의 수렴 특성이 고정된 스텝 크기를 사용하는 그리피스 알고리즘과 비교하여 수신 신호 벡터와 연관된 상관 행렬의 넓은 고유치 확산 문제에 대해 견고함을 보여줍니다.
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.
부
Ho-Chi HWANG, Che-Ho WEI, "Adaptive Variable Step-Size Griffiths' Algorithm for Blind Demodulation of DS/CDMA Signals" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 10, pp. 1643-1650, October 1999, doi: .
Abstract: The minimum mean-squared error (MMSE) linear detector has been proposed to successfully suppress the multiple access interference and mitigate the near-far problem in direct-sequence code-division multiple access communication systems. In the presence of unknown or time-varying channel parameters, the MMSE linear detector can be implemented by the blind Griffiths' algorithm, which uses the desired signal vector instead of a training sequence of symbols for initial adaptation. In this paper, a variable step-size (VSS) Griffiths' algorithm is proposed for accelerating the convergence speed, especially in the presence of strong interference. Numerical results show that the convergence properties of the VSS Griffiths' algorithm are robust against the wide eigenvalue-spread problem of the correlation matrix associated with the received signal vector compared to the Griffiths' algorithm using a fixed step-size.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_10_1643/_p
부
@ARTICLE{e82-b_10_1643,
author={Ho-Chi HWANG, Che-Ho WEI, },
journal={IEICE TRANSACTIONS on Communications},
title={Adaptive Variable Step-Size Griffiths' Algorithm for Blind Demodulation of DS/CDMA Signals},
year={1999},
volume={E82-B},
number={10},
pages={1643-1650},
abstract={The minimum mean-squared error (MMSE) linear detector has been proposed to successfully suppress the multiple access interference and mitigate the near-far problem in direct-sequence code-division multiple access communication systems. In the presence of unknown or time-varying channel parameters, the MMSE linear detector can be implemented by the blind Griffiths' algorithm, which uses the desired signal vector instead of a training sequence of symbols for initial adaptation. In this paper, a variable step-size (VSS) Griffiths' algorithm is proposed for accelerating the convergence speed, especially in the presence of strong interference. Numerical results show that the convergence properties of the VSS Griffiths' algorithm are robust against the wide eigenvalue-spread problem of the correlation matrix associated with the received signal vector compared to the Griffiths' algorithm using a fixed step-size.},
keywords={},
doi={},
ISSN={},
month={October},}
부
TY - JOUR
TI - Adaptive Variable Step-Size Griffiths' Algorithm for Blind Demodulation of DS/CDMA Signals
T2 - IEICE TRANSACTIONS on Communications
SP - 1643
EP - 1650
AU - Ho-Chi HWANG
AU - Che-Ho WEI
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 1999
AB - The minimum mean-squared error (MMSE) linear detector has been proposed to successfully suppress the multiple access interference and mitigate the near-far problem in direct-sequence code-division multiple access communication systems. In the presence of unknown or time-varying channel parameters, the MMSE linear detector can be implemented by the blind Griffiths' algorithm, which uses the desired signal vector instead of a training sequence of symbols for initial adaptation. In this paper, a variable step-size (VSS) Griffiths' algorithm is proposed for accelerating the convergence speed, especially in the presence of strong interference. Numerical results show that the convergence properties of the VSS Griffiths' algorithm are robust against the wide eigenvalue-spread problem of the correlation matrix associated with the received signal vector compared to the Griffiths' algorithm using a fixed step-size.
ER -