Please use this identifier to cite or link to this item:
http://hdl.handle.net/11189/8696
Title: | QOSTBC coded MIMO system with reduced complexity and optimised decoding for rank deficient channels | Authors: | Gupta, Bhasker Balyan, Vipin Saini, Davinder S |
Keywords: | QOSTBC;MIMO system;complexity;optimised;decoding;rank;deficient channels | Issue Date: | 2020 | Publisher: | Wiley | Source: | Gupta, B., Balyan, V. & Saini, D.S. 2020. QOSTBC coded MIMO system with reduced complexity and optimised decoding for rank deficient channels. Institution of Engineering and Technology, 14(4): 646-654. [https://doi.org/10.1049/iet-com.2018.6014] | Journal: | Institution of Engineering and Technology | 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. | URI: | http://hdl.handle.net/11189/8696 | ISSN: | 1751-8628 | DOI: | https://doi.org/10.1049/iet-com.2018.6014 |
Appears in Collections: | Eng - Journal articles (DHET subsidised) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
QOSTBC_coded_MIMO.pdf | 1.3 MB | Adobe PDF | View/Open |
Items in Digital Knowledge are protected by copyright, with all rights reserved, unless otherwise indicated.