Beam Management for Millimeter Wave Beamspace MU-MIMO Systems

Size: px
Start display at page:

Download "Beam Management for Millimeter Wave Beamspace MU-MIMO Systems"

Transcription

1 Beam Managemen for Millimeer Wave Beamspace MU-MIMO Sysems Qing Xue and Xuming Fang Key Lab of Informaion Coding & Transmission Souhwes Jiaoong Universiy, Chengdu 6003, China Ming Xiao Communicaion Theory Deparmen Royal Insiue of Technology, Sockholm 00 44, Sweden Absrac Millimeer wave (mmwave) communicaion has araced increasing aenion as a promising echnology for 5G neworks. One of he key archiecural feaures of mmwave is he use of massive anenna arrays a boh he ransmier and he receiver sides. Therefore, by employing direcional beamforming (BF), boh mmwave base saions (MBSs) and mmwave users (MUEs) are capable of supporing muli-beam simulaneous ransmissions. However, mos researches have only considered a single beam, which means ha hey do no make full poenial of mmwave. In his conex, in order o improve he performance of shor-range indoor mmwave neworks wih muliple reflecions, we invesigae he challenges and poenial soluions of downlink muli-user muli-beam ransmission, which can be described as a high-dimensional (i.e., beamspace) muli-user muliple-inpu muliple-oupu (MU-MIMO) echnique, including muli-user BF raining, simulaneous users grouping, and muli-user mulibeam power allocaion. Furhermore, we presen he heoreical and numerical resuls o demonsrae ha beamspace MU-MIMO compared wih single beam ransmission can largely improve he rae performance of mmwave sysems. Index Terms Millimeer wave (mmwave), beamspace MIMO, muli-user beamforming (BF) raining, iner-beam inerference coordinaion. I. INTRODUCTION According o Cisco forecas, global mobile daa raffic will increase sevenfold beween 06 and 0 []. Recen researches showed ha mmwave communicaions, operaing in GHz bands, are promising echnologies for meeing he explosive growh of mobile daa demand. Compared wih exising microwave sysems, mmwave sysems are faced wih wo major challenges: severe propagaion loss and sensiiviy o blockage. To compensae for high propagaion loss, direcional BF has been widely used as an essenial echnique o form a highly direcional beam paern wih large anenna gain. Thanks o he shor wavelenghs of mmwave radios ranging from 0 mm o mm, massive anenna arrays can be packed ino he limied dimensions of mmwave ransceivers. Therefore, wih direcional BF, i is possible o form muliple beams a boh mmwave ransmier and receiver sides in mobile neworks. Tha is, mmwave sysems are in fac able o provide high-dimensional MIMO operaions [] [4] and can realize spaial specrum reuse a close disance [5]. However, mos curren work does no make full poenial of mmwave. For insance, he work in [6] [9] was focused on single beam ransmission scenarios, and he work in [5], [0] [] considered he scenarios where only he ransmier side was operaing wih muliple beams. Moreover, since mmwave radios have limied abiliy o diffrac around obsacles (e.g., human body), he connecion beween each pair of ransmier and receiver is vulnerable o blockage evens. In his conex, aiming a increasing he achievable rae and mainaining conneciviy of mmwave mobile neworks, we invesigaed he challenges and poenial soluions (including muli-beam selecion, cooperaive beam racking, muli-beam power allocaion, and synchronizaion) associaed wih singleuser muli-beam simulaneous ransmissions (i.e., beamspace SU-MIMO) in [3]. I is worh menioning ha he proposed scheme is only applicable o he shor-range scenarios wih muliple NLOS pahs (e.g., firs or second order reflecions from floor and/or ceiling in indoor scenarios). In order o furher enhance he performance of mmwave sysems, we exend our previous work o muli-user scenarios, namely beamspace MU-MIMO, on he basis of exising research resuls. To he bes of our knowledge, here has been no work on his issue. Since he communicaion environmen wih muli-user is more complex han ha wih single user, no only need we o furher expand he sraegies proposed in [3], bu also will we face some new challenges for implemening beamspace MU-MIMO. For insance, due o he ransmi beams seleced by differen MUEs may be (parially) overlapped, he ineruser inerference should be seriously considered in beamspace MU-MIMO. This sudy mainly focuses on he issues of muliuser BF raining, simulaneous users grouping, and muli-user muli-beam power allocaion in beamspace MU-MIMO. The res of he paper is organized as follows. In Secion II, he nework model and he basic idea of beamspace MU- MIMO are inroduced. Secion III firs describes mui-user BF raining and hen proposes a muli-user grouping mechanism. In Secion IV, he poenial soluions of power allocaion for beamspace MU-MIMO are presened and analyzed. Secion V shows some numerical resuls o evaluae he proposed scheme. Finally, Secion VI concludes he paper. II. SYSTEM OVERVIEW In his sudy, we consider a shor-range indoor mmwave nework wih one reference MBS and U oal sparsely disribued MUEs. Le R denoe he se of hese MUEs. Meanwhile, boh he MBS and MUEs are equipped wih massive anenna arrays.

2 Thus, wih direcional BF and space division echnique, hey are capable of supporing muliple orhogonal beams simulaneously and can realize specrum reuse, as illusraed in Fig.. Le b MBS max and b u max denoe he maximum number of beams ha he MBS and MUE u (u R) can form, respecively, we generally have b MBS max b u max. Le Q (Q R) be he se of MUEs served simulaneously by he MBS and U be he number of MUEs in Q, we have U b MBS max. Furhermore, supposing ha b and b u are he number of operaing beams of he MBS and MUE u in acual ransmissions, respecively, and considering ha he ransmi and receive beams are used in pairs in mmwave neworks, we have b = b u b MBS max, where b u b u max. The muli-user muli-beam simulaneous ransmission scheme invesigaed in his sudy can be described as beamspace MU-MIMO defined as Definiion. Fig. shows an example of beamspace MU-MIMO in wo-dimensional (D) perspecive. Noe ha he analysis is also applicable o hree-dimensional (3D) mode. For ease of analysis, similar o [0], [3], [4], we replace he MBS wih U virual MBSs (vmbss) locaed a he same posiion. Each vmbs serves differen MUEs wih differen ransmi beam ses. Moreover, when < b u b u max, he ransmission mode beween MUE u and is corresponding vmbs is beamspace SU-MIMO (e.g., for MUE and MUE3 in Fig. ) and i is beamspace SU-SISO when b u = (e.g., for MUE). In his conex, beamspace MU-MIMO can be defined as a se of beamspace SU-MIMO and/or SU-SISO echnologies wih space division echnique. Definiion (Beamspace MU-MIMO): The beamspace MU- MIMO is defined as an mmwave communicaion mode ha an MBS wih muliple orhogonal beams can ransmi simulaneously o a se of MUEs, where each MUE is wih one or more operaing beams. Tha is, denoing Q as he se of MUEs, b and b u as he number of ransmiing and receiving beams of he MBS and MUE u (u Q), respecively, he muli-user mulibeam simulaneous ransmissions can be ermed as N N U beamspace MU-MIMO, where U is he number of MUEs in Q, N is he oal number of ransmiing and receiving (T-R) beam pairs beween he MBS { and he simulaneous ransmiing MUEs, N min b, b u }. In order o implemen beamspace MU-MIMO and, meanwhile, o achieve opimal sysem performance, we face many challenges as below. ) Muli-user BF raining: Since only one ransmi/receive direcion s link qualiy can be deeced a a ime in radiional BF raining (e.g., in 80.ad/ay), he efficiency of he opimal beam selecion is generally very low. I means ha he exising beam selecion soluions are no enirely applicable o beamspace MU-MIMO. This sudy uilizes he capabiliy of supporing muliple beams boh a he MBS and MUEs o deec he qualiy of muliple links simulaneously, and hus o increase he efficiency of muli-beam selecion for beamspace MU-MIMO. ) Iner-user inerference coordinaion: The bes ransmi beam MUE3 MBS (vmbss) LOS link NLOS link MUE MUE Fig.. An example of D view of beamspace MU-MIMO (U = 3). Noe ha, in order o make he figure clear, we do no show he side lobes here. ses seleced by differen MUEs may be (parially) overlapped, e.g., in Fig., one NLOS link for MUE is in conflic wih he LOS link for MUE over he ransmi beam. And he iner-user inerference will be severe in his case. To address his issue, we can swich some MUEs iniial seleced T-R beam pairs wih conflicing beams o a suiable candidae (if available), or assign he MUEs wih he same conflicing ransmi beam o differen groups. MUEs in differen groups will be served in ime division manner. 3) Power allocaion: Considering ha he ransmission performance of differen links for differen MUEs may vary widely, he appropriae power allocaion sraegies should be seriously considered o maximize he achievable rae of beamspace MU-MIMO. III. BEAM/USER MANAGEMENT FOR BEAMSPACE MU-MIMO In his secion, we firs give an efficien muli-user BF raining mechanism for beamspace MU-MIMO. I is worh menioning ha he BF raining (or beam seering) operaions are designed o deermine he bes T-R beam pair se N u pair (u R) ha bes maches he LOS pah and/or NLOS pahs beween a vmbs and is corresponding MUE, hereafer called vmbs-mue. In his sudy, afer he successful compleion of BF raining, direcional BF is esablished. Moreover, o guaranee he nework performance, we furher adjus he iniial seleced T-R beam pair ses by analyzing iner-user inerference. Table I summarizes he main noaions used hroughou he paper. A. Muli-user BF Training The muli-user BF raining mechanism in his sudy aims a improving he downlink performance of beamspace MU- MIMO. The corresponding sraegies for uplink ransmission are lef as our fuure work. For ease of illusraion, we divide he region of he MBS/MUEs ino a number of ransmi/receive secors (i.e., orhogonal beam direcions). Meanwhile, we assume ha MUEs can disinguish signals received from differen beams. The proposed mechanism mainly consiss of hree phases and, moreover, he concepual flow of he firs wo phases is illusraed in Fig.. The deails are as follows. (i) Transmi Training: In his phase, all MUEs are in he quasi-omni mode and he MBS scans ransmi secors

