Low-Complexity Maximum-Likelihood Decoder for Four-Transmit- Antenna Quasi-Orthogonal Space–Time Block Code

2005 ◽  
Vol 53 (11) ◽  
pp. 1817-1821 ◽  
Author(s):  
M.-T. Le ◽  
V.-S. Pham ◽  
L. Mai ◽  
G. Yoon
2015 ◽  
Vol 2015 ◽  
pp. 1-6
Author(s):  
Adel Ahmadi ◽  
Siamak Talebi

Motivated by the decompositions of sphere and QR-based methods, in this paper we present an extremely fast maximum-likelihood (ML) detection approach for quasi-orthogonal space-time block code (QOSTBC). The proposed algorithm with a relatively simple design exploits structure of quadrature amplitude modulation (QAM) constellations to achieve its goal and can be extended to any arbitrary constellation. Our decoder utilizes a new decomposition technique for ML metric which divides the metric into independent positive parts and a positive interference part. Search spaces of symbols are substantially reduced by employing the independent parts and statistics of noise. Symbols within the search spaces are successively evaluated until the metric is minimized. Simulation results confirm that the proposed decoder’s performance is superior to many of the recently published state-of-the-art solutions in terms of complexity level. More specifically, it was possible to verify that application of the new algorithms with 1024-QAM would decrease the computational complexity compared to state-of-the-art solution with 16-QAM.


Electronics ◽  
2019 ◽  
Vol 8 (7) ◽  
pp. 732
Author(s):  
Jae Jin Jeong

The quasi-orthogonal space–time block code (QO-STBC) was introduced to achieve a full transmission rate for the four antennas system. In this paper, a decoding method for the QO-STBC is proposed to improve the bit-error-rate (BER) and to solve a rank-deficient problem. The proposed algorithm is based on the minimum mean-square-error (MMSE) technique. To overcome the implementation problem from the MMSE, an estimation method of the noise variance is developed in this paper. The proposed algorithm is implemented without matrix inversion, therefore, the proposed algorithm achieves a better BER than the conventional algorithms, as it has a low computational complexity. The simulation results show the low BER of the proposed algorithm in a Rayleigh fading channel.


Sign in / Sign up

Export Citation Format

Share Document