Adaptive Modulation for Multiple Antenna Channels
|
|
- Kathleen Young
- 5 years ago
- Views:
Transcription
1 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 E-mal: Abstract We consder the use of adaptve modulaton scheme for multple transmt and multple receve antenna system wth nstantaneous channel nformaton known to both the recever and the transmtter. We derve an effcent bt allocaton algorthm whch maxmzes the transmsson rate for a gven transmt power. The algorthm s generally a greedy algorthm; however, we derve a suffcent condton for the bt allocaton algorthm to be globally optmal, whch s found to be satsfed n all dgtal modulaton schemes. It s found that when uncoded M-ary QAM s used wth a target symbol error probablty of 1 there s about 9 db gap between the channel capacty and the throughput of adaptve modulaton. I. INTRODUCTION The adaptve modulaton for scalar channels was studed n [1]. The fundamental concept of adaptve modulaton s that the system parameters n the physcal layer are adaptvely changed based on the channel status to ncrease the communcaton lnk qualty, mostly, transmsson rate. Ths paper consders usng the adaptve modulaton method n multple antenna channels. In partcular, we focus on the power allocaton problem over multple spatal channels. In recent years, multple antenna communcaton systems have gathered much attenton for hgh-rate transmsson over wreless channels. Telatar [] showed the nformaton-theoretc capacty of multple-nput multple-output (MIMO) channels wth flat fadng. If the channel state nformaton s known to both the transmtter and the recever, an MIMO channel can be decomposed nto parallel ndependent sngle-nput sngle-output (SISO) channels by employng approprate operatons at the transmtter and the recever. The resultng decomposed channels are characterzed by the channel gan matrx,.e., the gans of the decomposed channels are determned to be the sngular values of the channel gan matrx. After decomposng the channel nto parallel channels, the remanng problem s how to allocate the transmt power over the decomposed channels to maxmze the total transmsson rate. The adaptve modulaton for multple antenna channels s concerned wth adaptaton of modulaton parameters n spatal as well as temporal doman. Ths research was supported by CoRe research grant No. Cor-17 and by a research grant from Ercsson. The power allocaton problem can be equvalently consdered as so-called bt allocaton problem 1 over multple spatal channels f the target lnk qualty s fxed. The bt allocaton problem nvolves solvng an optmzaton problem wth nteger varables, n whch the optmum bt allocaton over the multple channels s determned to mnmze the total transmt power for a gven number of transmsson bts. That s, the cost functon s the total requred transmt power for transmttng the gven number of bts wth a target lnk qualty satsfed. The channel gan matrx characterzes the cost functon. One contrbuton of ths paper s that the bt allocaton problem s formulated as an optmzaton problem, and then an effcent bt allocaton algorthm s derved. The derved algorthm s a greedy algorthm, whch generally may not be the global optmum. However, we derve a suffcent condton for the bt allocaton algorthm to be globally optmal, whch s found to be satsfed n all M-ary dgtal modulaton schemes. We are also nterested n the average transmsson rate that can be affordable wth adaptve modulaton n MIMO systems and how far the average rate s away from the channel capacty. We consder an adaptve modulaton scheme that changes the modulaton order of M-ary QAM, M {,,,..., }, dependng on the channel state. The smulaton results show that the average transmsson rate of the adaptve uncoded M-ary QAM s about 9 db away from the channel capacty when the target symbol error probablty s set to 1. II. SYSTEM MODEL We consder a pont-to-pont flat fadng channel wth multple antennas at both the transmtter and the recever. The number of transmt antennas s denoted by t and the number of receve antennas by r. We consder a lnear dscrete channel model y = Hx + w (1) where x C t 1 s the transmtted sgnal, y C r 1 s the receved sgnal, H C r t s the channel gan matrx, and w C r 1 s the zero-mean complex Gaussan nose wth covarance E{ww } = I r. As n [], we assume that H s a random matrx ndependent of x and w. H s a complex Gaussan 1 The bt allocaton problem has been also studed for mult-carrer communcaton applcatons; there, computatonally effcent suboptmum schemes have been focused because the number of parallel channels s usually large.
2 matrx wth..d. entres, each entry havng ndependent real and magnary parts wth zero-mean and varance 1/. And, we assume a power constrant on the transmtted sgnal wth E{x x} P T. A. Channel Decomposton Usng SVD If the channel state nformaton s known at both the transmtter and the recever, the channel can be decomposed nto parallel non-nterferng SISO channels by usng sngular value decomposton (SVD): H = UΣV, where U C r r and V C t t are untary, and Σ R r t contans the sgular values wth σ s the -th sngular value of H. If the transmtter knows the channel matrx H (or V ), x = V s s transmtted where s C t 1 s the modulaton symbol vector. And, at the recever, by pre-multplyng y by U we have ỹ = Σs + w () where ỹ = U y, and w = U w. Snce m rank(h) mn(t, r), () can be rewrtten as { σ s ỹ = + w, 1 m (3) w, otherwse where the subscrpt ndcates the -th element of the correspondng vector. Note that snce U and V are untary matrx, E{s s} = E{x x} and E{ w w } = E{ww }. From (3), we can see that, for a gven channel H, we have m ndependent parallel Gaussan channels wth the -th channel havng a gan σ. Therefore, the demodulaton for the transmtted symbol vector s becomes smple: just demodulate each channel ndependently wth a decson varable ỹ. B. Transmt Beamformng and Maxmal-Rato Combnng We also consder a transmt beamformng and maxmal-rato combnng (MRC) at the recever for comparson. In ths case, the modulaton symbol s now a scalar s and the prncple egenvector of H H s employed as the beamformng weght,.e., x = v 1 s. And, at the recever sde, the weghtng vector s set to h = Hv 1 / Hv 1, whch equals to u 1, the prncple egenvector of HH, then the decson varable s gven by ỹ = h y = σ 1 s + w. () The resultng channel s a sngle Gaussan channel wth a channel gan σ 1 and E{ w } = 1. We place the same nput power constrant, E{ s } P T. C. M-ary QAM We consder M-ary QAM wth M {, 1,,..., }, whch corresponds to transmttng {, 1,,..., } bts per channel use. Snce the decson boundary n the QAM constellaton s not rectangular when M = 3 and 1 as shown n Fgure 1, we use Crag s method [3] to obtan the exact numercal values for the probablty of symbol error. Table I summarzes the requred symbol energy per nose densty, whch s denoted by g(n) for M = n, when the target symbol error probablty (SER) s 1. TABLE I THE REQUIRED SYMBOL ENERGY PER NOISE DENSITY IN db, g(n), OF M -ARY QAM WHEN THE TARGET SYMBOL ERROR PROBABILITY IS 1. M n g(n) III. OPTIMUM BIT ALLOCATION When the channel state nformaton s known to both the transmtter and the recever, after decomposng the channel nto m parallel channels as n the prevous secton, the remanng problem s how to allocate the transmt power over the decomposed channels to maxmze the total transmsson rate. One obvous strategy from nformaton theory s to allocate more power to better channel as n water-fllng []. The water-fllng assumes that there exsts nfntely many contnuous levels of power. But, n the adaptve modulaton wth M-ary modulaton, we need dscrete-valued power to transmt one more addtonal bt wth a gven lnk qualty satsfed. Therefore, the power allocaton n adaptve modulaton for MIMO systems s to fnd the optmum way to allocate the avalable transmt power over multple parallel channels wth each havng ts dscrete levels whch are determned by the modulaton scheme and ts channel gan. Snce the channel gan of the -th decomposed channel s σ, the receved sgnal-to-nose rato (SNR) s gven by σ P, where P s the transmt SNR of the -th channel. Note that snce we assume a normalzed nose wth unt varance, the transmt power on a decomposed channel equals to the transmt SNR. Therefore, f we denote the requred SNR for M = n,.e. n bts transmsson per channel use, by g(n), the requred transmt power wth a channel gan σ s gven by Γ (n) = g(n) σ, n = 1,..., n max. () Consder that we transmt n N {, 1,,..., n max } bts over the -th channel, 1 m, we call ths a bt allocaton n = (n 1,..., n m ) N m. Then, the total transmt power, the cost functon n ths optmzaton problem, s gven by f(n) = f(n 1,..., n m ) = Γ (n ) = a g(n ) () where a = 1/σ and wthout loss of generalty we assume that σ 1 σ... σ m >, so < a 1 a... a m. For smpler notaton, we defne n g(n) g(n 1), and n () 1 as a vector wth same elements of n except -th element reduced by one. Snce we are dealng wth a non-negatve nteger n N, t s more useful to defne n () 1 ( n 1,..., n 1, [n 1] +, n +1,..., n m ). (7)
3 where [x] + max{, x}. Theorem 1: Consder two bt allocatons, n and k, wth n k for some and the total transmt powers wth two bt allocatons satsfyng f(n) f(k). Then, wth a suffcent condton f(n () 1 ) f(k () 1 ) () < k n. (9) Proof: Snce f(n) f(k), the hypothess on the total transmt powers can be rewrtten as a j [g(n j ) g(k j )] After subtractng the -th term from both sdes, we have a j [g(n j ) g(k j )] a [g(k ) g(n )] j From the above, we can show the nequalty (). f(n () 1 ) f(k () 1 ) = a [g(n 1) g(k 1)] + a j [g(n j ) g(k j )] j a [g(n 1) g(k 1)] + a [g(k ) g(n )] = a {[g(k ) g(k 1)] [g(n ) g(n 1)]} = a ( k n ) The last nequalty s satsfed under the suffcent condton (9). Hence, the theorem was proved. Example 1: Assume m =, N = {, 1,..., }, and bt allocaton n = (7, ) s the optmal n transmttng 1 bts per channel user (see Fgure ). That s, f(7, ) = Applyng Theorem 1, mn f(k 1, k ). k 1,k N k 1 +k =1 f(, ) f(, ), f(, 7), f(3, ) and f(7, ) f(, 3) Therefore, mn f(k 1, k ) = mn{f(, ), f(7, )}. k 1,k N k 1 +k =11 We want to generalze the dea n the above Example and derve an effcent bt allocaton algorthm based on Theorem 1. Before dong that, we need a set of defntons for the subsets of all possble bt allocatons, N m. S N {n : n = N and n N, = 1,..., m} whch s the set of all bt allocatons that are correspondng to N bts transmsson per channel use. We also defne a subset of S N wth a parameter a S N as set of all the vectors n S N wth the -th element less than the -th element of a,.e., D N (a) { n : n S N and n a }, = 1,..., m. We can see that S N = m DN (a), for some a SN. And, we also defne D N () 1 (a) { n () 1 : n S N (a) }. Then, from the above defntons we can easly see the followng Lemma. Lemma 1: For some vector a S N, S N 1 = m D() 1 N (a). (1) We can dvde the mnmzng problem over a varable space, say S, nto two stages: Frst, do m number of mnmzatons over the subset varable spaces, say D, = 1,..., m, where S = m D ; and secondly, fnd the fnal mnmzng pont among the m mnmzng ponts obtaned from the frst step. The followng Lemma summarzes ths dea. Lemma : Suppose the varable space for the optmzaton, S = m D, and n s the mnmzng pont over the subset space D,.e., f(n ) = mn n D f(n). Then, the mnmzng pont n over the whole space S s gven by f(n ) = mn n S f(n) = mn f(n ). (11) Lemma 3: Suppose that a s the mnmzng pont n S N,.e., f(a) = mn n S N f(n) and that g(n) satsfes the followng condton, < 1... nmax. (1) Then, a () 1 s the the mnmzng pont n D N () 1 (a) SN 1. That s, f(a () 1 ) = mn f(n) for = 1,..., m. (13) n D N () 1 (a) Proof: Snce f(a) = mn n S N f(n), f(a) f(k) for all k S N. By Theorem 1, t mples that f(a () 1 ) f(k () 1 ) for all k S N. (1) Snce we defned D() 1 N (a) = { k () 1 : k S N (a)}, (1) s equvalent to (13). From Lemma 1, and 3, we can derve the followng Theorem whch s drectly related to the optmum bt allocaton algorthm. Theorem : If a s the bt allocaton wth N bts transmsson that mnmzes the transmt power,.e., f(a) = mn n S N f(n), then the optmum bt allocaton b wth N 1 bts transmsson s gven by f(b) mn n S N 1 f(n) = mn f(a () 1 ). (1)
4 Proof: For the optmzaton problem over S N 1, we consder the subsets D() 1 N SN 1, 1 m, as n Lemma 1, and apply two steps optmzaton stated n Lemma, then we can easly arrve the result by Lemma (3). From the above Theorem, we derve an effcent bt allocaton algorthm as s summarzed as follows: 1) Start wth N = m n max ; and n = (n max,..., n max ). ) N N 1; = arg mn 1 m f(n () 1 ), then n n ( ) 1. 3) Repeat Step untl f(n ) P T. Otherwse, stop. where n ( ) 1 as a vector wth same elements of n except - th element reduced by one as defned n (7). Snce the cost functon, the total transmt power, has a form of f(n) = m a g(n ), by notcng the fact f(n () 1 ) = f(n ) a n, the second step n the above bt allocaton algorthm s equvalent to ) N N 1; = arg max 1 m a n, then n n ( ) 1, f(n ) f(n ) max a n. The above bt algorthm always gves the bt allocaton that maxmzes the total number of transmsson bts for a gven power constrant, snce the resultng bt allocaton n for each N always provdes the mnmum transmt power. The algorthm s, n general, a greedy algorthm whch may not be the global optmum, snce t follows the best way at each stage wthout care of the prevous path, regardless of the characterstcs of the cost functon. In ths secton, we have shown that the derved bt allocaton algorthm provdes the globally optmum pont under a suffcent condton (1), whch s satsfed for all M-ary dgtal modulaton schemes. One can also develop, wth the same prncple, an equvalent bt allocaton algorthm that goes the reverse drecton: 1) Start wth N = ; and n = (,..., ). ) N N + 1; n tmp n ; = arg mn 1 m a n +1, then n n ( )+1, f(n ) f(n ) + mn a n +1. 3) Repeat Step untl f(n ) > P T. Otherwse, stop and n n tmp. where n ()+1 (n 1,..., n 1, n + 1, n +1,..., n m ). IV. THROUGHPUT OF ADAPTIVE M -ARY QAM The ergodc channel capacty of MIMO channels wth perfect channel state nformaton known to both the transmtter and the recever s gven by C(P T ) = E H {C(P T ; H)} (1) where E H { } s the expectaton over the random channel matrx H, and C(P T ; H) s the condtonal capacty for a gven channel realzaton H, whch s gven by [] C(P T ; H) = [ log (νσ ) ] + (17) and ν s the water-fllng level satsfyng [ ] ν 1/σ + = PT. (1) The cost functon of () s determned by the channel matrx H, or more precsely by {σ 1,..., σ m }; and, for a channel realzaton, the optmum bt allocaton can be solved wth the algorthm descrbed n the prevous secton. Then, the maxmum number of transmsson bts, let us say R(P T ; H) = R(σ 1,..., σ m ; P T ), s smply the sum of all the elements of the bt allocaton,.e., R(P T ; H) = n, where n s the -th element of the optmum bt allocaton n. Therefore, for a gven transmt power constrant P T, the average bts per channel use, that s offered by adaptve modulaton, can be expressed as, R(P T ) = E H {R(P T ; H)} = R(σ 1,..., σ m ; P T )p(σ 1,..., σ m ) dσ 1 dσ m (19) where p(σ 1,..., σ m ) s the jont probablty densty functon of {σ }, whch can be found n lterature, e.g., []. However, unfortunately, t s not easy to fnd any closed-form expresson for R(σ 1,..., σ m ; P T ). Instead, we resort to the solutons from the bt allocaton algorthm. We ran smulatons to evaluate the throughput of adaptve modulaton. We consdered M-ary QAM wth requred SER of 1, and used the requred transmt power (or transmt SNR) for each transmsson bt, g(n), n =, 1,...,, that are shown n the Table I n Secton II. Fgures 3 shows the results when t = {1,, 3, } and r =. We can see that the throughput of adaptve modulaton s away 9 1 db from the channel capacty calculated from (1). One apparent observaton s that as P T ncrease R(P T ) m n max, because at hgh P T all m channels are utlzed wth n max bts transmsson on each channel. Before R(P T ) s saturated, the throughput s almost parallel to C(P T ). One obvous way to reduce the gap to the channel capacty s to employ channel codes. If the perfect channel s known to both sdes so that the MIMO channel can be decomposed nto non-nterferng parallel channels, there s no need to use vector channel codng that needs hgh complexty, and conventonal scalar channel codng for each channel s suffcent. The throughput of adaptve modulaton wth ndependent scalar codngs can be obtaned usng a smlar approach, because we separated the power allocaton problem n the MIMO channel from the modulaton ssues. That s, once the requred transmt power {g(n)} that accounts for the effect of channel codng s
5 obtaned, we can obtan the throughput by just substtutng the new {g(n)} n the bt allocaton algorthm. The beamformng strategy descrbed n Secton II needs less nformaton about the channel (only v 1 and σ 1 are necessary at the transmtter). In Fgure, we compared the performance of the transmt beamformng wth the channel decomposton method usng SVD. When P T s low, the transmt beamformng scheme shows a comparable performance to the channel decomposton method. Ths s because at low transmt power only the best spatal channel s used most of the tme. Therefore, the two schemes gve lttle dfference n performance. But, as P T ncreases, the other remanng channels are startng to be utlzed; hence, the channel decomposton method outperforms the transmt beamformng counterpart. V. CONCLUSION We consder the use of adaptve modulaton scheme for MIMO channels wth nstantaneous channel nformaton known to both the recever and transmtter. An effcent bt allocaton algorthm s derved and ts optmalty s proved under a suffcent condton, whch s satsfed n all M-ary modulaton schemes. It s found that when M-ary QAM s used wth a target symbol error probablty of 1 there s about 9 db gap between the channel capacty and the throughput of adaptve modulaton. And, t s also shown that a transmt beamformng scheme, whch needs less channel nformaton, gves a comparable performance when the power constrant s low. Relaxng the assumpton of perfect channel nformaton at both communcaton sdes needs further studes. REFERENCES [1] A. J. Goldsmth and S.-G. Chua, Varable-rate varable-power MQAM for fadng channels, IEEE Trans. Commun., vol., no. 1, pp , [] I. E. Telatar, Capacty of mult-antenna Gaussan channels, AT&T Bell Labs Tech. Memo., 199. [3] J. W. Crag, A new, smple and exact result for calculatng the probablty of error for two-dmensonal sgnal constellatons, n Proc. IEEE MIL- COM, pp. 71 7, [] T. M. Cover and J. A. Thomas, Elements of Informaton Theory. New York: Wlly, M = M = (a) M = 3 (b) M = 1 Fg. 1. Sgnal constellaton of M-ary QAM (M = 3, 1). f(n 1, n ) Optmum Bt Allocatons n n 1 n 1 + n = 1 n + n = 11 1 Fg.. Example of bt allocaton algorthm (m =, n max = ). Average Bts per Channel Use Throughput of Adaptve M ary QAM: r = Channel Capacty (t = 1,, 3, from the bottom) Adaptve Modulaton (t = 1,, 3, from the bottom) Transmt Power Constrant, P T (db) Fg. 3. Average bts per channel use of M-ary QAM adaptve modulaton when r = fxed. The sold lnes are for adaptve modulaton wth t = 1,, 3, (from the bottom), and the dashed lnes for the channel capactes wth r = and t = 1,, 3, (from the bottom). Average Bts per Channel Use Throughput of Adaptve M ary QAM: r = Channel Decomposton (t = 1,, 3, from the bottom) Transmt Beamformng (t = 1,, 3, from the bottom) Transmt Power Constrant, P T (db) Fg.. Average bts per channel use of M-ary QAM adaptve modulaton when r = fxed. The sold lnes are for channel decomposton method, and the dashed lnes for the transmt beamformng scheme, wth t = 1,, 3, (from the bottom).
Performance 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationReview: Our Approach 2. CSC310 Information Theory
CSC30 Informaton Theory Sam Rowes Lecture 3: Provng the Kraft-McMllan Inequaltes September 8, 6 Revew: Our Approach The study of both compresson and transmsson requres that we abstract data and messages
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 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 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 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 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 informationPhasor Representation of Sinusoidal Signals
Phasor Representaton of Snusodal Sgnals COSC 44: Dgtal Communcatons Instructor: Dr. Amr Asf Department of Computer Scence and Engneerng York Unversty Handout # 6: Bandpass odulaton Usng Euler dentty e
More informationRevision of Lecture Twenty-One
Revson of Lecture Twenty-One FFT / IFFT most wdely found operatons n communcaton systems Important to know what are gong on nsde a FFT / IFFT algorthm Wth the ad of FFT / IFFT, ths lecture looks nto OFDM
More informationTarget Response Adaptation for Correlation Filter Tracking
Target Response Adaptaton for Correlaton Flter Tracng Adel Bb, Matthas Mueller, and Bernard Ghanem Image and Vdeo Understandng Laboratory IVUL, Kng Abdullah Unversty of Scence and Technology KAUST, Saud
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 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 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 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 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 informationInformation-Theoretic Comparison of Channel Capacity for FDMA and DS-CDMA in a Rayleigh Fading Environment
WSEAS TRANSATIONS on OMMUNIATIONS Informaton-Theoretc omparson of hannel apacty for FDMA and DS-DMA n a Raylegh Fadng Envronment PANAGIOTIS VARZAAS Department of Electroncs Technologcal Educatonal Insttute
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 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 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 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 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 informationAN IMPROVED BIT LOADING TECHNIQUE FOR ENHANCED ENERGY EFFICIENCY IN NEXT GENERATION VOICE/VIDEO APPLICATIONS
Journal of Engneerng Scence and Technology Vol., o. 4 (6) 476-495 School of Engneerng, Taylor s Unversty A IMPROVED BIT LOADIG TECHIQUE FOR EHACED EERGY EFFICIECY I EXT GEERATIO VOICE/VIDEO APPLICATIOS
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 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 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 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 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 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 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 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 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 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 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 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 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 informationThe Throughput of Hybrid-ARQ in Block Fading under Modulation Constraints
The Throughput of Hybrd-ARQ n Block Fadng under Modulaton Constrants Tark Ghanm and Matthew C. Valent Lane Dept. of Comp. Sc. and Elect. Eng. West Vrgna Unversty Morgantown, WV 26506 6109 Emal: mvalent@wvu.edu
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 informationTECHNICAL NOTE TERMINATION FOR POINT- TO-POINT SYSTEMS TN TERMINATON FOR POINT-TO-POINT SYSTEMS. Zo = L C. ω - angular frequency = 2πf
TECHNICAL NOTE TERMINATION FOR POINT- TO-POINT SYSTEMS INTRODUCTION Because dgtal sgnal rates n computng systems are ncreasng at an astonshng rate, sgnal ntegrty ssues have become far more mportant to
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 informationPerformance Evaluation of Cooperative Versus Receiver Coded Diversity
Saf E. A. Alnawayseh, Pavel Loskot, Mutaz Al-Tarawneh, Zyad Ahmed Al Tarawneh Performance Evaluaton of Cooperatve Versus Recever Coded Dversty Saf E. A. Alnawayseh 1,a, Pavel Loskot,b, Mutaz Al-Tarawneh
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 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 informationThe Effect Of Transmitter Channel State Information (CSIT ) On The MIMO Capacity Performance
Journal of Engneerng and Development, Vol. 16, o.3, Sep. 1 ISS 1813-78 The Effect Of Transmtter Channel State Informaton (CSIT ) On The MIMO Capacty Performance Lect. Ghanm Abd AL Kareem Electrcal Engneerng
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 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 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 informationOptimal Placement of PMU and RTU by Hybrid Genetic Algorithm and Simulated Annealing for Multiarea Power System State Estimation
T. Kerdchuen and W. Ongsakul / GMSARN Internatonal Journal (09) - Optmal Placement of and by Hybrd Genetc Algorthm and Smulated Annealng for Multarea Power System State Estmaton Thawatch Kerdchuen and
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 informationA Recursive Approach to Compute Bit Error Rate in Underwater Channels with Multiple Paths
A Recursve Approach to Compute Bt Error Rate n Underwater Channels wth Multple Paths C. Chen A. Ad Center for Wreless Communcaton and Sgnal Processng Research Dept. of Electrcal and Computer Engneerng
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 informationNetwork Reconfiguration in Distribution Systems Using a Modified TS Algorithm
Network Reconfguraton n Dstrbuton Systems Usng a Modfed TS Algorthm ZHANG DONG,FU ZHENGCAI,ZHANG LIUCHUN,SONG ZHENGQIANG School of Electroncs, Informaton and Electrcal Engneerng Shangha Jaotong Unversty
More informationEnergy Efficient Adaptive Modulation in Wireless Cognitive Radio Ad Hoc Networks
Energy Effcent Adaptve Modulaton n Wreless Cogntve Rado Ad Hoc Networks Song Gao, Ljun Qan*, Dhadesugoor. R. Vaman ARO/ARL Center for Battlefeld Communcatons Research Prare Vew A&M Unversty, Texas A&M
More informationOptimizing Transmission Lengths for Limited Feedback with Non-Binary LDPC Examples
Optmzng Transmsson Lengths for Lmted Feedbac wth on-bnary LDPC Examples Kasra Valna, Sudarsan V. S. Ranganathan, Darush Dvsalar*, and Rchard D. Wesel Department of Electrcal Engneerng, Unversty of Calforna,
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 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 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 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 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 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 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 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 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 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 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 informationA NEW TRANSMISSION STRATEGY FOR SCALABLE MULTIMEDIA DATA ON OFDM SYSTEMS
15th European Sgnal Processng Conference (EUSIPCO 27), Poznan, Poland, September 3-7, 27, copyrght by EURASIP A NEW TRANSMISSION STRATEGY FOR SCALABLE MULTIMEDIA DATA ON OFDM SYSTEMS Heykel Houas, Cléo
More informationDecomposition Principles and Online Learning in Cross-Layer Optimization for Delay-Sensitive Applications
Techncal Report Decomposton Prncples and Onlne Learnng n Cross-Layer Optmzaton for Delay-Senstve Applcatons Abstract In ths report, we propose a general cross-layer optmzaton framework n whch we explctly
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 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 informationParticle Filters. Ioannis Rekleitis
Partcle Flters Ioanns Reklets Bayesan Flter Estmate state x from data Z What s the probablty of the robot beng at x? x could be robot locaton, map nformaton, locatons of targets, etc Z could be sensor
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 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 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 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 informationAn Efficient Method for PAPR Reduction of OFDM Signal with Low Complexity
An Effcent Method for PAPR Reducton of OFDM Sgnal wth Low Complety Mahesh Ingle M.E. EXTC MGMCET,Kamothe Nav Mumba-41009 Sachn Nkalje M.E. EXTC MGMCET Kamothe Nav Mumba-41009 Savta Bhosale H.o.D.(EXTC)
More informationDirect Sequence Spread Spectrum (DSSS)
Drect Sequence Spread Spectrum (DSSS) DS-SS DS-SS uses sequences for spectrum spreadng and phase modulaton Modulaton s bnary SK (BSK) or quaternary SK (QSK) Message BSK - - - - QSK BSK Bt hase Dr. Cesar
More informationDISTRIBUTED video coding (DVC) [1] [4] is an attractive
1040 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 23, NO. 6, JUNE 2013 Dstrbuted Wreless Vsual Communcaton Wth Power Dstorton Optmzaton Xaopeng Fan, Member, IEEE, Feng Wu, Fellow,
More informationNATIONAL RADIO ASTRONOMY OBSERVATORY Green Bank, West Virginia SPECTRAL PROCESSOR MEMO NO. 25. MEMORANDUM February 13, 1985
NATONAL RADO ASTRONOMY OBSERVATORY Green Bank, West Vrgna SPECTRAL PROCESSOR MEMO NO. 25 MEMORANDUM February 13, 1985 To: Spectral Processor Group From: R. Fsher Subj: Some Experments wth an nteger FFT
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 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 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 informationSecure Transmission of Sensitive data using multiple channels
Secure Transmsson of Senstve data usng multple channels Ahmed A. Belal, Ph.D. Department of computer scence and automatc control Faculty of Engneerng Unversty of Alexandra Alexandra, Egypt. aabelal@hotmal.com
More information