On the Design of MIMO-NOMA Downlink and Uplink Transmission

Size: px
Start display at page:

Download "On the Design of MIMO-NOMA Downlink and Uplink Transmission"

Transcription

1 On the Design of MIMO-NOMA Downlink and Uplink Transission Zhiguo Ding, Meber, IEEE, Robert Schober, Fellow, IEEE, and H. Vincent Poor, Fellow, IEEE Abstract In this paper, a novel MIMO-NOMA fraework for downlink and uplink transission is proposed by applying the concept of signal alignent. By using stochastic geoetry, closedfor analytical results are developed to facilitate the perforance evaluation of the proposed fraework for randoly deployed users and interferers. The ipact of different power allocation strategies, such as fixed power allocation and cognitive radio inspired power allocation, on the perforance of MIMO-NOMA is also investigated. Coputer siulation results are provided to deonstrate the perforance of the proposed fraework and the accuracy of the developed analytical results. I. INTRODUCTION Non-orthogonal ultiple access NOMA has been recognized as a spectrally efficient ultiple access MA technique for the next generation of obile networks [] and []. For exaple, the use of NOMA has been recently proposed for downlink scenarios in long-ter evolution LTE systes as well as in fifth generation 5G obile networks [3] [5]. The key idea of NOMA is to exploit the power doain for ultiple access, which eans ultiple users can be served concurrently at the sae tie, frequency, and spreading code. The perforance of NOMA in a network with randoly deployed single-antenna nodes was investigated in []. User fairness in the context of NOMA was addressed in [6], where power allocation was optiized under different assuptions regarding the channel state inforation CSI. The application of ultiple-input ultiple-output MIMO techniques to NOMA is iportant since the use of MIMO provides additional degrees of freedo for further perforance iproveent. In [7], the ultiple-input single-output MISO scenario, where the base station had ultiple antennas and users were equipped with a single antenna, was considered. Ref. [8] focused on a special case of MIMO-NOMA with two users, where a throughput axiization proble was forulated and two algoriths were proposed to solve the optiization proble. In any practical scenarios, it is preferable to serve as any users as possible in order to reduce user latency and iprove user fairness. Following this rationale, in [9], users were first grouped into sall-size clusters, where NOMA was ipleented for the users within each cluster and MIMO detection was used to cancel inter-cluster interference. Siilar to [0], this ethod does not need CSI at the base station; however, unlike [0], it avoids the use of rando beaforing which can cause uncertainties for the quality of service QoS experienced by the users. This paper considers a general MIMO-NOMA counication network where a base station is counicating with ultiple users using the sae tie, frequency, and spreading Z. Ding and H. V. Poor are with the Departent of Electrical Engineering, Princeton University, Princeton, NJ 08544, USA. Z. Ding is also with the School of Coputing and Counications, Lancaster University, LA 4WA, UK. R. Schober is with the Institute for Digital Counications, University of Erlangen-Nurnberg, Gerany. code resources, in the presence of randoly deployed interferers. The contributions of this paper are listed as follows. Firstly, a general MIMO-NOMA fraework which is applicable to both downlink and uplink transission is proposed, by applying the concept of signal alignent, originally developed for ulti-way relaying channels in [] and []. By exploiting this fraework, the considered ulti-user MIMO-NOMA scenario can be decoposed into ultiple separate single-antenna NOMA channels, to which conventional NOMA protocols can be applied straightforwardly. Secondly, since the choice of the power allocation coefficients is key to achieve a favorable throughput-fairness tradeoff in NOMA systes, two types of power allocation strategies are studied in this paper. The fixed power allocation strategy can realize different QoS requireents in the long ter, whereas the cognitive radio inspired power allocation strategy can ensure that users QoS requireents are et instantaneously. Finally, exact expressions and asyptotic perforance results are developed in order to obtain an insightful understanding of the proposed MIMO-NOMA fraework. In particular, the outage probability is used as the perforance criterion since it not only bounds the error probability of detection tightly, but can be also used to calculate the outage capacity/rate. The ipact of the rando locations of the users and the interferers is captured by applying stochastic geoetry, and the diversity order is coputed to illustrate how efficiently the degrees of freedo of the channels are used by the proposed fraework. II. SYSTEM MODEL Consider a MIMO-NOMA downlink uplink counication scenario in which a base station is counicating with ultiple users. The base station is equipped with M antennas and each user is equipped with N antennas. In this paper, we consider the scenario N > M in order to ipleent the concept of signal alignent, an assuption ore general than the one used in [9]. This assuption is applicable to various counication scenarios, such as sall cells in heterogenous networks and 5G cloud radio access networks. The users are assued to be uniforly deployed in a disc, denoted by D, i.e., the cell controlled by the base station. The radius of the disc is r, and the base station is located at the center of D. In order to reduce the syste load, several existing studies on NOMA have proposed to pair two users for the ipleentation of NOMA, and have deonstrated that it is ideal to pair two users whose channel conditions are very different [3], [4]. Based on this insight, we assue that the disc is divided into two regions. The first region is a saller disc, denoted by D, with radius r r < r and the base station located at its origin. The second region is a ring, denoted by D, constructed fro D by reoving D. Assue that M pairs of users are selected, where user, randoly located in D, is paired with user, randoly located in D.

