# On the Fundamental Limits of MIMO Massive Multiple Access Channels

In this paper, we study multiple-antenna wireless communication networks where a large number of devices simultaneously communicating with an access point. The capacity region of multiple-input multiple-output massive multiple access channels (MIMO mMAC) is investigated. While the joint typicality decoding is utilized to establish the achievability of capacity region for conventional multiple access channel with fixed number of users, the technique is not directly applicable for MIMO mMAC [4]. Instead, an information-theoretic approach based on Gallager's error exponent analysis is exploited to characterize the capacity region of MIMO mMAC. Theoretical results reveal that the capacity region of MIMO mMAC is dominated by the sum rate constraint only and the individual user rate is determined by a specific factor that corresponds to the allocation of sum rate. The individual user rate in conventional MAC is not achievable with massive multiple access and the successive interference cancellation cannot guarantee an arbitrary small decoding error probability for MIMO mMAC. The capacity region of MIMO mMAC is a generalization of the symmetric rate in [5].

## Authors

• 8 publications
• 57 publications
• 56 publications
• 68 publications
• 108 publications
08/09/2019

### On the Fundamental Limits of MIMO Massive Access Communication

The multiple access channel (MAC) with many-user is a general model for ...
01/28/2020

### Performance Analysis of MIMO K-user Interference Channels with Hardware Impairments

Next generation of wireless systems will employ many antenna branches wi...
05/09/2021

### Feedback Gains for Gaussian Massive Multiple-Access Channels

Feedback is shown to increase the sum-rate capacity of K-user Gaussian m...
09/16/2021

### Gaussian Broadcast Channels in Heterogeneous Blocklength Constrained Networks

Future wireless access networks will support simultaneously a large numb...
05/23/2019

### Simple Bounds for the Symmetric Capacity of the Rayleigh Fading Multiple Access Channel

Communication over the i.i.d. Rayleigh slow-fading MAC is considered, wh...
01/14/2018

### On the effect of blockage objects in dense MIMO SWIPT networks

Simultaneous information and power transfer (SWIPT) is characterised by ...
11/22/2021

### Capacity Optimal Generalized Multi-User MIMO: A Theoretical and Practical Framework

Conventional multi-user multiple-input multiple-output (MU-MIMO) mainly ...
##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

## I Introduction

Massive connectivity and massive capacity are two central requirements for future cellular network. In contrast to the current human-centric networks, the expansion of connected machine-centric networks will potentially support millions of devices in each cellular network. As such, it is vital to understand the fundamental limits of such communication systems. The capacity region of conventional multiple access channel (MAC) where the number of simultaneous communicate devices is fixed has been established [1, 2, 3]. However, the proof of achievability by joint typicality may not be suitable when the number of devices in the network grows unbounded with code block length [4]. Moreover, with fixed transmit powers as well as fixed number of antennas, the individual user rate would approach zero in the massive connectivity network, which makes the traditional notion of rate defined by , i.e., bits per channel use a less meaningful performance metric.

In order to circumvent the above issues, Chen et al. [4, 5] proposed a symmetric code construction for the massive multiple access channels (mMAC), where the number of devices grows unbounded with the code block length. Meanwhile, the message-length capacity, which is a codelength related notion of capacity was introduced. By the definition of message-length capacity, the individual user rate now is different from conventional vanishing rate defined by bits per channel use, and is ensured to be bounded away from zero.

In this paper, the region of multiple-input multiple-output massive multiple access channels (MIMO mMAC) is investigated. We adopt the definition of message-length capacity from [4, 5] in order to avoid zero individual user rate. Asymmetric code construction, where different user groups may have codes with different rates is considered in this paper. Therefore the devices can transmit at diverse rates depending on their Quality of Service. The number of message set size is assumed to be finite and denumerable. Thereby, a finite dimension region of MIMO mMAC is formulated in this paper. Moreover, to meet the massive capacity requirement in the future cellular network, multiple-antenna system [6, 7, 8, 9] is considered in our work.

