Channel aware scheduling for broadcast MIMO systems with orthogonal linear precoding and fairness constraints
|
|
- Erin Leonard
- 6 years ago
- Views:
Transcription
1 Channel aware schedulng for broadcast MIMO systems wth orthogonal lnear precodng and farness constrants G Prmolevo, O Smeone and U Spagnoln Dp d Elettronca e Informazone, Poltecnco d Mlano Pzza L da Vnc, 3 I-133 Mlano (Italy) Abstract In the downlnk of a broadcast fadng channel, the base staton can captalze on multuser dversty through channel aware schedulng In MIMO systems, the desgn of the scheduler has to take nto account the processng performed at the trasmtter and the recevers In ths work, we consder channel aware schedulng for orthogonal lnear precodng at the base staton that guarantees nterference free recepton for each scheduled users The problem s set n a novel mathematcal framework and a schedulng algorthm s proposed that s shown by smulaton to guarantee superor performance as compared to know technques Moreover, farness constrants nspred by the proportonal far crteron are ntroduced n the schedulng process n order to guarantee the desred long term farness propertes I INTRODUCTION In the downlnk of a broadcast fadng channel, the base staton can captalze on multuser dversty provded by ndependent fadng realzatons across dfferent users Channel aware schedulng s a technque that allows to acheve ths goal by approprately tmng transmsson to a subset of one or more users n each avalable tme (code/frequency) slot Schedulng s performed accordng to the knowledge of the channel state nformaton avalable at the scheduler wth the general goal of grantng transmsson to the users that have nstantaneous channel near the peak [1] If base staton and users are equpped wth a sngle antenna, t has been shown that transmsson to the user wth the strongest channel s a strategy that acheves channel capacty [] owever, f the base staton s equpped wth an antenna array, more users can be served smultaneously n the same tme slot In partcular, f the base staton has n T antennas, up to n T users can be allocated n the same tme slot wth controlled nterference In ths case, transmsson to a sngle user s not the optmal soluton and the desgn of the scheduler becomes more complcated dependng on the beamformng and power allocaton strategy [3] [4] In MIMO systems (e, antenna array at both base staton and termnals), the scheduler can leverage on another degree of freedom snce each user can be assgned to multple spatal channels [5] In fact, f each user has n R recevng antennas (n R n T ), the base staton can grant up to n R spatal channels (out of the avalable n T ) to any user [6] The desgn of the scheduler has to take nto account the processng performed at the transmtter (eg, lnear precodng and power allocaton) and the recevers (eg, lnear equalzer) Schedulng wth lnear processng at the base staton that smply assocates each spatal channel wth a transmttng antenna and lnear nterfaces at the recevers has been consdered n [5] (zero forcng equalzer) and [7] (MMSE equalzer) In ths paper, we consder channel aware schedulng for x 1 x K M 1 M K 1 K n 1 y 1 n K y K B 1 B K ~ y1 y~ K equalzaton decodng equalzaton decodng Fg 1 Block dagram of a broadcast channel wth lnear nterfaces at the transmtter (base staton) and recevers (users) orthogonal lnear precodng at the base staton and lnear zero-forcng equalzers at the recevers (Orthogonal Space Dvson Multple Access, OSDMA [8]) Usng the OSDMA transmttng/recevng strategy, the spatal channels ntended for a gven user do not nterfere nether wth the sgnal destned to other users nor among themselves Channel aware schedulng for OSDMA has been frst studed n [8] We set the problem n a novel mathematcal framework and propose a schedulng algorthm that s shown by smulaton to guarantee superor performance n terms of sum capacty Moreover, farness constrants nspred by the proportonal far crteron [9] [1] are ntroduced n the schedulng process n order to guarantee the desred long term farness propertes II SIGNAL MODEL AND PROBLEM FORMULATION The broadcast channel wth lnear nterfaces at the transmtter and recevers s depcted n fg 1 Let K be the set of K avalable users The th user s equpped wth an antenna array of n R, elements and the base staton wth n T antennas The subset of K(t) users that are served by the base staton wthn the tth tme slot s denoted as K(t) K and ts element ndexed by k =1,,, K(t) The scheduler allocates d k (t) n R,k spatal channels to the kth user so that all the avalable n T spatal channels are used: K(t) X d k (t) =n T (1) k=1 The sgnal ntended for the kth user, collected n the d k (t) 1 vector x k (t) s lnearly precoded by the n T d k (t) matrx M k (t) Followng the conventonal notaton (see, eg, [6]) and referrng to fg 1, the sgnal receved by the kth user across ts n R,k recevng antennas wthn the tth tme slot can /5/$ (C) 5 IEEE
2 be wrtten as the n R,k 1 vector y k (t) y k (t) = k (t)m k (t)x k (t)+ X k (t)m (t)x (t)+n k (t) 6=k K(t) () where k (t) s the n R,k n T channel matrx of the kth user and n k (t) s the zero mean addtve Gaussan nose wth E[n k (t)n k (t) ]=σ ni nr,k The receved sgnal y k (t) les n a n R,k -dmensonal lnear space owever, only d k (t) n R,k spatal channels are assgned to the kth user Therefore, the useful part of the receved sgnal spans a d k (t)-dmensonal subspace that we refer to as recevng subspace In order to account for ths, at the recever, the n R,k 1 receved sgnal y k (t) s pre-fltered by the d k (t) n R,k matrx B k (t) ỹ k (t) = B k (t) y k (t) = k (t)m k (t)x k (t)+ + X k (t)m (t)x (t)+ñ k (t), (3) 6=k K(t) wherewehavedefned the d k (t) n T equvalent channel k (t) =B k (t) k (t) and ñ k (t) =B k (t) n k (t) In order to smplfy the analyss and wthout lmtng the generalty of the approach, we assume B k (t) B k (t) =I dk (t), (4) so that E[ñ k (t)ñ k (t) ]=σ ni dk (t) The range space of B k (t) corresponds to the recevng subspace for the kth termnal As a last step, equalzaton and detecton s performed on ỹ k (t) In ths work, we assume that the channel matrces k (t) are known to the transmtter and recevers, eg, by transmsson of plot symbols and feedback of the channel state nformaton from the recevers to the base staton [11] An analyss of the effect of mperfect channel state nformaton and feedback delays s proposed n [1] In order to smplfy the notaton, n the followng the temporal dependence on t s omtted A Problem formulaton In prncple, we would lke to fnd the subset of users K and the set of precodng matrces M ={M } K and pre-flterng matrces B = {B } K so that the sum capacty s maxmzed under a total power constrant (recall also constrants (1) and (4)): {B, M} =argmax B,M st C (B, M) tr(m M ) P, where C (B, M) s the lnk capacty for the th user [6] wth C (B, M) =log I d +R 1 ( M M R = σ ni d + X k6= k K (5a) (5b) ) (6) M k M k (7) In (6)-(7) the assumpton of Gaussan codebooks wth E[x x ] = I d s mpled Moreover, as a result of the optmzaton problem (5) the th user belongs to the set of actve users K f d > or equvalently (M, B ) are not empty matrces Soluton of the optmzaton problem (5) s not known, even for the case of gven sets K and B In [8], an algorthm s proposed for obtanng an approxmate soluton based on the addtonal constrant of zero nter-user nterference and the separate computaton of precodng and schedulng as explaned n Sec III The treatment s amed at settng the results of [8] n the dscussed mathematcal framework and revew the man concepts A novel approxmate soluton of (5) s then proposed n Sec IV The algorthm s stll based on the ncluson of the zero nter-user nterference constrant but, dfferently from [8], t performs ontly precodng and schedulng III REVIEW OF MIMO-OSDMA WIT LSV SCEDULING Accordng to the approxmate soluton of (5) proposed n [8], at frst the schedulng step s performed Ths amounts to select the subset K and the correspondng K matrces B k Recall that the choce of B k mples the allocaton of d k spatal channel to the kth user and the correspondng recevng subspace Then, the desgn of the precodng matrces M k s carred out wth the addtonal constrant of grantng nter-user nterference free transmsson (MIMO-OSDMA) A Largest Sngular Value (LSV) channel aware schedulng In [8], selecton of the subset K and of the correspondng K matrces {B k } K k=1 s performed so as to set as actve the spatal channels correspondng to the largest sngular values of matrces { } K To elaborate, let λ,, =1,,r = rank( ) be the non-zero sngular values of channel matrx gathered n the dagonal matrx Λ and (u,, v, ) the correspondng left and rght sngular vectors collected by columns n matrces U and V respectvely: = U Λ V The LSV algorthm selects the n T largest sngular values of the set {λ, =1,, K, =1,,r } and bulds matrces B k wth the correspondng left sngular vectors v, Ths algorthm can equvalently be stated as the soluton of the followng optmzaton problem: fnd the set B = {B } K so that (recall also constrants (1) and (4)): B =argmax B B, (8) Notce that an user belongs to K f the correspondng number of assgned channel d s not zero, or equvalently B s not empty B MIMO Orthogonal Space Dvson Multple Access (OS- DMA) Gven the output of the schedulng algorthm (e, the set K and matrces {B k } K k=1 ), the precodng matrces M k are derved by maxmzng the sum capacty (5) wth an addtonal zero nterference constrant among the users Notce that the /5/$ (C) 5 IEEE
3 zero-nterference assumpton s capacty achevng n the hgh sgnal-to-nose rato regme where the nterference plays a maor role n defnng the system performance In partcular, the followng optmzaton problem s solved: KX M =argmax C (B, M) (9a) M KX st tr(m k M k ) P, (9b) k=1 M = f 6=, (9c) Constrant (9c) ensures zero-nterference among the K actve users Therefore, the capacty for the th user can be wrtten as (6) wth R = σ ni d The resultng precodng matrx M k has the followng form [8] M k = Θ k P k, (1) where Θ k s a n T d k matrx s selected as Θ k = V kṽk (11) where V k s a n T d k bass of the d k dmensonal null space of the n T (n T d k ) matrx k wth the sngular value decomposton k = [ 1 k 1 k K] = = Ū Ū Λ V V, (1) ths guarantees the zero nter-user nterference constrant (9c) Matrx Ṽ k s the d k d k range space of k, thus ensurng zero nterference among all the spatal channels Fnally, P k s a d k d k dagonal matrx that defnes power allocaton over the spatal channels selected accordng to the mult-user waterfllng crteron IV MIMO-OSDMA WIT SVS SCEDULING The approxmate soluton of the problem (9) proposed by [8] suffers from degraded performance (as t wll be shown n Sec VI) manly because the precodng matrces M k and the preflterng matrces B k (and the assocated set K) are optmzed separately ere we propose a ont optmzaton that approxmates problem (9) as follows ) The zero nterference constrant (9c) s mposed, thus obtanng a MIMO- OSDMA system as n [8] As explaned n Sec III-B, the resultng precodng matrces have the form (1)-(11) ) The obectve functon C (B, M) s approxmated by ts frst term of the Taylor expanson: C (B, M) 1/σ n B M The latter approxmaton s expected to hold at suffcently low sgnal-to-nose ratos The resultng optmzaton problem reads (recall also constrants (1) and (4) and defne V = { V } K ): {B, V } =argmax B, V N (B, V ), (13a) st V =,6=, (13b) wherewedefned N (B, V )= B V The obectve functon (13a) s amenable to an effcent numercal optmzatonandwllbeshownnsecvitoyeldrelevantadvantages as compared to the separate optmzaton proposed n [8] Notce that n order to smplfy the soluton of the problem, the remanng term of the precodng matrces (1), Ṽ k and P k, are assumed to be computed accordng to Sec III-B, thus guaranteeng zero nterference among dfferent streams and the enforcement of the total power constrant A Successve Vector Selecton (SVS) channel aware schedulng Problem (13) can be effcently solved by a greedy approach as detaled n the followng The dea s to select at each step the spatal channel that yelds the largest ncrease of the obectve functon (13a) Let us denote wth the superscrpt (n) the quanttes of nterest as computed at the nth teraton At each teraton a spatal channel (out of the n T avalable) s allocated to a specfc user so that a total number of n T teratons are needed We are nterested n updatng the recevng subspaces B (ntalzed as B () equaltoanempty matrx) and the transmttng subspaces V, or equvalently ts orthogonal complement V (see (1), ntalzaton: V () = I nt ) Let u be a possble canddate vector to be ncluded n the recevng subspace B (n) of user at the nth teraton ( =1,, K) As a result of the choce of u at the nth teraton, the obectve functon (13a) modfes as (droppng the functonal dependence on B, V for smplcty of notaton) N (n) (u )= N (n 1) + N (n) (u ) (14) Among all the possble vectors u for all users =1,, K, the vector u s selected so as to maxmze the ncrease of (u )Inthefollowng,the computaton of N (n) (u ) s carred out To elaborate, we need to defne for each user a bass U (n) that spans the range space of the channel matrx that at the nth teraton has not be assgned to any recevng subspace the obectve functon P K N (n) Formally, t s: span{u (n) } = span{u } null{b (n) } Therefore, the correspondng ntalzaton s U () = U At the nth teraton we have P K (n) ˆd = n and the possble canddate vectors to be ncluded n the recevng subspace of the th user are lnear combnatons of the columns of U (n) : u = U (n) a, wth ka k =1 (15) Wth the selecton of (15), the correspondng recevng subspace s updated as B (n) =[B (n 1) u ] whle ts transmt subspace remans unchanged, V (n) = V (n 1), snce no new constrant (9c) s mposed upon t It follows that N (n) (u )= u V (n) (16) Then, let v = u be the vector correspondng to u on the transmtter sde The choce of u for user results n an /5/$ (C) 5 IEEE
4 addtonal zero-nterference constrant for any user 6= (see (13)), that leads to h V (n) = V (n 1) w, (17) where w s the proecton of v over V (n 1), scaled to unt length w =( V (n 1) V (n 1) v )/ V (n 1) V (n 1) v (18) V (n) s updated as well, so that span( V (n) ) = null( V (n) ) Ths step can be performed, eg, by updatng the QR decomposton of (17) [13] On the other hand, nothng changes at the recever sde of the th user, B (n) = B (n 1) Itseasyto show that N (n) (u )= B (n) w 6= (19) To sum up, from (16) and (19) the ncrease of obectve functon (13) due to the choce of vector u at the nth teraton s N (n) (u )= u V (n) X B (n) w 6= () The frst term n () accounts for the ncreased useful power receved by user on the newly assgned spatal channel, whereas the other terms represent the power loss suffered from the other users from not beng allowed to transmt over w anymore Recallng (18) and (15), functon () can be easly recognzed to be a sum of Raylegh quotents n terms of vector a Whle the maxmzaton of a sngle Raylegh quotent s analytcally feasble snce t corresponds to the soluton of a generalzed egenvalue problem, maxmzng a sum of Raylegh quotents s much more dffcult and costly ere, we resort to a sub-optmal approach, by restrctng a to be a column of an dentty matrx, whch translates to restrctng our search of the optmal u to the columns of U (n) Ths approach has been proved by smulaton to yeld performance very close to the optmum soluton V SVS ALGORITM WIT PROPORTIONAL FAIRNESS CONSTRAINTS The algorthms dscussed so far am to maxmze the system throughput If the users are unbalanced, wth some of them experencng strongly attenuated channels, t s expected that the algorthms wll result n an unfar sharng of system resources that mght preclude communcaton to some users (see also Sec VI) Smlarly to the proportonal far crteron [1], a schedulng procedure that acheves over a long term an approprate balance between sum capacty and farness among users can be defned by modfyng (13) as follows (here we explct for convenence the tme dependence): {B(t), V (t)} =argmax B, V log(e[n (B, V )]), (1a) st (t) V (t) =,6= (1b) where E[ ] refers to the long term average over tme Followng the analyss of [9] and the consderatons n Sec IV, t can be shown that a procedure that (approxmately) converges to the soluton of (1) can be obtaned by mplementng the SVS algorthm on normalzed channel matrces N (t) = (t) () α (t) wth α (t) = µ1 1tc ˆα (t)+ 1 t c N (B(t 1), V (t 1)), (3) where parameter t c rules the memory of the algorthm Parameter α (t) measures the channel power that each user has been allowed to use wthn a wndow of t c tme slots The ratonale of the algorthm s that f a gven user has been gnored by the schedulng procedure n the consdered tme wndow, the matrx scalng () wll force the SVS algorthm to allocate resources to t The crteron (1) s a farness constrants on the channel norms: ts mplcaton on the channel rates s not obvous and wll be nvestgated n the next Secton by numercal smulatons VI NUMERICAL SIMULATIONS The performance of the proposed SVS algorthm s compared wth the LSV algorthm [8] by Monte Carlo smulatons We consder K = 4 users, where each user has the same number of recevng antennas n R = whle the base staton s equpped wth n T =4antennas Where not stated otherwse, the channels are assumed to be subect to dentcally dstrbuted Ralegh fadng, vec( ) CN, I nt n R As reference performance, a random user selecton algorthm s consdered that chooses randomly a set K of users such that (1) s satsfed On ths subset, orthogonal precodng s appled as detaled n Sec III-B Moreover, the performance of a n T n T sngle user MIMO lnk s evaluated n order to set a reference level for the sum capacty of the multuser system The ergodc sum capacty s plotted versus the sgnal to nose rato P/σ n n fg The proposed SVS algorthm yelds a gan of about 4dB as compared to the LSV algorthm, whose performance are, n ths case, smlar to random users selecton As explaned n Sec IV, the advantage of SVS s due to the ont computaton of the transmttng and recevng subspaces Fg 3 shows sum capacty versus outage probablty for P/σ n =1dB It can be seen that the slope of the outage probablty for SVS s comparable to that of a sngle user channel, provng the ablty of the SVS algorthm to approprately explot the dversty of the broadcast channel Let us now consder unbalanced users n order to valdate the performance of the SVS algorthm wth farness constrants To be specfc, the channels are assumed to be selected so that vec( ) CN,β I nt n R, where β1 = db, β = 5dB, β 3 = 1dB and β 4 = db The performance of the SVS algorthm s evaluated wth and wthout farness constrants (t c = ) The results are summarzed n fg 4 n terms of ergodc sum capacty and ndvdual /5/$ (C) 5 IEEE
5 Ergodc sum Capacty [bt/s/z] Random selecton LSV schedulng [8] SVS schedulng Sngle User P/σ n [db] Ergodc capacty [bt/s/z] C 1 C C 3 Fg Ergodc sum capacty versus P/σ n (K =4,n T =4,n R =) C 4 SVS schedulng Far SVS schedulng sum capacty user capacty t 1 8 Random selecton LSV schedulng [8] SVS schedulng Sngle User Fg 4 Ergodc sum capacty and ndvdual capactes versus tme t for the SVS algorthm wth and wthout farness constrants (unbalanced users, K =4,n T =4,n R =,P/σ n =1dB) Outage probablty 6 4 based on the ont optmzaton of precodng and schedulng has been proposed and ts performance proved by smulaton to be superor to know technques n terms of sum capacty Moreover, the ntroducton of proportonal farness constrants has been dscussed and a modfcaton of the algorthm that yelds desrable long term farness propertes has been proposed and valdated through smulaton Ergodc sum capacty [bt/s/z] Fg 3 Sum capacty versus outage probablty (K =4,n T =4,n R =, P/σ n =1dB) ergodc capacty versus tme t The total throughput loss ncreases as the farness constrants are mposed by the scalng algorthm dscussed n Sec V and converges to approxmately bt/s/z Ths decrease of the sum capacty translates n a more far sharng of resources as proved by the ndvdual channel capactes Notce that the channel capactes for t = correspond to the performance of the SVS algorthm wth no farness constrants Even though the farness constrant (1) was mposed on the channel norms, rather than on the ndvdual rates as n [1], the smulaton results ndcate that the proportonal far crteron s very closely followed by the channel capactes as well In fact, the user capactes approxmately converge to the dashed lnes n fg 4 that denote the ndvdual capactes as obtaned by sharng the long term sum capacty accordng to the proportonal far crteron (e, n proporton to the sngle user capactes E[log I d +P/K ] [1]) VII CONCLUSION The problem of channel aware schedulng for broadcast MIMO channels wth orthogonal lnear precodng and lnear nterfaces at the recevers has been nvestgated An algorthm REFERENCES [1] R Knopp and P umblet, Informaton capacty and power control n sngle cell multuser communcatons, Proc IEEE Int Computer Conf, pp , June 1995 [] D N C Tse, Optmal power allocaton over parallel Gaussan channels, Proc IEEE ISIT, p 7, 1997 [3] Vswanathan and K Kumaran, "Rate schedulng n multple antenna downlnk wreless systems," Proc Allerton Conference, 1 [4] I Koutsopoulos, T Ren and L Tassulas, "The mpact of space dvson multplexng on resource allocaton: a unfed vew," Proc IEEE Infocom, pp , 3 [5] RWeathJr,MAry,AJPaulra, MultuserdverstyforMIMO wreless systems wth lnear recevers, Proc Aslomar Conf Sgnals, Systems and Computers, pp , Nov 1 [6] AGoldsmth,SAJafar,NJndalandSVshwanath,"Capactylmts of MIMO channels," IEEE J Select Areas Commun, vol 1, no 5, pp 684-7, June 3 [7] O Shn and K Bok, Antenna-asssted round robn schedulng for MIMO cellular systems, IEEE Comm Letters, vol 7, no 3, pp , March 3 [8] Q Spencer, A Lee Swndlehurst and M aardt, "Zero-forcng methods for downlnk spatal multplexng n multuser MIMO channels", IEEE Trans Sgnal Processng, vol 5, no, pp , Feb 4 [9] J Kushner and P Whtng, "Convergence of proportonal-far sharng algorthms under general condtons", IEEE Trans Wreless Commun, vol 3, no 4, pp , July 4 [1] P Vswanath, D N C Tse, R Laroa, Opportunstc beamformng usng dumb antennas, IEEE Trans Inform Theory, vol 48, no 6, pp , June [11] T Marzetta and B ochwald, "Fast transfer of channel state nformaton n wreless systems," submtted to IEEE Trans Sgnal Processng [also avalable on [1] G Prmolevo, O Smeone and U Spagnoln, "Effects of mperfect channel state nformaton on the capacty of broadcast OSDMA-MIMO systems", Proc IEEE SPAWC, 4 [13] G Golub and C F van Loan, Matrx Computatons, Johns opkns, 1996, 3rd edton /5/$ (C) 5 IEEE
Adaptive Modulation for Multiple Antenna Channels
Adaptve Modulaton for Multple Antenna Channels June Chul Roh and Bhaskar D. Rao Department of Electrcal and Computer Engneerng Unversty of Calforna, San Dego La Jolla, CA 993-7 E-mal: jroh@ece.ucsd.edu,
More informationPerformance Analysis of Multi User MIMO System with Block-Diagonalization Precoding Scheme
Performance Analyss of Mult User MIMO System wth Block-Dagonalzaton Precodng Scheme Yoon Hyun m and Jn Young m, wanwoon Unversty, Department of Electroncs Convergence Engneerng, Wolgye-Dong, Nowon-Gu,
More informationUplink User Selection Scheme for Multiuser MIMO Systems in a Multicell Environment
Uplnk User Selecton Scheme for Multuser MIMO Systems n a Multcell Envronment Byong Ok Lee School of Electrcal Engneerng and Computer Scence and INMC Seoul Natonal Unversty leebo@moble.snu.ac.kr Oh-Soon
More informationDesign Rules for Efficient Scheduling of Packet Data on Multiple Antenna Downlink
Desgn Rules for Effcent Schedulng of acet Data on Multple Antenna Downln Davd J. Mazzarese and Wtold A. rzyme Unversty of Alberta / TRLabs Edmonton, Alberta, Canada E-mal: djm@ ece.ualberta.ca / wa@ece.ualberta.ca
More informationOn Interference Alignment for Multi-hop MIMO Networks
013 Proceedngs IEEE INFOCOM On Interference Algnment for Mult-hop MIMO Networks Huacheng Zeng Y Sh Y. Thomas Hou Wenng Lou Sastry Kompella Scott F. Mdkff Vrgna Polytechnc Insttute and State Unversty, USA
More informationHUAWEI TECHNOLOGIES CO., LTD. Huawei Proprietary Page 1
Project Ttle Date Submtted IEEE 802.16 Broadband Wreless Access Workng Group Double-Stage DL MU-MIMO Scheme 2008-05-05 Source(s) Yang Tang, Young Hoon Kwon, Yajun Kou, Shahab Sanaye,
More informationBER Performance Analysis of Multiuser Diversity with Antenna Selection in MRC MIMO Systems
Performance Analyss of ultuser Dversty wth Antenna Selecton n RC IO Systems ohammad Torab 1, Davd Haccoun 1 and Wessam Ajb 2 1 Department of Electrcal Engneerng, École Polytechnque de ontréal, ontréal,
More informationComparative Analysis of Reuse 1 and 3 in Cellular Network Based On SIR Distribution and Rate
Comparatve Analyss of Reuse and 3 n ular Network Based On IR Dstrbuton and Rate Chandra Thapa M.Tech. II, DEC V College of Engneerng & Technology R.V.. Nagar, Chttoor-5727, A.P. Inda Emal: chandra2thapa@gmal.com
More informationParameter Free Iterative Decoding Metrics for Non-Coherent Orthogonal Modulation
1 Parameter Free Iteratve Decodng Metrcs for Non-Coherent Orthogonal Modulaton Albert Gullén Fàbregas and Alex Grant Abstract We study decoder metrcs suted for teratve decodng of non-coherently detected
More informationCalculation of the received voltage due to the radiation from multiple co-frequency sources
Rec. ITU-R SM.1271-0 1 RECOMMENDATION ITU-R SM.1271-0 * EFFICIENT SPECTRUM UTILIZATION USING PROBABILISTIC METHODS Rec. ITU-R SM.1271 (1997) The ITU Radocommuncaton Assembly, consderng a) that communcatons
More informationPerformance Study of OFDMA vs. OFDM/SDMA
Performance Study of OFDA vs. OFD/SDA Zhua Guo and Wenwu Zhu crosoft Research, Asa 3F, Beng Sgma Center, No. 49, Zhchun Road adan Dstrct, Beng 00080, P. R. Chna {zhguo, wwzhu}@mcrosoft.com Abstract: In
More informationDistributed Resource Allocation and Scheduling in OFDMA Wireless Networks
Southern Illnos Unversty Carbondale OpenSIUC Conference Proceedngs Department of Electrcal and Computer Engneerng 11-2006 Dstrbuted Resource Allocaton and Schedulng n OFDMA Wreless Networks Xangpng Qn
More informationOn Space-Frequency Water-Filling Precoding for Multi-User MIMO Communications
Proceedngs of the World ongress on Engneerng 05 Vol I WE 05, July - 3, 05, London, U.. On Space-Frequency Water-Fllng Precodng for Mult-User MIMO ommuncatons Yu-uan hang, Ye-Shun Shen, Fang-Bau Ueng and
More informationRejection of PSK Interference in DS-SS/PSK System Using Adaptive Transversal Filter with Conditional Response Recalculation
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol., No., November 23, 3-9 Rejecton of PSK Interference n DS-SS/PSK System Usng Adaptve Transversal Flter wth Condtonal Response Recalculaton Zorca Nkolć, Bojan
More informationDistributed Uplink Scheduling in EV-DO Rev. A Networks
Dstrbuted Uplnk Schedulng n EV-DO ev. A Networks Ashwn Srdharan (Sprnt Nextel) amesh Subbaraman, och Guérn (ESE, Unversty of Pennsylvana) Overvew of Problem Most modern wreless systems Delver hgh performance
More informationResource Allocation for Throughput Enhancement in Cellular Shared Relay Networks
Resource Allocaton for Throughput Enhancement n Cellular Shared Relay Networs Mohamed Fadel, Ahmed Hndy, Amr El-Key, Mohammed Nafe, O. Ozan Koyluoglu, Antona M. Tulno Wreless Intellgent Networs Center
More informationMIMO-OFDM Systems. Team Telecommunication and Computer Networks, FSSM, University Cadi Ayyad, P.O. Box 2390, Marrakech, Morocco.
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 8, Issue 3, ay 2011 ISSN (Onlne: 1694-0814 A Low-complexty Power and Bt Allocaton Algorthm for ultuser IO-OFD Systems Ayad Habb 1, Khald El Baamran
More informationErgodic Capacity of Block-Fading Gaussian Broadcast and Multi-access Channels for Single-User-Selection and Constant-Power
7th European Sgnal Processng Conference EUSIPCO 29 Glasgow, Scotland, August 24-28, 29 Ergodc Capacty of Block-Fadng Gaussan Broadcast and Mult-access Channels for Sngle-User-Selecton and Constant-Power
More informationA new family of linear dispersion code for fast sphere decoding. Creative Commons: Attribution 3.0 Hong Kong License
tle A new famly of lnear dsperson code for fast sphere decodng Author(s) Da, XG; Cheung, SW; Yuk, I Ctaton he nd IEEE Canadan Conference on Electrcal and Computer Engneerng (CCECE 009), St. John's, L.,
More informationDistributed user selection scheme for uplink multiuser MIMO systems in a multicell environment
Lee et al. EURASIP Journal on Wreless Communcatons and Networkng 212, 212:22 http://s.euraspournals.com/content/212/1/22 RESEARCH Dstrbuted user selecton scheme for uplnk multuser MIMO systems n a multcell
More informationA NSGA-II algorithm to solve a bi-objective optimization of the redundancy allocation problem for series-parallel systems
0 nd Internatonal Conference on Industral Technology and Management (ICITM 0) IPCSIT vol. 49 (0) (0) IACSIT Press, Sngapore DOI: 0.776/IPCSIT.0.V49.8 A NSGA-II algorthm to solve a b-obectve optmzaton of
More informationOpportunistic Interference Alignment with 1-Bit Feedback in 3-Cell Interference Channels
Opportunstc Interference Algnment wth -Bt Feedbac n 3-Cell Interference Channels Zhnan Xu, Mngmng Gan, Thomas Zemen,2 FTW (Telecommuncatons Research Center Venna), Venna, Austra 2 AIT Austran Insttute
More informationNOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION
NOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION Phaneendra R.Venkata, Nathan A. Goodman Department of Electrcal and Computer Engneerng, Unversty of Arzona, 30 E. Speedway Blvd, Tucson, Arzona
More informationEffective SNR Based MIMO Switching in Mobile WiMAX Systems
Effectve SNR Based MIMO Swtcng n Moble WMAX Systems Myoung-Seob Km and Yong-wan Lee Scool of Electrcal Engneerng and INMC, Seoul Natonal Unversty Kwanak P. O. Box, Seoul -600 Korea Emal: mseob@ttl.snu.ac.kr
More information4492 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 65, NO. 10, OCTOBER 2017
4492 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 65, NO. 10, OCTOBER 2017 OFDM-Based Interference Algnment n Sngle-Antenna Cellular Wreless Networks Huacheng Zeng, Member, IEEE, YSh,Senor Member, IEEE, Y.
More informationHow to Scale Up the Spectral Efficiency of Multi-way Massive MIMO Relaying?
ow to Scale Up the Spectral Effcency of Mult-way Massve MIMO Relayng? Chung Duc o, en Quoc Ngo, Mchal Matthaou, and Trung Q. Duong School of Electroncs, Electrcal Engneerng and Computer Scence, Queen s
More informationDefine Y = # of mobiles from M total mobiles that have an adequate link. Measure of average portion of mobiles allocated a link of adequate quality.
Wreless Communcatons Technologes 6::559 (Advanced Topcs n Communcatons) Lecture 5 (Aprl th ) and Lecture 6 (May st ) Instructor: Professor Narayan Mandayam Summarzed by: Steve Leung (leungs@ece.rutgers.edu)
More informationThe Stability Region of the Two-User Broadcast Channel
The Stablty Regon of the Two-User Broadcast Channel Nkolaos appas *, Maros Kountours, * Department of Scence and Technology, Lnköpng Unversty, Campus Norrköpng, 60 74, Sweden Mathematcal and Algorthmc
More informationThroughput Maximization by Adaptive Threshold Adjustment for AMC Systems
APSIPA ASC 2011 X an Throughput Maxmzaton by Adaptve Threshold Adjustment for AMC Systems We-Shun Lao and Hsuan-Jung Su Graduate Insttute of Communcaton Engneerng Department of Electrcal Engneerng Natonal
More informationA New Opportunistic Interference Alignment Scheme and Performance Comparison of MIMO Interference Alignment with Limited Feedback
A New Opportunstc Interference Algnment Scheme and Performance Comparson of MIMO Interference Algnment wth Lmted Feedback Johann Lethon, Chau Yuen, Hmal A. Suraweera and Hu Gao Sngapore Unversty of Technology
More informationIMPACT OF LIMITED FEEDBACK ON MIMO- OFDM SYSTEMS USING JOINT BEAMFORMING
IMPACT OF LIMITED FEEDBACK ON MIMO- OFDM SYSTEMS USING JOINT BEAMFORMING NAJOUA ACHOURA 1 AND RIDHA BOUALLEGUE 1 Department Natonal Engneerng School of Tuns, Tunsa najouaachoura@gmalcom SUP COM, 6 Tel
More informationA Spreading Sequence Allocation Procedure for MC-CDMA Transmission Systems
A Spreadng Sequence Allocaton Procedure for MC-CDMA Transmsson Systems Davd Motter, Damen Castelan Mtsubsh Electrc ITE 80, Avenue des Buttes de Coësmes, 35700 Rennes FRAE e-mal: {motter,castelan}@tcl.te.mee.com
More informationMultiband Jamming Strategies with Minimum Rate Constraints
Multband Jammng Strateges wth Mnmum Rate Constrants Karm Banawan, Sennur Ulukus, Peng Wang, and Bran Henz Department of Electrcal and Computer Engneerng, Unversty of Maryland, College Park, MD 7 US Army
More informationFull-duplex Relaying for D2D Communication in mmwave based 5G Networks
Full-duplex Relayng for D2D Communcaton n mmwave based 5G Networks Boang Ma Hamed Shah-Mansour Member IEEE and Vncent W.S. Wong Fellow IEEE Abstract Devce-to-devce D2D communcaton whch can offload data
More informationDynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University
Dynamc Optmzaton Assgnment 1 Sasanka Nagavall snagaval@andrew.cmu.edu 16-745 January 29, 213 Robotcs Insttute Carnege Mellon Unversty Table of Contents 1. Problem and Approach... 1 2. Optmzaton wthout
More informationCharacterization and Analysis of Multi-Hop Wireless MIMO Network Throughput
Characterzaton and Analyss of Mult-Hop Wreless MIMO Network Throughput Bechr Hamdaou EECS Dept., Unversty of Mchgan 226 Hayward Ave, Ann Arbor, Mchgan, USA hamdaou@eecs.umch.edu Kang G. Shn EECS Dept.,
More informationMulticarrier Modulation
Multcarrer Modulaton Wha Sook Jeon Moble Computng & Communcatons Lab Contents Concept of multcarrer modulaton Data transmsson over multple carrers Multcarrer modulaton wth overlappng Chap. subchannels
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 13, NO. 12, DECEMBER
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 3, NO. 2, DECEMBER 204 695 On Spatal Capacty of Wreless Ad Hoc Networks wth Threshold Based Schedulng Yue Lng Che, Student Member, IEEE, Ru Zhang, Member,
More informationDIGITAL multi-tone (DMT) modulation, also known as
26 IEEE Nnth Internatonal Symposum on Spread Spectrum Technques and Applcatons Improved Throughput over Wrelnes wth Adaptve MC-DS-CDMA Mattheu CRUSSIÈRE, Jean-Yves BAUDAIS and Jean-Franços HÉLARD Electroncs
More informationA study of turbo codes for multilevel modulations in Gaussian and mobile channels
A study of turbo codes for multlevel modulatons n Gaussan and moble channels Lamne Sylla and Paul Forter (sylla, forter)@gel.ulaval.ca Department of Electrcal and Computer Engneerng Laval Unversty, Ste-Foy,
More informationOptimum Ordering for Coded V-BLAST
Optmum Orderng for Coded V-BLAST Alan Urarte Toboso Thess submtted to the Faculty of Graduate and Postdoctoral Studes n partal fulfllment of the requrements for the degree of Master of Appled Scence n
More informationSuresh Babu, International Journal of Advanced Engineering Technology E-ISSN Int J Adv Engg Tech/Vol. VII/Issue I/Jan.-March.
Research Paper OPTIMUM POWR ALLOCATION AND SYMBOL RROR RAT (SR) PRFORMANC OF VARIOUS SPAC TIM BLOCK CODS (STBC) OVR FADING COGNITIV MIMO CHANNLS IN DIFFRNT WIRLSS NVIRONMNT R. Suresh Babu Address for Correspondence
More informationRelevance of Energy Efficiency Gain in Massive MIMO Wireless Network
Relevance of Energy Effcency Gan n Massve MIMO Wreless Network Ahmed Alzahran, Vjey Thayananthan, Muhammad Shuab Quresh Computer Scence Department, Faculty of Computng and Informaton Technology Kng Abdulazz
More informationMIMO Precoding Using Rotating Codebooks
1 MIMO Precodng Usng Rotatng Codebooks C Jang, M Wang, C Yang Abstract Next generaton wreless communcatons rely on multple nput multple output (MIMO) technques to acheve hgh data rates. eedback of channel
More informationRESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING
RESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING Vaslos A. Srs Insttute of Computer Scence (ICS), FORTH and Department of Computer Scence, Unversty of Crete P.O. Box 385, GR 7 Heraklon, Crete,
More informationApproximating User Distributions in WCDMA Networks Using 2-D Gaussian
CCCT 05: INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATIONS, AND CONTROL TECHNOLOGIES 1 Approxmatng User Dstrbutons n CDMA Networks Usng 2-D Gaussan Son NGUYEN and Robert AKL Department of Computer
More informationAntenna Selection for Space-Time Communication with Covariance Feedback
Antenna Selecton for Space-Tme Communcaton wth Covarance Feedback G.Barrac and U. Madhow School of Electrcal and Computer Engneerng Unversty of Calforna, Santa Barbara Santa Barbara, CA 93106 Emal: barrac@engneerng.ucsb.edu
More informationResource Control for Elastic Traffic in CDMA Networks
Resource Control for Elastc Traffc n CDMA Networks Vaslos A. Srs Insttute of Computer Scence, FORTH Crete, Greece vsrs@cs.forth.gr ACM MobCom 2002 Sep. 23-28, 2002, Atlanta, U.S.A. Funded n part by BTexact
More informationUnderstanding the Spike Algorithm
Understandng the Spke Algorthm Vctor Ejkhout and Robert van de Gejn May, ntroducton The parallel soluton of lnear systems has a long hstory, spannng both drect and teratve methods Whle drect methods exst
More informationA Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results
AMERICAN JOURNAL OF UNDERGRADUATE RESEARCH VOL. 1 NO. () A Comparson of Two Equvalent Real Formulatons for Complex-Valued Lnear Systems Part : Results Abnta Munankarmy and Mchael A. Heroux Department of
More informationApproximate Joint MAP Detection of Co-Channel Signals
Approxmate Jont MAP Detecton of Co-Channel Sgnals Danel J Jaubsn and R Mchael Buehrer Moble and Portable Rado Research Group (MPRG), Wreless@VT, Vrgna Tech, Blacsburg, Vrgna, USA E-mal: {djj,buehrer}@vtedu
More informationPerformance Analysis of Scheduling Policies for Delay-Tolerant Applications in Centralized Wireless Networks
Performance Analyss of Schedulng Polces for Delay-Tolerant Applcatons n Centralzed Wreless Networks Mohamed Shaqfeh and Norbert Goertz Insttute for Dgtal Communcatons Jont Research Insttute for Sgnal &
More informationScaling Up MIMO. with very large arrays] Thomas L. Marzetta, Ove Edfors, and Fredrik Tufvesson ]
Scalng Up MIMO dynamc graphcs [ Opportuntes and challenges wth very large arrays] [ Fredrk Rusek, Danel Persson, Buon ong Lau, Erk G Larsson, Thomas L Marzetta, Ove Edfors, and Fredrk Tufvesson ] Multple-nput
More informationDistributed Interference Alignment in Cognitive Radio Networks
Dstrbuted Interference Algnment n Cogntve Rado Networks Y Xu and Shwen Mao Department of Electrcal and Computer Engneerng, Auburn Unversty, Auburn, AL, USA Abstract In ths paper, we nvestgate the problem
More informationResource Allocation Optimization for Device-to- Device Communication Underlaying Cellular Networks
Resource Allocaton Optmzaton for Devce-to- Devce Communcaton Underlayng Cellular Networks Bn Wang, L Chen, Xaohang Chen, Xn Zhang, and Dacheng Yang Wreless Theores and Technologes (WT&T) Bejng Unversty
More informationPRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht
68 Internatonal Journal "Informaton Theores & Applcatons" Vol.11 PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION Evgeny Artyomov and Orly
More informationEnergy Efficiency Analysis of a Multichannel Wireless Access Protocol
Energy Effcency Analyss of a Multchannel Wreless Access Protocol A. Chockalngam y, Wepng u, Mchele Zorz, and Laurence B. Mlsten Department of Electrcal and Computer Engneerng, Unversty of Calforna, San
More informationDigital Transmission
Dgtal Transmsson Most modern communcaton systems are dgtal, meanng that the transmtted normaton sgnal carres bts and symbols rather than an analog sgnal. The eect o C/N rato ncrease or decrease on dgtal
More informationFUTURE wireless systems will need to provide high data
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL., NO. 1, JANUARY 7 9 Downlnk Performance and Capacty of Dstrbuted Antenna Systems n a Multcell Envronment Wan Cho, Student Member, IEEE, and Jeffrey G.
More informationFractional Base Station Cooperation Cellular Network
Fractonal Base Staton Cooperaton Cellular Network Naok usashma Tokyo Insttute of Technoloy, Department of Electrcal and Electronc Enneern, Arak-Sakauch Laboratores. Contents Backround Cell-ede problem
More informationDistributed and Optimal Reduced Primal-Dual Algorithm for Uplink OFDM Resource Allocation
Dstrbuted and Optmal Reduced Prmal-Dual Algorthm for Uplnk OFDM Resource Allocaton Xaoxn Zhang, Lang Chen, Janwe Huang, Mnghua Chen, and Yupng Zhao Abstract Orthogonal frequency dvson multplexng OFDM s
More informationTwo-Stage Detector for SC-FDMA Transmission over MIMO ISI Channels
Two-Stage Detector for SC-FDMA Transmsson over MIMO ISI Channels Marcel Jar Eml Matúš Esther Pérez-Adeva Eckhard Ohlmer and Gerhard Fettwes Vodafone Char Moble Communcaton Systems Technsche Unverstät Dresden
More informationUtility Maximization for Uplink MU-MIMO: Combining Spectral-Energy Efficiency and Fairness
EuCNC-MngtTech 79 7 8 9 7 8 9 7 8 9 7 8 9 7 8 9 7 Utlty Maxmzaton for Uplnk MU-MIMO: Combnng Spectral-Energy Effcency and Farness Le Deng, Wenje Zhang, Yun Ru, Yeo Cha Kat Department of Informaton Engneerng,
More informationCooperative Multicast Scheduling Scheme for IPTV Service over IEEE Networks
Cooperatve Multcast Schedulng Scheme for IPTV Servce over IEEE 802.16 Networks Fen Hou 1, Ln X. Ca 1, James She 1, Pn-Han Ho 1, Xuemn (Sherman Shen 1, and Junshan Zhang 2 Unversty of Waterloo, Waterloo,
More informationJoint Adaptive Modulation and Power Allocation in Cognitive Radio Networks
I. J. Communcatons, etwork and System Scences, 8, 3, 7-83 Publshed Onlne August 8 n ScRes (http://www.scrp.org/journal/jcns/). Jont Adaptve Modulaton and Power Allocaton n Cogntve Rado etworks Dong LI,
More informationSelective Sensing and Transmission for Multi-Channel Cognitive Radio Networks
IEEE INFOCOM 2 Workshop On Cogntve & Cooperatve Networks Selectve Sensng and Transmsson for Mult-Channel Cogntve Rado Networks You Xu, Yunzhou L, Yfe Zhao, Hongxng Zou and Athanasos V. Vaslakos Insttute
More informationPower Minimization Under Constant Throughput Constraint in Wireless Networks with Beamforming
Power Mnmzaton Under Constant Throughput Constrant n Wreless etworks wth Beamformng Zhu Han and K.J. Ray Lu, Electrcal and Computer Engneer Department, Unversty of Maryland, College Park. Abstract In mult-access
More informationAchieving Transparent Coexistence in a Multi-hop Secondary Network Through Distributed Computation
Achevng Transparent Coexstence n a Mult-hop econdary Network Through Dstrbuted Computaton Xu Yuan Y h Y. Thomas Hou Wenng Lou cott F. Mdkff astry Kompella Vrgna olytechnc Insttute and tate Unversty, UA
More informationThe Detection Algorithms Performance in BLAST Enhanced IEEE a WLAN Standard on Measured Channels. University of Bristol
The Detecton Algorthms Performance n BLAST Enhanced IEEE 802.11a WLAN Standard on Measured Channels Unversty of Brstol Robert Pechoc, Paul Fletcher, Andy Nx, Nshan Canagarajah and Joe McGeehan The Thrd
More informationFair scheduling and orthogonal linear precoding/decoding. in broadcast MIMO systems
Fair scheduling and orthogonal linear precoding/decoding in broadcast MIMO systems R Bosisio, G Primolevo, O Simeone and U Spagnolini Dip di Elettronica e Informazione, Politecnico di Milano Pzza L da
More informationFRACTIONAL SPATIAL REUSE PRECODING FOR MIMO DOWNLINK NETWORKS. Ahmed Medra and Timothy N. Davidson
FRACTIONAL SPATIAL REUSE PRECODING FOR MIMO DOWNLINK NETWORKS Ahmed Medra and Tmothy N. Davdson Department of Electrcal and Computer Engneerng McMaster Unversty, Hamlton, Ontaro, Canada ABSTRACT A lnear
More informationBit-interleaved Rectangular Parity-Check Coded Modulation with Iterative Demodulation In a Two-Node Distributed Array
Bt-nterleaved Rectangular Party-Check Coded Modulaton wth Iteratve Demodulaton In a Two-Node Dstrbuted Array Xn L, Tan F. Wong, and John M. Shea Wreless Informaton Networkng Group Department of Electrcal
More informationOptimal Transmission Scheduling of Cooperative Communications with A Full-duplex Relay
1 Optmal Transmsson Schedulng of Cooperatve Communcatons wth A Full-duplex Relay Peng L Member IEEE Song Guo Senor Member IEEE Wehua Zhuang Fellow IEEE Abstract Most exstng research studes n cooperatve
More informationA MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION
A MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION Vncent A. Nguyen Peng-Jun Wan Ophr Freder Computer Scence Department Illnos Insttute of Technology Chcago, Illnos vnguyen@t.edu,
More informationBit Error Probability of Cooperative Diversity for M-ary QAM OFDM-based system with Best Relay Selection
011 Internatonal Conerence on Inormaton and Electroncs Engneerng IPCSIT vol.6 (011) (011) IACSIT Press, Sngapore Bt Error Proalty o Cooperatve Dversty or M-ary QAM OFDM-ased system wth Best Relay Selecton
More informationOpportunistic Beamforming for Finite Horizon Multicast
Opportunstc Beamformng for Fnte Horzon Multcast Gek Hong Sm, Joerg Wdmer, and Balaj Rengarajan allyson.sm@mdea.org, joerg.wdmer@mdea.org, and balaj.rengarajan@gmal.com Insttute IMDEA Networks, Madrd, Span
More informationEE 508 Lecture 6. Degrees of Freedom The Approximation Problem
EE 508 Lecture 6 Degrees of Freedom The Approxmaton Problem Revew from Last Tme Desgn Strategy Theorem: A crcut wth transfer functon T(s) can be obtaned from a crcut wth normalzed transfer functon T n
More informationPerformance and Analysis of CDM-FH-OFDMA for Broadband Wireless Systems
Performance and Analyss of CDM-FH-OFDMA for Broadband Wreless Systems Kan Zheng, Lu Han, Janfeng Wang, and Wenbo Wang Wreless Sgnal Processng Lab, Bejng Unversty of Posts & Telecomms, Bejng, Chna zkan@buptneteducn
More informationIterative Water-filling for Load-balancing in
Iteratve Water-fllng for Load-balancng n Wreless LAN or Mcrocellular Networks Jeremy K. Chen Theodore S. Rappaport Gustavo de Vecana Wreless Networkng and Communcatons Group (WNCG), The Unversty of Texas
More informationROYAL INSTITUTE OF TECHNOLOGY KUNGL TEKNISKA HÖGSKOLAN. Department of Signals, Sensors & Systems Signal Processing S STOCKHOLM
A Comparson of Two Systems for Down Lnk Communcaton wth Antenna Arrays at the Base Per Zetterberg 95{1{1 In: IEEE Wreless Communcaton Systems Symposum, 1995 IR{S3{SB{9522 ROYAL INSTITUTE OF TECHNOLOGY
More informationAutonomous Dynamic Spectrum Management for Coexistence of Multiple Cognitive Tactical Radio Networks
Autonomous Dynamc Spectrum Management for Coexstence of Multple Cogntve Tactcal Rado Networks Vncent Le Nr, Bart Scheers Abstract In ths paper, dynamc spectrum management s studed for multple cogntve tactcal
More informationWalsh Function Based Synthesis Method of PWM Pattern for Full-Bridge Inverter
Walsh Functon Based Synthess Method of PWM Pattern for Full-Brdge Inverter Sej Kondo and Krt Choesa Nagaoka Unversty of Technology 63-, Kamtomoka-cho, Nagaoka 9-, JAPAN Fax: +8-58-7-95, Phone: +8-58-7-957
More informationKeywords LTE, Uplink, Power Control, Fractional Power Control.
Volume 3, Issue 6, June 2013 ISSN: 2277 128X Internatonal Journal of Advanced Research n Computer Scence and Software Engneerng Research Paper Avalable onlne at: www.jarcsse.com Uplnk Power Control Schemes
More informationPower Allocation in Wireless Relay Networks: A Geometric Programming-Based Approach
ower Allocaton n Wreless Relay Networks: A Geometrc rogrammng-based Approach Khoa T. han, Tho Le-Ngoc, Sergy A. Vorobyov, and Chntha Telambura Department of Electrcal and Computer Engneerng, Unversty of
More informationPerformance Analysis and Optimization of DCT-Based Multicarrier System on Frequency-Selective Fading Channels
Receved January 3, 018, accepted February 1, 018, date of publcaton February 14, 018, date of current verson March 19, 018. Dgtal Object Identfer 10.1109/ACCESS.018.806318 Performance Analyss and Optmzaton
More informationSpace Time Equalization-space time codes System Model for STCM
Space Tme Eualzaton-space tme codes System Model for STCM The system under consderaton conssts of ST encoder, fadng channel model wth AWGN, two transmt antennas, one receve antenna, Vterb eualzer wth deal
More informationGraph Method for Solving Switched Capacitors Circuits
Recent Advances n rcuts, ystems, gnal and Telecommuncatons Graph Method for olvng wtched apactors rcuts BHUMIL BRTNÍ Department of lectroncs and Informatcs ollege of Polytechncs Jhlava Tolstého 6, 586
More informationA NOVEL PREAMBLE DESIGN FOR CHANNEL ESTIMATION IN MIMO- OFDM SYSTEMS RESULTING IN ENHANCED THROUGHPUT
Volume 53, umber 3, 01 ACTA TECHICA APOCESIS Electroncs and Telecommuncatons A OVEL PREAMBLE DESIG FOR CHAEL ESTIMATIO I MIMO- OFDM SYSTEMS RESULTIG I EHACED THROUGHPUT Shakeel Salamat ULLAH atonal Unversty
More informationPower Control for Full-Duplex Relay-Enhanced Cellular Networks With QoS Guarantees
SPECIAL SECTION ON FUTURE NETWORKS: ARCHITECTURES, PROTOCOLS, AND APPLICATIONS Receved January 9, 07, accepted February, 07, date of publcaton March 5, 07, date of current verson Aprl 4, 07. Dgtal Object
More informationPerformance Evaluation of Layer Adaptive Multi-User Scheduling in LTE-A Downlink
01 7th Internatonal ICST Conference on Communcatons and Networng n Chna (CHINACOM) Performance Evaluaton of Layer Adaptve Mult-User Schedulng n LTE-A Downln L Zhang, Sov Peter, Chunye Wang Chna Industral
More informationPower Allocation in Wireless Multi-User Relay Networks
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL 8, NO 5, MAY 2009 2535 Power Allocaton n Wreless Mult-User Relay Networks Khoa T Phan, Student Member, IEEE, Tho Le-Ngoc, Fellow, IEEE, Sergy A Vorobyov,
More informationAN EFFICIENT ITERATIVE DFT-BASED CHANNEL ESTIMATION FOR MIMO-OFDM SYSTEMS ON MULTIPATH CHANNELS
AN FFICINT ITRATIV DFT-BASD CHANNL STIMATION FOR MIMO-OFDM SYSTMS ON MULTIPATH CHANNLS Jan Hafang Graduate Unversty of the Chnese Academy of Scences Insttute of Semconductors, CAS Beng, Chna hf@sem.ac.cn
More informationA Unified Cross-Layer Framework for Resource Allocation in Cooperative Networks
3000 IEEE TRNSCTIONS ON WIRELESS COMMUNICTIONS, VOL. 7, NO. 8, UGUST 2008 Unfed Cross-Layer Framework for Resource llocaton n Cooperatve Networks We Chen, Member, IEEE, Ln Da, Member, IEEE, Khaled Ben
More informationMaximizing Lifetime of Sensor-Target Surveillance in Wireless Sensor Networks
Maxmzng Lfetme of Sensor-Target Survellance n Wreless Sensor Networks Ha Lu, Xaowen Chu, Yu-Wng Leung Computer Scence, Hong Kong Baptst Unversty Xaohua Ja, Peng-Jun Wan Computer Scence, Cty Unversty of
More informationSubcarrier allocation for OFDMA wireless channels using lagrangian relaxation methods
Unversty of Wollongong Research Onlne Faculty of Informatcs - Papers (Archve) Faculty of Engneerng and Informaton Scences 2006 Subcarrer allocaton for OFDMA wreless channels usng lagrangan relaxaton methods
More informationJoint iterative beamforming and power adaptation for MIMO ad hoc networks
RESEARCH Open Access Jont teratve beamformng and power adaptaton for MIMO ad hoc networks Engn Zeydan *, Ddem Kvanc 2, Ufuk Turel 2 and Crstna Comancu Abstract In ths paper, we present dstrbuted cooperatve
More informationResource Allocation for Transmit Hybrid Beamforming in Decoupled Millimeter Wave Multiuser-MIMO Downlink
Receved November 1, 2016, accepted November 23, 2016, date of publcaton December 2, 2016, date of current verson February 25, 2017. Dgtal Object Identfer 10.1109/ACCESS.2016.2634096 Resource Allocaton
More informationBlock Diagonal Precoding Based Power Allocation for Coordinated Multi-Point Transmission
54 JOUAL OF COMMUICAIOS, VOL 6, O 7, OCOBE 0 Bloc Dagonal recodng Based ower Allocaton for Coordnated Mult-ont ransmsson Jng Han Broadband Wreless Communcatons and Multmeda Laboratory, Key Laboratory of
More informationThe Performance Improvement of BASK System for Giga-Bit MODEM Using the Fuzzy System
Int. J. Communcatons, Network and System Scences, 10, 3, 1-5 do:10.36/jcns.10.358 Publshed Onlne May 10 (http://www.scrp.org/journal/jcns/) The Performance Improvement of BASK System for Gga-Bt MODEM Usng
More informationOn Sensor Fusion in the Presence of Packet-dropping Communication Channels
On Sensor Fuson n the Presence of Packet-droppng Communcaton Channels Vjay Gupta, Babak Hassb, Rchard M Murray Abstract In ths paper we look at the problem of multsensor data fuson when data s beng communcated
More information