3 TABLE I SUMMARY OF MAIN NOTATIONS. MBS: direcional beam scan MUE: quasi-omni mode Symbol Definiion R The se of MUEs wihin he coverage of he MBS Q The se of MUEs served simulaneously (Q R) U Number of MUEs in Q b MBS max Maximum number of simulaneous ransmi beams a MBS b u max Maximum number of simulaneous receive beams a MUE u b Number of he operaing beams a he MBS b u Number of he operaing beams a MUE u (u Q) N u TX Bes ransmi beam se of MUE u (u R) N u RX Bes receive beam se of MUE u (u R) N u pair Bes T-R beam pair se of vmbs-mue u (u R) N u cd Candidae T-R beam pair se of vmbs-mue u (u R) N u Operaing T-R beam pair se of vmbs-mue u (u Q) C m The se of MUEs wih conflicing beam m (C m R) η Threshold of SNR (or SINR) ξ Transmiing beamwidh ξ r Receiving beamwidh Ri u Transmission disance of link i for MUE u (i N u ) qualiy simulaneously wih direcional beams. Here, differen secors are scanned by differen beams which are muually orhogonal. Assuming ha he oal number of ransmi secors is S MBS, we have min { b MBS } max, S MBS. () Hence, we only need o es SMBS imes o deermine he bes ransmi beam se N u TX for MUE u ( u R), while he radiional ransmi raining operaing wih only one beam a a ime is required o es S MBS imes. (ii) Receive Training: In his phase, i reverses he scanning roles from he ransmi raining. Tha is, MUEs deec muliple receive secors simulaneously wih muliple direcional beams and he MBS remains in he quasi-omni mode a his ime. Similar o ransmi raining, MUE u ( u R) can obain is bes receive beam se N u RX afer scaning Su n imes, where u rx S u is he oal number of MUE u s receive secors, n u rx is he number of simulaneous scanning beams, and n u rx min {b u max, S u }. () Since he number of simulaneous receive beams suppored by each MUE may be differen, he number of ess required for compleing heir respecive receive raining will also be differen. Supposing ha S u = S MUE for u R, he number of ess required o complee muli-user receive raining is S MUE min u R nu rx. (iii) Beam Combining: We firs es he ransmi and receive beams in N u TX and Nu RX in pairwise combinaions o ge muliple T-R beam pair candidaes which mee cerain communicaion requiremens, e.g., SNR η, where η is a given hreshold. Then, by adoping he muli-beam combinaion selecion algorihm proposed in [3], we can deermine N u pair ( u R) in which here are b u T-R beam pair candidaes, b u b u max. Furhermore, he link qualiy of each candidae should mee SINR u,i η ( i N u pair ) when muliple links are ransmied simulaneously. Noe ha MUEs make he Transmi Training Receive Training MUE u MBS: quasi-omni mode MUE u u MBS Receive secor u MBS Transmi secor v v MUE v MUE: direcional beam scan MUE v Fig.. Illusraion of ransmi and receive raining for downlink beamspace MU-MIMO, given ha U oal =. The beams drawn wih solid lines are operaed concurrenly and i is he same o ha drawn wih doed lines. decision independenly in his phase and hey may obain several alernaive (or sub-opimal) T-R beam pair ses. B. Simulaneous MUEs Grouping Considering he diversiy and finieness of he number of simulaneous operaing beams ha can be suppored by he MBS and MUEs, he MBS is generally unable o serve all MUEs in is coverage simulaneously. Moreover, he sysem performance of beamspace MU-MIMO is various for differen combinaions of simulaneous MUEs. To ensure he performance, his subsecion is devoed o grouping simulaneous MUEs hrough he analysis of iner-user inerference. Since he decision of muli-beam selecion for each MUE is relaively independen, he ransmi beams seleced by hem may be (parially) overlapped. We assume ha one beam can serve only one MUE a he same ime. To avoid beam conflics, we need o adjus or re-selec N u pair ( u R), e.g., by beam swiching. Afer ha, we can proceed wih he selecion of simulaneous MUEs as described in Algorihm, he main idea of which can be oulined as follows: Denoing C m as he se of MUEs wih conflicing ransmi beam m, he MBS gives prioriy o MUE s (s C m ) which saisfies SINR s,m = max SINR u,m. u C m The MUEs (e.g., MUE u, u C m \s), which saisfy SINR u,m max i N u pair SINR u,i, can swich heir iniial seleced T-R beam pair ses o he bes suiable candidaes N u cd (if available). Here, suiable candidae refers o he alernaive