2 Hence, the users are randoly scheduled and paired together. The use of ore sophisticated schedulers can further iprove the perforance of the proposed MIMO-NOMA fraework of course, but this is beyond the scope of this paper. In addition to the essages sent by the base station, the downlink NOMA users also observe signals sent by interference sources which are distributed in R according to a hoogeneous Poisson point process PPP Ψ I of density λ I [5]. The sae assuption is ade for the uplink case. In practice, these interferers can be cognitive radio transitters, WiFi access points in LTE in the unlicensed spectru LTE- U, or transitters fro different tiers in heterogenous networks. In order to obtain tractable analytical results, it is assued that the interference sources are equipped with a single antenna and use identical transission powers, denoted by ρ I. Consider the use of a coposite channel odel with both quasi-static Rayleigh fading and large scale path loss. In particular, the channel atrix fro the base station to user is H = G, where G denotes an N M atrix Ld whose eleents represent Rayleigh fading channel gains, d denotes the distance fro the base station to the user, and the path loss is odelled as follows: { d α Ld =, if d > r 0 r0 α,, otherwise where α denotes the path loss exponent and paraeter r 0 avoids a singularity when the distance is sall. It is assued that r r 0 in order to siplify the analytical results. For notational siplicity, in case of uplink transission, the channel atrix fro user to the base station is denoted by H H, where H denotes the Heritian operator. We denote the transpose operator by T. Global CSI is assued to be available at the users and the base station. The proposed MIMO-NOMA fraework for downlink and uplink transission is described in the following two subsections, respectively. A. Downlink MIMO-NOMA Transission The base station sends the following [ M inforation-bearing vector ] s = T α s + α s α M s M + α M s M, where s is the signal intended for the -th user, α is the power allocation coefficient, and α + α =. The choice of the power allocation coefficients will be discussed later. Without loss of generality, we focus on user, whose observation is given by y = G Ld Ps + w I + n, where P is the M M precoding atrix to be defined at the end of this subsection, w I denotes the overall co-channel interference received by user, and n denotes the noise vector. Following the classical shot noise odel in [6], the co-channel interference, w I, can be expressed as follows: ρi LdIj, N, w I j Ψ I where denotes an all-one vector, and d Ij, denotes the distance fro user to the j-th interference source. Note that sall scale fading has been oitted in the interference odel, since the effect of path loss is ore doinant for interferers located far away. In addition, this siplification will facilitate the developent of tractable analytical results. User applies a detection vector v to its observation, and therefore the user s observation can be re-written as follows: G vy H = v H pαs + α s 3 Ld G + v H p iα i s i + α i s i + vw H I + n, i Ld } {{ } interference including inter pair interference + noise where p denotes the -th colun of P. In order to reove inter-pair interference, the following constraint has to be et: [ ] v H G v H G p i = 0, i, 4 where 0 n denotes the n all zero atrix. Without loss of generality, we focus on p which needs to satisfy the following constraint: [ G H v G H v GH M v M G H M v M ] H p = 0. 5 It is easy to verify that for general v a non-zero vector p i satisfying 5 does not exist. To overcoe this proble, in this paper, the concept of interference alignent is applied, which eans the detection vectors are designed to satisfy the following constraint [7], [8] vg H = v H G, 6 or equivalently [ ] [ ] G H G H v = 0 M. Define U v as the N N M atrix containing the N M right singular vectors of [ ] G H G H corresponding to its zero singular values. Therefore, the detection vectors at the users are designed as follows: [ ] v = U x, 7 v where x is a N M vector to be defined later. We noralize x to, i.e., x =, due to the following two reasons. First, the uplink transission power has to be constrained as shown in the following subsection. Second, this facilitates the perforance analysis carried out in the next section. It is straightforward to show that the choice of the detection vectors in 7 satisfies [ ] G H G H U x = 0 M. The effect of the signal alignent based design in 6 is the projection of the channels of the two users in the sae pair into the sae subspace. Define g G H v as the effective channel vector shared by the two users. As a result, the nuber of rows in the atrix in 5 can be reduced significantly. In particular, the constraint for p i in 5 can be rewritten as follows: [ ] H g g i g i+ g M pi = 0 M. 8

3 3 Note that [ g g i g i+ g M ] H is an M M atrix, which eans that a p i satisfying 8 exists. Define G [ g g M ] H. A zero forcing based precoding atrix at the base station can be designed as follows: P = G H D, 9 where D is a diagonal atrix to ensure power noralization at the base station, i.e., D = diag{ G G H,,, G G H M,M }, where A, denotes the -th eleent on the ain diagonal of A. As a result, the transission power at the base station can be constrained, i.e., tr { PP H} ρ = Mρ, where ρ denotes the transit signal-to-noise ratio SNR. With the design in 6 and 9, the signal odel for user can now be written as follows: v H y = α s + α s LdG G H, + v H w I + n. 0 For notational siplicity, we define h = and h Ld G G H =., Ld G G H, The use of the signal alignent based precoding and detection atrices decoposes the ulti-user MIMO-NOMA channels into M pairs of single-antenna NOMA channels. Therefore, it is iportant to point out that h and h share the sae sall scale fading gain with different distances. Recall that two users belonging to the sae pair are selected fro D and D, respectively, which eans that d < d. Therefore, the two users fro the sae pair are ordered without any abiguity, which siplifies the design of the power allocation coefficients, i.e., α α, following the NOMA principle. User decodes its essage with the following signal-to-interference-plus-noise ratio SINR ρ h α SINR = ρ h α + v + v H, N I where the interference ter is given by I = ρ I L. d Ij, j Ψ I User carries out successive interference cancellation SIC by first reoving the essage to user with SINR, ρ h SINR, = α ρ h α + v + v H, and then decoding its own essage with N I SINR SINR = which becoes the SNR if ρ I = 0. B. Uplink MIMO-NOMA Transission ρ h α v + v H N I, 3 For the NOMA uplink case, user will send out an inforation bearing essage s, and the signal transitted by this user is denoted by α v s. Because of the reciprocity between uplink and downlink channels, v, which was used as a downlink detection vector, can be used as a precoding vector for the uplink scenario. Siilarly, P will be used as the detection atrix for the uplink case. In this paper, we assue that the total transission power fro one user pair is noralized as follows: α v + α v ρ. 4 The base station observes the following signal: M G H y BS = α v s + GH α v s Ld Ld = + w I + n BS, where w I is the interference ter defined as follows w I j Ψ I ρi 5 L M. 6 d Ij,BS Here, d Ij,BS denotes the distance between the base station and the j-th interferer, and the noise ter is defined siilarly as in the previous sub-section. The base station applies a detection atrix P to its observations and the sybols fro the -th user pair can be detected based on p H y BS =p H + p H G H α v s + GH α v s Ld Ld i + p H w I + n BS. G H i α iv i s i + GH i α i v i s i Ldi Ldi 7 In order to avoid inter-pair interference, the following constraint needs to be et p H G H i α iv i s i + GH i α i v i s i = 0, i. 8 Ldi Ldi i Again applying the concept of signal alignent, the constraint that G H v = G H v is iposed on the precoding vectors v. Therefore, the sae design of v as shown in 7 can be used. The total transission power within one pair is constrained, i.e., ρα v +ρα v ρ, which eans that the use of the precoding vector in 7 ensures that the total transission power of one user pair is constrained. Following steps siilar to those used in the previous subsection, one can observe that the use of the proposed precoding/detection atrices can decopose the original MIMO- NOMA channels into separated SISO-NOMA channels. Due to the space liitation, we will only focus on the downlink case in the rest of this paper. More details about the uplink case can be found in the journal version of this paper [9]. III. PERFORMANCE ANALYSIS FOR DOWNLINK MIMO-NOMA TRANSMISSION Two types of power allocation policies are considered in this section. One is fixed power allocation and the other is inspired by the cognitive radio concept, as illustrated in the following two subsections, respectively. Recall that the precoding vectors v and v are deterined by x as shown in 7. In this paper, a rando choice of x is considered.

4 4 A. Fixed Power Allocation In this case, the power allocation coefficients α and α are constant and not related to the instantaneous realizations of the fading channels. We will first focus on the outage perforance of user. The outage probability of user to decode its inforation is given by P o = P log + SINR < R, where Px < a denotes the probability of the event x < a. The correlation between v and h akes the evaluation of the above outage probability very challenging. Hence, we focus on the following odified expression for the outage probability ρ h P α = P log + ρ h α < R, + + δi where δ 0. Since v + v =, we have v and v. In addition, because N N n= x n N N n= x n, v H N N v. Therefore, we have P o P, 9 for δ N, which eans that P provides an upper bound on P if δ N. Note that a choice of δ = is sufficient to ensure that P provides a very tight approxiation to P as shown in [9]. In addition, the use of P will be sufficient to identify the achievable diversity order of the proposed MIMO- NOMA schee. Given a rando choice of x, the following lea provides an exact expression for P as well as its high SNR approxiation. Lea. If α α ϵ, the probability P =, where ϵ = R. Otherwise, the probability P can be expressed as follows: P = r r where ϕ = e πλ I β x α γ α, β x r 0 α r e ϕ α x r φ I xxdx, 0 ϵ ρα ρα ϵ, φ Ix =, β x = ϕ δρ I L x α, and γ denotes the incoplete Gaa function. If ρ I is fixed and transit SNR ρ approaches infinity, the outage probability can be approxiated as follows: P ϕ + θ r r r α+ r α+ α +, where θ α = πλ I δρ I r 0. When ρ I = 0, P siplifies to P = e ϕ rα r e ϕ rα r ϕ α r r r r γ α +, ϕ rα γ α +, ϕ rα. Proof: Please refer to Appendix A in [9], which is the journal version of this paper By using the high SNR approxiation in Lea and also the fact that both ϕ and θ are at the order of ρ, the following corollary can be obtained straightforwardly. Corollary. If α > α ϵ, the diversity order achieved by the proposed MIMO-NOMA fraework for user is one. On the other hand, user first decodes the essage for user before decoding its own essage via SIC. Again, we focus on a odified expression for the outage probability as follows: ρ h P α = P log + ρ h α < R δi + P log + ρ h α < R, log + + δi ρ h α ρ h α > R + + δi, which is an upper bound for δ N as explained in the proof for Lea. The following lea provides an exact expression for this probability as well as its high SNR approxiation. Lea. If α α ϵ, the probability P =. Otherwise, the probability P can be expressed as follows: P = r r r r 0 r0 0 e ϕ r α 0 φi r 0 xdx 4 e α ϕ x φ I xxdx, where ϕ = ax{ϕ, ϕ } and ϕ = ϵ ρα. If ρ I is fixed and the transit SNR ρ approaches infinity, the outage probability can be approxiated as follows: P ϕ + θ αr α+ r α r α+, 5 where θ was defined in Lea. Proof: Please refer to Appendix B in [9]. B. Cognitive Radio Power Allocation In this section, a cognitive radio inspired power allocation strategy is studied. In particular, assue that user is viewed as a priary user in a cognitive ratio network. With orthogonal ultiple access, the bandwidth resource occupied by user cannot be reused by other users, despite its poor channel conditions. In contrast, with NOMA, one additional user, i.e., user, can be served siultaneously, under the condition that the QoS requireents of user can still be et. In particular, assue that user needs to achieve a target data rate of R, which eans that the power allocation coefficients of NOMA need to satisfy the following constraint ρ h α ρ h α + v + v H N I > ϵ, 6 which leads to the following choice for α α = ax 0, ρ h ϵ v + v H N I + ϵ ρ h. 7 It is straightforward to show that ρ h ϵ v + v H N I +ϵ ρ h is always less than one. An outage at user eans here that all power is allocated to user, but outage still occurs. As a result, the outage probability of user is exactly the sae as that in conventional orthogonal ultiple access systes. Therefore, in this

5 5 section, we only focus on the outage probability of user which can be expressed as follows: P o =P h < ax { ϕ v + v H N I, 8 ϕ v + v H N I }, if α > α ϵ, otherwise outage always occurs. It can be verified that α α ϵ is equivalent to α = 0, in the context of cognitive radio power allocation. Analyzing this outage probability is very difficult due to the following two reasons. First, h and v are correlated, and second, the users experience different but correlated co-channel interference, i.e., I I. Therefore, in this subsection, we only focus on the case without co-channel interference, i.e., ρ I = 0. In particular, we focus on the following outage probability P =P h < ax { ϕ, ϕ }, 9 where ϕ = ϵ ϵ ρᾱ, ϕ = ρᾱ ρᾱ ϵ, and ᾱ = ρ h ax 0, ϵ +ϵ ρ h. Siilarly to the case with fixed power allocation, the outage probability P tightly bounds P o. The following lea provides the expression for the outage probability P. Lea 3. When ρ I expressed as follows: P = Υ ϵ ρ = 0, the outage probability can be ϵ + ϵ Υ ρ, 30 where Υ y = r r e yr α r e yrα r + γ α +, yrα γ α +, yrα, and r Υ z = 0 e zrα 0 + r r e zr α r e zrα 0 r 0 + z α r γ α +, zrα γ α +, zrα 0. At high SNR, the outage probability can be approxiated as follows: y α r r P 4ϵ r α+ ρ + αr r r α+ + r+α 0 ϵ + ϵ ρr + 4ϵ + ϵ ρ + αr 3 r α+ r0 α+. Proof: Please refer to Appendix C in [9]. By using the above lea, it is straightforward to show that a diversity gain of one is still achievable at user i.e., there is no error floor, and it is iportant to point out that this is achieved when user experiences the sae outage perforance as if it solely uses the channel. Therefore, by using the proposed cognitive radio NOMA, one additional user, user, is introduced into the syste to share the spectru with the priary user, user, without causing any perforance degradation at user. IV. NUMERICAL STUDIES In this section, the perforance of the proposed NOMA fraework is investigated by using coputer siulations. The perforance of three benchark schees, tered MIMO- OMA without precoding, MIMO-OMA with precoding, and MIMO-NOMA without precoding, is shown in Fig.. The Outage Su rate: P R + PR MIMO OMA without precoding MIMO OMA with precoding 0.5 MIMO NOMA without precoding SA MIMO NOMA Transission Power in db Outage Probabilities: P and P P, R = 0.5 BPCU a Outage Su Rate MIMO OMA without precoding MIMO OMA with precoding MIMO NOMA without precoding SA MIMO NOMA P, R = 5 BPCU Transission Power in db b Outage Probabilities Fig.. Perforance coparison for downlink transission. R = 5 bits per channel use BPCU and R = 0.5 BPCU. r = 0 and r = 0. M = N = 3. r 0 =. a = 3. The path loss exponent is α = 3. The 4 noise power is 30dB and the interference power is ρ I = 0. design for the two schees without precoding can be found in [9]. The MIMO-OMA schee with precoding serves M users during each orthogonal channel use, e.g. one tie slot, whereas M users are served siultaneously by the proposed schee. The fraework proposed in this paper is tered SA-MIMO- NOMA. The size of D and D is deterined by r = 0, and r = 0. The paraeter for the bounded path loss odel is set as r 0 =. Since the benchark schees were proposed for the interference-free scenario, Fig. shows the perforance coparison of the four schees for ρ I = 0. In Fig. a, the downlink outage su rate, defined as R P +R P, is shown as a function of transission power, and the corresponding outage probabilities are studied in Fig. b. As can be seen fro the figures, the two NOMA schees can achieve larger outage su rates copared to the two OMA schees, which deonstrates the superior spectral efficiency of NOMA. In Fig. b, the two schees with precoding can achieve better outage perforance than the two schees without precoding, due to the efficient use of the degrees of freedo at the base station. Coparing the proposed SA-MIMO-NOMA schee with the one proposed in [9], one can observe that their outage su rate perforances are siilar, but SA-MIMO-NOMA can offer uch better reception reliability, particularly for high transission power. In ters of individual outage probability,

6 Outage Probabilities 0 0 Solid lines: siulations Dash-dotted lines: analytical results P, ρ I = ρ 0 P, ρ I =0dB P, ρ I = ρ 0 P, ρ 0 3 I = 0dB Transission Power in db Fig.. Outage probabilities P and P for downlink transission. λ I = 0 4, δ =, r = 0, r = 0, M = N =, r 0 =, and a = 3 4. R = R = BPCU. The path loss exponent is α = 3 and the noise power is 30dB. SA-MIMO-NOMA can ensure a lower outage probability at user, i.e., a saller P, copared to the MIMO-OMA schee with precoding, but results in perforance degradation for the outage probability at user, i.e., an increase of P. This is consistent with the finding in [4] which shows that the NOMA user with poorer channel conditions will suffer soe perforance loss due to the co-channel interference fro its partner. In Fig., the accuracy of the analytical results developed in Leas and for downlink transission is verified. As can be seen fro Fig., the exact expression developed in Lea perfectly atches the coputer siulations, and the asyptotic results developed in Lea are also accurate at high SNR, as shown in Fig.. The accuracy of Lea can be confired siilarly. Note that error floors appear when increasing ρ I in Fig., which is expected due to the strong co-channel interference caused by the randoly deployed interferers. In Fig. 3, the perforance of the cognitive radio power allocation schee proposed in Section III-B is studied. In particular, given the target data rate at user, the power allocation coefficients can be calculated opportunistically according to 7. As can be seen fro the figure, the probability for this NOMA syste to support the secondary user, i.e., user, but with a target data rate of R approaches one at high SNR. Note that with OMA, user cannot be aditted into the channel occupied by user, and with cognitive radio NOMA, one additional user, user, can be served without degrading the outage perforance of the priary user. V. CONCLUSIONS In this paper, we have proposed a signal alignent based fraework which is applicable to both MIMO-NOMA downlink and uplink transission. By applying tools fro stochastic geoetry, the ipact of the rando locations of the users and interferers has been captured, and closed-for expressions for the outage probability achieved by the proposed fraework have been developed to facilitate perforance evaluation. REFERENCES [] Y. Saito, A. Benjebbour, Y. Kishiyaa, and T. Nakaura, Syste level perforance evaluation of downlink non-orthogonal ultiple access NOMA, in Proc. IEEE Annual Syposiu on Personal, Indoor and Mobile Radio Counications PIMRC, London, UK, Sept. 03. Outage Probabilities 0 0 Solid lines: siulation Dotted lines: exact expressions Dash dotted lines: approxiation R =4 BPCU, R =4 BPCU R = BPCU, R =4 BPCU R = BPCU, R =4 BPCU R = BPCU, R = BPCU Transission Power in db Fig. 3. Outage probability P for cognitive radio downlink transission. r = 0, r = 0, r 0 =, δ =, ρ I = 0, and M = N =. The noise power is 30dB. The analytical results and the approxiations are based on Lea 3. [] Z. Ding, Z. Yang, P. Fan, and H. V. Poor, On the perforance of non-orthogonal ultiple access in 5G systes with randoly deployed users, IEEE Signal Process. Letters, vol., no., pp , Dec 04. [3] 3rd Generation Partnership Project3GPP, Study on downlink ultiuser superposition transission for LTE, Mar. 05. [4] 5G radio access: requireents, concepts and technologies, NTT DO- COMO, Inc., Tokyo, Japan, 5G Whitepaper, Jul. 04. [5] Proposed solutions for new radio access, Mobile and wireless counications Enablers for the Twenty-twenty Inforation Society METIS, Deliverable D..4, Feb. 05. [6] S. Tiotheou and I. Krikidis, Fairness for non-orthogonal ultiple access in 5G systes, IEEE Signal Process. Letters, vol., no. 0, pp , Oct. 05. [7] J. Choi, Miniu power ulticast beaforing with superposition coding for ultiresolution broadcast and application to NOMA systes, IEEE Trans. Coun., vol. 63, no. 3, pp , Mar. 05. [8] Q. Sun, S. Han, C.-L. I, and Z. Pan, On the ergodic capacity of MIMO NOMA systes, IEEE Wireless Coun. Letters, to appear in 05. [9] Z. Ding, F. Adachi, and H. V. Poor, The application of MIMO to nonorthogonal ultiple access, IEEE Trans. Wireless Coun., to appear in 05 Available on-line at arxiv: [0] K. Higuchi and Y. Kishiyaa, Non-orthogonal access with rando beaforing and intra-bea SIC for cellular MIMO downlink, in Proc. IEEE Vehicular Technology Conference, Las Vegas, NV, US, Sept. 03, pp. 5. [] N. Lee, J.-B. Li, and J. Chun, Degrees of the freedo of the MIMO Y channel: Signal space alignent for network coding, IEEE Trans Infor. Theory, vol. 56, pp , Jul. 00. [] Z. Ding and H. Poor, A general fraework of precoding design for ultiple two-way relaying counications, IEEE Trans. Signal Process., vol. 6, no. 6, pp , Mar. 03. [3] Y. Saito, Y. Kishiyaa, A. Benjebbour, T. Nakaura, A. Li, and K. Higuchi, Non-orthogonal ultiple access NOMA for cellular future radio access, in Proc. IEEE Vehicular Technology Conference, Dresden, Gerany, Jun. 03. [4] Z. Ding, P. Fan, and H. V. Poor, Ipact of user pairing on 5G nonorthogonal ultiple access, IEEE Trans. Vehicular Technology, to appear in 05 Available on-line at arxiv: [5] M. Haenggi, Stochastic Geoetry for Wireless Networks. Cabridge University Press, Cabridge, UK, 0. [6] J. Venkataraan, M. Haenggi, and O. Collins, Shot noise odels for outage and throughput analyses in wireless ad hoc networks, in Proc. IEEE Military Counications Conference, Washington, DC, USA, Oct [7] N. Lee and J.-B. Li, A novel signaling for counication on MIMO Y channel: Signal space alignent for network coding, in Proc. IEEE International Syposiu on Infor. Theory ISIT-09, Jul [8] Z. Ding, T. Wang, M. Peng, and W. Wang, On the design of network coding for ultiple two-way relaying channels, IEEE Trans. Wireless Coun., vol. 0, no. 6, pp , Jun. 0. [9] Z. Ding, R. Schober, and H. V. Poor, A general MIMO fraework for NOMA downlink and uplink transissions based on signal alignent, IEEE Trans. Wireless Coun., subitted Available on-line at arxiv:

Optimal Resource Allocation in Multicast Device-to-Device Communications Underlaying LTE Networks

Optimal Resource Allocation in Multicast Device-to-Device Communications Underlaying LTE Networks 1 Optial Resource Allocation in Multicast Device-to-Device Counications Underlaying LTE Networks Hadi Meshgi 1, Dongei Zhao 1 and Rong Zheng 2 1 Departent of Electrical and Coputer Engineering, McMaster

More information

NOMA: An Information Theoretic Perspective

NOMA: An Information Theoretic Perspective NOMA: An Information Theoretic Perspective Peng Xu, Zhiguo Ding, Member, IEEE, Xuchu Dai and H. Vincent Poor, Fellow, IEEE arxiv:54.775v2 cs.it] 2 May 25 Abstract In this letter, the performance of non-orthogonal

