Capacity bounds on multi-pair two-way communication with a base-station aided by a relay
|
|
- Garey Farmer
- 5 years ago
- Views:
Transcription
1 1 Capacty bounds on mult-par two-way communcaton wth a base-staton aded by a relay ang Joon Km, Besma mda, and Natasha Devroye Abstract The mult-par b-drectonal relay network under consderaton conssts of one base-staton, multple (say m) termnal nodes and one relay, all of whch are half-duplex, n whch, contrary to pror work, each node has a drect lnk wth every other node. Each of the m termnal nodes exchanges messages wth the base-staton n a b-drectonal fashon, leadng to 2m total messages to be communcated wth the (possble) help of the relay. Our contrbutons are: 1) the ntroducton of three new temporal protocols whch fully explot the two-way nature of the data, over-heard sde-nformaton through network codng, random bnnng, and compress-and-forward termnal node cooperaton, 2) dervatons of achevable rate regons and 3) cut-set based outer bounds for the mult-par network, and 4) a numercal evaluaton of the derved regons n Gaussan nose whch llustrate the performance of the proposed protocols. Index Terms b-drectonal relayng, decode and forward, mult-par, bnnng I. INTRODUCTION The smplest b-drectonal relay network conssts of a par of termnal nodes that wsh to exchange messages through the use of a sngle relay. Whle the capacty of ths channel s stll unknown n general, t has been of great recent nterest (see references n [1] and [2]) due to ts relevance n future wreless networks. The sngle relay, sngle par bdrectonal relay channel has been extended n a number of ways: 1) the consderaton of a sngle b-drectonal lnk usng multple relays [3] [7], and 2) the consderaton of multple b-drectonal lnks sharng a sngle, common relay [8] [11]. The relay network consdered n ths paper falls nto the second category and conssts of a base staton (node ) whch wshes to communcate smultaneously n a b-drectonal fashon wth multple termnal nodes (node 1,, node m) wth the help of one relay node (node r). Due to lmtatons of current technology, all nodes are assumed to be half-duplex and thus cannot transmt and receve smultaneously. Ths network topology s motvated by recent pushes to extend the coverage, relablty and/or data rates of wreless networks. For example, n a cellular scenaro, a relay staton s able to enhance the connectvty between a base staton and termnals at ts cell boundary. The relays may be connected to the base staton usng a wreless lnk rather than a wred one, resultng n savngs to the operators backhaul costs. Another motvatng ang Joon Km was wth the chool of Engneerng and Appled cences, Harvard Unversty, Cambrdge, MA Emal: sangkm@post.harvard.edu. Besma mda s wth the Department of Electrcal and Computer Engneerng, Purdue Unversty Calumet, Hammond, IN E-mal: Besma.mda@calumet.purdue.edu. Natasha Devroye s wth the Department of Electrcal and Computer Engneerng, Unversty of Illnos at Chcago, Chcago, IL 667. Emal: devroye@ece.uc.edu. example s satellte communcaton: satelltes can be used to relay sgnals from one ground staton to multple vehcular termnals on or close to the earth s surface. In ths work, we determne bounds on the capacty regons - whch may serve as gudes and benchmarks n the desgn of - such mult-par twoway communcaton networks aded by a sngle relay node. A. Related work In [8] a network n whch K half-duplex source/destnaton pars wsh to exchange messages n a b-drectonal fashon through a sngle mult-antenna relay s nvestgated from a dversty-multplexng gan perspectve. The authors of [9] consder a smlar channel model and propose the use of a CDMA strategy to support multple level Qo to dfferent users. In [1] multple b-drectonal pars communcate over a shared relay n the absence of a drect lnk between end nodes, where, n Gaussan nose, a carefully constructed superposton scheme of random and lattce codes was used. Fnally, n [11], an arbtrary number of clusters (nodes wthn a cluster all wsh to exchange messages) of arbtrary numbers of fullduplex nodes are assumed to communcate smultaneously through the use of a sngle relay n AWGN. In all four examples of mult-par b-drectonal communcaton wth a sngle relay, no drect lnk between the termnal nodes s assumed to exst, smplfyng the analyss as the tradeoff between relayed and drectly communcaton nformaton s avoded; no over-heard sde nformaton, or termnal node cooperaton s consdered. B. Our contrbutons We consder one base staton, multple termnal nodes and one relay, whch operate n half-duplex mode and have drect lnks to each other, as shown n Fg. 1. The desred bdrectonal lnks may be deduced from the ncluded messages W,j from node destned to node j, and W,j the estmate at node j of the message W.j. The base-staton s denoted as node wth ndex. Three elements of the formulated problem are markedly dfferent from pror nformaton theoretc work n ths area: 1) the assumpton that one end of the b-drectonal lnks s a sngle base-staton rather than ndependent nodes. 2) fully connected network - our nodes can all hear each other. Ths allows for the possblty of causal cooperaton between nodes as well as drect transmsson between the base-staton and the nodes, usng the relay only when benefcal. 3) n contrast to [1], [11], our nodes are half-duplex.
2 2 W2, W,2 W1, W,1 user 2 user 1 W3, W,3 Relay Basestaton W,1 user 3 Compress-and-Forward cooperaton between end users W1, W,2 W2, W,3 W3, Fg. 1. Our physcal channel model conssts of multple ndependent bdrectonal desred communcaton flows (message W, and W, wsh to be exchanged) between multple termnal nodes and a sngle base-staton. Communcatons may be aded usng one relay node. W,j s the estmate at node j of the message W,j. Our central contrbutons are: We propose three temporal protocols whch we call the FMABC (Full Multple Access ), PMABC (Partal Multple Access ) and FTDBC (Full Tme Dvson ) protocols. We determne nner bounds on the capacty regon of the mult-par b-drectonal relay network. Key elements of the schemes employed to do so nclude the use of multuser protocols n whch more than one termnal may be transmttng/recevng at one tme as n MAC and BC channels, random bnnng to explot over-heard sde-nformaton when the protocol permts, and the use of a flow-by-flow network codng strategy whch explots the two-way nature of data flows - all of whch wll be detaled n ecton III. We derve achevable rate regons where cooperaton between end users s enabled. Ths s possble n protocols n whch certan nodes over-hear other nodes transmssons. To the best of the authors knowledge, ths s the frst consderaton of cooperaton between end-users n a mult-par b-drectonal channel. In ths work, we consder a Compressand-Forward-based causal cooperaton scheme [12], selected due to the rough ntuton that CF outperforms for example DF-based cooperaton/relayng when the helpng node s close to the fnal destnaton, whch s expected to be one of the scenaros of practcal nterest. We present modfed cut-set-based outer bounds on the capacty regon of ths network. We note that due to lack of space, the statements and proofs of many of these results are omtted, but may be found at [2]. II. NOTATION AND DEFINITION We consder a base staton (node ), a set of termnal nodes B := {1, 2,, m and a relay r whch ads n the communcaton between the termnal nodes and the base staton. We defne M := B { = {, 1, 2,, m. We use R,j to denote the rate of communcaton from node to node j,.e. the message between node and node j, W,j, les n the set,j := {,..., 2 nr,j 1. mlarly, R,T s the sum of rates from set to set T where, T M at whch the messages W,T := {W,j, j T,, T M may be relably communcated. We assume that each end user communcates wth the base staton b-drectonally and that no nformaton s drectly exchanged between end users:.e. every par of termnal nodes and [1, m] wshes to exchange ndependent messages whle R,j = (or s undefned) for all, j B. Thus, there are a total of 2m messages n our network: m from node to each node B, and m from each node B to node, as shown n Fg. 1. Communcaton takes place over a number of channel uses, n and rates are acheved n the classcal asymptotc sense as n [1]. Node has nput alphabet X = X { and channel output alphabet Y = Y {, whch are related through a dscrete memoryless channel 1. Lower case letters x denote nstances of the upper case X whch le n the callgraphc alphabets X. Boldface x represents a vector ndexed by tme at node. Fnally, t s convenent to denote by x := {x, a set of vectors ndexed by tme, and as the cartesan product,.e., 3 =1 X = X 1 X 2 X 3. Durng phase l we use X (l) to denote the nput dstrbuton to denote the dstrbuton of the receved sgnal of node, and we use the dummy symbol to denote that there s no nput or no output at a partcular node durng a partcular phase.,n s the phase duraton of phase wth block sze n and s the phase duraton of phase when n. It and Y (l) s also convenent to defne X (l) := {X(l), a set of nput dstrbutons durng phase l. For a block length n, encoders and decoders are functons X k(w {,M, Y 1,, Y k 1 ) producng an encoded message at node, and W,j (Yj 1,, Y j n, W {j,m) producng a decoded message or error at node j when t wshes to decode the message W,j from node. Let (j) := { < j,. III. PROTOCOL FOR A MULTI-PAIR BI-DIRECTIONAL RELAY NETWORK The total transmsson tme s dvded nto two tme perods, each of whch may consst of one or more phases. Durng the frst multple access perod, the termnal nodes transmt to the relay. Durng the second broadcast perod the relay transmts to the termnal nodes. We consder three transmsson schemes for the multple-access perod: 1) Full Multple Access (FMABC) protocol: all termnal nodes transmt for the whole duraton, 2) Partal Multple Access (PMABC) protocol: uses the whole duraton and the other termnal nodes 1,, m transmt sequentally, and 3) Full Tme Dvson (FTDBC) protocol: all nodes transmt sequentally, as shown n Fg. 2. For comparson purposes n our smulatons, we also ntroduce what we call the smplest sequental protocol where all termnal nodes sequentally transmt nformaton to the relay,.e., r, 1 r,, m r, then the relay sequentally transmts them to the proper destnatons,.e., r, r 1,, r m. The FMABC, PMABC and FTDBC protocols descrbe the temporal phases or perods of the transmsson scheme but 1 Extensons to Gaussan nose channels wll be addressed n ecton V.
3 3 Node number Phase 1 Phase 2 Phase 1 Phase 2Phase 3 Tme Phase 1 Phase 2 Phase m Phase m+1 Phase m+1 Phase m+2 Multpleaccess perod perod Multpleaccess perod perod Multpleaccess perod perod Fg. 2. Three proposed half-duplex protocols - the tme phases of the dfferent protocols are seen; the encoders and decoders n the dfferent phases may vary. not what each node sends, or how ts messages are encoded durng those phases. The central techncal concepts employed n dervng achevable rate regons are: 1) Extended Marton s regon for broadcastng: Due to the presence of a base-staton wth multple messages (one to each of the termnal nodes), and a relay wth multple decoded messages (travelng to multple end users and the base-staton), we use a modfed verson of a generalzaton of Marton s broadcastng scheme [13] to > 2 messages/users, whch takes nto account own-message sde-nformaton at each node. A full statement of ths generalzaton may be found n [2]. 2) Network Codng: Network codng on a flow-by-flow (each flow conssts of two b-drectonal messages W, and W, ) bass s used at the relay r, whch decodes {w, and {w,, at the end of the multple access perod, and constructs w r = w, w,, B. Next, the decode-and-forward (DF) relay r constructs w r = (w r1, w r2,, w rm ) and broadcasts x r (w r ) durng the broadcast perod. 3) Random bnnng: Random bnnng s further used to explot over-heard sgnals from the drect lnks n the PMABC and FTDBC protocols. We apply random bnnng to combne, at an end user, the nformaton receved along from the drect lnk, and that receved along the relayng lnk. For example, n the PMABC protocol, node 1 uses m ndependent jontly typcal decoders wth sequences (x (2) (w,1, w {,B\{1 ),y (2) 1 ),, (x(m+1) r (w,1 w 1,, w r2,, w rm ),y (m+1) 1 ), thereby explotng the receved sgnals y (2) 1,,y(m+1) 1 overheard n phases 2, 3, (m+1) to decode w,1. 4) Cooperaton: Over-heard transmssons receved at a termnal node when t s not transmttng may be used to allow them to cooperate n decodng the messages W, for B. Cooperaton s enabled through a compress and forward strategy n whch each termnal node n B compresses the sgnals receved durng the relay broadcast perod usng an auxlary message set, whch t then transmts durng the next multple access perod. If other nodes can decode ths auxlary message, they are able to obtan the compressed receved sgnals whch n turn may be used to decode messages from the relay. We note that not all nodes need to cooperate or compress the receved sgnals - our results allow for any subset of the termnal nodes n B to cooperate. IV. ACHIEVABLE RATE REGION AND OUTER BOUND The achevable rate regons for the smplest, and the FMABC, PMABC, FTDBC wthout any network codng or bnnng, along wth the much more nvolved PMABC-NRC and FTDBC-NRC schemes wth cooperaton (the last C stands for cooperaton) are omtted due to space constrants but may all be found n [2], avalable onlne. Instead, we present the core achevable rate regons for the FMABC-N, PMABC- NR, and FTDBC-NR protocols, where N stands for Network codng and R stands for Random bnnng, whch explot the two-way nature of the data and over-heard sde nformaton whch s possble when a node s not transmttng. All regons are frst presented for dscrete memoryless channels and wll be evaluated n Gaussan nose n the followng secton. A. FMABC-N Protocol We consder the FMABC protocol n whch Network codng s employed at the relay to combne messages on a flowby-flow bass -.e. the message from node to node and vce-versa are combned at the relay. The U varables are the auxlary random varables playng a role smlar to those n Marton s regon [13] and ts > 2 user extenson n [2]. Theorem 1: An achevable rate regon of the mult-par half-duplex b-drectonal relay network under the FMABC- N protocol wth decode and forward relayng s the closure of the set of all ponts (R,b, R b, ) for all b B satsfyng R,M < 1 I(X (1) ; Y (1) R {,T < T r X (1), Q) (1) 2 I(U (2) ; Y (2) ) 2 I(U (2) ; U (2) T() ) (2) R T,{ < 2 I(U (2) T ; Y (2), U (2) T ) (3) for M and T B over all jont dstrbutons p(q) m = p(1) (x q)p (2) (u 1,, u m, x r ), where U j s are the auxlary random varables, and Q 2 m+1 1 over the alphabet m = X m j=1 U j X r Q. We note that for the FMABC random-bnnng to explot over-heard nformaton s mpossble as there s no overheard sde nformaton: durng each phase every node s ether transmttng or recevng - none are just lstenng. Under the PMABC and FTDBC protocols however, sde-nformaton may be exploted usng random bnnng, as descrbed next.
4 4 B. PMABC-NR Protocol We now consder the PMABC protocol n whch Network codng s employed at the relay to combne messages on a flow-by-flow bass, along wth Random Bnnng at the basestaton node to allow the end-nodes to explot nformaton over-heard n the phases durng whch they are not transmttng. In the followng theorem, the U varables are the auxlary random varables smlar to those seen n Marton s BC-channel regon [13] and ts extenson [2], whle V are auxlary random varables used for bnnng the message W, at the base-staton node for node. We note that bnnng s only possble at the base-staton for the end-users as n the PMABC protocol the base-staton s always transmttng durng the multple-access perod. Theorem 2: An achevable rate regon of the mult-par half-duplex b-drectonal relay network under the PMABC- NR protocol s the closure of the set of all ponts (R,b, R b, ) for all b B satsfyng R {,T + R,{ < X s si(v (s) T, X(s) s ; Y (s) r, V (s) Q) T + X si(v (s) T ; Y r (s), V (s) X(s) T s, Q) (4) s R {, < X mx ji(v (j) ; Y (j) Q) ji(v (j) ; V (j) Q) () j=1 + m+1i(u (m+1) ; Y (m+1) ) m+1i(u (m+1) ; U (m+1) ) (5) () R,{ < m+1i(u (m+1) ; Y (m+1), U (m+1) ) (6) for all B and, T B over all jont dstrbutons p(q) [ m =1 p() (v 1,, v m, x q)p () (x q) ] p (m+1) (u 1,, u m, x r ), where V j are the Random bnnng auxlary random varables at node, U j s are the auxlary Marton-lke random varables used at node r and V T := {V s s T wth Q 2 2m + 2 m over the alphabet m = X m j=1 (V j U j ) X r Q. Equaton (4) ensures correct decodng at the relay, (5) ensures correct combnng of overheard and relayed messages at the end users, whle (6) ensures correct decodng at the base-staton of the messages relayed (no sde-nformaton). C. FTDBC-NR Protocol The U and V varables have the same nterpretaton as n Theorem 2. Theorem 3: An achevable rate regon of the mult-par half-duplex b-drectonal relay network under the FTDBC- NR protocol s the closure of the set of all ponts (R,b, R b, ) for all b B satsfyng R {, < 1I(V (1) ; Y r (1), V (1) ) (7) R, < +1I(X (+1) ; Y r (+1) ) (8) R {, < X 1I(V (1) ; Y (1) ) 1I(V (1) ; V (1) ) () + m+2i(u (m+2) R,{ < X ; Y (m+2) +1I(X (+1) ; Y (+1) ) ) m+2i(u (m+2) ; U (m+2) () ) (9) + m+2i(u (m+2) ; Y (m+2), U (m+2) ) (1) for all B and ( B over all jont dstrbutons m ) p (1) (v 1,, v m, x ) j=1 p(j+1) (x j ) p (m+2) (u 1,, u m, x r ), where V j, U j s are the auxlary random varables and V T := {V s s T over the alphabet m = X m j=1 (V j U j ) X r. Remark 4: (7) and (8) correspond to the transmssons from M to the relay r, whle (9) (1) correspond to the relay broadcast phase. D. Compress-and-Forward based termnal node cooperaton The achevable rate regons for the PMABC-NRC and FTDBC-NRC protocols, where the C stands for Cooperaton are omtted due to space lmtatons but are avalable n [2] onlne. Note that due to the half-duplex constrant FMABC- NR and FMABC-NRC regons are not possble. E. Outer bounds The FMABC, PMABC and FTDBC outer bounds are obtaned by applyng the cut-set bound lemma talored to halfduplex mult-phase protocols frst derved n [1] to the dfferent protocols, where the cuts wll look dfferent dependng on what nodes are permtted to transmt durng each phase. The bounds are omtted for brevty and may be found n [2]. V. NUMERICAL ANALYI We assume an addtve whte Gaussan nose (AWGN) channel model, assume Gaussan nput dstrbutons for the achevablty schemes, whch may or may not be optmal, and evaluate the mutual nformaton terms. The correspondng mathematcal channel model s, for each channel use k : Y[k] = HX[k] + Z[k] where Y[k], X[k] and Z[k] are ndependent, of unt power, addtve, whte Gaussan, complex and crcularly symmetrc, and H C (m+2) (m+2) relate the vector channel nputs and output, whch are placed n the order, 1, 2, m, r. In phase l, f node s n transmsson mode X [k] follows the nput dstrbuton X (l) CN(, P ). Otherwse, X [k] =, whch means that the nput symbol does not exst n the above mathematcal channel model. We assume full CI. We use the followng channel gan matrx for m = 2 case: H = (11) Frst, n Fg. 3, we examne the effect of usng Marton bnnng and Network codng and compare ther performance to the smplest protocol by plottng three achevable rate regons; 1) the smplest protocol (mple), 2) convex hull of the FMABC, PMABC and FTDBC protocols (MB) and 3) convex hull of the FMABC-N, PMABC-NR and FTDBC-NR protocols (MB- NR). We set P = P 1 = P 2 = P r = db. For more realstc comparson, we add lower lmts of ndvdual data rates,.e., R,1.1, R,2.1, R 1,.1, R 2,.1 to guarantee mnmum nformaton flow n each data lnk. Wthout ths lmtaton, the sum-data rate wll be maxmzed when both
5 5.5 R B,{ mple MB MB NR R B,{ IN OUT FMABC PMABC FTDBC R, PMABC FTDBC NR NRC OUT R {,B R {,B R 1, Fg. 3. Effect of Marton bnnng, per-flow Network codng and Random bnnng. P = P 1 = P 2 = P r = db. Fg. 4. Overall regon comparson - no cooperaton. P = P 1 = P 2 = P r = db. Fg. 5. Effect of cooperaton. P = P 1 = P 2 = P r = db, and R,1 =.19, R 2, =.1. the transmsson rates R,2 and R 2, equal zero at least n the mplest case because the lnk between the relay and the node 2 s very poor. We see that the proposed protocols usng conventonal MAC and extended Martons broadcastng largely enhance the performance over straghtforward extensons of one-way protocols. Furthermore, we can sgnfcantly mprove the achevable rate regon by Network codng and Random bnnng schemes (n MB-NR). We emphasze that the ncluson mple MB MB-NR s not affected by the mnmum rate constrants. The achevable regons of the FMABC-N, PMABC-NR and FTDBC-NR protocols are plotted n Fg. 4 and compared to our modfed cut-set based outer bounds. The 4-dmensonal rate regons n (R,1, R,2, R 1,, R 2, ) are projected onto (R,1 + R,2, R 1, + R 2, ) 2-dmensonal space. Whle space constrants do not allow the presentaton of these plots under dfferent channel condtons and NRs, as seen n our extended work [2], one man conclusons drawn from plottng varous regons of the type seen n Fg. 4 s that dfferent protocols are optmal under dfferent channel condtons - no ncluson relatonshps appear to exst. In the low NR regme, the FMABC-N protocol outperforms the other protocols snce the amount of both sde nformaton and multple access nterference s relatvely small. However, n the hgh NR regme the FTDBC-NR protocol becomes the best snce t explots sde nformaton more effectvely. Under asymmetrc NR condtons (f we allow larger nput power for the base staton (node ) and relay (node r)) the PMABC-NR protocol outperforms the other two protocols; see [2]. To show the cooperaton codng gan, we plot the achevable rate regon of the dfferent protocols wth and wthout cooperaton. In Fg. 5, we fxed the data rates (R,1, R 2, ) to the rate par ((.19,.1) and plot rate regons n the (R 1,, R,2 ) doman. We do ths to hghlght the cooperaton gan, whch comes from re-allocatng node 1 s transmsson resources (.e. relatve power) to the two nformaton flows; 1 r (R 1, ) and 1 2 (R,2 ). As expected -NRC protocols acheve much better performance than -NR protocols. Notably, the cooperaton protocols mprove R,2 wthout any degradaton of R 1, n the FTDBC protocol. In contrast, the maxmum R 1, of the PMABC-NRC protocol s less than that of ts PMABC-NR only protocol. We explan ths by the fact that n our achevable rate regon, we used a smplfed and sub-optmal (successve decodng lke) recever n the PMABC-NRC protocol nstead of usng a fully general jont-decoder (as s done n the smpler PMABC-NR protocol), whch lmts the R 1,. If we were to enhance the PMABC-NRC scheme by usng the general jont decoder, the maxmum R 1, would be reached and the overall performance would mprove - a techncally challengng task left for future work. We furthermore expect the gans of cooperaton to ncrease f many more termnal nodes are able to explot node 1 s cooperatve broadcastng; however these stuatons wth current regons are too complex to be evaluated numercally. REFERENCE [1]. J. Km, P. Mtran, and V. Tarokh, Performance bounds for bdrectonal coded cooperaton protocols, IEEE Trans. Inf. Theory, vol. 54, no. 11, pp , Nov. 28. [2]. Km, B. mda, and N. Devroye, Achevable rate regons and outer bounds for a mult-par b-drectonal relay network, January, 21, posted on ArXv, short versons also at devroye/conferences.html. [3]. J. Km, N. Devroye, and V. Tarokh, B-drectonal half-duplex protocols wth multple relays, ubmtted to IEEE Trans. Inform. Theory, 27, [4] T. J. Oechterng and H. Boche, Bdrectonal Regeneratve Halfduplex Relayng usng Relay electon, IEEE Transactons on Wreless Communcatons, vol. 7, no. 5, pp , May 28. [5]. Km, N. Devroye, and V. Tarokh, A class of b-drectonal multrelay protocols, n Proc. IEEE Int. ymp. Inform. Theory, eoul, Jun. 29, pp [6] J. Poonah and L.-L. Xe, An achevable rate regon for the two-way two-relay channel, n Proc. IEEE Int. ymp. Inform. Theory, Jul. 28, pp [7] R. Vaze and R. Heath, Optmal amplfy and forward strategy for twoway relay channel wth multple relays, n Proc. IEEE Inf. Theory Workshop, Volos, Jun. 29. [8] H. Ghozlan, Y. Mohasseb, H. E. Gamal, and G. Kramer, The MIMO wreless swtch: Relayng can ncrease the multplexng gan, 29. [Onlne]. Avalable: [9] M. Chen and A. Yener, Interference management for multuser two-way relayng, n Proc. Conf. on Inf. c. and ys., Prnceton, Mar. 28, pp [1] A. ezgn, A. Avestmehr, M. Khajehnejad, and B. Hassb, Dvdeand-conquer: Approachng the capacty of the two-par bdrectonal Gaussan relay network, Arxv preprnt arxv: , 21. [11] D. Gunduz, A. Yener, A. Goldsmth, and H. Poor, The mult-way relay channel, n Proc. IEEE Int. ymp. Inform. Theory, eoul, Jul. 29, pp [12] T. Cover and A. E. Gamal, Capacty theorems for the relay channel, IEEE Trans. Inf. Theory, vol. IT-25, pp , ep [13] K. Marton, A codng theorem for the dscrete memoryless broadcast channel, IEEE Trans. Inf. Theory, vol. 25, no. 5, pp , May 1979.
Multi-pair bi-directional relay networks part I: protocols which exploit side-information
1 Mult-par b-drectonal relay networks part I: protocols whch explot sde-nformaton ang Joon Km, Besma mda, and Natasha Devroye Abstract The mult-par b-drectonal relay network under consderaton conssts of
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 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 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 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 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 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 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 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 informationNoisy Channel-Output Feedback Capacity of the Linear Deterministic Interference Channel
Nosy Channel-Output Feedback Capacty of the Lnear Determnstc Interference Channel Vctor Quntero, Samr M. Perlaza, Jean-Mare Gorce arxv:.4649v6 [cs.it] Jan 6 Abstract In ths paper, the capacty regon of
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 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 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 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 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 informationAdaptive 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 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 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 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 informationOn the Optimal Solution for BER Performance Improvement in Dual-Hop OFDM Relay Systems
IEEE WCNC 2014 - Workshop on Wreless Evoluton Beyond 2020 On the Optmal Soluton for BER Performance Improvement n Dual-Hop OFD Relay Systems Ens Kocan, lca Peanovc-Dursc Faculty of Electrcal Engneerng
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 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 informationHigh Speed ADC Sampling Transients
Hgh Speed ADC Samplng Transents Doug Stuetzle Hgh speed analog to dgtal converters (ADCs) are, at the analog sgnal nterface, track and hold devces. As such, they nclude samplng capactors and samplng swtches.
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 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 informationImpact of Interference Model on Capacity in CDMA Cellular Networks. Robert Akl, D.Sc. Asad Parvez University of North Texas
Impact of Interference Model on Capacty n CDMA Cellular Networks Robert Akl, D.Sc. Asad Parvez Unversty of North Texas Outlne Introducton to CDMA networks Average nterference model Actual nterference model
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 informationarxiv: v1 [cs.it] 30 Sep 2008
A CODED BIT-LOADING LINEAR PRECODED DISCRETE MULTITONE SOLUTION FOR POWER LINE COMMUNICATION Fahad Syed Muhammmad*, Jean-Yves Baudas, Jean-Franços Hélard, and Mattheu Crussère Insttute of Electroncs and
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 informationChannel Alternation and Rotation in Narrow Beam Trisector Cellular Systems
Channel Alternaton and Rotaton n Narrow Beam Trsector Cellular Systems Vncent A. Nguyen, Peng-Jun Wan, Ophr Freder Illnos Insttute of Technology-Communcaton Laboratory Research Computer Scence Department-Chcago,
More informationTraffic balancing over licensed and unlicensed bands in heterogeneous networks
Correspondence letter Traffc balancng over lcensed and unlcensed bands n heterogeneous networks LI Zhen, CUI Qme, CUI Zhyan, ZHENG We Natonal Engneerng Laboratory for Moble Network Securty, Bejng Unversty
More informationClustering Based Fractional Frequency Reuse and Fair Resource Allocation in Multi-cell Networks
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the IEEE ICC 21 proceedngs Clusterng Based Fractonal Frequency Reuse and Far Resource
More informationTest 2. ECON3161, Game Theory. Tuesday, November 6 th
Test 2 ECON36, Game Theory Tuesday, November 6 th Drectons: Answer each queston completely. If you cannot determne the answer, explanng how you would arrve at the answer may earn you some ponts.. (20 ponts)
More informationSTUDY ON LINK-LEVEL SIMULATION IN MULTI- CELL LTE DOWNLINK SYSTEM
Proceedngs of IEEE IC-BMT0 TUDY O LIK-LEVEL IMULATIO I MULTI- CELL LTE DOWLIK YTEM Yang Zhang, Ruoyu Jn, Xn Zhang, Dacheng Yang Beng Unversty of Posts and Telecommuncatons, Beng 00876, Chna 05330@bupt.edu.cn
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 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 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 informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
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 informationDistributed Relay Selection and Power Allocation Using Stackelberg and Auction Games in Multi-user Multi-relay Networks
ensors & Transducers 013 by IFA http://www.sensorsportal.com Dstrbuted Relay electon and Power Allocaton Usng tackelberg and Aucton Games n Mult-user Mult-relay Networks Erqng ZHANG xng YIN Lang YIN hufang
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 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 informationGeneralized Incomplete Trojan-Type Designs with Unequal Cell Sizes
Internatonal Journal of Theoretcal & Appled Scences 6(1): 50-54(2014) ISSN No. (Prnt): 0975-1718 ISSN No. (Onlne): 2249-3247 Generalzed Incomplete Trojan-Type Desgns wth Unequal Cell Szes Cn Varghese,
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 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 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 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 informationIN wireless networks, it has always been a challenge to satisfy
1668 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 13, NO. 3, MARCH 14 Desgn of Low-Densty Party-Check Codes for Half-Duplex Three-Phase Two-Way Relay Channels Xnsheng Zhou, Lang-Lang Xe, Senor Member,
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 informationAnalysis of Time Delays in Synchronous and. Asynchronous Control Loops. Bj rn Wittenmark, Ben Bastian, and Johan Nilsson
37th CDC, Tampa, December 1998 Analyss of Delays n Synchronous and Asynchronous Control Loops Bj rn Wttenmark, Ben Bastan, and Johan Nlsson emal: bjorn@control.lth.se, ben@control.lth.se, and johan@control.lth.se
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 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 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 informationTHE USE OF CONVOLUTIONAL CODE FOR NARROWBAND INTERFERENCE SUPPRESSION IN OFDM-DVBT SYSTEM
THE USE OF CONVOLUTIONAL CODE FOR NARROWBAND INTERFERENCE SUPPRESSION IN OFDM-DVBT SYSTEM Azura Abdullah, Muhammad Sobrun Jaml Jamal, Khazuran Abdullah, Ahmad Fadzl Ismal and An Lza Asnaw Department of
More informationantenna antenna (4.139)
.6.6 The Lmts of Usable Input Levels for LNAs The sgnal voltage level delvered to the nput of an LNA from the antenna may vary n a very wde nterval, from very weak sgnals comparable to the nose level,
More informationEnhancing Throughput in Wireless Multi-Hop Network with Multiple Packet Reception
Enhancng Throughput n Wreless Mult-Hop Network wth Multple Packet Recepton Ja-lang Lu, Paulne Vandenhove, We Shu, Mn-You Wu Dept. of Computer Scence & Engneerng, Shangha JaoTong Unversty, Shangha, Chna
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 informationTwo-Phase Cooperative Broadcasting Based on Batched Network Code
Two-Phase Cooperatve Broadcastng Based on Batched Network Code Xaol Xu, Praveen Kumar M. Gandh, Yong Lang Guan, and Peter Han Joo Chong 1 arxv:1504.04464v1 [cs.it] 17 Apr 2015 Abstract In ths paper, we
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 informationA Benchmark for D2D in Cellular Networks: The Importance of Information
A Benchmark for D2D n Cellular Networks: The Importance of Informaton Yğt Özcan, Catherne Rosenberg Unversty of Waterloo {yozcan,cath}@uwaterloo.ca Fabrce Gullemn Orange Labs, France fabrce.gullemn@orange.com
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 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 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 informationHigh Speed, Low Power And Area Efficient Carry-Select Adder
Internatonal Journal of Scence, Engneerng and Technology Research (IJSETR), Volume 5, Issue 3, March 2016 Hgh Speed, Low Power And Area Effcent Carry-Select Adder Nelant Harsh M.tech.VLSI Desgn Electroncs
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 informationOn the Feasibility of Receive Collaboration in Wireless Sensor Networks
On the Feasblty of Receve Collaboraton n Wreless Sensor Networs B. Bantaleb, S. Sgg and M. Begl Computer Scence Department Insttute of Operatng System and Computer Networs (IBR) Braunschweg, Germany {behnam,
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 informationPassive Filters. References: Barbow (pp ), Hayes & Horowitz (pp 32-60), Rizzoni (Chap. 6)
Passve Flters eferences: Barbow (pp 6575), Hayes & Horowtz (pp 360), zzon (Chap. 6) Frequencyselectve or flter crcuts pass to the output only those nput sgnals that are n a desred range of frequences (called
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 information760 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 30, NO. 4, MAY 2012
760 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 30, NO. 4, MAY 2012 Cooperatve Communcaton Aware Lnk Schedulng for Cogntve Vehcular Networks Mao Pan, Student Member, IEEE, PanL,Member, IEEE
More informationThe Impact of Spectrum Sensing Frequency and Packet- Loading Scheme on Multimedia Transmission over Cognitive Radio Networks
Ths artcle has been accepted for publcaton n a future ssue of ths journal, but has not been fully edted. Content may change pror to fnal publcaton. The Impact of Spectrum Sensng Frequency and Pacet- Loadng
More informationHierarchical Generalized Cantor Set Modulation
8th Internatonal Symposum on Wreless Communcaton Systems, Aachen Herarchcal Generalzed Cantor Set Modulaton Smon Görtzen, Lars Schefler, Anke Schmenk Informaton Theory and Systematc Desgn of Communcaton
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 informationJoint Power Control and Scheduling for Two-Cell Energy Efficient Broadcasting with Network Coding
Communcatons and Network, 2013, 5, 312-318 http://dx.do.org/10.4236/cn.2013.53b2058 Publshed Onlne September 2013 (http://www.scrp.org/journal/cn) Jont Power Control and Schedulng for Two-Cell Energy Effcent
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 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 informationA Novel Optimization of the Distance Source Routing (DSR) Protocol for the Mobile Ad Hoc Networks (MANET)
A Novel Optmzaton of the Dstance Source Routng (DSR) Protocol for the Moble Ad Hoc Networs (MANET) Syed S. Rzv 1, Majd A. Jafr, and Khaled Ellethy Computer Scence and Engneerng Department Unversty of Brdgeport
More informationLearning Ensembles of Convolutional Neural Networks
Learnng Ensembles of Convolutonal Neural Networks Lran Chen The Unversty of Chcago Faculty Mentor: Greg Shakhnarovch Toyota Technologcal Insttute at Chcago 1 Introducton Convolutonal Neural Networks (CNN)
More informationAN ALGORITHM TO COMBINE LINK ADAPTATION AND TRANSMIT POWER CONTROL IN HIPERLAN TYPE 2
AN ALGORITHM TO COMBINE LINK ADAPTATION AND TRANSMIT POWER CONTROL IN HIPERLAN TYPE 2 Markus Radmrsch Inst. f. Allgem. Nachrchtentechnk, Unv. Hannover, Appelstr. 9a, 3167 Hannover, Germany Tel.: +49-511-762
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 informationChannel aware scheduling for broadcast MIMO systems with orthogonal linear precoding and fairness constraints
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,
More informationArterial Travel Time Estimation Based On Vehicle Re-Identification Using Magnetic Sensors: Performance Analysis
Arteral Travel Tme Estmaton Based On Vehcle Re-Identfcaton Usng Magnetc Sensors: Performance Analyss Rene O. Sanchez, Chrstopher Flores, Roberto Horowtz, Ram Raagopal and Pravn Varaya Department of Mechancal
More information1 GSW Multipath Channel Models
In the general case, the moble rado channel s pretty unpleasant: there are a lot of echoes dstortng the receved sgnal, and the mpulse response keeps changng. Fortunately, there are some smplfyng assumptons
More informationNETWORK 2001 Transportation Planning Under Multiple Objectives
NETWORK 200 Transportaton Plannng Under Multple Objectves Woodam Chung Graduate Research Assstant, Department of Forest Engneerng, Oregon State Unversty, Corvalls, OR9733, Tel: (54) 737-4952, Fax: (54)
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 informationKing s Research Portal
Kng s Research Portal DOI: 10.1109/TWC.2015.2460254 Document Verson Peer revewed verson Lnk to publcaton record n Kng's Research Portal Ctaton for publshed verson (APA): Shrvanmoghaddam, M., L, Y., Dohler,
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 informationThe Spectrum Sharing in Cognitive Radio Networks Based on Competitive Price Game
8 Y. B. LI, R. YAG, Y. LI, F. YE, THE SPECTRUM SHARIG I COGITIVE RADIO ETWORKS BASED O COMPETITIVE The Spectrum Sharng n Cogntve Rado etworks Based on Compettve Prce Game Y-bng LI, Ru YAG., Yun LI, Fang
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 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 informationCOST EFFICIENCY OPTIMIZATION OF 5G WIRELESS BACKHAUL NETWORKS
COST EFFICIENCY OPTIMIZATION OF 5G WIRELESS BACKHAUL NETWORKS Xaohu Ge, Senor Member, IEEE, Song Tu, Guoqang Mao 2, Senor Member, IEEE, Vncent K. N. Lau 3, Fellow, IEEE, Lnghu Pan School of Electronc Informaton
More informationEE360: Lecture 7 Outline Cellular System Capacity and ASE Announcements Summary due next week
EE360: Lecture 7 Outlne Cellular System Capacty and ASE Announcements Summary due next week Capacty Area Spectral Effcency Dynamc Resource Allocaton Revew of Cellular Lecture Desgn consderatons: Spectral
More informationFigure.1. Basic model of an impedance source converter JCHPS Special Issue 12: August Page 13
A Hgh Gan DC - DC Converter wth Soft Swtchng and Power actor Correcton for Renewable Energy Applcaton T. Selvakumaran* and. Svachdambaranathan Department of EEE, Sathyabama Unversty, Chenna, Inda. *Correspondng
More informationControl Chart. Control Chart - history. Process in control. Developed in 1920 s. By Dr. Walter A. Shewhart
Control Chart - hstory Control Chart Developed n 920 s By Dr. Walter A. Shewhart 2 Process n control A phenomenon s sad to be controlled when, through the use of past experence, we can predct, at least
More informationCorrelation Analysis of Multiple-Input Multiple-Output Channels with Cross-Polarized Antennas
Correlaton Analyss of Multple-Input Multple-Output Channels wth Cross-Polarzed Antennas Le Jang, Volker Jungnckel, Stephan Jaeckel, Lars Thele and Armn Brylka Fraunhofer Insttute for Telecommuncatons,
More informationIndex Terms Adaptive modulation, Adaptive FEC, Packet Error Rate, Performance.
ANALYTICAL COMPARISON OF THE PERFORMANCE OF ADAPTIVE MODULATION AND CODING IN WIRELESS NETWORK UNDER RAYLEIGH FADING 723 Sab Y.M. BANDIRI, Rafael M.S. BRAGA and Danlo H. SPADOTI Federal Unversty of Itajubá
More informationDegrees of Freedom of Full-Duplex Multiantenna Cellular Networks
Degrees of Freedom of Full-Duplex Multantenna Cellular etworks Sang-Woon Jeon, Member, IEEE, Sung Ho Chae, Member, IEEE, and Sung Hoon Lm, Member, IEEE Abstract arxv:50.02889v [cs.it] 3 Jan 205 We study
More informationMTBF PREDICTION REPORT
MTBF PREDICTION REPORT PRODUCT NAME: BLE112-A-V2 Issued date: 01-23-2015 Rev:1.0 Copyrght@2015 Bluegga Technologes. All rghts reserved. 1 MTBF PREDICTION REPORT... 1 PRODUCT NAME: BLE112-A-V2... 1 1.0
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 information