4 Algorihm Muli-user grouping Inpu: he maximum number of ransmi beams b MBS max ; he bes T-R beam pair ses N u pair ( u R); : Iniialize Q = ; : Compare N u pair and Nv pair ( u, v R, u v); 3: Record he MUEs wihou beam conflics ino Q ; 4: if Q = R or b = b u > b MBS max hen 5: Rank MUEs in Q in decreasing order according o he average link qualiy SINR, e.g., SINR u = i N u SINR u,i pair b u ; 6: Record he firs U MUEs ino Q which saisfies b = b u b MBS max ; 7: else 8: Selec an MUE (e.g., MUE s) in each se of MUEs wih conflicing beam (e.g., C m ), which saisfies SINR s,m = max u C m SINR u,m, and record hem ino Q ; 9: Record he MUEs who can swich o a suiable candidae T-R beam pair se in (R Q ) ino Q ; 0: Rank MUEs in Q and Record he firs U MUEs ino Q as in sep 5 and sep 6, respecively; : end if Oupu: he se of simulaneous MUEs Q T-R beam pair se which saisfies: () N u cd Nv pair =, v Q\u; () SINR u,i η, i N u cd. If hese MUEs have no suiable candidaes, hey will be served in ime division manner. The oher MUEs (e.g., MUE k, k C m \s, u) should be assigned o differen simulaneous MUE groups and will be served in ime division manner. Denoing N u as he operaing T-R beam pair se of MUE u, we have N u = N u pair or Nu = N u cd. In his sudy, he MBS carries ou he decision of muli-user grouping and informs MUEs of he decision resul. Before each ransmission cycle, Algorihm can realize he selecion of simulaneous MUEs for beamspace MU-MIMO. Meanwhile, he nonseleced MUEs have relaive high prioriies in he nex cycle o ensure fairness. IV. POWER ALLOCATION FOR BEAMSPACE MU-MIMO Since he qualiy of differen links may vary widely among simulaneous MUEs, we should make reasonable power allocaion for beamspace MU-MIMO in order o maximize is achievable rae. The NLOS links in his sudy are assumed o be firs order reflecions, because mmwave signals are generally negligible afer high-order reflecions and he acual ransmission pahs of hem are unpredicable. For racabiliy of he analysis, we approximae he acual anenna paern by an ideal secored anenna model [7], [5]. The direciviy gain can be expressed as [8], [4] { π (π ξ)z G (ξ) = ξ, in he main lobe, z, in side lobes, where ξ is he operaing beamwidh and z is he average gain of side lobes, 0 z <. Furhermore, he pah loss of mmwave can be modeled as [6] (3) L (R) [db] = A + 0 log 0 (f c ) + 0n log 0 (R), (4) where f c is he carrier frequency in GHz, R is ransmission disance in km, A is he aenuaion value, and n is he pah loss exponen. Since he T-R beam pairs for beamspace MU- MIMO are muually orhogonal (i.e., he main lobes are nonoverlapping), we assume ha he iner-beam inerference is mainly caused by side lobes. Therefore, he SINR of link i for MUE u (u Q) is ( ) P i g ξ u,i g ( ) ξr u,i SINR u,i [db] = 0 log 0 P N + ( P j z g j M ( where P i is he ransmied power; g ) π (π ξ = u,i r )z ξ u,i ξ u,i r L(R u i ) ) L(R u i ) ) (5) = π (π ξu,i ξ u,i, )z and g ( ξr u,i are he average main lobe ξr u,i gains of ransmi and receive beams, ( respecively; P N is he hermal noise power; M = (N u \i) N ). v Moreover, v Q\u he achievable rae of link i can be esimaed as Rae u,i = B log ( + SINR u,i ) according o Shannon capaciy formula, where B is he operaing bandwidh. To maximize he achievable rae of beamspace MU-MIMO,, and P i ( u Q, i N u ) in vecors ξ, ξ r and p, respecively, and hen formulae he problem under consideraion as an opimizaion problem (P) given by we firs collec he variables ξ u,i maximize ξ,ξ r,p,q subjec o, ξ u,i r Rae = B log ( + SINR u,i ) i N u (6a) ξ,min ξ u,i < π, (6b) ξ r,min ξr u,i < π, (6c) U b MBS (6d) max, 0 P i, (6e) 0 < P i P max, (6f) i N u where ξ,min and ξ r,min are he minimum beamwidh of ransmi and receive beams, respecively; and P max are he maximum ransmission power of each ransmi beam and he MBS, respecively. Noe ha funcion argumens have been discarded for noaional simpliciy. Considering he simples scenario wih pencil beams, i.e., z, we can neglec he iner-beam inerference and opimize he operaing beamwidh for each link individually. Tha( is, he ) opimal beamwidh of ransmi and receive beams are ξ u,i = ξ,min and ( ) ξr u,i = ξr,min, respecively. Hereafer, he opimized

5 parameers are idenified by he on he upper righ corner. Meanwhile, he SINR expression formulaed in Eq. (5) reduces o SNR according o ( ) P i π π SNR ξ,min ξ r,min L(Ri u,i = u ). (7) P N As P is difficul o obain is opimal soluion, we invesigae wo low complexiy and easy o implemen soluions for muli-user muli-beam power allocaion o subopimally address P ha wih pencil beams. Average Power Allocaion (APA): Each link s ransmission power is he same wihou considering he difference of link qualiy, i.e., ( ) P i APA = P max, where Q and b u can be b u obained by Algorihm. Prioriy Power Allocaion (PPA): Considering he qualiy of differen links may vary widely, we give prioriy o opimize he ransmission power of he links ha wih high link qualiy o address P. Furhermore, his soluion includes he following wo cases. ) Considering fairness: When he fairness of power allocaion among simulaneous MUEs is aken ino accoun, we will give prioriy o opimize ( he bes ) link for each MUE (e.g., link l for MUE u), i.e., P u,l =. Then, we FP employ ( APA ) o allocae power for oher links (e.g., link i), i.e., p max, i (N u ) \l, where U is P u,i FP = Pmax U (b u ) he number of MUEs in Q. ) Wihou considering fairness: We rank all he links in N in decreasing order according o he link qualiy, where N = N u. Denoing N OFP as he se of he firs P max links in N, we have ( ) P i = p OFP max for i N OFP. Furher, P if he res of he power p = P max max can mee he communicaion requiremens of a link in (N N OFP ), we have U P = max ; Oherwise, U P = max. Subsiuing he opimized parameers ino Eq. (6) and (7), we can easily obain he maximum achievable rae wih APA and wih PPA, respecively. Since he lengh of he paper is limied, we do no give hese resuls here. TABLE II SIMULATION PARAMETERS. Parameers Values Carrier frequency, f c 60GHz Bandwidh, B.5GHz Maximum ransmi power of MBS, P max 0dBm Maximum power of ransmi beams, 3dBm Maximum number of ransmi beams, b MBS max 0 Maximum number of receive beams, b MUE max 3 Aenuaion value, A A LOS = 3.5; A NLOS = 45.5 Pah loss exponen, n n LOS =.0; n NLOS =.4 Transmission disance, R R LOS = 7m; R NLOS = 0m Noise figure, NF 6dB Algorihm b u ( u Q) Opimizaion for APA Inpu: he se of simulaneous MUEs Q; he operaing T-R beam pair ses N u for u Q; : P = P max b u ; : if P > hen 3: Le P = ; 4: end if 5: SNR u,i = P π π ξ,min ξ r,min L(R i u) P N for u Q, i N u ; 6: if min SNR,i N u u,i < η hen 7: Remove link j from N s (s Q), he link saisfies SNR s,j = min,i N u SNR u,i; 8: b s = b s ; 9: if b s = 0 hen 0: Remove MUE s from Q; : end if : Go o sep ; 3: else 4: Q = Q; 5: (N u ) = N u and b u = b u for u Q ; 6: end if Oupu: b u ( u Q ) V. PERFORMANCE EVALUATION This secion presens some numerical resuls on he performance of beamspace MU-MIMO. The objecive of his work is wo-fold: (i) o verify he effeciveness of he proposed muliuser BF raining mechanism; (ii) o compare and analyze he performance of APA and PPA. To simplify simulaions, we assume ha ξ u,i = ξ, ξr u,i = ξ r, and b u max = b MUE max, for i N u, u Q. Moreover, we consider a shor-range indoor mmwave nework wih Ri u = R LOS for LOS links and Ri u = R NLOS for NLOS links. Table II summarizes he deailed simulaion parameers. In addiion, a a sandard emperaure of 7 C, we le P N [db] = 74 [dbm/hz] + 0 log 0 (B) + NF, where NF is noise figure in db. Fig. 3 shows ha he proposed muli-beam ransmi raining can effecively improve he efficiency of beam selecion. For example, when ξ = 0, we have S MBS = 36 and 0 which can be known from Eq. (). Hence, if = 5, o obain he bes ransmi beam ses (i.e., N u TX, S u Q), he MBS only needs o scan MBS = 8 imes by adoping he proposed soluion. However, using he radiional ransmi raining operaing wih single beam, he number of scans required is S MBS = 36. Similarly, we can verify he effeciveness of he proposed muli-beam receive raining for selecing he bes receive beam ses (i.e., N u RX, u Q). Furhermore, he larger he values of and, he more superior he muli-user BF raining. In Fig. 4, we invesigae he rae performance of beamspace MU-MIMO wih APA and wih PPA, respecively. Here we consider he nework is wih hree MUEs, i.e., U = 3 and,

