کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6951657 | 1451700 | 2018 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Simplicity-based recovery of finite-alphabet signals for large-scale MIMO systems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
پردازش سیگنال
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Simplicity-based recovery of finite-alphabet signals for large-scale MIMO systems Simplicity-based recovery of finite-alphabet signals for large-scale MIMO systems](/preview/png/6951657.png)
چکیده انگلیسی
In this paper, we consider the problem of finite-alphabet source separation in both determined and underdetermined large-scale systems. First, we address the noiseless case and we propose a linear criterion based on â1-minimization combined with box constraints. We investigate also the system conditions that ensure successful recovery. Next, we apply the approach to the noisy massive MIMO transmission and we propose a quadratic criterion-based detector. Simulation results show the efficiency of the proposed detection methods for various QAM modulations and MIMO configurations. We mention that there is no change in the computational complexity when the constellation size increases. Moreover, the proposed method outperforms the classical Minimum Mean Square Error (MMSE)-based detection algorithms.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Digital Signal Processing - Volume 80, September 2018, Pages 70-82
Journal: Digital Signal Processing - Volume 80, September 2018, Pages 70-82
نویسندگان
Zahran Hajji, Abdeldjalil Aïssa-El-Bey, Karine Amis,