More information

A Mathematical Proof of the Superiority of NOMA Compared to Conventional OMA

A Mathematical Proof of the Superiority of NOMA Compared to Conventional OMA IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. XX, NO. X, OCT. 2016 1 A Mathematical Proof of the Superiority of NOMA Compared to Conventional OMA Zhiyong Chen, Zhiguo Ding, Senior Member, IEEE, Xuchu Dai,

More information

SPECTRUM sensing is a core concept of cognitive radio

SPECTRUM sensing is a core concept of cognitive radio World Acadey of Science, Engineering and Technology International Journal of Electronics and Counication Engineering Vol:6, o:2, 202 Efficient Detection Using Sequential Probability Ratio Test in Mobile

More information

Short-Packet Communications in Non-Orthogonal Multiple Access Systems

Short-Packet Communications in Non-Orthogonal Multiple Access Systems Short-Packet Communications in Non-Orthogonal Multiple Access Systems Xiaofang Sun, Shihao Yan, Nan Yang, Zhiguo Ding, Chao Shen, and Zhangdui Zhong State Key Lab of Rail Traffic Control and Safety, Beijing

More information

NOMA: Principles and Recent Results

NOMA: Principles and Recent Results NOMA: Principles and Recent Results Jinho Choi School of EECS GIST September 2017 (VTC-Fall 2017) 1 / 46 Abstract: Non-orthogonal multiple access (NOMA) becomes a key technology in 5G as it can improve