6 Scan Times for Transmi Training Muli beam: ξ =5 Single beam: ξ =5 Muli beam: ξ =0 Single beam: ξ =0 Muli beam: ξ =5 Single beam: ξ =5 Achievable Rae (Gbps) MU-SISO MU-MIMO wih APA MU-MIMO wih PPA Achievable Rae (Gbps) MU-SISO MU-MIMO wih APA MU-MIMO wih PPA Number of simulaneous ransmi beams, SINR Threshold, η (db) (a) SINR Threshold, η (db) (b) Fig. 3. Performance comparison beween he proposed muli-beam ransmi raining and he radiional soluion. Fig. 4. Achievable rae performance versus SINR hreshold η for beamspace MU-SISO and MU-MIMO wih PPA and wih APA, respecively, given ha ξ = 0, ξ r = 5, and (a) z = 0.0, (b) z = 0.. meanwhile, each of hem is operaing wih a LOS link and wo NLOS links, i.e., b = b u = 9. Moreover, we assume ha he qualiy of each LOS link is beer han ha of NLOS links. In his conex, he rae performance of beamspace MU-MIMO wih PPA is he same regardless of wheher he fairness of power allocaion among simulaneous MUEs is aken ino accoun. Clearly, he performance of PPA is generally beer han ha of APA for beamspace MU-MIMO. Furher, he resuls indicae ha beamspace MU-MIMO compared wih beamspace MU-SISO can largely improve he rae performance of mmwave neworks. Noe ha U > and b u = ( u Q) in beamspace MU-SISO sysems. For example, when η = 0dB shown in Fig. 4(a), we have Rae APA MU MIMO = 0Gbps and Rae PPA MU MIMO = 0Gbps while Rae MU SISO = 49Gbps. To make he resuls more general, he iner-beam inerference caused by side lobes is no ignored in our simulaions, i.e., z 0. By comparing Fig. 4(a) wih Fig. 4(b), we can see ha he greaer he value of z, he greaer he inerference, and he more obvious he impac on he sysem performance. VI. CONCLUSIONS In his sudy, in order o furher enhance he performance of mmwave neworks wih muliple reflecions, we exended our previous work o muli-user scenario, namely beamspace MU- MIMO, and invesigaed is challenges and poenial soluions for downlink ransmission. Firs, we improved he efficiency of muli-beam selecion for beamspace MU-MIMO by uilizing he capabiliy of supporing muliple beams boh a he MBS and MUEs. Second, o avoid beam conflics, we grouped simulaneous served MUEs. Third, we analyzed wo low complexiy muli-user muli-beam power allocaion soluions, i.e., APA and PPA. The numerical resuls demonsraed ha hey are very effecive o improve he achievable rae of beamspace MU-MIMO. Furhermore, he corresponding sraegies for uplink beamspace MU-MIMO will be also our fuure work. REFERENCES [] Cisco, Cisco visual neworking index: Global mobile daa raffic forecas updae, 06-0, Whie Paper, Feb. 07. [] A. M. Sayeed, Deconsrucing mulianenna fading channels, IEEE Trans. Signal Process., vol. 50, no. 0, pp , Oc. 00. [3] J. Brady, N. Behdad, and A. M. Sayeed, Beamspace MIMO for millimeer-wave communicaions: Sysem archiecure, modeling, analysis, and measuremens, IEEE Trans. Anennas Propag., vol. 6, no. 7, pp , Jul. 03. [4] A. Sayeed and J. Brady, Beamspace MIMO channel modeling and measuremen: Mehodology and resuls a 8GHz, in 06 IEEE Globecom Workshops (GC Wkshps), Dec. 06, pp. 6. [5] P. V. Amadori and C. Masouros, Low RF-complexiy millimeer-wave beamspace-mimo sysems by beam selecion, IEEE Trans. Commun., vol. 63, no. 6, pp. 3, Jun. 05. [6] K. Hosoya e al., Muliple secor ID capure (MIDC): A novel beamforming echnique for 60-GHz band muli-gbps WLAN/PAN sysems, IEEE Trans. Anennas Propag., vol. 63, no., pp. 8 96, Jan. 05. [7] T. Bai and R. W. Heah, Coverage and rae analysis for millimeer-wave cellular neworks, IEEE Trans. Wireless Commun., vol. 4, no., pp. 00 4, Feb. 05. [8] H. Shokri-Ghadikolaei, L. Gkazikis, and C. Fischione, Beam-searching and ransmission scheduling in millimeer wave communicaions, in IEEE In. Conf. Commun. (ICC), Jun. 05, pp [9] C. Liu, M. Li, S. V. Hanly, I. B. Collings, and P. Whiing, Millimeer wave beam alignmen: Large deviaions analysis and design insighs, IEEE J. Sel. Areas Commun., vol. 35, no. 7, pp , Jul. 07. [0] Q. Xue, X. Fang, M. Xiao, and L. Yan, Muli-user millimeer wave communicaions wih nonorhogonal beams, IEEE Trans. Veh. Technol., vol. 66, no. 7, pp , Jul. 07. [] A. Sayeed and J. Brady, Beamspace MIMO for high-dimensional muliuser communicaion a millimeer-wave frequencies, in IEEE Global Commun. Conf. (GLOBECOM), Dec. 03, pp [] X. Gao, L. Dai, Z. Chen, Z. Wang, and Z. Zhang, Near-opimal beam selecion for beamspace mmwave massive MIMO sysems, IEEE Commun. Le., vol. 0, no. 5, pp , May 06. [3] Q. Xue, X. Fang, and C. X. Wang, Beamspace SU-MIMO for fuure millimeer wave wireless communicaions, IEEE J. Sel. Areas Commun., vol. 35, no. 7, pp , Jul. 07. [4] H. Shokri-Ghadikolaei, C. Fischione, G. Fodor, P. Popovski, and M. Zorzi, Millimeer wave cellular neworks: A MAC layer perspecive, IEEE Trans. Commun., vol. 63, no. 0, pp , Oc. 05. [5] A. M. Huner, J. G. Andrews, and S. Weber, Transmission capaciy of ad hoc neworks wih spaial diversiy, IEEE Trans. Wireless Commun., vol. 7, no., pp , Dec [6] A. Malsev e al., Channel Models for 60 GHz WLAN Sysems, IEEE Sandard /0334r8, May 00.

Beam Management for Millimeter Wave Beamspace MU-MIMO Systems

Beam Management for Millimeter Wave Beamspace MU-MIMO Systems This aricle has been acceped for publicaion in a fuure issue of his journal, bu has no been fully edied. Conen may change prior o final publicaion. Ciaion informaion: DOI.9/TCOMM.28.2867487, IEEE Beam

More information

Resource Allocation in Visible Light Communication Networks NOMA vs. OFDMA Transmission Techniques

Resource Allocation in Visible Light Communication Networks NOMA vs. OFDMA Transmission Techniques Resource Allocaion in Visible Ligh Communicaion Neworks NOMA vs. OFDMA Transmission Techniques Eirini Eleni Tsiropoulou, Iakovos Gialagkolidis, Panagiois Vamvakas, and Symeon Papavassiliou Insiue of Communicaions

More information

STATE-SPACE MODELLING. A mass balance across the tank gives:

STATE-SPACE MODELLING. A mass balance across the tank gives: B. Lennox and N.F. Thornhill, 9, Sae Space Modelling, IChemE Process Managemen and Conrol Subjec Group Newsleer STE-SPACE MODELLING Inroducion: Over he pas decade or so here has been an ever increasing

More information

Block Diagram of a DCS in 411

Block Diagram of a DCS in 411 Informaion source Forma A/D From oher sources Pulse modu. Muliplex Bandpass modu. X M h: channel impulse response m i g i s i Digial inpu Digial oupu iming and synchronizaion Digial baseband/ bandpass

More information

Solutions for Assignment 2

Solutions for Assignment 2 Faculy of rs and Science Universiy of Torono CSC 358 - Inroducion o Compuer Neworks, Winer 218 Soluions for ssignmen 2 Quesion 1 (2 Poins): Go-ack n RQ In his quesion, we review how Go-ack n RQ can be

More information

control properties under both Gaussian and burst noise conditions. In the ~isappointing in comparison with convolutional code systems designed

control properties under both Gaussian and burst noise conditions. In the ~isappointing in comparison with convolutional code systems designed 535 SOFT-DECSON THRESHOLD DECODNG OF CONVOLUTONAL CODES R.M.F. Goodman*, B.Sc., Ph.D. W.H. Ng*, M.S.E.E. Sunnnary Exising majoriy-decision hreshold decoders have so far been limied o his paper a new mehod

More information

Applying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Capacity Constraints

Applying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Capacity Constraints IJCSI Inernaional Journal of Compuer Science Issues, Vol 9, Issue 1, No 1, January 2012 wwwijcsiorg 18 Applying Geneic Algorihms for Invenory Lo-Sizing Problem wih Supplier Selecion under Sorage Capaciy

More information

Vehicle Arrival Models : Headway

Vehicle Arrival Models : Headway Chaper 12 Vehicle Arrival Models : Headway 12.1 Inroducion Modelling arrival of vehicle a secion of road is an imporan sep in raffic flow modelling. I has imporan applicaion in raffic flow simulaion where

More information

Single-Pass-Based Heuristic Algorithms for Group Flexible Flow-shop Scheduling Problems

Single-Pass-Based Heuristic Algorithms for Group Flexible Flow-shop Scheduling Problems Single-Pass-Based Heurisic Algorihms for Group Flexible Flow-shop Scheduling Problems PEI-YING HUANG, TZUNG-PEI HONG 2 and CHENG-YAN KAO, 3 Deparmen of Compuer Science and Informaion Engineering Naional

More information

Zürich. ETH Master Course: L Autonomous Mobile Robots Localization II

Zürich. ETH Master Course: L Autonomous Mobile Robots Localization II Roland Siegwar Margaria Chli Paul Furgale Marco Huer Marin Rufli Davide Scaramuzza ETH Maser Course: 151-0854-00L Auonomous Mobile Robos Localizaion II ACT and SEE For all do, (predicion updae / ACT),

More information

CENTRALIZED VERSUS DECENTRALIZED PRODUCTION PLANNING IN SUPPLY CHAINS