In the massive connectivity regime, when the number of users grows to infinity with the code block length, the joint typicality method fails to achieve the region of MIMO mMAC due to the exponential number of error events. As such, we investigate the region of MIMO mMAC based on Gallager’s error exponent analysis. In contrast to the conventional capacity region that is a polytope defined in general by rate constraint inequalities, where

is the number of users, the region of MIMO mMAC is shown to be subjected to the sum rate constraint only and each individual use rate can be expressed in terms of a specific factor multiplied by the sum rate. Theoretical analysis of the individual rate shows that asymptotically, there is no benefit of having multiple antenna at the transmitters and what matters is the number of antennas at the receiver. Further, we show that due to the channel hardening effect, the asymptotic individual user rate converges to that when receiver has the statistical knowledge of channels only. The result has suggested that the instant estimation for users’ channel gain at receiver (which is unrealistic in the context of massive accessed users) is unnecessary. Another interesting difference between the conventional MAC and the case studied in this paper is that, while successive interference cancellation (SIC) is able to achieve rate points on the capacity region boundary in conventional case, it fails in MIMO mMAC due to the arbitrary large interference from the other users.

For the related works of massive multiple access, the upper bound of sum rate in multiple antenna system is provided in [10] but with a sketch proof only. The key difference between Yu’s work in [10] and mMAC is that there the code block length goes to infinity before the number of devices goes to infinity. A compressed sensing based method is proposed for the active users detection in MIMO random users access [11]. It was shown that the probability of miss detections and false alarms vanishes with an infinity number of antennas. In [12], the achievability bound for the random-access code is proposed and the tradeoff between the energy-per-bit and spectral efficiency for var,ious MAC regimes in the massive multiple access is studied. Moreover, some recent works on the coding aspects of massive random access can be found in [13, 14, 15, 16, 17, 18].

Notation: Lowercase letters , bold lowercase letters , and bold uppercase letters

denote scalars, column vectors, and matrices, respectively. We use

to denote complex conjugate and transpose for matrix and to denote the trace operator of matrix. The notion denotes the binomial coefficient of choose . The binary entropy function is denoted by .

## Ii System Model

We consider the MIMO mMAC system where each user is equipped with antennas while antennas are deployed at the base station. In the massive multiple access, the number of users is comparable or even larger than the code block length, therefore we denote by the number of users, which grows linearly with the code block length , i.e.,  [5, 12]. For the channel use, the received signal can be written as

 y(i)=kn∑k=1Hk(i)xk(i)+z(i), i=1,2,…,n, (1)

where and are the complex channel matrix and transmitted codewords vector of user , respectively. is the complex white Gaussian noise vector with normalized identity covariance matrix. Without loss of generality, we assume for every user and every channel use , the entries of channel matrix equal to a fast fading coefficient multiplied by a large scale fading factor [7], i.e.,

 h(k)m,n=α(k)m,nβ12k, (2)

where

denotes the fast fading coefficient, which is assumed to be complex Gaussian with zero mean and unit variance. The coefficient

is large scale fading factor where is the distance between user and the base station, is the path loss exponent, and

is the log-normal random variable with a standard deviation of

. Both and are statistically independent of the antenna indexes but are statistically dependent on user index . We also assume that the large scale fading factors remain constant during the transmission of codewords. Meanwhile, the Gaussian noise are supposed to be independent and identically distributed (i.i.d.) in each channel use .

With the transmissions over channel uses, the uplink received signal is given by

 yn=kn∑k=1Hnkxnk+zn, (3)

where is the received signal. The block diagonal channel matrix and the transmitted codewords vector for each user is given by and , respectively. The vector denotes the Gaussian noise. In the following of this paper, the variables are associated with superscript when collections of channel uses are considered, whereas the superscript is removed to denote the per channel use variables.

The following definitions introduce the asymmetric codes construction for MIMO mMAC as well as the notion of message-length capacity [5].

