COGNITIVE RADIO NETWORKS BASED ON OPPORTUNISTIC BEAMFORMING WITH QUANTIZED FEEDBACK
|
|
- Prudence McDonald
- 5 years ago
- Views:
Transcription
1 COGNITIVE RADIO NETWORKS BASED ON OPPORTUNISTIC BEAMFORMING WITH QUANTIZED FEEDBACK Ayman MASSAOUDI, Noura SELLAMI 2, Mohamed SIALA MEDIATRON Lab., Sup Com Unversty of Carthage 283 El Ghazala Arana, Tunsa 2 LETI Lab., ENIS Unversty of Sfax 338 Sfax, Tunsa ABSTRACT In ths paper, we consder an opportunstc beamformng schedulng scheme of secondary users SUs whch can share the spectrum wth a prmary user PU n an underlay cogntve rado networ. In the schedulng process, the cogntve base staton CBS havng mult-antennas, generates orthogonal beams whch nsure the mnmum nterference to the PU. Then, each SU feeds bac ts maxmum sgnal to nterference and nose rato SINR and the correspondng beam ndex to the CBS. The CBS selects the users havng the largest SINRs for transmsson. The am of our wor s to study the effect of SINR feedbac quantzaton on the throughput of the secondary system. To do ths, we derve an accurate statstcal characterzaton of ordered beams SINR and then we derve the closed-form expresson of the system throughput wth SINR feedbac quantzaton based on Lloyd-Max algorthm. Index Terms Cogntve rado, opportunstc beamformng, feedbac quantzaton, Lloyd-Max quantzer practce, the SINRs are quantzed before beng fed bac to the base staton n order to mae more effcent use of the lmted resources bandwdth and power. The SINR quantzaton for OB non-cogntve system has been recently studed n the lterature [5 7]. In these studes, the mpact of the feedbac quantzaton on the throughput of OB system s analyzed. The context of ths wor s dfferent snce t deals wth cogntve rado networ. Indeed, we consder the cogntve users schedulng scheme of [3] and we propose to quantze the SINR feedbac usng the mnmum mean squared error MMSE optmal quantzer.e. the Lloyd-Max quantzer [8]. We propose to dentfy the optmal set of quantzaton thresholds and to study analytcally the mpact of quantzaton on the throughput of the secondary system. To do ths, we study analytcally the statstcs of the ordered beam SINRs for a partcular user. The dffculty here comes from the fact that these SINRs are correlated random varables. 2. SYSTEM MODEL. INTRODUCTION Cogntve rado CR s a novel approach for mprovng the utlzaton of the rado electromagnetc spectrum []. It allows unlcensed secondary users to share the spectrum wth lcensed prmary users wthout sgnfcantly mpactng ther communcaton [2]. In [3], we proposed an opportunstc beamformng schedulng scheme of secondary users SUs whch can share the spectrum wth a prmary user PU n an underlay cogntve rado networ. We assumed that the cogntve base staton CBS does not have full channel state nformaton CSI from SUs whle t has an mperfect CSI from the PU and we proposed a two-steps schedulng algorthm based on opportunstc beamformng OB [4]. In the frst step, orthogonal beams are generated by the CBS to mnmze the nterference to the PU. In the second step, each SU calculates the sgnal to nterference plus nose ratos SINRs for each beam and feeds bac ts maxmum SINR and the correspondng beam ndex to the CBS. The CBS selects for transmsson the users wth the hghest SINRs and assgns to each of these users the beam correspondng to the hghest SINR. In Fg.. System model We consder the system model llustrated n Fgure and descrbed n [3], where a cogntve rado networ coexsts wth a prmary networ. The prmary networ conssts of a prmary base staton PBS wth a sngle transmttng antenna and one PU wth a sngle recevng antenna. The cogntve networ comprses K SUs, wth a sngle recevng antenna each, and a CBS wth M transmttng antennas. Through /5/$3. 25 IEEE 222
2 out ths paper, we assume that M K and the frequency dvson duplex FDD mode s used for both prmary and secondary lns. We consder the downln of the cogntve rado networ n whch the CBS transmts ndependent sgnals to scheduled secondary users, M the schedulng wll be explaned n the followng. We denote by S the set of the selected cogntve users. Snce the same carrer frequency s used wthn the prmary and the secondary networs, the receved sgnals at the SUs are corrupted by the sgnal transmtted by the PBS. Let h = [h,, h,2,, h,m ], where h,t s the channel tap gan between the t-th transmt antenna of the CBS and the -th secondary user, for t M and K. Let g = [g, g 2,, g K ], where g, for K, denotes the channel tap gan between the transmt antenna at the PBS and the -th cogntve user receve antenna. The entres of channel vectors h and g are ndependent and dentcally dstrbuted..d. complex Gaussan samples of a random varable wth zero mean and unt varance. We assume that the channels are constant durng the transmsson of a burst of T symbols and vary ndependently from burst to burst. The receved sgnal at the -th cogntve user, for K, can be wrtten as: y = P s h w x + P pu g x pu + n, S where P s and P pu denote the transmtted power for each selected cogntve user and for the prmary user, respectvely. In ths wor, fxed power allocaton for all selected users s adopted. The quanttes x pu and x denote the transmtted data from the PBS to the PU and from the CBS to the -th SU, respectvely, n denotes the nose at the -th cogntve user whch s a zero-mean Gaussan random varable wth varance σ 2. We assume that the varances σ2 for K are equal to σ 2. The weghtng vector w of sze M denotes the beamformng weght vector for the -th selected secondary user. 3. OPPORTUNISTIC BEAMFORMING SCHEDULING WITH SINR QUANTIZATION In our wor, we consder the two steps SUs schedulng method proposed n [3]. We assume that the CBS has an mperfect estmate of the nterference channel h pu channel between the CBS and the PU and has only partal channels nowledge about the secondary lns channels between the CBS and the SUs. In order to reduce the nterference to the PU, the CBS generates, n the frst step, orthogonal beams to the nterference channel estmate ĥ pu usng the Gram- Schmdt algorthm. In the second step, the CBS selects a set S of secondary users by applyng the opportunstc beamformng approach proposed n [4]. Thus, the cogntve base staton transmts the generated beams to all SUs. Then, by usng, each SU calculates the followng SINRs by assumng that x j, j, s the desred sgnal and the others x, j,, are nterferng sgnals as: SINR,j = Ns h w j 2 P s =, j h w 2 P s + g 2 P pu + σ 2. 2 In practce, each SU feeds bac to the CBS a quantzed verson of ts maxmum SINR.Thus, the value range of SINRs s dvded nto Q = 2 b ntervals, wth boundares values gven as: b < b <... < b Q. 3 If the largest SINR value of user, denoted by γ, s n the q-th nterval, where q Q,.e. < γ b q, then the -th user wll feedbac the ndex q of that nterval together wth the ndex of ts best beam. The CBS allocates the beams to selected users based on the feedbac nformaton. Specfcally, a beam wll be assgned to the user who has the largest SINR nterval ndex, among all the users requestng that beam. Notce that f many users feed bac the same quantzaton nterval ndex for the same beam, one of these users s selected at random. In addton, t may happen that no user requests one or several beams. In ths case, the CBS wll assgn that beam to a randomly chosen SU. We propose to use n ths paper the Lloyd-Max quantzer [8]. Then, we study the mpact of feedbac quantzaton on the secondary system sum rate. In order to dentfy the optmal set of quantzaton thresholds and to compute the sum rate, we derve the statstcs of the ordered beam SINR for a gven user. 4. LLOYD-MAX QUANTIZATION In ths secton, we consder the Lloyd-Max quantzaton [8]. Let Γ q, for q Q, be the reconstructon levels of the Q-level quantzer Ω. defned as: Ω γ = Γq f < γ b q 4 The quantzer s desgned to mnmze the average dstorton D Q gven by: D Q = Q q= γ Γ q 2 f γ γ dγ 5 where E [.] denotes the statstcal expectaton and f γ γ s the pdf of the largest SINR per user whch s ndependent of as wll be seen n secton 6. The expresson of f γ γ wll be gven n 8.The necessary condtons to mnmze D Q are: { DQ b q = D Q 6 Γ q = Solvng 6 usng the Lloyd-Max algorthm, we obtan the necessary condtons for mnmzaton as: b Γ q = q γf γ γ dγ 7 f γ γ dγ 223
3 b q = Γ q + Γ q+ 8 2 Mathematcally, the decson and the reconstructon levels are solutons of the above set of nonlnear equatons. In general, closed form solutons to equatons 7 and 8 do not exst and they can be solved by numercal technques n an teratve way by frst assumng an ntal set of values for the decson levels b q. For smplcty, one can start wth decson levels correspondng to unform quantzaton, where decson levels are equally spaced. Based on the ntal set of decson levels, the reconstructon levels can be computed usng equaton 7. These reconstructon levels are used n equaton 8 to obtan the updated values of b q. Solutons of equatons 7 and 8 are teratvely repeated untl convergence s acheved. In the next secton, we propose to study the mpact of SINR quantzaton on the secondary system sum rate. 5. SUM RATE OF THE SECONDARY SYSTEM In ths secton, we study the throughput of the secondary system. The loss n throughput due to the quantzaton s equal to: R loss = R A R Q 9 where R A respectvely R Q s the throughput of the secondary system wth analog respectvely quantzed feedbac. The throughput of the secondary system wth analog feedbac s expressed as [3]: + R A = F Sγ K dγ, + γ where F S x denotes the cdf of SINR,j n 2 and s gven n [3]: Ns a j exp F Sx = x / + ans exp x /, x + j x + j= where a j, for j, are constants. The exact sum rate expresson for the secondary system wth quantzed feedbac can be calculated as [ [9], Eq. 7.7]: K K K Ns R Q = = Q Fγ b q F γ b q q= F γ b q F γ Ns + K Ns u=2 log 2 + γ f γ γ dγ log 2 + γ f γ u γ dγ 2 where f γ u γ s the pdf of the u-th largest SINR per user and wll be gven n 5. In the next secton, we derve the statstcs of the ordered beam SINR for a gven user needed n 7, 8 and STATISTICS OF THE ORDERED BEAM SINRS FOR A PARTICULAR USER Because the SINR values for a partcular user are not ndependent, the order statstcs used n [3] cannot be appled. Indeed, the beam SINRs for the same user,.e. SINR,j n 2, for j, are correlated random varables as they nvolve the same channel vector h. The ordered SINRs for a gven user are denoted by γ Ns γ u γ. Snce for a user, the channels h and the noses n have statstcs whch are ndependent of, we omt the ndex n the followng. We show that the cdf of γ u, for 2 u, s gven by: F γ u γ = where = Ps σ and 2 Ns uy u γ y +y 2 +z+ f X u,y,y +,Z x, y, y 2, z dxdy dy 2dz. 3 f X u,y,y +,Z x, y, y 2, z = s u = Ns! y u xu 2 u! u! exp x + y + y 2 + z U y u x u! u 2! u y 2 x Ns u U y 2 x x >, y > u x, y 2 < ux, z > 4 where U. denotes the unt step functon and = Ppu P s. Proof: See the Appendx. By tang dervatve of 3 wth respect to γ, the pdf of γ u s gven by f γ u γ = f X u,y,y +,Z Ns uy u y + y 2 + z + γ y + y 2 + z +, y, y 2, z dy dy 2 dz. 5 We also show that the cdf of the largest SINR for a partcular user, denoted by γ, s gven by F γ γ = where f X,Y,Z x, y, z = γ y+z+ 2! f X,Y,Z x, y, z dxdydz. s = 6 y x Ns 2 exp x + y + z U y x 7 We omt here the proof of 7 due to the lac of space. After tang dervatve wth respect to γ, by applyng the bnomal theorem and usng equaton n [], we can 224
4 obtan the closed-form expresson for the pdf of the largest SINR per user, f γ γ, gven by: f γ γ = γj γ + 2! j+ exp γ d γ s = where Σ,j,d γ = d! d l= Σ 2,j,d γ = d+ l= Ns s 2 Ns 2 j= γ Ns 2 j γ + Ns 2 j + γ d d= Ns 2 j d Σ,j,d γ + Σ2,j,d γ U γ d+!j! j+! γ+ + j! γ γ d l!x+ l+ d+ l γ γ d+ l!γ+ l+ 7. SIMULATION RESULTS. d l j and 8 In ths secton, we present smulaton results of our proposed schedulng algorthm based on quantzed SINR feedbac. We compare the performance of the secondary system sum rate for the Lloyd-Max quantzaton and the unform quantzaton. Sum rate bps/hz Unform quant., b=2, smulaton 4 Unform quant., b=2, analyss Lloyd Max quant., b=2, smulaton 3.5 Lloyd Max quant., b=2, analyss Full feedbac, smulaton Full feedbac, analyss K: Number of secondary users Fg. 2. Sum rate versus the number K of secondary users for dfferent quantzaton schemes for b = 2, M = 4, = 3 and = 5 db Fgure 2 shows the sum rate versus the number K of secondary users for b = 2, M = 4, = 3 and = 5 db for the Lloyd-Max quantzaton and the unform quantzaton. It also shows the sum rate for the deal scheme [3] wth analog best beam SINR feedbac full feedbac. In fgure 2, the curves obtaned by usng the numercal results n and 2 red curves are compared to the smulaton results blue sold curves for the deal scheme and the two quantzaton schemes. The fgure shows that the analytcal curves are nlne wth the curves obtaned by smulatons. We notce that the sum rate ncreases wth the total number of cogntve users snce the mult-user dversty ncreases [4]. Moreover, t can be seen from the fgure that the use of dfferent quantzaton schemes leads to a loss n terms of throughput. However, the Lloyd-Max quantzer clearly outperforms the unform quantzer as expected. R loss bps/hz Unform quant., smulaton Unform quant., analyss Lloyd Max quant., smulaton Lloyd Max quant., analyss Number of quantzaton bts Fg. 3. Sum rate loss versus the number b of quantzaton bts for dfferent quantzaton schemes for K = 5, M = 4, = 3 and = 5 db Fgure 3 shows the sum rate loss versus the number b of quantzaton bts for the Lloyd-Max quantzer and the unform quantzer for K = 5, M = 4, = 3 and = 5 db. We notce that the curves obtaned by usng the numercal results n 9 red curves are nlne wth the smulaton results blue sold curves for the two quantzaton schemes consdered n ths fgure. We remar that the gap between the Lloyd-Max quantzer and the unform quantzer n terms of sum rate decreases as b ncreases. Moreover, for both quantzers, the sum rates converge to the one obtaned wth full feedbac as b ncreases. 8. CONCLUSIONS In ths paper, we consdered a SUs schedulng scheme based on opportunstc beamformng. We analyzed the mpact of SINR feedbac quantzaton on the throughput of the secondary system. In partcular, we derved the accurate statstcal characterzatons of ordered beams SINRs and we gave the exact analytcal expresson of the sum rate for the schedulng scheme based on quantzed SINR feedbac. We consdered the Lloyd-Max quantzer and we compared ts performance wth that of the unform quantzer. 9. APPENDIX Let X,j = h w j 2 for K and j, ordered as X > X2 >... > XNs, where Xu denotes the u-th largest value 2 u among the values X,j for j. We notce that SINR,j s the u-th largest beam SINR, for user, f and only f X,j = X u. Based on ths observaton, the u-th largest SINR of user, denoted γ u, 225
5 can be wrtten as: REFERENCES γ u = X u Y + Y + + Z + 9 where Y = u X =, Y + = X =u+, Z = g 2, = Ppu P s and = Ps σ. Snce for a user, the channels h 2 and the noses n have statstcs whch are ndependent of, we omt the ndex n the followng. The cdf of γ u can be calculated n terms of the jont pdf of X u, Y, Y + and Z, denoted by f Xu,Y,Y +,Z x, y, y 2, z, as F γ u γ = Ns uy u γ y +y 2 +z+ f X u,y,y +,Z x, y, y 2, z dxdy dy 2dz. 2 After tang dervatve wth respect to γ, the pdf of γ u s gven by Ns uy u f γ u γ = y + y 2 + z + f X u,y,y +,Z γ y + y 2 + z +, y, y 2, z dy dy 2 dz. 2 Applyng Bayesan rules, the jont pdf f X u,y,y +,Z x, y, y 2, z, can be obtaned as follows [9] f X u,y,y +,Z x, y, y 2, z = f X u x f Y y f Y + y 2 f Z z 22 where x >, y > u x, y 2 < ux, z >. Snce the random varables X,j, for a gven and j, are..d. random varables and have a gamma dstrbuton Γ,, f X u x, u, can be obtaned as [ [], Eq.2..6]: N f X u s! x = u! u! exp xns u exp ux 23 The pdfs f Y y and f Y + y 2 can be obtaned, respectvely, as [ [2], Eqs. 26, 27]: f Y y = y u x u 2 exp y + u x u 2! f Y + y 2 = u! s u = u y2 xns u exp y 2 exp x Ns u U y 2 x, 25 where U. denotes the unt step functon. The random varable Z follows the gamma dstrbuton Γ, and the PDF f Z z s gven by: f Z z = exp z. 26 Fnally, after proper substtuton, we can obtan the analytcal expresson gven n 4. [] J. Mtola and G. Q. Magure, Cogntve rado: Mang software rados more personal, IEEE Personal Communcatons, vol. 6, pp. 3 8, August 999. [2] A. Goldsmth, S. A. Jafar, I. Marc, and S. Srnvasa, Breang spectrum grdloc wth cogntve rados: An nformaton theoretc perspectve, Proceedngs of the IEEE, vol. 97, pp , May 29. [3] A. Massaoud, N. Sellam, and M. Sala, Schedulng scheme for cogntve rado networs wth mperfect channel nowledge, PIMRC, pp , 23. [4] M. Sharf and B. Hassb, On the capacty of MIMO broadcast channels wth partal sde nformaton, IEEE Transactons on Informaton Theory, vol. 5, pp , February 25. [5] C. Anton-Haro, On the mpact of pdf-matched quantzaton on orthogonal random beamformng, IEEE Communcatons Letters, vol., no. 4, pp , Aprl 27. [6] H.-C. Yang, P. Lu, H.-K. Sung, and Y. cha Ko, Exact sum-rate analyss of MIMO broadcast channels wth random untary beamformng based on quantzed snr feedbac, ICC, pp , May 28. [7] O. Ozdemr and M. Torla, Optmum feedbac quantzaton n an opportunstc beamformng scheme, IEEE Transactons on Wreless Communcatons, vol. 9, no. 5, pp , May 2. [8] S. Lloyd, Least squares quantzaton n PCM, IEEE Transactons on Informaton Theory, vol. 28, no. 2, pp , Mar 982. [9] H. Yang and M. Aloun, Order Statstcs n Wreless Communcatons: Dversty, Adaptaton, and Schedulng n MIMO and OFDM Systems. Cambrdge Unversty Press, 2. U y u x, [] I. S. Gradshteyn and I. M. Ryzh, Table Of Integrals, 24 Seres And Products. 7th Edton, Elsever, 27. [] H. A. Davd, Order Statstcs, N. J. W.. Sons, Ed. New Yor, 98. [2] Y.-C. Ko, H.-C. Yang, S.-S. Eom, and M.-S. Aloun, Adaptve modulaton wth dversty combnng based on output-threshold MRC, Wreless Communcatons, IEEE Transactons on, vol. 6, no., pp , October
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationLossy Compression. Compromise accuracy of reconstruction for increased compression.
Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost
More informationPower Allocation for Distributed BLUE Estimation with Full and Limited Feedback of CSI
Power Allocaton for Dstrbuted BLUE Estmaton wth Full and Lmted Feedback of CSI Mohammad Fanae, Matthew C. Valent, and Natala A. Schmd Lane Department of Computer Scence and Electrcal Engneerng West Vrgna
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationChapter 7 Channel Capacity and Coding
Wreless Informaton Transmsson System Lab. Chapter 7 Channel Capacty and Codng Insttute of Communcatons Engneerng atonal Sun Yat-sen Unversty Contents 7. Channel models and channel capacty 7.. Channel models
More informationAppendix B: Resampling Algorithms
407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles
More informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationChapter 7 Channel Capacity and Coding
Chapter 7 Channel Capacty and Codng Contents 7. Channel models and channel capacty 7.. Channel models Bnary symmetrc channel Dscrete memoryless channels Dscrete-nput, contnuous-output channel Waveform
More informationPulse Coded Modulation
Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationWhat would be a reasonable choice of the quantization step Δ?
CE 108 HOMEWORK 4 EXERCISE 1. Suppose you are samplng the output of a sensor at 10 KHz and quantze t wth a unform quantzer at 10 ts per sample. Assume that the margnal pdf of the sgnal s Gaussan wth mean
More informationError Probability for M Signals
Chapter 3 rror Probablty for M Sgnals In ths chapter we dscuss the error probablty n decdng whch of M sgnals was transmtted over an arbtrary channel. We assume the sgnals are represented by a set of orthonormal
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationThe Gaussian classifier. Nuno Vasconcelos ECE Department, UCSD
he Gaussan classfer Nuno Vasconcelos ECE Department, UCSD Bayesan decson theory recall that we have state of the world X observatons g decson functon L[g,y] loss of predctng y wth g Bayes decson rule s
More informationCLOSED-FORM CHARACTERIZATION OF THE CHANNEL CAPACITY OF MULTI-BRANCH MAXIMAL RATIO COMBINING OVER CORRELATED NAKAGAMI FADING CHANNELS
CLOSED-FORM CHARACTERIZATION OF THE CHANNEL CAPACITY OF MULTI-BRANCH MAXIMAL RATIO COMBINING OVER CORRELATED NAKAGAMI FADING CHANNELS Yawgeng A. Cha and Karl Yng-Ta Hang Department of Commncaton Engneerng,
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationPower Allocation/Beamforming for DF MIMO Two-Way Relaying: Relay and Network Optimization
Power Allocaton/Beamformng for DF MIMO Two-Way Relayng: Relay and Network Optmzaton Je Gao, Janshu Zhang, Sergy A. Vorobyov, Ha Jang, and Martn Haardt Dept. of Electrcal & Computer Engneerng, Unversty
More informationOptimal Bandwidth and Power Allocation for
Optmal Bandwdth and Power Allocaton for 1 Sum Ergodc Capacty under Fadng Channels n Cogntve Rado Networks arxv:1006.5061v1 [cs.it] 25 Jun 2010 Xaowen Gong, Student Member, IEEE, Sergy A. Vorobyov, Senor
More informationAn Upper Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control
An Upper Bound on SINR Threshold for Call Admsson Control n Multple-Class CDMA Systems wth Imperfect ower-control Mahmoud El-Sayes MacDonald, Dettwler and Assocates td. (MDA) Toronto, Canada melsayes@hotmal.com
More informationConsider the following passband digital communication system model. c t. modulator. t r a n s m i t t e r. signal decoder.
PASSBAND DIGITAL MODULATION TECHNIQUES Consder the followng passband dgtal communcaton system model. cos( ω + φ ) c t message source m sgnal encoder s modulator s () t communcaton xt () channel t r a n
More informationOPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION. Christophe De Luigi and Eric Moreau
OPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION Chrstophe De Lug and Erc Moreau Unversty of Toulon LSEET UMR CNRS 607 av. G. Pompdou BP56 F-8362 La Valette du Var Cedex
More informationI + HH H N 0 M T H = UΣV H = [U 1 U 2 ] 0 0 E S. X if X 0 0 if X < 0 (X) + = = M T 1 + N 0. r p + 1
Homework 4 Problem Capacty wth CSI only at Recever: C = log det I + E )) s HH H N M T R SS = I) SVD of the Channel Matrx: H = UΣV H = [U 1 U ] [ Σr ] [V 1 V ] H Capacty wth CSI at both transmtter and
More informationAntenna Combining for the MIMO Downlink Channel
Antenna Combnng for the IO Downlnk Channel arxv:0704.308v [cs.it] 0 Apr 2007 Nhar Jndal Department of Electrcal and Computer Engneerng Unversty of nnesota nneapols, N 55455, USA Emal: nhar@umn.edu Abstract
More informationAsymptotic Quantization: A Method for Determining Zador s Constant
Asymptotc Quantzaton: A Method for Determnng Zador s Constant Joyce Shh Because of the fnte capacty of modern communcaton systems better methods of encodng data are requred. Quantzaton refers to the methods
More informationTime Delay Estimation in Cognitive Radio Systems
Tme Delay Estmaton n Cogntve Rado Systems Invted Paper Fath Kocak, Hasar Celeb, Snan Gezc, Khald A. Qaraqe, Huseyn Arslan, and H. Vncent Poor Department of Electrcal and Electroncs Engneerng, Blkent Unversty,
More informationA Feedback Reduction Technique for MIMO Broadcast Channels
A Feedback Reducton Technque for MIMO Broadcast Channels Nhar Jndal Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455, USA Emal: nhar@umn.edu Abstract A multple antenna
More informationAmiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business
Amr s Supply Chan Model by S. Ashtab a,, R.J. Caron b E. Selvarajah c a Department of Industral Manufacturng System Engneerng b Department of Mathematcs Statstcs c Odette School of Busness Unversty of
More informationComposite Hypotheses testing
Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter
More informationx = x 1 + :::+ x K and the nput covarance matrces are of the form ± = E[x x y ]. 3.2 Dualty Next, we ntroduce the concept of dualty wth the followng t
Sum Power Iteratve Water-fllng for Mult-Antenna Gaussan Broadcast Channels N. Jndal, S. Jafar, S. Vshwanath and A. Goldsmth Dept. of Electrcal Engg. Stanford Unversty, CA, 94305 emal: njndal,syed,srram,andrea@wsl.stanford.edu
More informationFAST CONVERGENCE ADAPTIVE MMSE RECEIVER FOR ASYNCHRONOUS DS-CDMA SYSTEMS
Électronque et transmsson de l nformaton FAST CONVERGENCE ADAPTIVE MMSE RECEIVER FOR ASYNCHRONOUS DS-CDMA SYSTEMS CĂLIN VLĂDEANU, CONSTANTIN PALEOLOGU 1 Key words: DS-CDMA, MMSE adaptve recever, Least
More informationChapter 12. Ordinary Differential Equation Boundary Value (BV) Problems
Chapter. Ordnar Dfferental Equaton Boundar Value (BV) Problems In ths chapter we wll learn how to solve ODE boundar value problem. BV ODE s usuall gven wth x beng the ndependent space varable. p( x) q(
More informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationNumerical Solution of Ordinary Differential Equations
Numercal Methods (CENG 00) CHAPTER-VI Numercal Soluton of Ordnar Dfferental Equatons 6 Introducton Dfferental equatons are equatons composed of an unknown functon and ts dervatves The followng are examples
More informationx = , so that calculated
Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to
More informationAverage Decision Threshold of CA CFAR and excision CFAR Detectors in the Presence of Strong Pulse Jamming 1
Average Decson hreshold of CA CFAR and excson CFAR Detectors n the Presence of Strong Pulse Jammng Ivan G. Garvanov and Chrsto A. Kabachev Insttute of Informaton echnologes Bulgaran Academy of Scences
More informationGlobal Sensitivity. Tuesday 20 th February, 2018
Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values
More informationOn an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1
On an Extenson of Stochastc Approxmaton EM Algorthm for Incomplete Data Problems Vahd Tadayon Abstract: The Stochastc Approxmaton EM (SAEM algorthm, a varant stochastc approxmaton of EM, s a versatle tool
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationA Distributed Spectrum Sharing Algorithm in Cognitive Radio Networks
A Dstrbuted Spectrum Sharng Algorthm n Cogntve Rado Networks We Sun, Tong Lu, Yanmn Zhu, Bo L Shangha Jao Tong Unversty Hong Kong Unversty of Scence and Technology Emal: {sunwt,lutong2569164,yzhu}@sjtu.edu.cn,
More informationThe Concept of Beamforming
ELG513 Smart Antennas S.Loyka he Concept of Beamformng Generc representaton of the array output sgnal, 1 where w y N 1 * = 1 = w x = w x (4.1) complex weghts, control the array pattern; y and x - narrowband
More informationJoint Scheduling and Power-Allocation for Interference Management in Wireless Networks
Jont Schedulng and Power-Allocaton for Interference Management n Wreless Networks Xn Lu *, Edwn K. P. Chong, and Ness B. Shroff * * School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette,
More informationComments on Detecting Outliers in Gamma Distribution by M. Jabbari Nooghabi et al. (2010)
Comments on Detectng Outlers n Gamma Dstrbuton by M. Jabbar Nooghab et al. (21) M. Magdalena Lucn Alejandro C. Frery September 17, 215 arxv:159.55v1 [stat.co] 16 Sep 215 Ths note shows that the results
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationRate Constrained Power Control in Space-Time Coded Fading Ad-Hoc Networks
Rate Constraned Power Control n Space-Tme Coded Fadng Ad-Hoc Networks Homayoun Yousef zadeh Lynn Zheng Hamd Jafarkhan Department of EECS, UCI [hyousef, llzheng,hamdj]@uc.edu Outlne Problem Descrpton Lterature
More informationDr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur
Analyss of Varance and Desgn of Exerments-I MODULE III LECTURE - 2 EXPERIMENTAL DESIGN MODELS Dr. Shalabh Deartment of Mathematcs and Statstcs Indan Insttute of Technology Kanur 2 We consder the models
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationSolving Nonlinear Differential Equations by a Neural Network Method
Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,
More informationFirst Year Examination Department of Statistics, University of Florida
Frst Year Examnaton Department of Statstcs, Unversty of Florda May 7, 010, 8:00 am - 1:00 noon Instructons: 1. You have four hours to answer questons n ths examnaton.. You must show your work to receve
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationDistributed parameter estimation in wireless sensor networks using fused local observations
Dstrbuted parameter estmaton n wreless sensor networks usng fused local observatons Mohammad Fanae, Matthew C. Valent, Natala A. Schmd, and Marwan M. Alkhweld Lane Department of Computer Scence and Electrcal
More informationCognitive Access Algorithms For Multiple Access Channels
203 IEEE 4th Workshop on Sgnal Processng Advances n Wreless Communcatons SPAWC) Cogntve Access Algorthms For Multple Access Channels Ychuan Hu and Alejandro Rbero, Department of Electrcal and Systems Engneerng,
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationA Lower Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control
A ower Bound on SIR Threshold for Call Admsson Control n Multple-Class CDMA Systems w Imperfect ower-control Mohamed H. Ahmed Faculty of Engneerng and Appled Scence Memoral Unversty of ewfoundland St.
More informationThe Expectation-Maximization Algorithm
The Expectaton-Maxmaton Algorthm Charles Elan elan@cs.ucsd.edu November 16, 2007 Ths chapter explans the EM algorthm at multple levels of generalty. Secton 1 gves the standard hgh-level verson of the algorthm.
More informationLinear Regression Analysis: Terminology and Notation
ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented
More informationDFT-based Beamforming Weight-Vector Codebook Design for Spatially Correlated Channels in the Unitary Precoding Aided Multiuser Downlink
DFT-based Beamformng Weght-Vector Codeboo Desgn for Spatally Correlated Channels n the Untary Precodng Aded Multuser Downln Du Yang Le-Lang Yang and Lajos Hanzo School of ECS Unversty of Southampton SO7
More informationOn the achievable rates of multiple antenna broadcast channels with feedback-link capacity constraint
Chen et al. EURASI Journal on Wreless Communcatons and Networkng 2, 2:2 http://jwcn.euraspjournals.com/content/2//2 RESEARCH Open Access On the achevable rates of multple antenna broadcast channels wth
More informationDepartment of Statistics University of Toronto STA305H1S / 1004 HS Design and Analysis of Experiments Term Test - Winter Solution
Department of Statstcs Unversty of Toronto STA35HS / HS Desgn and Analyss of Experments Term Test - Wnter - Soluton February, Last Name: Frst Name: Student Number: Instructons: Tme: hours. Ads: a non-programmable
More informationArizona State University
SCHEDULING AND POWER ALLOCATION TO OPTIMIZE SERVICE AND QUEUE-WAITING TIMES IN COGNITIVE RADIO UPLINKS By arxv:1601.00608v1 [cs.it] 4 Jan 2016 Ahmed Emad Ewasha Commttee: Dr. Chan Tepedelenloğlu, Char
More informationMIMO Systems and Channel Capacity
MIMO Systems and Channel Capacty Consder a MIMO system wth m Tx and n Rx antennas. x y = Hx ξ Tx H Rx The power constrant: the total Tx power s x = P t. Component-wse representaton of the system model,
More informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationDistributed Power Control for Interference-Limited Cooperative Relay Networks
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the IEEE ICC 2009 proceedngs Dstrbuted Power Control for Interference-Lmted Cooperatve
More informationOptimal Resource Allocation in Full-Duplex Wireless-Powered Communication Network
1 Optmal Resource Allocaton n Full-Duplex Wreless-owered Communcaton Network Hyungsk Ju and Ru Zhang, Member, IEEE arxv:143.58v3 [cs.it] 15 Sep 14 Abstract Ths paper studes optmal resource allocaton n
More informationChapter 8 SCALAR QUANTIZATION
Outlne Chapter 8 SCALAR QUANTIZATION Yeuan-Kuen Lee [ CU, CSIE ] 8.1 Overvew 8. Introducton 8.4 Unform Quantzer 8.5 Adaptve Quantzaton 8.6 Nonunform Quantzaton 8.7 Entropy-Coded Quantzaton Ch 8 Scalar
More informationLecture 4: November 17, Part 1 Single Buffer Management
Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input
More informationLINEAR REGRESSION ANALYSIS. MODULE VIII Lecture Indicator Variables
LINEAR REGRESSION ANALYSIS MODULE VIII Lecture - 7 Indcator Varables Dr. Shalabh Department of Maematcs and Statstcs Indan Insttute of Technology Kanpur Indcator varables versus quanttatve explanatory
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationIntroduction to Information Theory, Data Compression,
Introducton to Informaton Theory, Data Compresson, Codng Mehd Ibm Brahm, Laura Mnkova Aprl 5, 208 Ths s the augmented transcrpt of a lecture gven by Luc Devroye on the 3th of March 208 for a Data Structures
More informationj) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1
Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons
More informationPop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing
Advanced Scence and Technology Letters, pp.164-168 http://dx.do.org/10.14257/astl.2013 Pop-Clc Nose Detecton Usng Inter-Frame Correlaton for Improved Portable Audtory Sensng Dong Yun Lee, Kwang Myung Jeon,
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationModelli Clamfim Equazione del Calore Lezione ottobre 2014
CLAMFIM Bologna Modell 1 @ Clamfm Equazone del Calore Lezone 17 15 ottobre 2014 professor Danele Rtell danele.rtell@unbo.t 1/24? Convoluton The convoluton of two functons g(t) and f(t) s the functon (g
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationChapter - 2. Distribution System Power Flow Analysis
Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationEnergy Efficient Resource Allocation for Quantity of Information Delivery in Parallel Channels
TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES Trans. Emergng Tel. Tech. 0000; 00: 6 RESEARCH ARTICLE Energy Effcent Resource Allocaton for Quantty of Informaton Delvery n Parallel Channels Jean-Yves
More informationColor Rendering Uncertainty
Australan Journal of Basc and Appled Scences 4(10): 4601-4608 010 ISSN 1991-8178 Color Renderng Uncertanty 1 A.el Bally M.M. El-Ganany 3 A. Al-amel 1 Physcs Department Photometry department- NIS Abstract:
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationDUE: WEDS FEB 21ST 2018
HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant
More informationMaximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models
ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Maxmum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models
More informationSTAT 511 FINAL EXAM NAME Spring 2001
STAT 5 FINAL EXAM NAME Sprng Instructons: Ths s a closed book exam. No notes or books are allowed. ou may use a calculator but you are not allowed to store notes or formulas n the calculator. Please wrte
More informationDistributed Non-Autonomous Power Control through Distributed Convex Optimization
Dstrbuted Non-Autonomous Power Control through Dstrbuted Convex Optmzaton S. Sundhar Ram and V. V. Veeravall ECE Department and Coordnated Scence Lab Unversty of Illnos at Urbana-Champagn Emal: {ssrnv5,vvv}@llnos.edu
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationOutage Probability of Macrodiversity Reception in the Presence of Fading and Weibull Co- Channel Interference
ISSN 33-365 (Prnt, ISSN 848-6339 (Onlne https://do.org/.7559/tv-67847 Orgnal scentfc paper Outage Probablty of Macrodversty Recepton n the Presence of Fadng and Webull Co- Channel Interference Mloš PERIĆ,
More informationCHAPTER 14 GENERAL PERTURBATION THEORY
CHAPTER 4 GENERAL PERTURBATION THEORY 4 Introducton A partcle n orbt around a pont mass or a sphercally symmetrc mass dstrbuton s movng n a gravtatonal potental of the form GM / r In ths potental t moves
More informationComparison of Regression Lines
STATGRAPHICS Rev. 9/13/2013 Comparson of Regresson Lnes Summary... 1 Data Input... 3 Analyss Summary... 4 Plot of Ftted Model... 6 Condtonal Sums of Squares... 6 Analyss Optons... 7 Forecasts... 8 Confdence
More informationEqual-Optimal Power Allocation and Relay Selection Algorithm Based on Symbol Error Probability in Cooperative Communication
INTERNATIONAL JOURNAL OF COUNICATIONS Volume 1, 18 Equal-Optmal Power Allocaton and Relay Selecton Algorthm Based on Symbol Error Probablty n Cooperatve Communcaton Xn Song, Syang Xu and ngle Zhang Abstract
More informationUncertainty as the Overlap of Alternate Conditional Distributions
Uncertanty as the Overlap of Alternate Condtonal Dstrbutons Olena Babak and Clayton V. Deutsch Centre for Computatonal Geostatstcs Department of Cvl & Envronmental Engneerng Unversty of Alberta An mportant
More informationA NEW DISCRETE WAVELET TRANSFORM
A NEW DISCRETE WAVELET TRANSFORM ALEXANDRU ISAR, DORINA ISAR Keywords: Dscrete wavelet, Best energy concentraton, Low SNR sgnals The Dscrete Wavelet Transform (DWT) has two parameters: the mother of wavelets
More informationRethinking MIMO for Wireless Networks: Linear Throughput Increases with Multiple Receive Antennas
Retnng MIMO for Wreless etwors: Lnear Trougput Increases wt Multple Receve Antennas ar Jndal Unversty of Mnnesota Unverstat Pompeu Fabra Jont wor wt Jeff Andrews & Steven Weber MIMO n Pont-to-Pont Cannels
More informationDETERMINATION OF UNCERTAINTY ASSOCIATED WITH QUANTIZATION ERRORS USING THE BAYESIAN APPROACH
Proceedngs, XVII IMEKO World Congress, June 7, 3, Dubrovn, Croata Proceedngs, XVII IMEKO World Congress, June 7, 3, Dubrovn, Croata TC XVII IMEKO World Congress Metrology n the 3rd Mllennum June 7, 3,
More information6.3.7 Example with Runga Kutta 4 th order method
6.3.7 Example wth Runga Kutta 4 th order method Agan, as an example, 3 machne, 9 bus system shown n Fg. 6.4 s agan consdered. Intally, the dampng of the generators are neglected (.e. d = 0 for = 1, 2,
More informationLow Complexity Soft-Input Soft-Output Hamming Decoder
Low Complexty Soft-Input Soft-Output Hammng Der Benjamn Müller, Martn Holters, Udo Zölzer Helmut Schmdt Unversty Unversty of the Federal Armed Forces Department of Sgnal Processng and Communcatons Holstenhofweg
More information