CENTRALIZED VERSUS DECENTRALIZED PRODUCTION PLANNING IN SUPPLY CHAINS CENRALIZED VERSUS DECENRALIZED PRODUCION PLANNING IN SUPPLY CHAINS Georges SAHARIDIS* a, Yves DALLERY* a, Fikri KARAESMEN* b * a Ecole Cenrale Paris Deparmen of Indusial Engineering (LGI), +3343388, saharidis,dallery@lgi.ecp.fr

More information

Physics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle

Physics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle Chaper 2 Newonian Mechanics Single Paricle In his Chaper we will review wha Newon s laws of mechanics ell us abou he moion of a single paricle. Newon s laws are only valid in suiable reference frames,

More information

Numerical Dispersion

Numerical Dispersion eview of Linear Numerical Sabiliy Numerical Dispersion n he previous lecure, we considered he linear numerical sabiliy of boh advecion and diffusion erms when approimaed wih several spaial and emporal

More information

Diebold, Chapter 7. Francis X. Diebold, Elements of Forecasting, 4th Edition (Mason, Ohio: Cengage Learning, 2006). Chapter 7. Characterizing Cycles

Diebold, Chapter 7. Francis X. Diebold, Elements of Forecasting, 4th Edition (Mason, Ohio: Cengage Learning, 2006). Chapter 7. Characterizing Cycles Diebold, Chaper 7 Francis X. Diebold, Elemens of Forecasing, 4h Ediion (Mason, Ohio: Cengage Learning, 006). Chaper 7. Characerizing Cycles Afer compleing his reading you should be able o: Define covariance

More information

Decentralized Stochastic Control with Partial History Sharing: A Common Information Approach

Decentralized Stochastic Control with Partial History Sharing: A Common Information Approach 1 Decenralized Sochasic Conrol wih Parial Hisory Sharing: A Common Informaion Approach Ashuosh Nayyar, Adiya Mahajan and Demoshenis Tenekezis arxiv:1209.1695v1 [cs.sy] 8 Sep 2012 Absrac A general model

More information

CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK

CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK 175 CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK 10.1 INTRODUCTION Amongs he research work performed, he bes resuls of experimenal work are validaed wih Arificial Neural Nework. From he

More information

A Study of Inventory System with Ramp Type Demand Rate and Shortage in The Light Of Inflation I

A Study of Inventory System with Ramp Type Demand Rate and Shortage in The Light Of Inflation I Inernaional Journal of Mahemaics rends and echnology Volume 7 Number Jan 5 A Sudy of Invenory Sysem wih Ramp ype emand Rae and Shorage in he Ligh Of Inflaion I Sangeea Gupa, R.K. Srivasava, A.K. Singh

More information

Random Walk with Anti-Correlated Steps

Random Walk with Anti-Correlated Steps Random Walk wih Ani-Correlaed Seps John Noga Dirk Wagner 2 Absrac We conjecure he expeced value of random walks wih ani-correlaed seps o be exacly. We suppor his conjecure wih 2 plausibiliy argumens and

More information

A Dynamic Model of Economic Fluctuations

A Dynamic Model of Economic Fluctuations CHAPTER 15 A Dynamic Model of Economic Flucuaions Modified for ECON 2204 by Bob Murphy 2016 Worh Publishers, all righs reserved IN THIS CHAPTER, OU WILL LEARN: how o incorporae dynamics ino he AD-AS model

More information

T L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB

T L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB Elecronic Companion EC.1. Proofs of Technical Lemmas and Theorems LEMMA 1. Le C(RB) be he oal cos incurred by he RB policy. Then we have, T L E[C(RB)] 3 E[Z RB ]. (EC.1) Proof of Lemma 1. Using he marginal

More information

Inventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions

Inventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions Muli-Period Sochasic Models: Opimali of (s, S) Polic for -Convex Objecive Funcions Consider a seing similar o he N-sage newsvendor problem excep ha now here is a fixed re-ordering cos (> 0) for each (re-)order.

More information

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 62, NO. 8, OCTOBER

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 62, NO. 8, OCTOBER IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 62, NO. 8, OCTOBER 213 3737 Energy-Efficien Hybrid One- and Two-ay Relay Transmission Can Sun and Chenyang Yang, Senior Member, IEEE Absrac Two-way relaying

More information

Appendix to Creating Work Breaks From Available Idleness

Appendix to Creating Work Breaks From Available Idleness Appendix o Creaing Work Breaks From Available Idleness Xu Sun and Ward Whi Deparmen of Indusrial Engineering and Operaions Research, Columbia Universiy, New York, NY, 127; {xs2235,ww24}@columbia.edu Sepember

More information

10. State Space Methods

10. State Space Methods . Sae Space Mehods. Inroducion Sae space modelling was briefly inroduced in chaper. Here more coverage is provided of sae space mehods before some of heir uses in conrol sysem design are covered in he

More information

20. Applications of the Genetic-Drift Model

20. Applications of the Genetic-Drift Model 0. Applicaions of he Geneic-Drif Model 1) Deermining he probabiliy of forming any paricular combinaion of genoypes in he nex generaion: Example: If he parenal allele frequencies are p 0 = 0.35 and q 0

More information

in Renewable Energy Powered Cellular Networks

in Renewable Energy Powered Cellular Networks IEEE TRANSACTIONS ON COMMUNICATIONS 1 Base Saion Sleeping and Resource Allocaion in Renewable Energy Powered Cellular Neworks Jie Gong, Member, IEEE, John S. Thompson, Member, IEEE, Sheng Zhou, Member,

More information

st semester. Kei Sakaguchi

st semester. Kei Sakaguchi 0 s semeser MIMO Communicaion Sysems #5: MIMO Channel Capaciy Kei Sakaguchi ee ac May 7, 0 Schedule ( s half Dae Tex Conens # Apr. A-, B- Inroducion # Apr. 9 B-5, B-6 Fundamenals

More information

Analyze patterns and relationships. 3. Generate two numerical patterns using AC

Analyze patterns and relationships. 3. Generate two numerical patterns using AC envision ah 2.0 5h Grade ah Curriculum Quarer 1 Quarer 2 Quarer 3 Quarer 4 andards: =ajor =upporing =Addiional Firs 30 Day 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 andards: Operaions and Algebraic Thinking

More information

3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon

3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon 3..3 INRODUCION O DYNAMIC OPIMIZAION: DISCREE IME PROBLEMS A. he Hamilonian and Firs-Order Condiions in a Finie ime Horizon Define a new funcion, he Hamilonian funcion, H. H he change in he oal value of

More information

Particle Swarm Optimization Combining Diversification and Intensification for Nonlinear Integer Programming Problems

Particle Swarm Optimization Combining Diversification and Intensification for Nonlinear Integer Programming Problems Paricle Swarm Opimizaion Combining Diversificaion and Inensificaion for Nonlinear Ineger Programming Problems Takeshi Masui, Masaoshi Sakawa, Kosuke Kao and Koichi Masumoo Hiroshima Universiy 1-4-1, Kagamiyama,

More information

Written Exercise Sheet 5

Written Exercise Sheet 5 jian-jia.chen [ ] u-dormund.de lea.schoenberger [ ] u-dormund.de Exercise for he lecure Embedded Sysems Winersemeser 17/18 Wrien Exercise Shee 5 Hins: These assignmens will be discussed a E23 OH14, from

More information

Dimitri Solomatine. D.P. Solomatine. Data-driven modelling (part 2). 2

Dimitri Solomatine. D.P. Solomatine. Data-driven modelling (part 2). 2 Daa-driven modelling. Par. Daa-driven Arificial di Neural modelling. Newors Par Dimiri Solomaine Arificial neural newors D.P. Solomaine. Daa-driven modelling par. 1 Arificial neural newors ANN: main pes

More information

RC, RL and RLC circuits

RC, RL and RLC circuits Name Dae Time o Complee h m Parner Course/ Secion / Grade RC, RL and RLC circuis Inroducion In his experimen we will invesigae he behavior of circuis conaining combinaions of resisors, capaciors, and inducors.

More information

Optimal Server Assignment in Multi-Server

Optimal Server Assignment in Multi-Server Opimal Server Assignmen in Muli-Server 1 Queueing Sysems wih Random Conneciviies Hassan Halabian, Suden Member, IEEE, Ioannis Lambadaris, Member, IEEE, arxiv:1112.1178v2 [mah.oc] 21 Jun 2013 Yannis Viniois,

More information

Performance Enhancement of Adaptive Orthogonal Modulation in Wireless CDMA Systems

Performance Enhancement of Adaptive Orthogonal Modulation in Wireless CDMA Systems Performance Enhancemen of Adapive Orhogonal Modulaion in Wireless CDMA Sysems 1 Alaa Muqaash, Marwan Krunz, and Tao Shu Deparmen of Elecrical and Compuer Engineering The Universiy of Arizona Tucson, AZ

