摘要
Vertical layered space-time codes have demonstrated the enormous potential to accommodate rapid flow data. Thus far, vertical layered space-time codes assumed that perfect estimates of current channel fading conditions are available at the receiver. However, increasing the number of transmit antennas increases the required training interval and reduces the available time in which data may be transmitted before the fading coefficients change. In this paper, a vertical layered space-time code is proposed. By applying the subspace method to the layered space-time code, the symbols can be detected without training symbols and channel estimates at the transmitter or the receiver. Monte Carlo simulations show that performance can approach that of the detection method with the knowledge of the channel.
Vertical layered space-time codes have demonstrated the enormous potential to accommodate rapid flow data. Thus far, vertical layered space-time codes assumed that perfect estimates of current channel fading conditions are available at the receiver. However, increasing the number of transmit antennas increases the required training interval and reduces the available time in which data may be transmitted before the fading coefficients change. In this paper, a vertical layered space-time code is proposed. By applying the subspace method to the layered space-time code, the symbols can be detected without, training symbols and channel estimates at the transmitter or the receiver. Monte Carlo simulations show that performance can approach that of the detection method with the knowledge of the channel.
基金
Partially supported by the National Natural Sciences Foundation (No.69872029) and the Research Fund for Doctoral Program of Higher Education (No.1999069808) of China
关键词
时空编码
信号处理
子空间法
盲符号探测
Layered space-time code
Array signal processing
Subspace method
Blind symbol detection