IEICE TRANSACTIONS on Communications
Subspace-Based Blind Detection of Space-Time Coding
Summary :
Space-time coding (STC) schemes for communication systems employing multiple transmit and receive antennas have received considerable interest recently. On space-time coding, some algorithms with perfect channel state information (CSI) have been proposed. In certain fast varying situation, however, it may be difficult to estimate the channel accurately and it is natural to study the blind detection algorithm without CSI. In this paper, based on subspace, a new blind detection algorithm without CSI is proposed. Using singular value decomposition (SVD) on output signal, noise subspace and signal subspace, which keep orthogonal to each other, are obtained. By searching the intersection of the signal subspace and the limited symbol vector set, symbol detection is achieved. The simulations illustrate that the proposed algorithm significantly improves system performance by receiving more output signals relative to transmit symbols. Furthermore, the presented algorithm is robust to the fading channel that changes between two successive blocks.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E89-B No.3 pp.853-858
- Publication Date
- 2006/03/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e89-b.3.853
- Type of Manuscript
- PAPER
- Category
- Wireless Communication Technologies
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
Zhengwei GONG, Taiyi ZHANG, Haiyuan LIU, Feng LIU, "Subspace-Based Blind Detection of Space-Time Coding" in IEICE TRANSACTIONS on Communications,
vol. E89-B, no. 3, pp. 853-858, March 2006, doi: 10.1093/ietcom/e89-b.3.853.
Abstract: Space-time coding (STC) schemes for communication systems employing multiple transmit and receive antennas have received considerable interest recently. On space-time coding, some algorithms with perfect channel state information (CSI) have been proposed. In certain fast varying situation, however, it may be difficult to estimate the channel accurately and it is natural to study the blind detection algorithm without CSI. In this paper, based on subspace, a new blind detection algorithm without CSI is proposed. Using singular value decomposition (SVD) on output signal, noise subspace and signal subspace, which keep orthogonal to each other, are obtained. By searching the intersection of the signal subspace and the limited symbol vector set, symbol detection is achieved. The simulations illustrate that the proposed algorithm significantly improves system performance by receiving more output signals relative to transmit symbols. Furthermore, the presented algorithm is robust to the fading channel that changes between two successive blocks.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.3.853/_p
Copy
@ARTICLE{e89-b_3_853,
author={Zhengwei GONG, Taiyi ZHANG, Haiyuan LIU, Feng LIU, },
journal={IEICE TRANSACTIONS on Communications},
title={Subspace-Based Blind Detection of Space-Time Coding},
year={2006},
volume={E89-B},
number={3},
pages={853-858},
abstract={Space-time coding (STC) schemes for communication systems employing multiple transmit and receive antennas have received considerable interest recently. On space-time coding, some algorithms with perfect channel state information (CSI) have been proposed. In certain fast varying situation, however, it may be difficult to estimate the channel accurately and it is natural to study the blind detection algorithm without CSI. In this paper, based on subspace, a new blind detection algorithm without CSI is proposed. Using singular value decomposition (SVD) on output signal, noise subspace and signal subspace, which keep orthogonal to each other, are obtained. By searching the intersection of the signal subspace and the limited symbol vector set, symbol detection is achieved. The simulations illustrate that the proposed algorithm significantly improves system performance by receiving more output signals relative to transmit symbols. Furthermore, the presented algorithm is robust to the fading channel that changes between two successive blocks.},
keywords={},
doi={10.1093/ietcom/e89-b.3.853},
ISSN={1745-1345},
month={March},}
Copy
TY - JOUR
TI - Subspace-Based Blind Detection of Space-Time Coding
T2 - IEICE TRANSACTIONS on Communications
SP - 853
EP - 858
AU - Zhengwei GONG
AU - Taiyi ZHANG
AU - Haiyuan LIU
AU - Feng LIU
PY - 2006
DO - 10.1093/ietcom/e89-b.3.853
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2006
AB - Space-time coding (STC) schemes for communication systems employing multiple transmit and receive antennas have received considerable interest recently. On space-time coding, some algorithms with perfect channel state information (CSI) have been proposed. In certain fast varying situation, however, it may be difficult to estimate the channel accurately and it is natural to study the blind detection algorithm without CSI. In this paper, based on subspace, a new blind detection algorithm without CSI is proposed. Using singular value decomposition (SVD) on output signal, noise subspace and signal subspace, which keep orthogonal to each other, are obtained. By searching the intersection of the signal subspace and the limited symbol vector set, symbol detection is achieved. The simulations illustrate that the proposed algorithm significantly improves system performance by receiving more output signals relative to transmit symbols. Furthermore, the presented algorithm is robust to the fading channel that changes between two successive blocks.
ER -
English