More information

Optimal Packet Scheduling in a Multiple Access Channel with Energy Harvesting Transmitters

Optimal Packet Scheduling in a Multiple Access Channel with Energy Harvesting Transmitters 4 JOURNAL OF COMMUNICAIONS AND NEWORKS, VOL. 4, NO. 2, APRIL 22 Opimal Packe Scheduling in a Muliple Access Channel wih Energy Harvesing ransmiers Jing Yang and Sennur Ulukus Absrac: In his paper, we invesigae

More information

Solutions to the Exam Digital Communications I given on the 11th of June = 111 and g 2. c 2

Solutions to the Exam Digital Communications I given on the 11th of June = 111 and g 2. c 2 Soluions o he Exam Digial Communicaions I given on he 11h of June 2007 Quesion 1 (14p) a) (2p) If X and Y are independen Gaussian variables, hen E [ XY ]=0 always. (Answer wih RUE or FALSE) ANSWER: False.

More information

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION SUPPLEMENTARY INFORMATION DOI: 0.038/NCLIMATE893 Temporal resoluion and DICE * Supplemenal Informaion Alex L. Maren and Sephen C. Newbold Naional Cener for Environmenal Economics, US Environmenal Proecion

More information

Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems

Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems 1 Sable Scheduling Policies for Maximizing Throughpu in Generalized Consrained Queueing Sysems Prasanna Chaporar, Suden Member, IEEE, Saswai Sarar, Member, IEEE Absrac We consider a class of queueing newors

More information

Lecture 2 October ε-approximation of 2-player zero-sum games

Lecture 2 October ε-approximation of 2-player zero-sum games Opimizaion II Winer 009/10 Lecurer: Khaled Elbassioni Lecure Ocober 19 1 ε-approximaion of -player zero-sum games In his lecure we give a randomized ficiious play algorihm for obaining an approximae soluion

More information

Longest Common Prefixes