Definition 1 : Let and be the alphabet of input symbol for user and output symbol of channel, respectively. An code for MIMO mMAC consists of sets of integers called message sets and

• The set of encoding functions for every user . Since all users are active, the transmitted codewords should satisfy the following power constraint:

 Pk−δ≤Tr(Qk)≤Pk,

where is an arbitrary small number and . The positive semi-definite matrix denotes the input covariance matrix for user . For user , the symbol are assumed to be generated i.i.d.

according to the Gaussian distribution

.

• A decoding function , which is a deterministic rule that assigns a sequence of estimated messages to each possible received vector.

The average error probability of the code is given by

 P(n)e=Pr{D(yn)≠(W1,W2,…,Wkn)}, (4)

where the messages are generated independently over the message set.

Definition 2 (Asymptotically Achievable Message-Length): Given the set of functions that map natural numbers to some positive value, we say the message-length are asymptotically achievable if there exists a sequence of codes in the sense of Definition such that the average error probability vanishes as .

As stated in [3, 5], when the total number of senders is very large, the traditional notion of rate, measured in bits per channel use, goes to zero for each individual user even the total amount of information can be arbitrary large. Thus the message-length rate, as a function of the codelength , is adopted here to avoid the deficiencies of conventional capacity.

The conventional definition for the capacity region of MIMO mMAC is the closure of the set of all achievable rate tuples . However, as becomes larger, the dimension of this rate tuple also increases since the number of users now grows linearly with . Thus, to avoid an increasing dimension of capacity region and by noting that the message set size may not necessarily different from each other, we define the finite dimension region of MIMO mMAC as follows.

Definition 3 (Finite Dimension Message-Length Region): Let denote the number of users with message set size , i.e., with message-length rate for , where are the set of “distinct” message-length rates in the system. Then by grouping together the rates that are equal to each other, the -dimensional region of MIMO mMAC is defined as the closure of the convex hull of all , such that is upper bounded by the sum rate of the system.

For the finite and denumerable message set size, the dimension was expected to be independent of codelength . Thus, in Definition 3, a finite dimension region is formulated through the number of sustainable users for some given rate.

For the presentation of the main results in next section, we further define the coefficients , given the message set size of each user, and assume that the inverse of grows linearly with codelength , i.e., so that , where is some positive constant such that .

## Iii The Finite Region of MIMO mMAC

In this section, we present the main results of this paper. We assume that the channel distribution information is available at the transmitter (CDIT) only. Besides, the users are supposed to be simultaneously active in the network 111The random multiple access where each user transmits with a certain probability (as the case in [11]) will be treated in the future work..

Theorem 1: For MIMO mMAC described in (3), let denote the user set in the network, where the total number of users scales as . Then message-length vector with components is asymptotically achievable if

 Rk≤ckEH{logdet(I+∑t∈SHtQtH†t)}, (5)

where with denotes the channel matrix of user , and is defined as in Section II.

Corollary: With massive accessed users, since , the asymptotic individual message-length rate grows as

 Rk|S|→∞−−−−→ (6) = ckNRO(logn)+O(1), (7)

where the term is independent of any other constants but relates only to , and the constant depends on the pathlosses and transmit powers.

What is important here is the dependence for the individual rate. This means that the number of bits that each user is able to deliver grows logarithmically with the block length and therefore also logarithmically with the number of users.

Notice that for each user , rate (5) is determined by (or ). Since the message set size may not necessarily different from each other, given the Definition 3, the finite dimension region of MIMO mMAC is formulated as

 CMAC≜{(K1,...,KJ):K1V1+K2V2+⋯ +KJVJ≤nEH{logdet(I+∑t∈SHtQtH†t)}}, (8)

where denotes dimension of the region, and is on the order of . Eq. (III) states that any numbers of sustainable users are feasible, provided the total operational rate is constrained by the sum capacity of the system.