More information

The Transactional Nature of Quantum Information

The Transactional Nature of Quantum Information The Transactional Nature of Quantu Inforation Subhash Kak Departent of Coputer Science Oklahoa State University Stillwater, OK 7478 ABSTRACT Inforation, in its counications sense, is a transactional property.

More information

Sparse beamforming in peer-to-peer relay networks Yunshan Hou a, Zhijuan Qi b, Jianhua Chenc

Sparse beamforming in peer-to-peer relay networks Yunshan Hou a, Zhijuan Qi b, Jianhua Chenc 3rd International Conference on Machinery, Materials and Inforation echnology Applications (ICMMIA 015) Sparse beaforing in peer-to-peer relay networs Yunshan ou a, Zhijuan Qi b, Jianhua Chenc College

More information

Non-Parametric Non-Line-of-Sight Identification 1

Non-Parametric Non-Line-of-Sight Identification 1 Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,

More information

NOMA: Principles and Recent Results

NOMA: Principles and Recent Results NOMA: Principles and Recent Results Jinho Choi School of EECS, GIST Email: jchoi114@gist.ac.kr Invited Paper arxiv:176.885v1 [cs.it] 27 Jun 217 Abstract Although non-orthogonal multiple access NOMA is

More information

Non-orthogonal Multiple Access in Large-Scale Underlay Cognitive Radio Networks

