One imminent demand for the next generation wireless mobile communication systems is to provide instant and reliable access for an increasingly large number of machine-type devices (MTDs) [bockelmann2016massive, shariatmadari2015machine]. Different from human-centric communication, the resultant Massive Machine-Type Communication (mMTC) has two distinct features. In particular, only a small number of devices are active in each communication round due to the sporadic activity in mMTC[chen2018sparse]. Besides, MTDs usually transmit small data payloads adopting short-packet signaling [durisi2016toward]. These make traditional grant-based random access schemes generally not very suitable for the mMTC scenario because of their low spectral efficiency and exceedingly long latency [chen2020massive]. Therefore, the design of reliable and efficient grant-free random access schemes has attracted significant attention recently, where active users transmit pilots and data to the base station (BS) directly without permission granted [liang2017non, zhang2016grant]
. In most grant-free random access schemes, a set of pilot sequences that are designated to the users are used for the BS to ensure its accurate user activity detection and channel estimation[senel2018grant, kim2019novel, wang2019joint]. However, this is neither affordable nor feasible in the next generation multiple access (NGMA) scenarios due to the high density, the large number of connections therein, and the frequent collisions that may occur. To tackle the issues, a special type of grant-free random access, the so-called unsourced random access (URA), is introduced in [polyanskiy2017perspective], in which users do not transmit preambles, all the potential users share a common codebook, and the BS only needs to decode a list of messages instead of the identities of active users. This scheme can avoid the huge cost of preambles and the extra protocol of collision resolution, thus well meeting the requirements of next generation massive access.
On the other hand, massive or super MIMO technology, in combination with the millimeter-wave (mmWave) technology, have been promoted as two core technological features for the next generation wireless communication system with a witnessed potential to boost the capacity and efficiency. These two underlying key technologies jointly bring additional spatial-domain signal dimension with their excellent intrinsic directivity and proper beamforming, and also result in salient beam-space sparsity due to the lack of scattering in a mmWave MIMO channel [akdeniz2014millimeter, wen2014channel, bellili2019generalized]. To further increase the efficiency of the future massive access systems, such spatial-domain resources and properties should be fully explored and exploited. Various multi-user transmission schemes have been proposed to unleash the potential and properties of the beam-space resources, such as the typical works on beam division multiple access (BDMA), which simultaneously serves multiple users via different beams [sun2015beam, you2017bdma, jia2019massive].
However, for grant-free random access, even if the information of the location of all potential users is stored at the BS, the identities of active users are unknown to the BS. Therefore, the beam dimension cannot be directly exploited in the design of the encoding process of an unsourced grant-free random access, which is different from previous works [sun2015beam, you2017bdma, jia2019massive]. Moreover, in a general URA system, the messages of active users are divided into several sub-blocks and transmitted in consecutive sub-slots. As the signals transmitted from active users often experience deep fading, some sub-blocks may be missed by the decoder at the receiver. The loss of any sub-block in any sub-slot finally leads to the failure of recovering the corresponding original message. The problem of packet loss is also needed to be solved as it can cause severe decoding performance degradation. Note that the user location information can generally serve as a hint of the indices of the messages originated from it. Therefore, the intrinsic beam division property and salient spatial sparsity in a mmWave MIMO system can provide extra extrinsic information for both multi-user signal separation and multi-sub-block message stitching. This motivates us to exploit the beam space properties to design new URA schemes for next generation multiple access to help the entire system accommodate more active users and improve the decoding performance.
I-B Related Works
Y. Polyanskiy first introduced a framework named URA [polyanskiy2017perspective]. Specifically, in URA, all the users share a common codebook, and the decoder only needs to decode a list of messages transmitted from the active users. The error probability is defined as the average fraction of mis-decoded messages over the number of active users, including both missed detection and false alarm. It is obvious that the message recovery at the BS can be formulated as a compressed sensing (CS) problem due to the sporadic activity in mMTC, which is similar to the conventional grant-free random access schemes [liu2018massive, liu2018massive2]. However, the size of the common codebook grows exponentially with the number of information bits. In practice, even if a short packet is transmitted, the size of information messages is typically at the order of 100 bits, which makes the CS algorithms computationally intractable. In this context, V. K. Amalladinne proposed a coded compressed sensing (CCS) scheme for URA communication [amalladinne2020coded]. In particular, the messages from active users are first divided into several sub-blocks. Then, a systematic linear code adds redundancy to those sub-blocks. Once this is achieved, each sub-block is mapped into a codeword in a common codebook and transmitted in a certain sub-slot. Then a standard CS algorithm implements the detection of the sub-blocks. Finally, the sub-blocks transmitted in different sub-slots are stitched together to obtain the original messages. Build upon the findings in [amalladinne2020coded] and the structure of sparse regression codes (SPARCs), A. Fengler provided an improved inner decoder, and a complete asymptotic error analysis [fengler2021sparcs].
Apart from the above works, the study of massive multiple-input multiple-output (MIMO) URA has also attracted much attention. A. Fengler extended the URA model of [amalladinne2020coded] to a block-fading MIMO channel by using a low-complexity covariance-based CS (CB-CS) recovery algorithm [fengler2021non]. Considering the low code rate and spectral efficiency of the CCS scheme, V. Shyianov proposed a new algorithmic solution to solve the massive URA problem by leveraging the rich spatial dimensionality offered by large-scale antenna arrays [shyianov2020massive]. Besides, without requiring a separate activity detection or channel estimation step, A. Decurninge
introduced a structure that allows the receiver to separate the users using a classical tensor decomposition[decurninge2020tensor]. As URA is a special scheme of grant-free random access, A. Fengler presented a conceptually simple algorithm based on pilot transmission, activity detection, channel estimation, Maximum Ratio Combining (MRC), and single-user decoding [fengler2020pilot], which is similar to the existing grant-free random access schemes [chen2018sparse, liu2018massive]. The difference is that they use a pool of non-orthogonal pilots where every active user picks one of them pseudo-randomly. Furthermore, X. Shao proposed a unified cooperative activity detection framework for sourced and unsourced random access based on the covariance of the received signals for the sixth generation (6G) cell-free wireless networks [CAD].
I-C Main Contributions
In this paper, we propose a URA scheme with beam-space tree decoding. Specifically, we adopt the CCS scheme [amalladinne2020coded] suitably to our case and design two beam-space tree decoders, which are based on hard decision and soft decision, respectively. By leveraging the beam division property to assist in distinguishing the sub-blocks transmitted from different users, both decoders can help the system serve more active users. As the discriminating power is improved, the searching space of the solution in the decoding process is reduced, such that the first decoder has low complexity. In addition, notice that any sub-block missed by the CS decoder would finally lead to missed detection, which degrades the decoding performance. To tackle this issue, the second decoder establishes factor graphs at each stage during the decoding process and implements message passing algorithm (MPA) to give each candidate sub-block drawn from the checking relationship a log-likelihood ratio (LLR) value. Then the reliability of every candidate path is calculated by a path metric (PM). At every stage, some reliable paths are kept, and finally, the surviving path is output as the valid message. Even if a sub-block is missed by the CS decoder, it is possible that the path of the original message is reliable and kept. The main contributions of this paper are summarized as follows:
A URA scheme with beam-space tree decoding is proposed for mmWave communication systems in mMTC to accommodate more active users and to improve the system performance.
Two beam-space tree decoders are designed. Both of them can exploit the intrinsic beam division property to improve the decoding performance of the tree decoder by enhancing the discriminating power and helping the system serve more active users. Besides, the first decoder is based on hard decision with low complexity. The second one is based on soft decision and exploits the advantage of list decoding to recover the packet loss, which is the key of the proposed URA scheme.
Simulation results verify that our URA schemes have significantly better performances than existing works.
I-D Paper Organization and Notations
The rest of this paper is organized as follows: Section II provides a brief introduction of the considered massive URA system. Section III provides the encoding and decoding process of the considered system. Section IV proposes a beam-space tree decoder with hard decision. Then, Section V designs a beam-space tree decoder with soft decision. Next, Section VI analyzes the performance of the proposed URA scheme. Afterward, Section VII provides extensive simulation results to validate the effectiveness of the proposed algorithm. Finally, Section VIII concludes the paper.
Throughout this paper, we use bold letters to denote matrices or vectors and non-bold letters to denote scalars. We denote the-th row and the -th column of a matrix with the row-vector and the column-vector respectively. We denote by the space of complex matrices of size . We use to denote the absolute value of a complex number, and to denote conjugate transpose and transpose, respectively. The -norm of an input vector is denoted by . denotes the number of elements of set . The notation
denotes that the random variable (r.v.)
follows the circular symmetric complex Gaussian distribution.stands for the big-O notation.
Ii System Model
Consider an uplink single-cell cellular network consisting of single-antenna users. The BS is equipped with antennas and radio frequency (RF) chains such that , as shown in Fig. 1. Due to the sporadic user activity of mMTC, only a small number of users are active in a transmisson process, i.e., . Each active user has bits of information to be transmitted in a block-fading channel. According to [akdeniz2014millimeter, bellili2019generalized], the channel vector from user to the BS can be written as
where denotes the total number of clusters and within the -th cluster there are sub-paths. and denote the gain and the the angle of arrival (AOA) of the -th sub-path within the -th cluster. For the uniform linear array (ULA), the array steering vector can be expressed as
where , , is the signal wavelength, and is the antenna spacing which is usually half of the signal wavelength.
To overcome the strong path loss in mmWave channels, a beamforming technique should be adopted. However, the BS cannot focus in any specific direction in grant-free random access. The reason is that even if the location of all potential users is stored at the BS, which users are active is not prior information known to the BS. Besides, due to the constraint of hardware implementations and large energy consumption of RF chains, we have . Therefore, many beamforming methods in existing works [gao2016near, wang2017spectrum] cannot be applied in our system directly as
narrow beams cannot cover the whole beam space. In this paper, we give a beamforming method based on the widely used Discrete Fourier Transform (DFT) based beamforming codebook[gao2016near, wang2017spectrum], to overcome the strong path loss of mmWave channels in grant-free random access. Specifically, the DFT based beamforming codework, which is denoted by , can be writtern as
Consider the process of hardware implementations, the number of antennas is usually a multiple of the number of RF chains. Therefore, the consecutive beamforming vectors can be grouped and summed together to form a new beamforming vector , . is expressed as
where the parameter is set to constrain the power of receive beamforming, i.e., . Then the beamforming matrix is obtained, where is written as . By applying this beamforming method, the width of every beam is , thus the beams can cover the whole beam space, which means that the signals coming from all directions can be received by the BS.
In a typical URA scenario, all the users share a common codebook , which is denoted by . The power of each codeword is constrained to 1, i.e., . Let denote whether user transmits the codeword . can be written as
After receive beamforming at the receiver, the beam domain channel vector of the active user is denoted by . Also, the random noise vector is denoted by , where is modeled by a complex circular Gaussian random vector with i.i.d. components, i.e., . Then the received signal on the -th beam can be written as
By summarizing all the samples in a transmission block, the received signal can be recast as
where , , and . The matrix contains only non-zero columns each of which having a non-zero entry.
For the matrix , where , the -th row of such matrix is given as
The probability that is identically zero is given by . Since is significantly larger than , the matrix is row-sparse, which is shown in Fig. 2. The reason is that only a small number of users are active due to the sporadic traffic of users, i.e., . For the same reason, the matrix is also row-sparse. Moreover, due to the lack of scattering in mmWave bands, the signal propagates from the transmitter to the receiver through a small number of path clusters. This leads to the sparsity of mmWave massive MIMO channels in the beam domain as well, i.e., the channel vector is sparse. Therefore, for the matrix , the number of non-zero entries of its columns is less than that of , which is shown in Fig. 2. Note that the total number of users plays no role in the matrix . This means that if the matrix is recovered, only the codeword index is known to the BS, instead of the user’s ID, which leads to the so-called unsourced property.
Let and denote the set of the recovered messages at the BS and the set of the active users, respectively. Each active user expects to transmit bits of information, i.e., . The performance in URA is evaluated by the probability of missed detection and false alarm, denoted by and respectively, which can be given by:
and the error probability of the system is defined as
Iii Proposed URA Scheme
In this section, we first review the studies of the CCS scheme in [amalladinne2020coded] and then propose a URA scheme. In the CCS scheme, each active user partitions the message into several sub-blocks and adds parity bits. The CS techniques detect the sub-blocks transmitted by active users in all sub-slots. A tree-based algorithm then stitched these sub-blocks to recover the original messages.
Iii-a Encoding Process
The transmission strategy includes two encoders: tree encoder and CS encoder. The tree encoder uses a systematic linear block code based on random parity checks to add parity bits to every sub-block. The CS encoder maps each sub-block into a codeword in the common codebook.
Iii-A1 Tree Encoder
Divide bits message into sub-blocks of size , where . Let and , . Each sub-block is resized to length by appending parity bits, which is obtained by linear combinations of the information bits of the previous sub-blocks. Mathematically, define as a coded message, then we have . Herein, is obtained by
where is a binary matrix. Parity bits are computed using modulo-2 arithmetic and, as such, they remain binary. Every sub-block has the same size , and the code rate is fixed as .
Iii-A2 CS Encoder
For each active user , is the coded message output by the tree encoder. are mapped in to , which denote the indices of the codewords in the common codebook , where . Then the active user transmits the consecutive codewords of length , i.e., .
Iii-B Decoding Process
The input to the decoder is the sum of the signals transmitted by active users plus noise after receive beamforming. The decoding process also consists of a CS decoder and tree decoder. The conventional CS decoder exploits CS techniques to recover the sub-blocks transmitted from all active users. The tree decoder forms code trees to piece these sub-blocks together to obtain the original messages.
Iii-B1 CS Decoder
For each sub-slot s, the received signal can be expressed as
is a row sparse matrix and can be recovered by CS techniques such as Approximate Message Passing (AMP) [donoho2009message].
For rich-scattering environments, an accurate and widely used statistical model for the actual channel coefficients is the Gaussian model. However, in mmWave communications, the entries cannot be approximated by a Gaussian distribution due to the lack of scatterers. Thus, we design a special activity detector for our considered scenario. Specifically, we approximate the unknown prior distribution with Gaussian mixture (GM) [wen2014channel] and EM-GM-AMP [vila2013expectation] models for activity detection and channel estimation. The coefficients in the -th column of are approximated to be i.i.d with marginal pdf
where is the Dirac delta, is the sparsity rate, and for the -th GM component, , ,
are the weight, mean, and variance, respectively. The sparsity of the vector is captured by the sparsity rate
. The weights, means, and variances can be iteratively learned by the Expectation-Maximization (EM) algorithm.
For each sub-slot , the CS algorithm outputs the estimation of , i.e., . Via maximum-ratio-combining (MRC), the activity detector is defined as
where is a threshold, and is expressed as
Through the activity detector, the indices of the transmitted codewords in the common codebook are obtained and collected in the set , which is written as . As the relationship between a sub-block and the corresponding codeword is a one-to-one mapping, if a codeword is detected, then the corresponding sub-block can be recovered automatically. The CS Decoder finally outputs the set of the sub-blocks and the corresponding estimated channel vectors . Notice that the index cannot represent the identity of the active user. The information that is known at the BS is that a sub-block is transmitted, it comes from a certain user and the estimated channel gain of that user is . Besides, let , means the number of the sub-blocks collected in sub-slot s. is usually less than , i.e., , due to the following two reasons:
Since all users use a common codebook, the messages from different users may share some sub-blocks, which is defined as collision.
Due to the poor channel condition and the mistake of the CS decoder, some sub-blocks may be lost.
Iii-B2 Tree Decoder
The traditional tree decoder in [amalladinne2020coded] aims to recover the original messages transmitted from all active users by piecing together valid sequences of the sub-blocks drawn from . As an initial step, the decoder fixes a sub-block in as the root of a tree and gets the parity bits of the next sub-block by (13). All sub-blocks in matching the parity bits are attached to the root. This process then moves forward. For every candidate path at stage , parity bits are computed, and the matching sub-blocks in are attached to this path, forming new branches. This continues until the last sub-slot is reached. At this point, every surviving path is output as a valid tree message.
However, the traditional tree decoder has the following two problems:
The loss of a sub-block from a particular user by the CS decoder finally leads to missed detection of the original message from that user.
The parity bits to be attended in every sub-block are fixed, which restricts the maximum active users that the system can serve.
To tackle the above problems, we propose two beam-space tree decoders, which are based on hard decision and soft decision, respectively. The beam-space tree decoder with hard decision has low complexity, which is suitable to the scenario of massive connectivity. The beam-space tree decoder with soft decision considers the problem of packet loss, which can be applied to the scenario with poor channel condition.
|The -th sub-block detected in the -th sub-slot|
|The beam pattern of the sub-block|
Iv Beam-space Tree Decoder with Hard Decision
The traditional tree decoder exploits the discriminating power of parity bits to stitch the sub-blocks together to form a valid message instead of the erroneous one. At any stage of a path during the decoding process, the sub-blocks meeting the parity constraints are attached to the path. Besides the valid sub-block, other attached sub-blocks are the ones that cannot be distinguished by the parity bits. These invalid sub-blocks may finally lead to an erroneous message output by the tree decoder. Notice that in all sub-slots, the sub-blocks sent by different users are received by different beams at the BS according to the location of the users and scatterers. Therefore, the discriminating power of beams can be exploited to distinguish the invalid sub-blocks that meet the parity constraints. By leveraging the beam dimension, the decoding process can be formulated as a problem of path search in the three-dimensional space, which is shown in Fig. 3.
To better describe the decoding process of the beam-space tree decoder with hard decision, Table I is given to summarize the important parameters encountered in this Section. Specifically, define the beam pattern of a sub-block as a set that contains the indices of the beams that receive the sub-block. Then different sub-blocks can be distinguished by their beam patterns. The beam pattern is written as . To get accurate beam patterns, assume the gains of the active beams obey a prior known Gaussian distribution, i.e., , where an ”active” beam means that at least the signal from one user is received by the beam. And the gains of the inactive beams obey another known Gaussian distribution, i.e., , where and . For the gains of the inactive beams, as no signal is received or the signal experiences deep fading, is close to zero. For the gains of the active beams, is large as the signals experience random fading. Using these two prior distributions, the gains of the beams can be grouped into two classes. And for each class, the mean and variance of the samples are calculated and the prior distributions can be updated, i.e., , , and . Then according to these updated distributions, we can give the decision rules of the beam patterns. Specifically, is obtained by , which is expressed as
For this proposed beam-space tree decoder, take the decoding process of a certain user for example. At the first stage, a code tree is created and a detected sub-block in the first sub-slot becomes the root of the tree and forms the first path. The root sub-block is written as and its beam pattern is . At later stages, the sub-blocks that meet the parity and the beam pattern matching constraints are kept. By meeting the parity constraints, is written as
And is obtained by
After beam pattern matching, only the sub-blocks in are survived. can be written as
where . Also, means that the sub-blocks and are received by at least one same beam at the BS, then and have the probability to be transmitted by the same user. By beam pattern matching, the proposed beam-space tree decoder can reduce the number of surviving sub-blocks in each sub-slot, which improves the discriminating power of the decoder. A practical pruning process of this algorithm is shown in Fig. 4. The sub-block is received by several beams at the BS, which is shown in the beam pattern. For every candidate path at stage , there are candidate sub-blocks in the common codebook that meet the parity constraints according to the parity bits. A part of them are inactive, while another part of them are discriminated by the beam pattern matching. As shown in Fig .4, the lines of the 2-nd and the -th candidate sub-blocks change from solid lines to dashed lines, which means that they are deleted, as there is no overlap between their beam patterns and the beam pattern of the root sub-block at stage 1.
Finally, the proposed beam-space tree decoder with hard decision is summarized and given in Algorithm 1. is a set that contains the beam patterns of the sub-blocks detected in sub-slot s, where is expressed as .
V Beam-space Tree Decoder with Soft Decision
As described above, the CS decoder cannot always detect all the transmitted sub-blocks because the received signals may experience deep fading. The loss of a sub-block by the CS decoder in any sub-slot finally leads to missed detection of the original message. This is because the traditional tree decoder and the beam-space tree decoder with hard decision just stitch the sub-blocks drawn from the output of the CS decoder. At any stage, according to the parity bits, the set of candidate sub-blocks can be obtained. At stage s, the tree decoder keeps the intersection between the candidate set and . In this proposed algorithm, we keep all the candidate sub-blocks and calculate the LLR values of them by implementing the MPA algorithm, which denotes the probability of whether the sub-blocks are transmitted. Then, we define a path metric to calculate the reliability of the consecutive sub-blocks and keep some reliable paths at every stage. Even if a sub-block in a sub-slot is missed, it is possible for the path to be reliable because the path metric measures the reliability of the entire path. Therefore, the purpose of packet loss recovery is achieved.
Specifically, take a user’s decoding process for example. At stage for the -th path, the number of the candidate sub-blocks is , and these sub-blocks are collected in the set . is expressed as
The difference between and in (20) is that the candidate sub-blocks in are drawn according to the parity bits only, thus . To reduce interference, only the received signals of those candidate sub-blocks are kept, which is denoted by . is written as
where means that is in the set instead of . Then a factor graph is formed, taking the corresponding codewords as variable nodes and beam resources as resource nodes. Let and denote the number of variable nodes and resource nodes. To exploit the beam division property, the active beams in the beam pattern of the root sub-block form the resource nodes. Then the remaining received signal is defined as . A certain row of comes from the -th row of , where . For the sake of simplicity, define as the received signal at the -th resource, as the estimated channel gain between the user transmitting the -th codeword and the BS at the -th resource as the -th possible codeword and as a random variable that indicates whether the codeword is transmitted. Then is written as , where can be expressed as
and . To reduce the computational complexity, we resort to Gaussian Approximation (GA) as in [idma], and approximate as a complex Gaussian-distributed random variable with mean and variance , i..e., . and can be expressed as
is the log likelihood ratio (LLR) delivered from the -th variable node to the -th resource node. Also, denotes the LLR delivered from the -th resource node to the -th variable node, which is written as
Besides, is given as
Finally, can be expressed as
Denote as the new paths that are split from the -th path. By implementing MPA, from path at stage s, we can obtain the LLRs of the candidate sub-blocks in , which are written as . Learning from the way of list decoding [tal2015list], we define a path metric to calculate the reliability of the new branches from path at stage . Specifically, the PM of the new branch is written as
where denotes the LLR of the sub-block at stage in the path . The decoder calculates the PM of all the branches from every candidate path and keep some reliable paths at every stage. And at the last stage, the decoder outputs the most reliable path as the recovered message.
However, this scheme is not suitable in the case that collision occurs. As mentioned above, active users select codewords from a common codebook . Even if the dimension of is large, collisions may still occur. If the traditional tree decoder fixes a sub-block transmitted by two active users at the first stage, then the decoder finally outputs two valid tree messages. According to [fengler2020pilot], we give as the average number of collisions of users on consistent s sub-blocks started from the first one, which is written as
The collision of more than two users is ignored because the number is usually much smaller than 1. As grows, the collision can be ignored when . In other words, it is impossible for the valid messages of the collision users to be the new branches of the same candidate path. However, when the depth of a code tree grows, the LLR of a sub-block has less impact on the PM of the entire path. Therefore, the remaining paths at stage s may all come from the new branches of the most reliable path at stage , leading to missed detection. Actually, there is no need to keep all new branches from a candidate path because the valid messages of collision users come from different candidate paths. Denote as the number of splitting paths, which means that only new branches from a candidate path are kept according to the PM. Then for the current stage, keep most reliable paths, where . This pruning process is shown in Fig. 5. The number of candidate sub-blocks at stage is , which is equivalent to the process in Fig. 4. At stage , for the new branches of a path, a factor graph is created to implement the MPA algorithm and give the candidate sub-blocks LLRs. Then the most reliable paths are kept, and others are deleted, which is shown in Fig. 5 that the lines of those deleted sub-blocks change from solid to dashed. Finally at stage , for the paths, the most reliable paths are kept and others are deleted. is chosen according to the trade-off between the computational complexity and decoding performance of the decoder.
At the last stage, the number of messages output by the decoder cannot be determined because whether a collision occurs is unknown to the decoder. Notice that the traditional tree decoder outputs all the paths meeting the parity constraints as valid messages. When a collision occurs, the traditional tree decoder outputs several paths as the recovered messages. Besides, more parity bits are pushed towards later stages to reduce the probability of error according to [amalladinne2020coded]. Thus, we exploit the discriminating power of the parity bits at later stages to output the results of the beam-space tree decoder with soft decision. To summarize, list decoding is implemented at the former stages to keep the missed sub-blocks, and the sub-blocks that are full of parity bits are exploited to prune the erroneous paths at the latter stages.
However, due to the loss packet recovery, the missed detection rate decreases while the false alarm rate increases. The reason is that some undetected sub-blocks may be kept in the decoding process. Some of them are not transmitted actually, which may lead to false alarm. As the valid messages from collision users are not similar with each other, the invalid messages can be discriminated. Specifically, define a similarity metric , which is denoted by
where is the indicator function, and are two messages output by a code tree. Calculate every pair of the outputs from a code tree, if , , then keep the more reliable one according to the PM, otherwise keep both, where is a threshold. By leveraging the similarity metric, the invalid messages meeting the parity constraints are deleted. The beam-space tree decoder with soft decision is summarized and given in Algorithm 2.
Vi Performance Analysis
The performance of our proposed URA system is connected with the reliability of CS techniques in each sub-slot and the efficiency of message stitching across different sub-slots. In the remainder of this section, we ignore the collision that different active users share a sub-block in the first sub-slot.
Take the decoding process of user for example. Let be the probability that at least one sub-block of user is not output by the CS decoder, be the probability of error, be the probability of missed detection, and be the probability of false alarm. is written as