The individual user rate in (5) is different from that of conventional MAC. In conventional MAC, the corner points of the region is achieved through SIC, i.e., the receiver decodes the first user’s data by treating the signals from others as noises and then subtract it from the received signal. The SIC approach, however, may not be possible in the massive connectivity scenario since interferences plus noise become arbitrarily large as the number of users grows without bound. 222A mathematical analysis for the single antenna AWGN case can be found in [5] and the multiple antennas case will be analyzed in the future work. As shown in Theorem 1, the region of MIMO mMAC is only subjected to the sum rate constraint and the individual user rate is obtained by the sum rate multiplies a factor , which is related to the size of message set as shown in Section II. Note that the size is determined when the codebook has been generated. This is in contrast with conventional MAC where the region is subjected to constraints.

From (6

), the multiple antennas have provided the system with the degree of freedom gain

[23], which is . One important implication of (6) is that, no matter how many transmitter antennas each user is equipped with, we will get the same asymptotical result. Thus there is no benefit of having multiple antenna at the transmitters and what matters is the number of antennas at the receiver. The result in (6) also indicates that due to the effect of channel hardening, the asymptotic rate is close to that when the receiver has only the statistic knowledge of effective channel gain. As a consequence, the estimation of users’ fast fading coefficients at receiver (which may be unrealistic due to the massive number of users) is unnecessary.

## Iv Proof of the Converse

The proof of the converse part is mainly based on the Fano’s inequality. We have to show that for any sequence of codes with must have for some positive constant .

Let denote the message of users. The entropy of messages are computed by

 H(W) =H(W|yn)+I(W;yn) ≤H(W|yn)+I(xn;yn), (9)

where and (IV) follows from the data processing inequality since

forms a Markov chain.

The mutual information in (IV) can be written as,

 I(xn;yn) =H(yn)−H(yn|xn) =H(yn)−H(zn) ≤n∑i=1[H(y(i))−H(z(i))] ≤nEH{logdet(I+∑t∈SHtQtH†t)}, (10)

where the second inequality follows because the entropy is maximized by normal distribution with the covariance

.

By Fano’s inequality, the conditional entropy is upper bounded by

 H(W|yn)≤1+P(n)e∑k∈SlogMk. (11)

For the uniformly distributed messages, the entropy is given by

. Combining (IV), (IV), and (11), we obtain

 ∑k∈SlogMk≤nEH{ logdet(I+∑t∈SHtQtH†t)} +1+P(n)e∑k∈SlogMk. (12)

Multiplying both sides with ,

 (1−P(n)e)logMk ≤μnk +nμnkEH {logdet(I+∑t∈SHtQtH†t)}. (13)

Now let , the first term on R.H.S. of (IV) vanishes. As a consequence, the rate is shown to be

 logMk≤ckEH{logdet(I+∑t∈SHtQtH†t)}, (14)

for some positive constant .

## V Proof of the Achievability

In this section, we give the proof of achievability part for MIMO message-length capacity. The joint typicality decoding is shown to be achievable in conventional multiple access channel. This approach, however, fails in the case of MIMO mMAC as now grows linearly with the codelength . As a consequence, the packing lemma [19] does not hold in this regime. An alternative approach for the achievability part is by Gallager’s error exponent analysis [20, 21], which forms the basis of our proof in this section. In the following, we assume that the decoder uses maximum likelihood detection for the data decoding.

Consider the case when out of users incur a decoding error. Clearly, there are such error events. Based on the Gallager’s error exponent analysis, the decoding error probability for the event is given by [20]

 Ple(ke) ≤∏k∈Al(Mk−1)ρEH{∫Q{XAcl} ×[ ∫Q{XAl}P11+ρ{y|X,H}dXAl]1+ρdXAcldy}n ≤exp{−[nEl(ρ,Q)−ρ∑k∈AlRk]}, (15)

where , , and is the subset of with while is the complementary set of . The error exponent is given by

 El(ρ,Q) =−logEH{∫Q{XAcl} ×[∫ Q{XAl}P11+ρ{y|X,H}dXAl]1+ρdXAcldy}, (16)

