IEICE TRANSACTIONS on Communications
Adaptive DOA Tracking Approaches for Time-Space System in CDMA Mobile Environments
Summary :
It was previously shown that the number of array elements must exceed the number of sources for multiple target direction of arrival (DOA) tracking. This is clearly not practical for code-division multiple access (CDMA) communications since the number of mobile users is very large. To overcome the restriction, adaptive angle tracking approaches employing the code-matched filters and parallel Kalman/H∞ algorithms are presented in this paper. The proposed approaches are applied to the base station of a mobile communication system. Different from Kalman prediction algorithm which minimize the squared tracking error, the adaptive H∞ filtering algorithm is a worst case optimization. It minimizes the effect of the worst disturbances (including modeling error of direction matrix models and array structure imperfection, process noise, and measurement noise). Hence, the difficult problem of tracking the crossing mobiles can be successfully handled by using the code-matched filters. Computer simulation is provided for illustrating the effectiveness of the adaptive angle tracking approaches.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E89-B No.8 pp.2208-2217
- Publication Date
- 2006/08/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e89-b.8.2208
- Type of Manuscript
- PAPER
- Category
- Antennas and Propagation
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Ann-Chen CHANG, "Adaptive DOA Tracking Approaches for Time-Space System in CDMA Mobile Environments" in IEICE TRANSACTIONS on Communications,
vol. E89-B, no. 8, pp. 2208-2217, August 2006, doi: 10.1093/ietcom/e89-b.8.2208.
Abstract: It was previously shown that the number of array elements must exceed the number of sources for multiple target direction of arrival (DOA) tracking. This is clearly not practical for code-division multiple access (CDMA) communications since the number of mobile users is very large. To overcome the restriction, adaptive angle tracking approaches employing the code-matched filters and parallel Kalman/H∞ algorithms are presented in this paper. The proposed approaches are applied to the base station of a mobile communication system. Different from Kalman prediction algorithm which minimize the squared tracking error, the adaptive H∞ filtering algorithm is a worst case optimization. It minimizes the effect of the worst disturbances (including modeling error of direction matrix models and array structure imperfection, process noise, and measurement noise). Hence, the difficult problem of tracking the crossing mobiles can be successfully handled by using the code-matched filters. Computer simulation is provided for illustrating the effectiveness of the adaptive angle tracking approaches.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.8.2208/_p
Copy
@ARTICLE{e89-b_8_2208,
author={Ann-Chen CHANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Adaptive DOA Tracking Approaches for Time-Space System in CDMA Mobile Environments},
year={2006},
volume={E89-B},
number={8},
pages={2208-2217},
abstract={It was previously shown that the number of array elements must exceed the number of sources for multiple target direction of arrival (DOA) tracking. This is clearly not practical for code-division multiple access (CDMA) communications since the number of mobile users is very large. To overcome the restriction, adaptive angle tracking approaches employing the code-matched filters and parallel Kalman/H∞ algorithms are presented in this paper. The proposed approaches are applied to the base station of a mobile communication system. Different from Kalman prediction algorithm which minimize the squared tracking error, the adaptive H∞ filtering algorithm is a worst case optimization. It minimizes the effect of the worst disturbances (including modeling error of direction matrix models and array structure imperfection, process noise, and measurement noise). Hence, the difficult problem of tracking the crossing mobiles can be successfully handled by using the code-matched filters. Computer simulation is provided for illustrating the effectiveness of the adaptive angle tracking approaches.},
keywords={},
doi={10.1093/ietcom/e89-b.8.2208},
ISSN={1745-1345},
month={August},}
Copy
TY - JOUR
TI - Adaptive DOA Tracking Approaches for Time-Space System in CDMA Mobile Environments
T2 - IEICE TRANSACTIONS on Communications
SP - 2208
EP - 2217
AU - Ann-Chen CHANG
PY - 2006
DO - 10.1093/ietcom/e89-b.8.2208
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2006
AB - It was previously shown that the number of array elements must exceed the number of sources for multiple target direction of arrival (DOA) tracking. This is clearly not practical for code-division multiple access (CDMA) communications since the number of mobile users is very large. To overcome the restriction, adaptive angle tracking approaches employing the code-matched filters and parallel Kalman/H∞ algorithms are presented in this paper. The proposed approaches are applied to the base station of a mobile communication system. Different from Kalman prediction algorithm which minimize the squared tracking error, the adaptive H∞ filtering algorithm is a worst case optimization. It minimizes the effect of the worst disturbances (including modeling error of direction matrix models and array structure imperfection, process noise, and measurement noise). Hence, the difficult problem of tracking the crossing mobiles can be successfully handled by using the code-matched filters. Computer simulation is provided for illustrating the effectiveness of the adaptive angle tracking approaches.
ER -
English