Longest Common Prefixes Longes Common Prefixes The sandard ordering for srings is he lexicographical order. I is induced by an order over he alphabe. We will use he same symbols (,

More information

PENALIZED LEAST SQUARES AND PENALIZED LIKELIHOOD

PENALIZED LEAST SQUARES AND PENALIZED LIKELIHOOD PENALIZED LEAST SQUARES AND PENALIZED LIKELIHOOD HAN XIAO 1. Penalized Leas Squares Lasso solves he following opimizaion problem, ˆβ lasso = arg max β R p+1 1 N y i β 0 N x ij β j β j (1.1) for some 0.

More information

MODULE - 9 LECTURE NOTES 2 GENETIC ALGORITHMS

MODULE - 9 LECTURE NOTES 2 GENETIC ALGORITHMS 1 MODULE - 9 LECTURE NOTES 2 GENETIC ALGORITHMS INTRODUCTION Mos real world opimizaion problems involve complexiies like discree, coninuous or mixed variables, muliple conflicing objecives, non-lineariy,

More information

Orientation. Connections between network coding and stochastic network theory. Outline. Bruce Hajek. Multicast with lost packets

Orientation. Connections between network coding and stochastic network theory. Outline. Bruce Hajek. Multicast with lost packets Connecions beween nework coding and sochasic nework heory Bruce Hajek Orienaion On Thursday, Ralf Koeer discussed nework coding: coding wihin he nework Absrac: Randomly generaed coded informaion blocks

More information

Online Convex Optimization Example And Follow-The-Leader

Online Convex Optimization Example And Follow-The-Leader CSE599s, Spring 2014, Online Learning Lecure 2-04/03/2014 Online Convex Opimizaion Example And Follow-The-Leader Lecurer: Brendan McMahan Scribe: Sephen Joe Jonany 1 Review of Online Convex Opimizaion

More information

Navneet Saini, Mayank Goyal, Vishal Bansal (2013); Term Project AML310; Indian Institute of Technology Delhi

Navneet Saini, Mayank Goyal, Vishal Bansal (2013); Term Project AML310; Indian Institute of Technology Delhi Creep in Viscoelasic Subsances Numerical mehods o calculae he coefficiens of he Prony equaion using creep es daa and Herediary Inegrals Mehod Navnee Saini, Mayank Goyal, Vishal Bansal (23); Term Projec

More information

Recursive Estimation and Identification of Time-Varying Long- Term Fading Channels

Recursive Estimation and Identification of Time-Varying Long- Term Fading Channels Recursive Esimaion and Idenificaion of ime-varying Long- erm Fading Channels Mohammed M. Olama, Kiran K. Jaladhi, Seddi M. Djouadi, and Charalambos D. Charalambous 2 Universiy of ennessee Deparmen of Elecrical

More information

Power Allocation in Multi-user Cellular Networks With Deep Q Learning Approach

Power Allocation in Multi-user Cellular Networks With Deep Q Learning Approach Power Allocaion in Muli-user Cellular Neworks Wih Deep Q Learning Approach Fan Meng, Peng Chen and Lenan Wu arxiv:1812.02979v1 [cs.it] 7 Dec 2018 Absrac The model-driven power allocaion (PA) algorihms

More information

ERROR LOCATING CODES AND EXTENDED HAMMING CODE. Pankaj Kumar Das. 1. Introduction and preliminaries

ERROR LOCATING CODES AND EXTENDED HAMMING CODE. Pankaj Kumar Das. 1. Introduction and preliminaries MATEMATIČKI VESNIK MATEMATIQKI VESNIK 70, 1 (2018), 89 94 March 2018 research paper originalni nauqni rad ERROR LOCATING CODES AND EXTENDED HAMMING CODE Pankaj Kumar Das Absrac. Error-locaing codes, firs

More information

Learning Relaying Strategies in Cellular D2D Networks with Token-Based Incentives

Learning Relaying Strategies in Cellular D2D Networks with Token-Based Incentives Learning Relaying Sraegies in Cellular D2D Neworks wih Token-Based Incenives Nicholas Masronarde, Viral Pael Deparmen of Elecrical Engineering Sae Universiy of New York a Buffalo Buffalo, NY USA Jie Xu,

More information

Joint Optimization of Rate Allocation and BLAST Ordering to Minimize Outage Probability

Joint Optimization of Rate Allocation and BLAST Ordering to Minimize Outage Probability Join Opimizaion of Rae Allocaion and BLAST Ordering o Minimize Ouage Probabiliy Arumugam Kannan, Badri Varadarajan and John R. Barry School of Elecrical and Compuer Engineering Georgia Insiue of Technology,

More information

1 Review of Zero-Sum Games

1 Review of Zero-Sum Games COS 5: heoreical Machine Learning Lecurer: Rob Schapire Lecure #23 Scribe: Eugene Brevdo April 30, 2008 Review of Zero-Sum Games Las ime we inroduced a mahemaical model for wo player zero-sum games. Any

More information

Online Appendix to Solution Methods for Models with Rare Disasters

Online Appendix to Solution Methods for Models with Rare Disasters Online Appendix o Soluion Mehods for Models wih Rare Disasers Jesús Fernández-Villaverde and Oren Levinal In his Online Appendix, we presen he Euler condiions of he model, we develop he pricing Calvo block,

More information

Chapter 2. First Order Scalar Equations

Chapter 2. First Order Scalar Equations Chaper. Firs Order Scalar Equaions We sar our sudy of differenial equaions in he same way he pioneers in his field did. We show paricular echniques o solve paricular ypes of firs order differenial equaions.

More information

Appendix 14.1 The optimal control problem and its solution using

Appendix 14.1 The optimal control problem and its solution using 1 Appendix 14.1 he opimal conrol problem and is soluion using he maximum principle NOE: Many occurrences of f, x, u, and in his file (in equaions or as whole words in ex) are purposefully in bold in order

More information

Application of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing

Application of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing Applicaion of a Sochasic-Fuzzy Approach o Modeling Opimal Discree Time Dynamical Sysems by Using Large Scale Daa Processing AA WALASZE-BABISZEWSA Deparmen of Compuer Engineering Opole Universiy of Technology

More information

Electrical and current self-induction

Electrical and current self-induction Elecrical and curren self-inducion F. F. Mende hp://fmnauka.narod.ru/works.hml mende_fedor@mail.ru Absrac The aricle considers he self-inducance of reacive elemens. Elecrical self-inducion To he laws of

More information

The electromagnetic interference in case of onboard navy ships computers - a new approach

The electromagnetic interference in case of onboard navy ships computers - a new approach The elecromagneic inerference in case of onboard navy ships compuers - a new approach Prof. dr. ing. Alexandru SOTIR Naval Academy Mircea cel Bărân, Fulgerului Sree, Consanţa, soiralexandru@yahoo.com Absrac.

More information

Problem Set #1. i z. the complex propagation constant. For the characteristic impedance:

Problem Set #1. i z. the complex propagation constant. For the characteristic impedance: Problem Se # Problem : a) Using phasor noaion, calculae he volage and curren waves on a ransmission line by solving he wave equaion Assume ha R, L,, G are all non-zero and independen of frequency From

More information

International Journal of Computer Science Trends and Technology (IJCST) Volume 3 Issue 6, Nov-Dec 2015

International Journal of Computer Science Trends and Technology (IJCST) Volume 3 Issue 6, Nov-Dec 2015 Inernaional Journal of Compuer Science Trends and Technology (IJCST) Volume Issue 6, Nov-Dec 05 RESEARCH ARTICLE OPEN ACCESS An EPQ Model for Two-Parameer Weibully Deerioraed Iems wih Exponenial Demand

More information

di Bernardo, M. (1995). A purely adaptive controller to synchronize and control chaotic systems.

di Bernardo, M. (1995). A purely adaptive controller to synchronize and control chaotic systems. di ernardo, M. (995). A purely adapive conroller o synchronize and conrol chaoic sysems. hps://doi.org/.6/375-96(96)8-x Early version, also known as pre-prin Link o published version (if available):.6/375-96(96)8-x

More information

Analytical Solutions of an Economic Model by the Homotopy Analysis Method

Analytical Solutions of an Economic Model by the Homotopy Analysis Method Applied Mahemaical Sciences, Vol., 26, no. 5, 2483-249 HIKARI Ld, www.m-hikari.com hp://dx.doi.org/.2988/ams.26.6688 Analyical Soluions of an Economic Model by he Homoopy Analysis Mehod Jorge Duare ISEL-Engineering

More information

Biol. 356 Lab 8. Mortality, Recruitment, and Migration Rates

Biol. 356 Lab 8. Mortality, Recruitment, and Migration Rates Biol. 356 Lab 8. Moraliy, Recruimen, and Migraion Raes (modified from Cox, 00, General Ecology Lab Manual, McGraw Hill) Las week we esimaed populaion size hrough several mehods. One assumpion of all hese

More information

Notes on Kalman Filtering

Notes on Kalman Filtering Noes on Kalman Filering Brian Borchers and Rick Aser November 7, Inroducion Daa Assimilaion is he problem of merging model predicions wih acual measuremens of a sysem o produce an opimal esimae of he curren

More information

PROC NLP Approach for Optimal Exponential Smoothing Srihari Jaganathan, Cognizant Technology Solutions, Newbury Park, CA.

PROC NLP Approach for Optimal Exponential Smoothing Srihari Jaganathan, Cognizant Technology Solutions, Newbury Park, CA. PROC NLP Approach for Opimal Exponenial Smoohing Srihari Jaganahan, Cognizan Technology Soluions, Newbury Park, CA. ABSTRACT Esimaion of smoohing parameers and iniial values are some of he basic requiremens

More information

Stability and Bifurcation in a Neural Network Model with Two Delays

Stability and Bifurcation in a Neural Network Model with Two Delays Inernaional Mahemaical Forum, Vol. 6, 11, no. 35, 175-1731 Sabiliy and Bifurcaion in a Neural Nework Model wih Two Delays GuangPing Hu and XiaoLing Li School of Mahemaics and Physics, Nanjing Universiy

More information

Robotics I. April 11, The kinematics of a 3R spatial robot is specified by the Denavit-Hartenberg parameters in Tab. 1.

Robotics I. April 11, The kinematics of a 3R spatial robot is specified by the Denavit-Hartenberg parameters in Tab. 1. Roboics I April 11, 017 Exercise 1 he kinemaics of a 3R spaial robo is specified by he Denavi-Harenberg parameers in ab 1 i α i d i a i θ i 1 π/ L 1 0 1 0 0 L 3 0 0 L 3 3 able 1: able of DH parameers of

More information

On-line Adaptive Optimal Timing Control of Switched Systems

On-line Adaptive Optimal Timing Control of Switched Systems On-line Adapive Opimal Timing Conrol of Swiched Sysems X.C. Ding, Y. Wardi and M. Egersed Absrac In his paper we consider he problem of opimizing over he swiching imes for a muli-modal dynamic sysem when

More information

Article from. Predictive Analytics and Futurism. July 2016 Issue 13

Article from. Predictive Analytics and Futurism. July 2016 Issue 13 Aricle from Predicive Analyics and Fuurism July 6 Issue An Inroducion o Incremenal Learning By Qiang Wu and Dave Snell Machine learning provides useful ools for predicive analyics The ypical machine learning

More information

Lecture 2-1 Kinematics in One Dimension Displacement, Velocity and Acceleration Everything in the world is moving. Nothing stays still.

Lecture 2-1 Kinematics in One Dimension Displacement, Velocity and Acceleration Everything in the world is moving. Nothing stays still. Lecure - Kinemaics in One Dimension Displacemen, Velociy and Acceleraion Everyhing in he world is moving. Nohing says sill. Moion occurs a all scales of he universe, saring from he moion of elecrons in

More information

Simulation-Solving Dynamic Models ABE 5646 Week 2, Spring 2010

Simulation-Solving Dynamic Models ABE 5646 Week 2, Spring 2010 Simulaion-Solving Dynamic Models ABE 5646 Week 2, Spring 2010 Week Descripion Reading Maerial 2 Compuer Simulaion of Dynamic Models Finie Difference, coninuous saes, discree ime Simple Mehods Euler Trapezoid

More information

ODEs II, Lecture 1: Homogeneous Linear Systems - I. Mike Raugh 1. March 8, 2004

ODEs II, Lecture 1: Homogeneous Linear Systems - I. Mike Raugh 1. March 8, 2004 ODEs II, Lecure : Homogeneous Linear Sysems - I Mike Raugh March 8, 4 Inroducion. In he firs lecure we discussed a sysem of linear ODEs for modeling he excreion of lead from he human body, saw how o ransform

More information

CHAPTER 12 DIRECT CURRENT CIRCUITS

CHAPTER 12 DIRECT CURRENT CIRCUITS CHAPTER 12 DIRECT CURRENT CIUITS DIRECT CURRENT CIUITS 257 12.1 RESISTORS IN SERIES AND IN PARALLEL When wo resisors are conneced ogeher as shown in Figure 12.1 we said ha hey are conneced in series. As

More information

Transmitting important bits and sailing high radio waves: a decentralized cross-layer approach to cooperative video transmission

Transmitting important bits and sailing high radio waves: a decentralized cross-layer approach to cooperative video transmission Transmiing imporan bis and sailing high radio waves: a decenralized cross-layer approach o cooperaive video ransmission 1 Nicholas Masronarde, Francesco Verde, Donaella Darsena, Anna Scaglione, and Mihaela

More information

Problem Formulation in Communication Systems

Problem Formulation in Communication Systems Problem Formulaion in Communicaion Sysems Sooyong Choi School of Elecrical and Elecronic Engineering Yonsei Universiy Inroducion Problem formulaion in communicaion sysems Simple daa ransmission sysem :

More information

IB Physics Kinematics Worksheet

IB Physics Kinematics Worksheet IB Physics Kinemaics Workshee Wrie full soluions and noes for muliple choice answers. Do no use a calculaor for muliple choice answers. 1. Which of he following is a correc definiion of average acceleraion?

More information

Traffic Splitting with Network Calculus for Mesh Sensor Networks

Traffic Splitting with Network Calculus for Mesh Sensor Networks Traffic Spliing wih Nework Calculus for Mesh Sensor Neworks Huimin She, Zhonghai Lu, Axel Jansch, Li-Rong Zheng, Dian Zhou Dep. of Elecronic, Compuer and Sofware Sysems, Royal Insiue of Technology, Sweden

More information

Policy regimes Theory

Policy regimes Theory Advanced Moneary Theory and Policy EPOS 2012/13 Policy regimes Theory Giovanni Di Barolomeo giovanni.dibarolomeo@uniroma1.i The moneary policy regime The simple model: x = - s (i - p e ) + x e + e D p

More information

Theory of! Partial Differential Equations-I!

Theory of! Partial Differential Equations-I! hp://users.wpi.edu/~grear/me61.hml! Ouline! Theory o! Parial Dierenial Equaions-I! Gréar Tryggvason! Spring 010! Basic Properies o PDE!! Quasi-linear Firs Order Equaions! - Characerisics! - Linear and

More information

Wireless Communication Channel Overview

Wireless Communication Channel Overview EC744 Wireless Communicaion Fall 008 Mohamed Essam Khedr Deparmen of Elecronics and Communicaions Wireless Communicaion Channel Overview Syllabus Tenaively Week 1 Week Week 3 Week 4 Week 5 Week 6 Week

More information

Reading from Young & Freedman: For this topic, read sections 25.4 & 25.5, the introduction to chapter 26 and sections 26.1 to 26.2 & 26.4.

Reading from Young & Freedman: For this topic, read sections 25.4 & 25.5, the introduction to chapter 26 and sections 26.1 to 26.2 & 26.4. PHY1 Elecriciy Topic 7 (Lecures 1 & 11) Elecric Circuis n his opic, we will cover: 1) Elecromoive Force (EMF) ) Series and parallel resisor combinaions 3) Kirchhoff s rules for circuis 4) Time dependence

