اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدHermite Expansion Model and LMMSE Analysis for Low-Resolution Quantized MIMO Detection
85
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, the Hermite polynomials are employed to study linear approximation models of narrowband multiantenna signal reception (i.e., MIMO) with low-resolution quantizations. This study results in a novel linear approximation using the second-order Hermite expansion (SOHE). The SOHE model is not based on those assumptions often used in existing linear approximations. Instead, the quantization distortion is characterized by the second-order Hermite kernel, and the signal term is characterized by the first-order Hermite kernel. It is shown that the SOHE model can explain almost all phenomena and characteristics observed so far in the low-resolution MIMO signal reception. When the SOHE model is employed to analyze the linear minimum-mean-square-error (LMMSE) channel equalizer, it is revealed that the current LMMSE algorithm can be enhanced by incorporating a symbol-level normalization mechanism. The performance of the enhanced LMMSE algorithm is demonstrated through computer simulations for narrowband MIMO systems in Rayleigh fading channels.
قيم البحث
اقرأ أيضاً
We investigate a reconfigurable intelligent surface (RIS)-aided multi-user massive multiple-input multi-output (MIMO) system where low-resolution digital-analog converters (DACs) are configured at the base station (BS) in order to reduce the cost and
power consumption. An approximate analytical expression for the downlink achievable rate is derived based on maximum ratio transmission (MRT) and additive quantization noise model (AQNM), and the rate maximization problem is solved by particle swarm optimization (PSO) method under both continuous phase shifts (CPSs) and discrete phase shifts (DPSs) at the RIS. Simulation results show that the downlink sum achievable rate tends to a constant with the increase of the number of quantization bits of DACs, and four quantization bits are enough to capture a large portion of the performance of the ideal perfect DACs case.
In this paper, we present a new scenario of direction of arrival (DOA) estimation using massive multiple-input multiple-output (MIMO) receive array with low-resolution analog-to-digital convertors (ADCs), which can strike a good balance between perfo
rmance and circuit cost. Based on the linear additive quantization noise model (AQNM), the effect of low-resolution ADCs on the methods, such as Root-MUSIC method, is analyzed. Also, the closed-form expression of Cramer-Rao lower bound (CRLB) is derived to evaluate the performance loss caused by the low-resolution ADCs. The simulation results show that the Root-MUSIC methods can achieve the corresponding CRLB. Furthermore, 2-3 bits are acceptable for most applications if the 1dB performance loss.
In order to reduce hardware complexity and power consumption, massive multiple-input multiple-output (MIMO) systems employ low-resolution analog-to-digital converters (ADCs) to acquire quantized measurements $boldsymbol y$. This poses new challenges
to the channel estimation problem, and the sparse prior on the channel coefficient vector $boldsymbol x$ in the angle domain is often used to compensate for the information lost during quantization. By interpreting the sparse prior from a probabilistic perspective, we can assume $boldsymbol x$ follows certain sparse prior distribution and recover it using approximate message passing (AMP). However, the distribution parameters are unknown in practice and need to be estimated. Due to the increased computational complexity in the quantization noise model, previous works either use an approximated noise model or manually tune the noise distribution parameters. In this paper, we treat both signals and parameters as random variables and recover them jointly within the AMP framework. The proposed approach leads to a much simpler parameter estimation method, allowing us to work with the quantization noise model directly. Experimental results show that the proposed approach achieves state-of-the-art performance under various noise levels and does not require parameter tuning, making it a practical and maintenance-free approach for channel estimation.
Lattice reduction is a popular preprocessing strategy in multiple-input multiple-output (MIMO) detection. In a quest for developing a low-complexity reduction algorithm for large-scale problems, this paper investigates a new framework called sequenti
al reduction (SR), which aims to reduce the lengths of all basis vectors. The performance upper bounds of the strongest reduction in SR are given when the lattice dimension is no larger than 4. The proposed new framework enables the implementation of a hash-based low-complexity lattice reduction algorithm, which becomes especially tempting when applied to large-scale MIMO detection. Simulation results show that, compared to other reduction algorithms, the hash-based SR algorithm exhibits the lowest complexity while maintaining comparable error performance.
The performance of short polar codes under successive cancellation (SC) and SC list (SCL) decoding is analyzed for the case where the decoder messages are coarsely quantized. This setting is of particular interest for applications requiring low-compl
exity energy-efficient transceivers (e.g., internet-of-things or wireless sensor networks). We focus on the extreme case where the decoder messages are quantized with 3 levels. We show how under SCL decoding quantized log-likelihood ratios lead to a large inaccuracy in the calculation of path metrics, resulting in considerable performance losses with respect to an unquantized SCL decoder. We then introduce two novel techniques which improve the performance of SCL decoding with coarse quantization. The first technique consists of a modification of the final decision step of SCL decoding, where the selected codeword is the one maximizing the maximum-likelihood decoding metric within the final list. The second technique relies on statistical knowledge about the reliability of the bit estimates, obtained through a suitably modified density evolution analysis, to improve the list construction phase, yielding a higher probability of having the transmitted codeword in the list. The effectiveness of the two techniques is demonstrated through simulations.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
