Next Article in Journal
The Effect of Rice Straw Gasification Temperature on the Release and Occurrence Modes of Na and K in a Fluidized Bed
Next Article in Special Issue
Linear Approximation Signal Detection Scheme in MIMO-OFDM Systems
Previous Article in Journal
A Non-Reference Image Denoising Method for Infrared Thermal Image Based on Enhanced Dual-Tree Complex Wavelet Optimized by Fruit Fly Algorithm and Bilateral Filter
Previous Article in Special Issue
Moving-Target Position Estimation Using GPU-Based Particle Filter for IoT Sensing Applications
Article Menu
Issue 12 (December) cover image

Export Article

Open AccessArticle
Appl. Sci. 2017, 7(12), 1206; doi:10.3390/app7121206

Low-Complexity QRD-M with Path Eliminations in MIMO-OFDM Systems

uT Communication Research Institute, Sejong University, Seoul 05006, Gwangjin-gu, Gunja-dong 98, Korea
*
Author to whom correspondence should be addressed.
Received: 18 September 2017 / Revised: 21 November 2017 / Accepted: 21 November 2017 / Published: 23 November 2017
(This article belongs to the Special Issue Advanced Internet of Things for Smart Infrastructure System)
View Full-Text   |   Download PDF [2093 KB, uploaded 23 November 2017]   |  

Abstract

The QR decomposition-M algorithm (QRD-M) is a popular signal detector which has similar error performance with maximum likelihood (ML) in multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) systems. The QRD-M uses M candidates at each layer, unlike the ML. However, the complexity of the QRD-M is high in huge MIMO-OFDM systems due to unnecessary survival paths at each layer. In this paper, a low-complexity QRD-M with variable number of survival paths at each layer is proposed. In the conventional QRD-M, path eliminations at the previous layer reduce the number of calculations for accumulated squared Euclidean distance (ASED) in subsequent layers. The proposed QRD-M eliminates unnecessary survival paths by comparing the ASED and the calculated threshold at each layer. The simulation results show that the proposed QRD-M maintains the error performance for the conventional QRD-M and has a very low complexity. View Full-Text
Keywords: MIMO-OFDM; QRD-M; survival path; path elimination MIMO-OFDM; QRD-M; survival path; path elimination
Figures

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Ro, J.-H.; Kim, J.-K.; You, Y.-H.; Song, H.-K. Low-Complexity QRD-M with Path Eliminations in MIMO-OFDM Systems. Appl. Sci. 2017, 7, 1206.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Appl. Sci. EISSN 2076-3417 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top