More information

Methodology. -ratios are biased and that the appropriate critical values have to be increased by an amount. that depends on the sample size.

Methodology. -ratios are biased and that the appropriate critical values have to be increased by an amount. that depends on the sample size. Mehodology. Uni Roo Tess A ime series is inegraed when i has a mean revering propery and a finie variance. I is only emporarily ou of equilibrium and is called saionary in I(0). However a ime series ha

More information

Macroeconomic Theory Ph.D. Qualifying Examination Fall 2005 ANSWER EACH PART IN A SEPARATE BLUE BOOK. PART ONE: ANSWER IN BOOK 1 WEIGHT 1/3

Macroeconomic Theory Ph.D. Qualifying Examination Fall 2005 ANSWER EACH PART IN A SEPARATE BLUE BOOK. PART ONE: ANSWER IN BOOK 1 WEIGHT 1/3 Macroeconomic Theory Ph.D. Qualifying Examinaion Fall 2005 Comprehensive Examinaion UCLA Dep. of Economics You have 4 hours o complee he exam. There are hree pars o he exam. Answer all pars. Each par has

More information

Robust estimation based on the first- and third-moment restrictions of the power transformation model

Robust estimation based on the first- and third-moment restrictions of the power transformation model h Inernaional Congress on Modelling and Simulaion, Adelaide, Ausralia, 6 December 3 www.mssanz.org.au/modsim3 Robus esimaion based on he firs- and hird-momen resricions of he power ransformaion Nawaa,

More information

Scheduling of Crude Oil Movements at Refinery Front-end

Scheduling of Crude Oil Movements at Refinery Front-end Scheduling of Crude Oil Movemens a Refinery Fron-end Ramkumar Karuppiah and Ignacio Grossmann Carnegie Mellon Universiy ExxonMobil Case Sudy: Dr. Kevin Furman Enerprise-wide Opimizaion Projec March 15,

More information

0.1 MAXIMUM LIKELIHOOD ESTIMATION EXPLAINED

0.1 MAXIMUM LIKELIHOOD ESTIMATION EXPLAINED 0.1 MAXIMUM LIKELIHOOD ESTIMATIO EXPLAIED Maximum likelihood esimaion is a bes-fi saisical mehod for he esimaion of he values of he parameers of a sysem, based on a se of observaions of a random variable

More information

EE650R: Reliability Physics of Nanoelectronic Devices Lecture 9:

EE650R: Reliability Physics of Nanoelectronic Devices Lecture 9: EE65R: Reliabiliy Physics of anoelecronic Devices Lecure 9: Feaures of Time-Dependen BTI Degradaion Dae: Sep. 9, 6 Classnoe Lufe Siddique Review Animesh Daa 9. Background/Review: BTI is observed when he

More information

Geometric Mean Decomposition Based Hybrid Precoding for Millimeter-Wave Massive MIMO

Geometric Mean Decomposition Based Hybrid Precoding for Millimeter-Wave Massive MIMO SIGNAL PROCESSING FOR COMMUNICATIONS Geomeric Mean Decomposiion Based ybrid Precoding for Millimeer-Wave Massive MIMO Tian Xie Linglong Dai * Xinyu Gao Muhammad Zeeshan Shakir 2 Jianjun Li 3 Tsinghua Naional

More information

EECS 141: FALL 00 MIDTERM 2

EECS 141: FALL 00 MIDTERM 2 Universiy of California College of Engineering Deparmen of Elecrical Engineering and Compuer Science J. M. Rabaey TuTh9:30-11am ee141@eecs EECS 141: FALL 00 MIDTERM 2 For all problems, you can assume he

More information

3.1 More on model selection

3.1 More on model selection 3. More on Model selecion 3. Comparing models AIC, BIC, Adjused R squared. 3. Over Fiing problem. 3.3 Sample spliing. 3. More on model selecion crieria Ofen afer model fiing you are lef wih a handful of

More information

WEEK-3 Recitation PHYS 131. of the projectile s velocity remains constant throughout the motion, since the acceleration a x

WEEK-3 Recitation PHYS 131. of the projectile s velocity remains constant throughout the motion, since the acceleration a x WEEK-3 Reciaion PHYS 131 Ch. 3: FOC 1, 3, 4, 6, 14. Problems 9, 37, 41 & 71 and Ch. 4: FOC 1, 3, 5, 8. Problems 3, 5 & 16. Feb 8, 018 Ch. 3: FOC 1, 3, 4, 6, 14. 1. (a) The horizonal componen of he projecile

More information

Impacts of both Tx and Rx IQ Imbalances on OFDM Systems - Analytical Approach

Impacts of both Tx and Rx IQ Imbalances on OFDM Systems - Analytical Approach mpacs of boh Tx and Rx Q mbalances on OFD Sysems - Analyical Approach Hassan Zareian, Vahid Tabaaba Vakili ran Universiy of Science and Technology UST, Tehran, ran Faculy of he slamic Republic of ran Broadcasing

More information

Content-Based Shape Retrieval Using Different Shape Descriptors: A Comparative Study Dengsheng Zhang and Guojun Lu

Content-Based Shape Retrieval Using Different Shape Descriptors: A Comparative Study Dengsheng Zhang and Guojun Lu Conen-Based Shape Rerieval Using Differen Shape Descripors: A Comparaive Sudy Dengsheng Zhang and Guojun Lu Gippsland School of Compuing and Informaion Technology Monash Universiy Churchill, Vicoria 3842

More information

Testing for a Single Factor Model in the Multivariate State Space Framework

Testing for a Single Factor Model in the Multivariate State Space Framework esing for a Single Facor Model in he Mulivariae Sae Space Framework Chen C.-Y. M. Chiba and M. Kobayashi Inernaional Graduae School of Social Sciences Yokohama Naional Universiy Japan Faculy of Economics

More information

Lecture Notes 3: Quantitative Analysis in DSGE Models: New Keynesian Model

Lecture Notes 3: Quantitative Analysis in DSGE Models: New Keynesian Model Lecure Noes 3: Quaniaive Analysis in DSGE Models: New Keynesian Model Zhiwei Xu, Email: xuzhiwei@sju.edu.cn The moneary policy plays lile role in he basic moneary model wihou price sickiness. We now urn

More information

KINEMATICS IN ONE DIMENSION

KINEMATICS IN ONE DIMENSION KINEMATICS IN ONE DIMENSION PREVIEW Kinemaics is he sudy of how hings move how far (disance and displacemen), how fas (speed and velociy), and how fas ha how fas changes (acceleraion). We say ha an objec

More information

Families with no matchings of size s

Families with no matchings of size s Families wih no machings of size s Peer Franl Andrey Kupavsii Absrac Le 2, s 2 be posiive inegers. Le be an n-elemen se, n s. Subses of 2 are called families. If F ( ), hen i is called - uniform. Wha is

More information

Topic Astable Circuits. Recall that an astable circuit has two unstable states;

Topic Astable Circuits. Recall that an astable circuit has two unstable states; Topic 2.2. Asable Circuis. Learning Objecives: A he end o his opic you will be able o; Recall ha an asable circui has wo unsable saes; Explain he operaion o a circui based on a Schmi inverer, and esimae

More information

Expert Advice for Amateurs

Expert Advice for Amateurs Exper Advice for Amaeurs Ernes K. Lai Online Appendix - Exisence of Equilibria The analysis in his secion is performed under more general payoff funcions. Wihou aking an explici form, he payoffs of he

More information

2017 3rd International Conference on E-commerce and Contemporary Economic Development (ECED 2017) ISBN:

2017 3rd International Conference on E-commerce and Contemporary Economic Development (ECED 2017) ISBN: 7 3rd Inernaional Conference on E-commerce and Conemporary Economic Developmen (ECED 7) ISBN: 978--6595-446- Fuures Arbirage of Differen Varieies and based on he Coinegraion Which is under he Framework

More information