Non-orthogonal Multiple Access in Large-Scale Underlay Cognitive Radio Networks 1 Non-orthogonal Multiple Access in Large-Scale Underlay Cognitive Radio Networks Yuanwei Liu, Student Member, IEEE, Zhiguo Ding, Senior Member, IEEE, Maged Elkashlan, Member, IEEE, and Jinhong Yuan Fellow,

More information

Simple Semi-Grant-Free Transmission Strategies Assisted by Non-Orthogonal Multiple Access

Simple Semi-Grant-Free Transmission Strategies Assisted by Non-Orthogonal Multiple Access 1 Simple Semi-Grant-Free Transmission Strategies Assisted by Non-Orthogonal Multiple Access Zhiguo Ding, Senior Member, IEEE, Robert Schober, Fellow, IEEE, Pingzhi Fan, Fellow, IEEE, and H. Vincent Poor,

More information

Construction of One-Bit Transmit-Signal Vectors for Downlink MU-MISO Systems with PSK Signaling

Construction of One-Bit Transmit-Signal Vectors for Downlink MU-MISO Systems with PSK Signaling 1 Construction of One-Bit Transit-Signal Vectors for Downlink MU-MISO Systes with PSK Signaling Gyu-Jeong Park and Song-Na Hong Ajou University, Suwon, Korea, eail: {net2616, snhong}@ajou.ac.kr and quantized

More information

Device-to-Device Collaboration through Distributed Storage

Device-to-Device Collaboration through Distributed Storage Device-to-Device Collaboration through Distributed Storage Negin Golrezaei, Student Meber, IEEE, Alexandros G Diakis, Meber, IEEE, Andreas F Molisch, Fellow, IEEE Dept of Electrical Eng University of Southern

More information

On Constant Power Water-filling

On Constant Power Water-filling On Constant Power Water-filling Wei Yu and John M. Cioffi Electrical Engineering Departent Stanford University, Stanford, CA94305, U.S.A. eails: {weiyu,cioffi}@stanford.edu Abstract This paper derives

More information

Secret-Key Sharing Based on Layered Broadcast Coding over Fading Channels

Secret-Key Sharing Based on Layered Broadcast Coding over Fading Channels Secret-Key Sharing Based on Layered Broadcast Coding over Fading Channels Xiaojun Tang WINLAB, Rutgers University Ruoheng Liu Princeton University Predrag Spasojević WINLAB, Rutgers University H. Vincent

More information

A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay

A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay A Low-Coplexity Congestion Control and Scheduling Algorith for Multihop Wireless Networks with Order-Optial Per-Flow Delay Po-Kai Huang, Xiaojun Lin, and Chih-Chun Wang School of Electrical and Coputer

More information

Adaptation to the Primary User CSI in Cognitive Radio Sensing and Access

Adaptation to the Primary User CSI in Cognitive Radio Sensing and Access Adaptation to e Priary User CSI in Cognitive Radio Sensing and Access Yuan Lu, Alexandra Duel-Hallen Departent of Electrical and Coputer Engineering Nor Carolina State University Raleigh, NC, 2766 {ylu8,

More information

The Throughput-Outage Tradeoff of Wireless One-Hop Caching Networks

The Throughput-Outage Tradeoff of Wireless One-Hop Caching Networks The Throughput-Outage Tradeoff of Wireless One-Hop Caching Networks Mingyue Ji, Student Meber, IEEE, Giuseppe Caire, Fellow, IEEE, and Andreas F. Molisch, Fellow, IEEE arxiv:3.637v [cs.it] 8 Jul 05 The

More information

Rateless Codes for MIMO Channels

Rateless Codes for MIMO Channels Rateless Codes for MIMO Channels Marya Modir Shanechi Dept EECS, MIT Cabridge, MA Eail: shanechi@itedu Uri Erez Tel Aviv University Raat Aviv, Israel Eail: uri@engtauacil Gregory W Wornell Dept EECS, MIT

More information

Distributed Power Control in Full Duplex Wireless Networks

Distributed Power Control in Full Duplex Wireless Networks Distributed Power Control in Full Duplex Wireless Networks Yu Wang and Shiwen Mao Departent of Electrical and Coputer Engineering, Auburn University, Auburn, AL 36849-5201 Eail: yzw0049@tigerail.auburn.edu,

More information

Error Exponents in Asynchronous Communication

Error Exponents in Asynchronous Communication IEEE International Syposiu on Inforation Theory Proceedings Error Exponents in Asynchronous Counication Da Wang EECS Dept., MIT Cabridge, MA, USA Eail: dawang@it.edu Venkat Chandar Lincoln Laboratory,

More information

A Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair

A Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving

More information

4196 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 10, OCTOBER 2016

4196 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 10, OCTOBER 2016 4196 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 10, OCTOBER 2016 Linear Precoding ain for Large MIMO Configurations With QAM and Reduced Coplexity Thoas Ketseoglou, Senior Meber, IEEE, and Ender

More information

Impact of Imperfect Channel State Information on ARQ Schemes over Rayleigh Fading Channels

Impact of Imperfect Channel State Information on ARQ Schemes over Rayleigh Fading Channels This full text paper was peer reviewed at the direction of IEEE Counications Society subject atter experts for publication in the IEEE ICC 9 proceedings Ipact of Iperfect Channel State Inforation on ARQ

More information

Antenna Saturation Effects on MIMO Capacity

Antenna Saturation Effects on MIMO Capacity Antenna Saturation Effects on MIMO Capacity T S Pollock, T D Abhayapala, and R A Kennedy National ICT Australia Research School of Inforation Sciences and Engineering The Australian National University,

More information

Design of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding

Design of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding IEEE TRANSACTIONS ON INFORMATION THEORY (SUBMITTED PAPER) 1 Design of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding Lai Wei, Student Meber, IEEE, David G. M. Mitchell, Meber, IEEE, Thoas

More information

A note on the multiplication of sparse matrices

A note on the multiplication of sparse matrices Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani

More information

4920 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 63, NO. 12, DECEMBER 2015

4920 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 63, NO. 12, DECEMBER 2015 4920 IEEE TRASACTIOS O COMMUICATIOS, VOL. 63, O. 12, DECEMBER 2015 Energy Efficient Coordinated Beaforing for Multicell Syste: Duality-Based Algorith Design and Massive MIMO Transition Shiwen He, Meber,

More information

Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Time-Varying Jamming Links

Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Time-Varying Jamming Links Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Tie-Varying Jaing Links Jun Kurihara KDDI R&D Laboratories, Inc 2 5 Ohara, Fujiino, Saitaa, 356 8502 Japan Eail: kurihara@kddilabsjp

More information

Matrix Inversion-Less Signal Detection Using SOR Method for Uplink Large-Scale MIMO Systems

Matrix Inversion-Less Signal Detection Using SOR Method for Uplink Large-Scale MIMO Systems Matrix Inversion-Less Signal Detection Using SOR Method for Uplin Large-Scale MIMO Systes Xinyu Gao, Linglong Dai, Yuting Hu, Zhongxu Wang, and Zhaocheng Wang Tsinghua National Laboratory for Inforation

More information

Power-Controlled Feedback and Training for Two-way MIMO Channels

Power-Controlled Feedback and Training for Two-way MIMO Channels 1 Power-Controlled Feedback and Training for Two-way MIMO Channels Vaneet Aggarwal, and Ashutosh Sabharwal, Senior Meber, IEEE arxiv:0901188v3 [csit] 9 Jan 010 Abstract Most counication systes use soe

More information

Data-Driven Imaging in Anisotropic Media

Data-Driven Imaging in Anisotropic Media 18 th World Conference on Non destructive Testing, 16- April 1, Durban, South Africa Data-Driven Iaging in Anisotropic Media Arno VOLKER 1 and Alan HUNTER 1 TNO Stieltjesweg 1, 6 AD, Delft, The Netherlands

More information

Fairness via priority scheduling

Fairness via priority scheduling Fairness via priority scheduling Veeraruna Kavitha, N Heachandra and Debayan Das IEOR, IIT Bobay, Mubai, 400076, India vavitha,nh,debayan}@iitbacin Abstract In the context of ulti-agent resource allocation