where denotes a distribution of transmitted codewords and is the likelihood function for each channel use. Assume the a distribution of the transmitted codewords follows a Gaussian distribution , after some algebra, Eq. (V) can be calculated as (analogous to the results in [6, p. 592])

 El(ρ)=−logEH{det(I+11+ρ∑t∈AlHtQtH†t)−ρ}. (17)

By union bound, the -users decoding error probability is upper bounded by

 Pe(ke) ≤∑Al⊆SPle(ke). (18)

Since there are error decoding events, using the inequality [3, Section 12.1]

 (knke)≤exp(knH2(γ)), (19)

where , we have for arbitrary ,

 (knke)Ple(ke)≤exp{−[Eo(ρ)−knH2(γ)]}, (20)

where .

Let denote the per channel user error exponent, we have the following lemma.

Lemma 1: For , if the message-length rate is given by

 Rk=(1−ϵ)ckEH{logdet(I+∑t∈SHtQtH†t)}, (21)

for the constants such that , and assume the maximum transmit power is upper bounded by some constant. Then there exists a positive constant such that,

 Er(ρ)≥c0, (22)

holds for all sufficient large codelength .

Proof: By Gallager’s trick [21], can be an arbitrary real number within the interval in the error exponent analysis. Without loss of generality, we choose in the proof. Combining (17) and (21), the error exponent is given by

 Er(1,γ)= −logEH{det(I+12∑t∈AlHtQtH†t)−1} −(1−ϵ)n −knnH2(γ). (23)

In the following, we consider two cases and show that holds for sufficient large .

Case I: is a large number and grows linearly with the code length so that converges to some constant. Since the summation is less than and , the error exponent is lower bounded by

 Er(1,γ)≥ ϵEH{logdet(I+∑t∈SHtQtH†t)}−knn −{log EH[det(I+12∑t∈AlHtQtH†t)−1] + EH[logdet(I+∑t∈SHtQtH†t)]}. (24)

We now define where the entry is given by

 g(t)i,j =∑n∑mh(k)i,mq(t)m,n(h(t)j,n)∗ =∑n∑mα(k)i,mq(t)m,n(α(t)j,n)∗βt (25)

where and denote the entry of matrices and , respectively. Since the fast fading coefficients are i.i.d. random variables with normal distribution

, by Kolmogorov’s strong law of large number

[22],

 limkn→∞∑t∈Sg(t)i,j=⎧⎨⎩∑t∈SβtTr(Qt),i=j;0,i≠j. (26)

and

 (27)

Therefore for lager number and ,

 limkn→∞det(I+∑t∈SGt)=(1+∑t∈SβtTr(Qt))NR, (28)

and

 limke→∞det(I+12∑t∈AlGt)=(1+12∑t∈AlβtTr(Qt))NR. (29)

Consequently,

 Er(1,γ) ≥ϵNRlog(1+∑t∈SβtTr(Qt))−knn +NRlog {(1+12∑t∈AlβtTr(Qt))/(1+∑t∈SβtTr(Qt))} ≥ϵNRlog(1+∑t∈SβtTr(Qt))−knn +NRlog {(1+12γkn(Pmin−δ))/(1+knPmax)}, (30)

where the last inequality in (V) follows because and . Since the last two terms in (V) converge to some constant while the first term grows unbounded as increases, the error exponent is shown to be large than some positive constant.

Case II: scales sublinearly with codelength so that . By choosing , we have

 Er(1,γ)= −logEH{det(I+12∑t∈AlHtQtH†t)−1} −(1−ϵ)n −knnH2(γ). (31)

Note that since matrix

is positive semi-definite, its largest eigenvalue is strictly positive, and hence the largest eigenvalue of

is strictly larger than , whereas the rest eigenvalues can be greater than or equal to . As a consequence, the first term in (V) is strictly positive.

