Abstract:As a means to support the access of massive machine-type communication devices, grant-free access and non-orthogonal multiple access (NOMA) have received great deal of attention in recent years. In the grant-free transmission, each device transmits information without the granting process so that the basestation needs to identify the active devices among all potential devices. This process, called an active user detection (AUD), is a challenging problem in the NOMA-based systems since it is difficult to identi… Show more
“…From ( 27) and ( 29) we can conceive that when the AP does not know the active UEs, it has to first carry out the symbol-based channel estimation, and then average the estimates obtained from the N P pilot symbols to give the final estimation. Furthermore, while AP knows b (p) i from the pilot sequences of UEs and it can also construct A A A i from the UEs' spreading sequences, AP has to know R R R a , in order to compute W W W i,p of (26) to fulfill the channel estimation based on (29). However, AP does not have the knowledge about the active UEs and even the number of them, R R R a is unable to be constructed using the knowledge available to AP, but has to be obtained from alternative approaches.…”
Section: B Channel Estimation With Active Ues Unknown To Ap -Estimator-ukmentioning
confidence: 99%
“…Owing to this, in recent years, various CSbased joint UAI, channel estimation and/or multiuser detection (MUD) algorithms have been developed and investigated in the context of mGFMA, when various sparsity structures are considered [6,7,10,11,[17][18][19][20][21][22][23][24][25][26][27][28]. While CS-based methods have some outstanding merits as claimed in references, they are not appearing for operation in the mGFMA systems where the number of active UEs is large [29]. This is because the recovery performance of CS-based methods is limited by the restricted isometric property (RIP) condition [30].…”
Grant-free multiple-access (GFMA) allows to significantly reduce the overhead of granted multiple-access. However, information detection in GFMA is challenging, as it has to be executed along with the activity detection of user equipments (UEs) and channel estimation. In this paper, we study the channel estimation and propose the UE activity identification (UAI) algorithms for the massive connectivity supporting GFMA (mGFMA) systems. For these purposes, the channel estimation is studied from several aspects by assuming different levels of knowledge to the access point, and based on which five UAI approaches are proposed. We study the performance of channel estimation, the statistics of estimated channels, and the performance of UAI algorithms. Our studies show that the proposed approaches are capable of circumventing some of the shortcomings of the existing techniques designed based on compressive sensing and message passing algorithms. They are robust for operation in the mGFMA systems where the active UEs and the number of them are highly dynamic.
“…From ( 27) and ( 29) we can conceive that when the AP does not know the active UEs, it has to first carry out the symbol-based channel estimation, and then average the estimates obtained from the N P pilot symbols to give the final estimation. Furthermore, while AP knows b (p) i from the pilot sequences of UEs and it can also construct A A A i from the UEs' spreading sequences, AP has to know R R R a , in order to compute W W W i,p of (26) to fulfill the channel estimation based on (29). However, AP does not have the knowledge about the active UEs and even the number of them, R R R a is unable to be constructed using the knowledge available to AP, but has to be obtained from alternative approaches.…”
Section: B Channel Estimation With Active Ues Unknown To Ap -Estimator-ukmentioning
confidence: 99%
“…Owing to this, in recent years, various CSbased joint UAI, channel estimation and/or multiuser detection (MUD) algorithms have been developed and investigated in the context of mGFMA, when various sparsity structures are considered [6,7,10,11,[17][18][19][20][21][22][23][24][25][26][27][28]. While CS-based methods have some outstanding merits as claimed in references, they are not appearing for operation in the mGFMA systems where the number of active UEs is large [29]. This is because the recovery performance of CS-based methods is limited by the restricted isometric property (RIP) condition [30].…”
Grant-free multiple-access (GFMA) allows to significantly reduce the overhead of granted multiple-access. However, information detection in GFMA is challenging, as it has to be executed along with the activity detection of user equipments (UEs) and channel estimation. In this paper, we study the channel estimation and propose the UE activity identification (UAI) algorithms for the massive connectivity supporting GFMA (mGFMA) systems. For these purposes, the channel estimation is studied from several aspects by assuming different levels of knowledge to the access point, and based on which five UAI approaches are proposed. We study the performance of channel estimation, the statistics of estimated channels, and the performance of UAI algorithms. Our studies show that the proposed approaches are capable of circumventing some of the shortcomings of the existing techniques designed based on compressive sensing and message passing algorithms. They are robust for operation in the mGFMA systems where the active UEs and the number of them are highly dynamic.
“…In the field of signal processing, algorithms based on ML have been applied to recover sparse signals [13], [14]. In related research on signature codes, by applying training data to a properly designed DNN, the scheme proposed in [15] learns the nonlinear mapping between the received signal and the support for detecting active users. Unlike traditional algorithms and ML methods based on conventional models, neural network-based solutions can improve the model's performance through a large amount of data, which is not present in traditional ML because of the influence of the standard model used.…”
In the user identification (UI) scheme for a multiple-access fading channel based on a randomly generated (0,1,-1)-signature code, previous studies used the signature code over a noisy multiple-access adder channel, and only the user state information (USI) was decoded by the signature decoder. However, by considering the communication model as a compressed sensing process, it is possible to estimate the channel coefficients while identifying users. In this study, to improve the efficiency of the decoding process, we propose an iterative deep neural network (DNN)based decoder. Simulation results show that for the randomly generated (0,1,-1)-signature code, the proposed DNN-based decoder requires less computing time than the classical signal recovery algorithm used in compressed sensing while achieving higher UI and channel estimation (CE) accuracies.
“…Although GF schemes are able to achieve the low-latency requirements, they lack in reliability in TIoT environments where a massive number of devices may need to be supported. To address this, GF-NOMA approaches have been presented and examined as possible solutions [13]- [17]. Particularly, in [13], the authors derived simplified expressions that approximate the outage probability and system throughout for both successive joint decoding (SJD) and successive interference cancellation (SIC), while in [14], Du et al developed an algorithm that exploits the block sparsity to effectively carry out the multi-user detection (MUD) process.…”
Section: Introductionmentioning
confidence: 99%
“…Jiang et al [15] presented a distributed transmission scheme that aims to mitigate collisions in massive machine-type communications (mMTC) scenarios, while, in [16], they developed a joint user and signal detection algorithm by leveraging the message passing principles of GF-NOMA systems. Finally, in [17], the authors utilized a deep neural network to develop an active user detection (AUD) method for mMTC.…”
Ultra-low latency connections for a massive number of devices are one of the main requirements of the nextgeneration tactile Internet-of-Things (TIoT). Grant-free nonorthogonal multiple access (GF-NOMA) is a novel paradigm that leverages the advantages of grant-free access and non-orthogonal transmissions, to deliver ultra-low latency connectivity. In this work, we present a joint channel assignment and power allocation solution for semi-GF-NOMA systems, which provides access to both grant-based (GB) and grant-free (GF) devices, maximizes the network throughput, and is capable of ensuring each device's throughput requirements. In this direction, we provide the mathematical formulation of the aforementioned problem. After explaining that it is not convex, we propose a solution strategy based on the Lagrange multipliers and subgradient method. To evaluate the performance of our solution, we carry out system-level Monte Carlo simulations. The simulation results indicate that the proposed solution can optimize the total system throughput and achieve a high association rate, while taking into account the minimum throughput requirements of both GB and GF devices.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.