اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn Throughput Improvement using Immediate Re-transmission in Grant-Free Random Access with Massive MIMO
57
0
0.0
(
0
)
تأليف
Jinho Choi
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
To support machine-type communication (MTC), massive multiple-input multiple-output (MIMO) has been considered for grant-free random access. In general, the performance of grant-free random access with massive MIMO is limited by the number of preambles and the number of active devices. In particular, when there are a number of active devices transmitting data packets simultaneously, the signal-to-interference-plus-noise ratio (SINR) cannot be high enough for successful decoding. In this paper, in order to improve performance, we consider immediate re-transmissions for an active device that has a low SINR although it does not experience preamble collision to exploit re-transmission diversity (RTD) gain. To see the performance of the proposed approach, we perform throughput analysis with certain approximations and assumption. Since the proposed approach can be unstable due to immediate re-transmissions, conditions for stable systems are also studied. Simulations are carried out and it is shown that analysis results reasonably match simulation results.
قيم البحث
اقرأ أيضاً
This paper designs a cooperative activity detection framework for massive grant-free random access in the sixth-generation (6G) cell-free wireless networks based on the covariance of the received signals at the access points (APs). In particular, mul
tiple APs cooperatively detect the device activity by only exchanging the low-dimensional intermediate local information with their neighbors. The cooperative activity detection problem is non-smooth and the unknown variables are coupled with each other for which conventional approaches are inapplicable. Therefore, this paper proposes a covariance-based algorithm by exploiting the sparsity-promoting and similarity-promoting terms of the device state vectors among neighboring APs. An approximate splitting approach is proposed based on the proximal gradient method for solving the formulated problem. Simulation results show that the proposed algorithm is efficient for large-scale activity detection problems while requires shorter pilot sequences compared with the state-of-art algorithms in achieving the same system performance.
A high success rate of grant-free random access scheme is proposed to support massive access for machine-to-machine communications in massive multipleinput multiple-output systems. This scheme allows active user equipments (UEs) to transmit their mod
ulated uplink messages along with super pilots consisting of multiple sub-pilots to a base station (BS). Then, the BS performs channel state information (CSI) estimation and uplink message decoding by utilizing a proposed graph combined clustering independent component analysis (GCICA) decoding algorithm, and then employs the estimated CSIs to detect active UEs by utilizing the characteristic of asymptotic favorable propagation of massive MIMO channel. We call this proposed scheme as GCICA based random access (GCICA-RA) scheme. We analyze the successful access probability, missed detection probability, and uplink throughput of the GCICA-RA scheme. Numerical results show that, the GCICA-RA scheme significantly improves the successful access probability and uplink throughput, decreases missed detection probability, and provides low CSI estimation error at the same time.
In this paper, the design of robust linear precoders for the massive multi-input multi-output (MIMO) downlink with imperfect channel state information (CSI) is investigated. The imperfect CSI for each UE obtained at the BS is modeled as statistical C
SI under a jointly correlated channel model with both channel mean and channel variance information, which includes the effects of channel estimation error, channel aging and spatial correlation. The design objective is to maximize the expected weighted sum-rate. By combining the minorize-maximize (MM) algorithm with the deterministic equivalent method, an algorithm for robust linear precoder design is derived. The proposed algorithm achieves a stationary point of the expected weighted sum-rate maximization problem. To reduce the computational complexity, two low-complexity algorithms are then derived. One for the general case, and the other for the case when all the channel means are zeros. For the later case, it is proved that the beam domain transmission is optimal, and thus the precoder design reduces to the power allocation optimization in the beam domain. Simulation results show that the proposed robust linear precoder designs apply to various mobile scenarios and achieve high spectral efficiency.
In this paper, we investigate the performance of cell-free massive MIMO systems with massive connectivity. With the generalized approximate message passing (GAMP) algorithm, we obtain the minimum mean-squared error (MMSE) estimate of the effective ch
annel coefficients from all users to all access points (APs) in order to perform joint user activity detection and channel estimation. Subsequently, using the decoupling properties of MMSE estimation for large linear systems and state evolution equations of the GAMP algorithm, we obtain the variances of both the estimated channel coefficients and the corresponding channel estimation error. Finally, we study the achievable uplink rates with zero-forcing (ZF) detector at the central processing unit (CPU) of the cell-free massive MIMO system. With numerical results, we analyze the impact of the number of pilots used for joint activity detection and channel estimation, the number of APs, and signal-to-noise ratio (SNR) on the achievable rates.
Grant-free sparse code multiple access (GF-SCMA) is considered to be a promising multiple access candidate for future wireless networks. In this paper, we focus on characterizing the performance of uplink GF-SCMA schemes in a network with ubiquitous
connections, such as the Internet of Things (IoT) networks. To provide a tractable approach to evaluate the performance of GF-SCMA, we first develop a theoretical model taking into account the property of multi-user detection (MUD) in the SCMA system. We then analyze the error rate performance of GF-SCMA in the case of codebook collision to investigate the reliability of GF-SCMA when reusing codebook in massive IoT networks. For performance evaluation, accurate approximations for both success probability and average symbol error probability (ASEP) are derived. To elaborate further, we utilize the analytical results to discuss the impact of codeword sparse degree in GFSCMA. After that, we conduct a comparative study between SCMA and its variant, dense code multiple access (DCMA), with GF transmission to offer insights into the effectiveness of these two schemes. This facilitates the GF-SCMA system design in practical implementation. Simulation results show that denser codebooks can help to support more UEs and increase the reliability of data transmission in a GF-SCMA network. Moreover, a higher success probability can be achieved by GFSCMA with denser UE deployment at low detection thresholds since SCMA can achieve overloading gain.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