For the second term, we have . Since is a positive constant for all while the expectation in the second term is on the order . In the following, we consider two cases for the sublinearly growing :

1. , i.e., is on the order of ,

2. , i.e., grows slower than the speed .

In case ), the first term grows unbounded with the codelength, the second term is lower bounded by some constant and the last term vanishes. In case ), the last two terms vanishes while the first term is positive. Therefore, in both cases the error exponent is shown to be large than zero.

Since is arbitrary, by (18), Lemma 1 and combining the Case I and Case II, the error probability decays exponentially with codelength . Hence,

 Pe≤kn∑k=1Pe(ke)≤kne−nc0, (32)

vanishes as increases. As a consequence, the achievability of Theorem 1 is established. The corollary can be obtained by using the same metric in the proof of Case I.

## Vi Numerical results

This section presents some numerical results for the MIMO mMAC channels. We consider a single cell communication system with users randomly deployed within the cellular network. Each user has a transmit power generated uniformly within the interval . The distance between an individual user and the base station ranges from m to m. For large scale fading, the decay exponent is whereas the shadow-fading standard deviation is set to be dB.

In Fig. 1, we plot the sum rate of MIMO mMAC system as a function of codelength . The considered MIMO systems include , and MIMO, respectively. To meet the massive connectivity requirement, the number of users is set , which grows linearly with the codelength . Note that since grows unbounded with codelength and the message-length capacity considered in this paper itself is a function of , the capacity of MIMO mMAC system thereby grows with an increasing of codelength as shown in Fig. 1. Moreover, it can be also observed from Fig. 1 that the asymptotic rate (6) matches well with the operational rate (5). Hence, with i.i.d. Rayleigh coefficients, the system performance is only affected by large scale fading under the massive connectivity scenario. The results in Fig. 1 indicate that with massive number of users, the estimation of users’ instant channel gain is unnessary due to the channel hardening.

We also demonstrate the impact of receive antenna numbers on the capacity of MIMO mMAC system in Fig. 2. We observe from Fig. 2 that given different codelength , the capacities all grow linearly with an increasing of . This is due to the degree of freedom gain of MIMO system [23]. The similar phenomenon has been well observed in [24], where they show that the number of degree of freedom of a MIMO system is limited by the minimum of the number of transmit antenna and the number of receive antenna in high SNR regime. With massive users, the uplink SNR is high enough. Therefore, we have . As a result, the capacity of MIMO mMAC grows linearly with as is shown in Fig. 2.

## Vii Conclusion

In this work, we have investigated the capacity of mMAC with multiple antennas. The capacity of conventional MAC with fixed number of users is achieved by a joint typicality decoder at the receiver. However, as the number of users grows unbounded, the joint typicality approach does not work due to the exponential number of error events. As such, we derived the finite dimension region of MIMO mMAC channels by using the Gallager’s error exponent analysis. Theoretical analysis indicates that rather than the interference plus noise, the individual user rate in MIMO mMAC is determined by a specific factor that corresponds to the allocation of sum capacity.

In this paper, we assumed that the set of active users is known to the receiver. In a random access scenario, each user has an independent transmit probability and the receiver is lack of the active users knowledge. This generalized model will be addressed in the future work.

## References