More information

SINR Estimation in Limited Feedback Coordinated Multi-point Systems

SINR Estimation in Limited Feedback Coordinated Multi-point Systems SINR Estiation in Liited Feedback Coordinated Multi-point Systes Di Su, Chenyang Yang, Gang Wang, and Ming Lei Abstract Coordinated ulti-point (CoMP) transission can provide high spectral efficiency for

More information

Rate of Channel Hardening of Antenna Selection Diversity Schemes and Its Implication on Scheduling

Rate of Channel Hardening of Antenna Selection Diversity Schemes and Its Implication on Scheduling SUBMITTED TO THE IEEE TRANSACTIONS ON INFORMATION THEORY Rate of Channel Hardening of Antenna Selection Diversity Schees and Its Iplication on Scheduling arxiv:cs/0703022v [cs.it] 5 Mar 2007 Dongwoon Bai,

More information

This model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.

This model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t. CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when

More information

Linear Precoding for Large MIMO Configurations and QAM Constellations

Linear Precoding for Large MIMO Configurations and QAM Constellations 1 Linear Precoding for Large MIMO Configurations and QAM Constellations Abstract In this paper, the proble of designing a linear precoder for Multiple-Input Multiple-Output (MIMO systes in conjunction

More information

Distributed Subgradient Methods for Multi-agent Optimization

Distributed Subgradient Methods for Multi-agent Optimization 1 Distributed Subgradient Methods for Multi-agent Optiization Angelia Nedić and Asuan Ozdaglar October 29, 2007 Abstract We study a distributed coputation odel for optiizing a su of convex objective functions

More information

Analytical Model of Epidemic Routing for Delay-Tolerant Networks Qingshan Wang School of Mathematics Hefei University of Technology Hefei, China

Analytical Model of Epidemic Routing for Delay-Tolerant Networks Qingshan Wang School of Mathematics Hefei University of Technology Hefei, China Analytical Model of Epideic Routing for Delay-Tolerant etwors Qingshan Wang School of Matheatics Hefei University of Technology Hefei, China qswang@hfut.edu.cn Zygunt J. Haas School of Electrical and Coputer

More information

Green Inter-Cluster Interference Management in Uplink of Multi-Cell Processing Systems

Green Inter-Cluster Interference Management in Uplink of Multi-Cell Processing Systems IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 1 Green Inter-Cluster Interference Manageent in Uplink of Multi-Cell Processing Systes Efstathios Katranaras, Meber, IEEE, Muhaad Ali Iran, Senior Meber, IEEE,

More information

Uplink Transmission Design with Massive Machine Type Devices in Tactile Internet

Uplink Transmission Design with Massive Machine Type Devices in Tactile Internet Uplink Transission Design wi Massive Machine Type Devices in Tactile Internet Changyang She and Chenyang Yang School of Electronics and Inforation Engineering, Beihang University, Beijing, China Eail:

More information

Minimum Rates Scheduling for MIMO OFDM Broadcast Channels

Minimum Rates Scheduling for MIMO OFDM Broadcast Channels IEEE Ninth International Syposiu on Spread Spectru Techniques and Applications Miniu Rates Scheduling for MIMO OFDM Broadcast Channels Gerhard Wunder and Thoas Michel Fraunhofer Geran-Sino Mobile Counications

More information

Randomized Recovery for Boolean Compressed Sensing

Randomized Recovery for Boolean Compressed Sensing Randoized Recovery for Boolean Copressed Sensing Mitra Fatei and Martin Vetterli Laboratory of Audiovisual Counication École Polytechnique Fédéral de Lausanne (EPFL) Eail: {itra.fatei, artin.vetterli}@epfl.ch

More information

Block designs and statistics

Block designs and statistics Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent

More information

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering

More information

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay

More information

Energy Efficient Predictive Resource Allocation for VoD and Real-time Services

Energy Efficient Predictive Resource Allocation for VoD and Real-time Services Energy Efficient Predictive Resource Allocation for VoD and Real-tie Services Changyang She and Chenyang Yang 1 arxiv:1707.01673v1 [cs.it] 6 Jul 2017 Abstract This paper studies how to exploit the predicted

More information

Iterative Decoding of LDPC Codes over the q-ary Partial Erasure Channel

Iterative Decoding of LDPC Codes over the q-ary Partial Erasure Channel 1 Iterative Decoding of LDPC Codes over the q-ary Partial Erasure Channel Rai Cohen, Graduate Student eber, IEEE, and Yuval Cassuto, Senior eber, IEEE arxiv:1510.05311v2 [cs.it] 24 ay 2016 Abstract In

More information

A Two-Phase Power Allocation Scheme for CRNs Employing NOMA

A Two-Phase Power Allocation Scheme for CRNs Employing NOMA A Two-Phase Power Allocation Scheme for CRNs Employing NOMA Ming Zeng, Georgios I. Tsiropoulos, Animesh Yadav, Octavia A. Dobre, and Mohamed H. Ahmed Faculty of Engineering and Applied Science, Memorial

More information

Adaptive Successive Transmission in Virtual Full-Duplex Cooperative NOMA

Adaptive Successive Transmission in Virtual Full-Duplex Cooperative NOMA Adaptive Successive Transmission in Virtual Full-Duplex Cooperative NOMA Young-bin Kim Future Access Network Division KDDI Research, Inc Fujimino-shi, Japan yo-kim@kddi-researchjp Kosuke Yamazaki Future

More information

On Power Minimization for Non-orthogonal Multiple Access (NOMA)

On Power Minimization for Non-orthogonal Multiple Access (NOMA) On Power Minimization for Non-orthogonal Multiple Access (NOMA) Lei Lei, Di Yuan and Peter Värbrand Journal Article N.B.: When citing this work, cite the original article. 2016 IEEE. Personal use of this

More information

Multiple Antenna Aided NOMA in UAV Networks: A Stochastic Geometry Approach

Multiple Antenna Aided NOMA in UAV Networks: A Stochastic Geometry Approach 1 Multiple Antenna Aided NOMA in UAV Networks: A Stochastic Geometry Approach Tianwei Hou, Student Member, IEEE, Yuanwei Liu, Member, IEEE, Zhengyu Song, Xin Sun, and Yue Chen, Senior Member, IEEE, arxiv:1805.04985v1

More information

Capacity Comparison between MIMO-NOMA and MIMO-OMA with Multiple Users in a Cluster

Capacity Comparison between MIMO-NOMA and MIMO-OMA with Multiple Users in a Cluster 1 Capacity Comparison between MIMO-NOMA and MIMO-OMA with Multiple Users in a Cluster Ming Zeng, Animesh Yadav, Octavia A. Dobre, Georgios I. Tsiropoulos arxiv:1706.0731v1 [cs.it] 8 Jun 017 and H. Vincent

More information

System Performance of Interference Alignment under TDD Mode with Limited Backhaul Capacity

System Performance of Interference Alignment under TDD Mode with Limited Backhaul Capacity Syste Perforance of Interference Alignent under TDD Mode with Liited Bachaul Capacity Matha Deghel, Mohaad Assaad and Mérouane Debbah Departent of Telecounications SUPELEC, Gif-sur-Yvette, France Matheatical

More information

Content-Type Coding. arxiv: v2 [cs.it] 3 Jun Linqi Song UCLA

Content-Type Coding. arxiv: v2 [cs.it] 3 Jun Linqi Song UCLA Content-Type Coding Linqi Song UCLA Eail: songlinqi@ucla.edu Christina Fragouli UCLA and EPFL Eail: christina.fragouli@ucla.edu arxiv:1505.03561v [cs.it] 3 Jun 015 Abstract This paper is otivated by the

More information

Content Caching and Delivery in Wireless Radio Access Networks

Content Caching and Delivery in Wireless Radio Access Networks Content Caching and Delivery in Wireless Radio Access Networks Meixia Tao, Deniz Gündüz, Fan Xu, and Joan S. Pujol Roig Abstract arxiv:904.07599v [cs.it] 6 Apr 209 Today s obile data traffic is doinated

More information

Multi-Window Post-Doppler Dimensionality Reduction for Multi-Waveform STAP

Multi-Window Post-Doppler Dimensionality Reduction for Multi-Waveform STAP Multi-Window Post-Doppler Diensionality Reduction for Multi-Wavefor STAP Luuba arnett 1, Patrick M. McCorick 1, Shannon D. Blunt 1, Justin G. Metcalf 2 1 Radar Systes Lab, University of Kansas, Lawrence,

More information

Using a De-Convolution Window for Operating Modal Analysis

Using a De-Convolution Window for Operating Modal Analysis Using a De-Convolution Window for Operating Modal Analysis Brian Schwarz Vibrant Technology, Inc. Scotts Valley, CA Mark Richardson Vibrant Technology, Inc. Scotts Valley, CA Abstract Operating Modal Analysis

More information

Dirty Paper Coding vs. TDMA for MIMO Broadcast Channels

Dirty Paper Coding vs. TDMA for MIMO Broadcast Channels TO APPEAR IEEE INTERNATIONAL CONFERENCE ON COUNICATIONS, JUNE 004 1 Dirty Paper Coding vs. TDA for IO Broadcast Channels Nihar Jindal & Andrea Goldsmith Dept. of Electrical Engineering, Stanford University

More information

A remark on a success rate model for DPA and CPA

A remark on a success rate model for DPA and CPA A reark on a success rate odel for DPA and CPA A. Wieers, BSI Version 0.5 andreas.wieers@bsi.bund.de Septeber 5, 2018 Abstract The success rate is the ost coon evaluation etric for easuring the perforance

More information

Content-aware Cooperative Transmission in HetNets with Consideration of Base Station Height

Content-aware Cooperative Transmission in HetNets with Consideration of Base Station Height This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content ay change prior to final publication. Citation inforation: DOI.9/TVT.8.8966, IEEE

More information

Optimal Jamming Over Additive Noise: Vector Source-Channel Case

Optimal Jamming Over Additive Noise: Vector Source-Channel Case Fifty-first Annual Allerton Conference Allerton House, UIUC, Illinois, USA October 2-3, 2013 Optial Jaing Over Additive Noise: Vector Source-Channel Case Erah Akyol and Kenneth Rose Abstract This paper

More information

An Extension to the Tactical Planning Model for a Job Shop: Continuous-Time Control

An Extension to the Tactical Planning Model for a Job Shop: Continuous-Time Control An Extension to the Tactical Planning Model for a Job Shop: Continuous-Tie Control Chee Chong. Teo, Rohit Bhatnagar, and Stephen C. Graves Singapore-MIT Alliance, Nanyang Technological Univ., and Massachusetts

More information

Copyright: 2003 by WPMC Steering Board

Copyright: 2003 by WPMC Steering Board Copyright: 2003 by WPMC Steering Board Copyright and reproduction perission: All rights are reserved and no part of this publication ay be reproduced or transitted in any for or by any eans, electronic

More information

Finite Horizon Throughput Maximization and Sensing Optimization in Wireless Powered Devices over Fading Channels

Finite Horizon Throughput Maximization and Sensing Optimization in Wireless Powered Devices over Fading Channels Finite Horizon Throughput Maxiization and Sensing Optiization in Wireless Powered Devices over Fading Channels Mehdi Salehi Heydar Abad, Ozgur Ercetin arxiv:1804.01834v2 [cs.it] 9 Sep 2018 Abstract Wireless

More information

Seismic Analysis of Structures by TK Dutta, Civil Department, IIT Delhi, New Delhi.

Seismic Analysis of Structures by TK Dutta, Civil Department, IIT Delhi, New Delhi. Seisic Analysis of Structures by K Dutta, Civil Departent, II Delhi, New Delhi. Module 5: Response Spectru Method of Analysis Exercise Probles : 5.8. or the stick odel of a building shear frae shown in

More information

A MAXIMUM-LIKELIHOOD DECODER FOR JOINT PULSE POSITION AND AMPLITUDE MODULATIONS

A MAXIMUM-LIKELIHOOD DECODER FOR JOINT PULSE POSITION AND AMPLITUDE MODULATIONS The 18th Annual IEEE International Syposiu on Personal, Indoor and Mobile Radio Counications (PIMRC 07) A MAXIMUM-LIKELIHOOD DECODER FOR JOINT PULSE POSITION AND AMPLITUDE MODULATIONS Chadi Abou-Rjeily,

More information

Low-complexity, Low-memory EMS algorithm for non-binary LDPC codes

Low-complexity, Low-memory EMS algorithm for non-binary LDPC codes Low-coplexity, Low-eory EMS algorith for non-binary LDPC codes Adrian Voicila,David Declercq, François Verdier ETIS ENSEA/CP/CNRS MR-85 954 Cergy-Pontoise, (France) Marc Fossorier Dept. Electrical Engineering

More information

5296 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 56, NO. 10, OCTOBER X/$ IEEE

5296 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 56, NO. 10, OCTOBER X/$ IEEE 5296 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 56, NO. 10, OCTOBER 2008 [13] E. A. Jorswieck and E. G. Larsson, Linear precoding in ultiple antenna broadcast channels: Efficient coputation of the achievable

More information

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes Graphical Models in Local, Asyetric Multi-Agent Markov Decision Processes Ditri Dolgov and Edund Durfee Departent of Electrical Engineering and Coputer Science University of Michigan Ann Arbor, MI 48109

More information

User Selection and Power Allocation for MmWave-NOMA Networks

User Selection and Power Allocation for MmWave-NOMA Networks User Selection and Power Allocation for MmWave-NOMA Networks Jingjing Cui, Yuanwei Liu, Zhiguo Ding, Pingzhi Fan and Arumugam Nallanathan Southwest Jiaotong University, Chengdu, P. R. China Queen Mary

More information

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Proc. of the IEEE/OES Seventh Working Conference on Current Measureent Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Belinda Lipa Codar Ocean Sensors 15 La Sandra Way, Portola Valley, CA 98 blipa@pogo.co

More information

Upper and Lower Bounds on the Capacity of Wireless Optical Intensity Channels

Upper and Lower Bounds on the Capacity of Wireless Optical Intensity Channels ISIT7, Nice, France, June 4 June 9, 7 Upper and Lower Bounds on the Capacity of Wireless Optical Intensity Channels Ahed A. Farid and Steve Hranilovic Dept. Electrical and Coputer Engineering McMaster

More information

Warning System of Dangerous Chemical Gas in Factory Based on Wireless Sensor Network

Warning System of Dangerous Chemical Gas in Factory Based on Wireless Sensor Network 565 A publication of CHEMICAL ENGINEERING TRANSACTIONS VOL. 59, 07 Guest Editors: Zhuo Yang, Junie Ba, Jing Pan Copyright 07, AIDIC Servizi S.r.l. ISBN 978-88-95608-49-5; ISSN 83-96 The Italian Association

More information

e-companion ONLY AVAILABLE IN ELECTRONIC FORM

e-companion ONLY AVAILABLE IN ELECTRONIC FORM OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer

More information

Secrecy Performance of Wirelessly Powered Wiretap Channels

Secrecy Performance of Wirelessly Powered Wiretap Channels Secrecy Perforance of Wirelessly Powered Wiretap Channels Jiang, X, Zhong, C, Chen, X, Duong, T Q, Tsiftsis, T, & Zhang, Z 6 Secrecy Perforance of Wirelessly Powered Wiretap Channels IEEE Transactions

More information

Multiple-relay selection in amplify-and-forward cooperative wireless networks with multiple source nodes

Multiple-relay selection in amplify-and-forward cooperative wireless networks with multiple source nodes Wu et al. EURASIP Journal on Wireless Counications and Networing 202, 202:256 RESEARCH Open Access Multiple-relay selection in aplify-and-forward cooperative wireless networs with ultiple source nodes

More information

arxiv: v1 [cs.ds] 29 Jan 2012

arxiv: v1 [cs.ds] 29 Jan 2012 A parallel approxiation algorith for ixed packing covering seidefinite progras arxiv:1201.6090v1 [cs.ds] 29 Jan 2012 Rahul Jain National U. Singapore January 28, 2012 Abstract Penghui Yao National U. Singapore

More information

Cooperative Non-Orthogonal Multiple Access with Simultaneous Wireless Information and Power Transfer

Cooperative Non-Orthogonal Multiple Access with Simultaneous Wireless Information and Power Transfer 1 Cooperative Non-Orthogonal Multiple Access with Simultaneous Wireless Information and Power Transfer Yuanwei Liu, Zhiguo Ding, Maged Elkashlan, and H Vincent Poor Abstract In this paper, the application

More information

Interactive Markov Models of Evolutionary Algorithms

Interactive Markov Models of Evolutionary Algorithms Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary

More information

Coverage Probability Analysis for Wireless Networks Using Repulsive Point Processes

Coverage Probability Analysis for Wireless Networks Using Repulsive Point Processes 3 IEEE 4th International Syposiu on Personal, Indoor and Mobile Radio Counications: Fundaentals and PHY Track Coverage Probability Analysis for Wireless Networks Using Repulsive Point Processes Abdelrahan

More information

Compressive Sensing Over Networks

Compressive Sensing Over Networks Forty-Eighth Annual Allerton Conference Allerton House, UIUC, Illinois, USA Septeber 29 - October, 200 Copressive Sensing Over Networks Soheil Feizi MIT Eail: sfeizi@it.edu Muriel Médard MIT Eail: edard@it.edu

More information

Fast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials

Fast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter

More information

This is a repository copy of Optimal Power Allocation Scheme for Non-Orthogonal Multiple Access with \alpha-fairness.

This is a repository copy of Optimal Power Allocation Scheme for Non-Orthogonal Multiple Access with \alpha-fairness. This is a repository copy of Optimal Power Allocation Scheme for Non-Orthogonal Multiple Access with \alpha-fairness. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.u/8886/

More information

COS 424: Interacting with Data. Written Exercises

COS 424: Interacting with Data. Written Exercises COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well

More information

Symbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm

Symbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm Acta Polytechnica Hungarica Vol., No., 04 Sybolic Analysis as Universal Tool for Deriving Properties of Non-linear Algoriths Case study of EM Algorith Vladiir Mladenović, Miroslav Lutovac, Dana Porrat

More information

HIGH RESOLUTION NEAR-FIELD MULTIPLE TARGET DETECTION AND LOCALIZATION USING SUPPORT VECTOR MACHINES

HIGH RESOLUTION NEAR-FIELD MULTIPLE TARGET DETECTION AND LOCALIZATION USING SUPPORT VECTOR MACHINES ICONIC 2007 St. Louis, O, USA June 27-29, 2007 HIGH RESOLUTION NEAR-FIELD ULTIPLE TARGET DETECTION AND LOCALIZATION USING SUPPORT VECTOR ACHINES A. Randazzo,. A. Abou-Khousa 2,.Pastorino, and R. Zoughi

More information

Fixed-to-Variable Length Distribution Matching

Fixed-to-Variable Length Distribution Matching Fixed-to-Variable Length Distribution Matching Rana Ali Ajad and Georg Böcherer Institute for Counications Engineering Technische Universität München, Gerany Eail: raa2463@gail.co,georg.boecherer@tu.de

More information

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either

More information

Average Consensus and Gossip Algorithms in Networks with Stochastic Asymmetric Communications

Average Consensus and Gossip Algorithms in Networks with Stochastic Asymmetric Communications Average Consensus and Gossip Algoriths in Networks with Stochastic Asyetric Counications Duarte Antunes, Daniel Silvestre, Carlos Silvestre Abstract We consider that a set of distributed agents desire

More information

Efficient Filter Banks And Interpolators

Efficient Filter Banks And Interpolators Efficient Filter Banks And Interpolators A. G. DEMPSTER AND N. P. MURPHY Departent of Electronic Systes University of Westinster 115 New Cavendish St, London W1M 8JS United Kingdo Abstract: - Graphical

More information

Feature Extraction Techniques

Feature Extraction Techniques Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that

More information

Multi-Dimensional Hegselmann-Krause Dynamics

Multi-Dimensional Hegselmann-Krause Dynamics Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory

More information

Defect-Aware SOC Test Scheduling

Defect-Aware SOC Test Scheduling Defect-Aware SOC Test Scheduling Erik Larsson +, Julien Pouget*, and Zebo Peng + Ebedded Systes Laboratory + LIRMM* Departent of Coputer Science Montpellier 2 University Linköpings universitet CNRS Sweden

More information

Witsenhausen s counterexample as Assisted Interference Suppression

Witsenhausen s counterexample as Assisted Interference Suppression Witsenhausen s counterexaple as Assisted Interference Suppression Pulkit Grover and Anant Sahai Wireless Foundations, epartent of EECS University of California at Berkeley, CA-947, USA {pulkit, sahai}@eecs.berkeley.edu

More information

Finite-State Markov Modeling of Flat Fading Channels

Finite-State Markov Modeling of Flat Fading Channels International Telecounications Syposiu ITS, Natal, Brazil Finite-State Markov Modeling of Flat Fading Channels Cecilio Pientel, Tiago Falk and Luciano Lisbôa Counications Research Group - CODEC Departent

More information

Inspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information

Inspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information Cite as: Straub D. (2014). Value of inforation analysis with structural reliability ethods. Structural Safety, 49: 75-86. Value of Inforation Analysis with Structural Reliability Methods Daniel Straub

More information

Sharp Time Data Tradeoffs for Linear Inverse Problems

Sharp Time Data Tradeoffs for Linear Inverse Problems Sharp Tie Data Tradeoffs for Linear Inverse Probles Saet Oyak Benjain Recht Mahdi Soltanolkotabi January 016 Abstract In this paper we characterize sharp tie-data tradeoffs for optiization probles used

More information

Revisiting the performance of the modular clock algorithm for distributed blind rendezvous in cognitive radio networks

Revisiting the performance of the modular clock algorithm for distributed blind rendezvous in cognitive radio networks Revisiting the perforance of the odular clock algorith for distributed blind rendezvous in cognitive radio networks Michel Barbeau, Gier Cervera, Joaquin Garcia-Alfaro, Evangelos Kranakis To cite this

More information