Frequency-domain Channel Frequency Response Estimation for Space-Time Coded MIMO Systems

2006 ◽  
Author(s):  
Yang Yang ◽  
Yong Chew ◽  
Tjeng Tjhung
Keyword(s):  
Frequency Response ◽  
Frequency Domain ◽  
Mimo Systems ◽  
Space Time ◽  
Channel Frequency Response

scholarly journals Fast Estimation Method of Space-Time Two-Dimensional Positioning Parameters Based on Hadamard Product

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Haiwen Li ◽  
Nae Zheng ◽  
Xiyu Song ◽  
Yinghua Tian
Keyword(s):  
Frequency Domain ◽  
Orthogonal Frequency Division Multiplexing ◽  
Hadamard Product ◽  
Estimation Method ◽  
Space Time ◽  
Joint Estimation ◽  
Two Dimensional ◽  
Music Algorithm ◽  
Fast Estimation ◽  
Response Vector

The estimation speed of positioning parameters determines the effectiveness of the positioning system. The time of arrival (TOA) and direction of arrival (DOA) parameters can be estimated by the space-time two-dimensional multiple signal classification (2D-MUSIC) algorithm for array antenna. However, this algorithm needs much time to complete the two-dimensional pseudo spectral peak search, which makes it difficult to apply in practice. Aiming at solving this problem, a fast estimation method of space-time two-dimensional positioning parameters based on Hadamard product is proposed in orthogonal frequency division multiplexing (OFDM) system, and the Cramer-Rao bound (CRB) is also presented. Firstly, according to the channel frequency domain response vector of each array, the channel frequency domain estimation vector is constructed using the Hadamard product form containing location information. Then, the autocorrelation matrix of the channel response vector for the extended array element in frequency domain and the noise subspace are calculated successively. Finally, by combining the closed-form solution and parameter pairing, the fast joint estimation for time delay and arrival direction is accomplished. The theoretical analysis and simulation results show that the proposed algorithm can significantly reduce the computational complexity and guarantee that the estimation accuracy is not only better than estimating signal parameters via rotational invariance techniques (ESPRIT) algorithm and 2D matrix pencil (MP) algorithm but also close to 2D-MUSIC algorithm. Moreover, the proposed algorithm also has certain adaptability to multipath environment and effectively improves the ability of fast acquisition of location parameters.

Новый критерий оптимальности пространственно-временных матриц

2020 ◽  
Author(s):  
A.A. Reznev ◽  
V.B. Kreyndelin
Keyword(s):  
Computational Complexity ◽  
Large Scale ◽  
Noise Immunity ◽  
Optimality Criterion ◽  
Mimo Systems ◽  
Optimality Criteria ◽  
Space Time ◽  
Space Time Codes ◽  
Golden Code ◽  
New Criterion

The application of optimality criteria for the study of space-time codes is considered. Known rank and determinant criteria are described. The computational complexity of determinant criteria is presented taking into account some estimation of the real CPUs specifications. An algorithm for calculating a new optimality criterion is described. The computational complexity of the new optimality criterion is evaluated. The new criterion is applied to the study of the space-time Golden matrix. The obtained criterion value is used to modify the Golden code. The modeling for Golden code demonstrates that criterion works and gives us better levels for noise immunity. The proposed optimality criterion is acceptable in terms of computational complexity even for a large number of antennas, which is typical for large-scale MIMO systems. Рассматривается применение критериев оптимальности для исследования пространственно-временных кодов.Описаны известные ранговый и детерминантный критерии. Для детерминантного критерия оценена вычислительная сложность с учетом определения специальных высокопроизводительных процессоров. Описан алгоритм расчета нового критерия оптимальности. Проведена оценка вычислительной сложности нового критерия оптимальности. Новый критерий применен для исследования пространственно-временной матрицы Голден. Полученное значение критерия использовано для модификациикода Голден. Продемонстрированы кривые помехоустойчивости для кода Голден и кода Голден с модифицированным параметром, получен энергетический выигрыш. Предложенный критерий оптимальности приемлем с точки зрения вычислительнойсложности даже при большом числе антенн, характерном для систем широкомасштабного MIMO.

Sign in / Sign up

Export Citation Format

Share Document