• [1] R. Ahlswede, “Multi-way communication channels,” in Proc. IEEE Int. Symp. Inf. Theory, Sep. 1971, pp. 23-52.
• [2] H. Liao, “A coding theorem for multiple access communications,” in Proc. IEEE Int. Symp. Inf. Theory, Pacific Grove, CA, USA, 1972.
• [3] T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd ed. Hoboken, NJ, USA: Wiley, 2006.
• [4] X. Chen and D. Guo, “Gaussian many-access channels: Definition and symmetric capacity,” in Proc. IEEE Inf. Theory Workshop, Seville, Spain, Sep. 2013, pp. 1-5.
• [5] X. Chen, T.-Y. Chen, and D. Guo, “Capacity of Gaussian many-access channels,” IEEE Trans. Inform. Theory, vol. 63, no. 6, pp. 3516-3539, Jun. 2017.
• [6] E. Telatar, “Capacity of multi-antenna Gaussian channels,” Eur. Trans. Telecomm. ETT, vol. 10, no. 6, pp. 585-596, Nov. 1999.
• [7] T. Marzetta, “Noncooperative cellular wireless with unlimited numbers of base station antennas,” IEEE Trans. Wireless Commun., vol. 9, no. 11, pp. 3590-3600, Nov. 2010.
• [8] Y. Wu, R. Schober, D. W. K. Ng, C. Xiao, and G. Caire, “Secure massive MIMO transmission with an active eavesdropper,” IEEE Trans. Inf. Theory, vol. 62, pp. 3880–3900, Jul. 2016.
• [9] Y. Wu, C. Xiao, Z. Ding, X. Gao, and S. Jin, “A survey on MIMO transmission with finite input signals: Technical challenges, advances, and future trends,” Proceedings of the IEEE, vol. 106, no. 10, pp. 1779-1833, Oct. 2018.
• [10] W. Yu, “On the fundamental limits of massive connectivity,” in Proc. Inf. Theory Appl. Workshop, pp. 1-6, Feb. 2017.
• [11] L. Liu, W. Yu, “Massive device connectivity with massive MIMO,” IEEE Inter. Symp. Inf. Theory (ISIT), pp. 1-6, Jun. 2017.
• [12] Y. Polyanskiy, “A perspective on massive random-access,” IEEE Inter. Symp. Inf. Theory (ISIT), pp. 2523-2527, Jun. 2017.
• [13] O. Ordentlich and Y. Polyanskiy, “Low complexity schemes for the random access Gaussian channel,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Aachen, Germany, Jun. 2017, pp. 2528-2532.
• [14] M. Effros, V. Kostina, and R.C. Yavas, “Random access channel coding in the finite blocklength regime,” arXiv:1801.09018, Feb. 2018.
• [15] A. Hasanzadeh, J. Chamberland, and K. Narayanan, “Rate selection and power adaptation using maximal ratio combining for the random access Gaussian channel,” arXiv:1801.03557, Jan. 2018.
• [16] V. K. Amalladinne, A. Vem, D. K. Soma, K. R. Narayanan, J.-F. Chamberland, “A Coupled Compressive Sensing Scheme for Uncoordinated Multiple Access,” arXiv:1809.04745v1 [eess.SP], Sep. 2018.
• [17] F. Wei, W. Chen, Y. Wu, J. Li, and Y. Luo, “Toward 5G wireless interface technology: Enabling nonorthogonal multiple access in the sparse code domain,” IEEE Veh. Technol. Mag., vol. 13, no. 4, pp. 18-27, Dec. 2018.
• [18] F. Wei, W. Chen, Y. Wu, J. Ma, and T. A. Tsiftsis, “Message-passing receiver design for joint channel estimation and data decoding in uplink grant-free SCMA systems,” IEEE Trans. Wireless Communications, vol. 18, no. 1, pp. 167-181, Jan. 2019.
• [19] A. El Gamal and Y. -H. Kim, Network Information Theory. Cambridge University Press, 2012.
• [20] R. G. Gallager, “A perspective on multiaccess channels,” IEEE Trans. Inf. Theory, vol. 31, no. 2, pp. 124-142, Mar. 1985.
• [21] R. G. Gallager, Information Theory and Reliable Communication, New York, NY, USA: Wiley, 1968.
• [22] P. K. Sen and J. M. Singer, Large sample methods in statistics, Chapman & Hall, Inc. 1993.
• [23] D. N. C. Tse and P. Viswanath, Fundamentals of Wireless Communications. Cambridge, U.K.: Cambridge Univ. Press, 2005.
• [24] H. Shin and J. H. Lee, “Capacity of multiple-antenna fading channels: spatial fading correlation, double scattering, and keyhole,” IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2636-2647, Oct. 2003.