View in EDS

QOSTBC coded MIMO system with reduced complexity and optimised decoding for rank deficient channels.

Saved in:
Bibliographic Details
Title: QOSTBC coded MIMO system with reduced complexity and optimised decoding for rank deficient channels.
Authors: Gupta, Bhasker1 (AUTHOR) bgupta@ccet.ac.in, Balyan, Vipin2 (AUTHOR), Saini, Davinder S.1 (AUTHOR)
Source: IET Communications (Wiley-Blackwell). Mar2020, Vol. 14 Issue 4, p646-654. 9p.
Subject Terms: *MAXIMUM likelihood detection, *BLOCK codes, *MAXIMUM likelihood statistics, *TRANSMITTING antennas, *RECEIVING antennas, *BIT error rate, *DECODING algorithms
Abstract: In multiple‐input multiple‐output (MIMO) systems, rank deficient channels are the most common and key areas of research. In these channels, the number of transmit antennas (MTx) is higher than receive antennas (MRx) and subsequently the unknown variables are more than the number of equations. In such situations, the conventional sphere decoder (SD) fails due to the presence of zero diagonal elements in Cholesky decomposition. This study analyses the quasi‐orthogonal space‐time block code (QOSTBC) of symbol rate‐2 for MTx = 4 with modified double‐layer SD detection to overcome rank deficiency problem. The first half of transmitted symbols is detected using two partially dependent SDs with optimised search radii. The remaining half is detected by employing single symbol maximum likelihood detection. Simulation and analytical results indicate that the proposed detection scheme reduces bit error rate and complexity compared to existing techniques. [ABSTRACT FROM AUTHOR]
Database: Academic Search Index
Description
Abstract:In multiple‐input multiple‐output (MIMO) systems, rank deficient channels are the most common and key areas of research. In these channels, the number of transmit antennas (MTx) is higher than receive antennas (MRx) and subsequently the unknown variables are more than the number of equations. In such situations, the conventional sphere decoder (SD) fails due to the presence of zero diagonal elements in Cholesky decomposition. This study analyses the quasi‐orthogonal space‐time block code (QOSTBC) of symbol rate‐2 for MTx = 4 with modified double‐layer SD detection to overcome rank deficiency problem. The first half of transmitted symbols is detected using two partially dependent SDs with optimised search radii. The remaining half is detected by employing single symbol maximum likelihood detection. Simulation and analytical results indicate that the proposed detection scheme reduces bit error rate and complexity compared to existing techniques. [ABSTRACT FROM AUTHOR]
ISSN:17518628
DOI:10.1049/iet-com.2018.6014