Collision Detection in IEEE Networks by Error Vector Magnitude Analysis
|
|
- Colleen Green
- 6 years ago
- Views:
Transcription
1 Collson Detecton n IEEE 80. Networks by Error Vector Magntude Analyss Muhammad Naveed Aman, Wa Kn Chan, and Bplab Skdar Department of ECSE, Department of ISE Rensselaer Polytechnc Insttute, Troy, NY 80 USA Abstract There are two causes of packet losses durng a wreless transmsson: losses caused by collsons and losses caused by poor channel condtons. The throughput and spatal reuse of IEEE 80. based wreless networks, as well as the effectveness of the rate adaptaton algorthms they use, s adversely affected by ther nablty to determne the real cause of a packet loss. To address ths ssue, ths paper proposes a mechansm based on Error Vector Magntude EVM) to dscern random channel errors from collsons n wreless networks. The proposed mechansm s based on frst developng an analytc model to characterze the EVM of a packet n the presence and absence of a collson. A threshold based classfer s then proposed that selects the threshold value such that the crossover error rate s acheved. Smulaton results are presented to demonstrate the accuracy of the proposed collson detecton mechansm. I. INTRODUCTION Wred networks lke Ethernet IEEE 80.3) use carrer sense multple access wth collson detecton CSMA/CD) as the bass for medum access control. A wred network can detect collsons because of ts ablty to lsten at the same tme t transmts. The wreless envronment brngs wth t dfferent challenges, one of them beng the dffculty to transmt and receve at the same tme. Moreover, whle a node n a wred network can receve every other node s transmssons, a node on a wreless network may be too far or hdden) from certan other nodes to receve ther transmssons and vce versa) [6]. Thus, wreless networks lke IEEE 80. use a mechansm called carrer sense multple access wth collson avodance CSMA/CA) at the MAC layer. The physcal layer of IEEE 80. delvers a packet to the MAC layer only f t has been receved correctly, otherwse the packet s dscarded. A fundamental ssue wth the use of CSMA/CA based protocols s that upper layers are unaware of the reason why a packet was dscarded at the physcal layer. In general, a packet may be dscarded due to two causes: a weak sgnal due to attenuaton and multpath characterstcs of the envronment) or nterference due to concurrent transmssons from other neghborng devces. However, the MAC layer of IEEE 80. s unaware of the cause of the packet loss, resultng n loss of performance. The nablty to detect collsons and dstngushng them from channel errors causes a waste of bandwdth due to the colldng transmsson), and an unnecessary delay due to performng a backoff. To address ths ssue, ths paper ntroduces a mechansm to detect the cause of a packet loss n wreless networks usng IEEE 80. as the MAC protocol. Determnng the actual cause of packet loss n wreless networks helps the MAC layer n makng ntellgent decsons. If a packet loss occurred due to a collson, an exponental backoff should be performed. Whereas, f a packet loss was the result of channel errors then a data rate adaptaton algorthm should be nvoked - possbly reducng the data rate and/or ncreasng the transmt power. It has been shown n [] that knowledge of the cause of a packet loss can ncrease the throughput by 0-60% whle reducng the retransmssons by 40%, dependng upon the channel condtons. From the above dscusson t s clear that the cause of a packet loss should be used by the MAC layer to mprove performance n wreless networks. A small number of technques have been proposed n lterature for collson detecton n wreless networks. A mechansm for collson detecton called CARA has been proposed n [3], and s based on the use of multple RTS/CTS packets. RRAA [] uses the CARA based RTS/CTS scheme to nfer whether a packet loss s due to a collson or weak sgnal. A method to solate physcal packet errors from collson packet errors usng RTS/CTS and packet fragmentaton s gven n [4]. These approaches requre the observaton and transmsson of multple RTS/CTS packets, thus requrng a long tme to solate the cause of a packet loss. In contrast, our approach to collson detecton s more drect and s based on a metrc that can be obtaned mmedately from the receved packet, thus gvng us mmedate results n real tme. In [] a scheme for collson detecton s proposed usng three channel qualty related metrcs and a metrc vote. Smulaton results presented n ths paper show that our proposed technque leads to sgnfcant reducton n the false postve rates and comparable detecton accuracy. A. Key Contrbutons The followng are the major contrbutons of ths work. ) Characterzaton of EVM n the presence of collsons: In ths paper, we present an analytc model for the statstcal behavor of EVM for the purpose of collson detecton n wreless networks. Usng a realstc model for wreless communcaton, we evaluate the probablty dstrbuton functon PDF) of EVM. Ths model s then used to derve analytcal expressons that relate key parameters characterzng the cause of a packet loss to the statstcal behavor of EVM. ) Mechansm for Collson Detecton: Ths paper proposes a mechansm to detect collsons usng EVM. The collson
2 TABLE I ALLOWED EVM VALUES VERSUS DATA RATE IN IEEE 80. Data rate Mbts/s) EVM db) EVM %) Fg.. Illustraton of Error Vector detecton mechansm s based on usng a threshold for the EVM to classfy packets nto collson or non-collson packets. To obtan the threshold, we frst develop an analytc model to characterze the EVM n the presence and absence of collsons. The optmum EVM threshold for classfcaton s then determned by dervng the threshold that leads to equal false postve and false negatve rates. We evaluate the effectveness of our collson detecton mechansm by usng extensve smulatons. The rest of ths paper s organzed as follows. Secton II presents an analytc model for the EVM under dfferent nterference scenaros. The model for EVM s used n Secton III to determne the threshold for classfyng the cause of a packet loss. Fnally, Secton IV presents the detals of the smulaton model, Secton V presents the smulaton results and Secton VI concludes the paper. II. ANALYSIS OF EVM FOR COLLISION DETECTION In ths secton we present a model to characterze the PDF of EVM n the presence and absence of collsons. Ths model s then used n the next secton to develop a classfer for determnng the cause of each packet loss. An error vector s the dfference between the complex voltage value of an deal symbol and the actual receved symbol. The root-mean-squared value of the error vector s defned as EVM. If X k denotes the reference or transmtted sgnal and Y k denotes the receved dstorted) sgnal, then Fgure shows the error vector E k = Y k X k. Then the EVM s defned as [0]: N k=0 EV M RMS = Y k X k N k=0 = E k P 0 P 0 ) where P 0 s the average power of all the symbols for a gven modulaton, and N s the number of receved symbols. P 0 normalzes the EVM so that t does not depend on the modulaton order. A transmtted OFDM sgnal may experence varous dstortons durng transmsson, resultng n hgh values of EVM. The standards specfy lmts on the EVM to ensure satsfactory n-band performance [5]. The thresholds for EVM, as specfed n the IEEE 80. standard [9], are gven Table I. Let us denote the transmtter by T x, the recever by R x, and the nterference by ζ J where J s the number of nterferers). Let us consder an OFDM system wth N subcarrers. We assume a frequency flat multpath Raylegh fadng channel. The receved tme doman OFDM sgnal y n s gven by y n = H n x n + η n + ζ n ) where H n denotes the Raylegh dstrbuted channel coeffcents, η n s the addtve whte Gaussan nose wth zero-mean and varance ση, and ζ n s the nterference due to a collson). x n s the n th tme doman OFDM sgnal, 0 n N. Then x n can be obtaned from X k, the M-QAM modulated symbol at the k th subcarrer as [7], x n = IDF T {X k } = k=0 X k e jπkn/n 3) where k = 0,,, N. If the number of subcarrers N s large, the real and magnary parts of x n are approxmately..d. Gaussan dstrbuted wth zero-mean and varance σ x [5]. If we assume frequency flat fadng, we can replace the convoluton operator n Equaton ) wth a multplcaton and rewrte Equaton ), as y n = H n x n + η n + ζ n. 4) Let us ntroduce a random varable Z defned as Z = E k. 5) N P 0 k=0 Let e n denote the error vector n the tme doman.e., e n = y n x n. We also know that e n = IDFT{E k } and y n = IDFT{Y k }. Therefore, applyng Parseval s theorem, we can rewrte Equaton 5) as Z = e n. 6) N P 0 Observng Equatons 5) and 6), we see that Z s composed of the sum of N..d. random varables. Applyng the central lmt theorem for large N typcally N = 5 for IEEE
3 80.a), we can approxmate Z by a Gaussan dstrbuton wth probablty densty functon PDF) f Z z) = e z µz ) σ Z. 7) πσ Z To obtan the pdf f Z z) of Z, we need to fnd ts mean µ Z ) and varance σz ). µ Z and σz wll have dfferent values for dfferent types of dstortons, and we are nterested n fndng them for packets nvolved n a collson. We frst evaluate µ Z and σz for the case when there s no collson. In ths case the error vector s gven by e n = H n x n + η n x n = x n H n ) + η n. 8) We assume the standard path loss law lr) = r, and take r α α as the mean power for a Raylegh dstrbuted channel H n ). To fnd µ Z, we have ε{z} = µ Z = N P 0 = P 0 [σ x ε{ e n } ) ] π + r α + ση 3) where ε{e n} s gven by Equaton 9). To fnd the varance of Z, we need to evaluate ε{z } gven as follows: ) Z = e n = NP 0 N P0 e n e n. 4) n =0 n =0 We now assume block fadng wth a block length of m symbols. Then Equaton 4) can be re-wrtten as [ Z = m ) m m N P0 e n 4 + e n e n + n =0 n =0 n =0 n =m m ) m m m m e n 4 + e n e n + e n e n n =m n =m + + n =β n =β n =mn =0 e n 4 + n =β n =0 n =mn =m β e n e n. 5) where β = N m. Takng the expectaton of Equaton 5), we get ε{z } = [ NP0 mε{e 4 n} + N m) ε{e n} ) ] 6) where ε{e n} and ε{e 4 n} are gven by Equatons 9) and 0), respectvely. Combnng Equatons 3) and 6), we can obtan the varance of Z as σ Z = ε{z } µ Z ). Now consder the case when a packet s corrupted due to the nterference caused by collson from other concurrent transmssons. We assume a wreless network wth J nterferers at dstance r j > 0 from R x, that transmt wth a probablty p ndependent of each other. We assume that the startng locaton of a collson wthn a packet s unformly dstrbuted between 0 and N. If a collson starts at OFDM symbol n 0, the error vector can be wrtten as { e en n < n n = 0 7) e n + ζ J n n 0 where ζ J s gven as follows ζ J = J B H r W. 8) =0 Here B s are..d. Bernoull random varables wth parameter p, H r s Raylegh dstrbuted wth mean power /r α, and W s the OFDM symbol transmtted by nterferer, whch s approxmately..d. Gaussan dstrbuted wth zero-mean and varance σx. We can then rewrte Equaton 6) as follows: Z = NP 0 n0 e n + n=n 0 e n + ζ J ) ). 9) Takng the expectaton of Equaton 9), we get ε{z } = µ Z = { } ) π σx P 0 r α + r α + ση ) J N + + pσx. 0) N P 0 r α j=0 j Smlarly, to get the varance of Z, we need to evaluate ε{z }, whch s gven by Z = = N P 0 N P 0 n =0 n =0 [ n0 n =n 0 n =0 n 0 n =0 n =0 n 0 e n e n e n e n + e n e n + n =n 0 n 0 n =0 e n e n + n =n 0 ] n =n 0 e n Takng the expectaton of Equaton ), we get ε{z } = N P 0 e n [ n 0.mε{e 4 n} + n 0 n 0 m) ε{e n} ) +.) n 0 N n 0 )ε{e n}ε{e n } + mn n 0 )ε{e n4 } + ) ] N n 0 )N n 0 m) ε{e n }. ) Takng the expectaton of Equaton 3) w.r.t. n 0, we get ε{z }= [ N P0 mn )ε{e4 n}+ 3 N ) ) ε{e mn ) n} ) + )) N + N ) ε{e 3 n}ε{e n }+ mn + )ε{e n4 } + N +N + ) ) ) ] 3 m N + ) ε{e n }. 3)
4 ε{e n} = σ x { ε{e 4 n} = 3σ 4 x) } π + r α + ση 9) ) 8 r α 4 r 3 α + π + { } ε{e n π } = σx + + ση + pσx ε{e n4 } = [ 3σ 4 x) [ { 6 σx r α 8 r α 4 + r 3 α r α π + J r α j=0 j + 3σ η + 6σ xσ η ) π + + 3ση + 6σxσ η } ] + ση pσx J r α j=0 j + 6pσx 4 J j=0 r α j ) π r α + )] π r α + + 0) ) ) where ε{e n} and ε{e 4 n} are gven by Equatons 9) and 0), respectvely, whle ε{e n } and ε{e n } are gven by Equatons ) and ), respectvely. Thus, we can now obtan the varance of Z as σ Z = ε{z } µ Z ). III. THRESHOLD BASED COLLISION DETECTION In ths secton we descrbe our threshold based mechansm for collson detecton and present the methodology for obtanng the threshold. The proposed collson detecton method s based on notng the dfference n the pdf of EVM n the presence of a collson. To classfy the cause of each packet loss, we frst calculate the EVM of each receved packet. Ths calculated EVM value s then compared aganst a threshold value. If the calculated EVM value s greater than the threshold, the packet s classfed as a collson, and vce versa. The optmum value of the threshold s determned by choosng the threshold value that leads to equal false postve and false negatve rates.e., the threshold that leads to the crossover error rate). The probablty of a false postve s defned as the probablty that the cause of a packet loss s attrbuted to a collson, whle the actual cause was a weak sgnal not a collson). If we denote the threshold by γ, then the probablty of a false postve s gven by γ ] P Z [Z > γ] = P e [ f Z z) dz 4) where P e s the symbol error rate for an M-QAM system. Smlarly the probablty of a false negatve s defned as the probablty that the cause of a packet loss s attrbuted to a weak sgnal, whle the actual cause was a collson. The probablty of a false negatve can be expressed as follows: [ γ ] P Z [Z γ] = P e f Z z ) dz. 5) To obtan the threshold that leads to the crossover error rate, we can fnd γ by equatng Equatons 4) and 5). Thus, to get the threshold we need to solve the followng equaton numercally: γ TABLE II PARAMETERS FOR FINDING THE THRESHOLD Parameter Value P 0 QPSK), 06QAM), 464QAM) σx 0.5 ση r meters) 3 r j meters) 3, 0, 5, 0, 30 α N 3 m 6 TABLE III THRESHOLDS FOR DETECTING COLLISIONS Modulaton Type Threshold for Z Threshold db) QPSK Mbps) QAM 4Mbps) QAM 48Mbps) γ f Z z) dz + f Z z ) dz =. 6) Usng the parameter values gven n Table II, the numercal solutons for the threshold γ absolute value and n db scale) for Mbps QPSK), 4Mbps 6QAM), and 48Mbps 64QAM) are gven n Table III. IV. SIMULATION MODEL In ths secton we descrbe the smulaton model used to evaluate the proposed collson detecton mechansm. The smulator was created n MATLAB/Smulnk. The transmtter and recever models were desgned accordng to the IEEE 80.a specfcatons [9]. The wreless nodes n the smulaton are connected through a frequency flat multpath Raylegh fadng channel. The channel s realzed through the Jake s model [8]. OFDM s used at the physcal layer. The modulaton related
5 Data rate Mbts/s) TABLE IV MODULATION PARAMETERS Modulaton Codng rate R) Coded bts per subcarrer N BP SC ) Coded bts per OFDM symbol N CBP S ) 6 BPSK / BPSK 3/ QPSK / QPSK 3/ QAM / QAM 3/ QAM / QAM 3/ Data bts per OFDM symbol N DBP S ) Fg. 3. Comparson of False Postve Rates Parameter TABLE V TIMING RELATED PARAMETERS Value N SY M : Samples per OFDM symbol 80 N F F T : FFT Length 64 N SD : Number of data subcarrers 48 N SP : Number of plot subcarrers 4 N ST : Number of total subcarrers 5 N SD + N SP ) N T RAIN : Number of tranng symbols F : Subcarrer frequency spacng 0.35 MHz =0 MHz/64) T F F T : IFFT/FFT perod 3.µs/ F ) T P REAMBLE : Preamble duraton 8µs T GI : Guard Interval GI) duraton 0.8µs T F F T /4) T GI : Tranng symbol GI duraton 8µs T SY M : Symbol nterval 4µs T GI + T F F T ) T LONG : Tranng sequence duraton 8µs T GI + xt F F T ) parameters are gven n Table IV, whle the OFDM tmng related parameters are gven n Table V. The network topology used n our smulatons s shown n Fgure. We have two transmtters T and T ) and one recever R) n our network. T acts as the nterferer and ntroduces collsons nto the network. The frame sze for T s fxed at 3 OFDM symbols, whle the frame sze of T s unformly dstrbuted between and 3 OFDM symbols. By varyng the frame sze of the nterferer T ) we can smulate collsons occurrng between packets of dfferent sze. The smulator also allows us to change the probablty of collson n the network, gvng us flexblty n terms of controllng our experment. Fg.. Scenaro for ntroducng collsons To model hgh moblty usage scenaros, the wreless channel assumes a maxmum Doppler frequency of 00Hz. A hgh Doppler frequency also ncreases the probablty of packet loss due to a weak sgnal. From the dscusson n Secton II t s clear that EVM does not depend on the modulaton order, therefore we do not need to consder all the possble data rates. We smulate data rates of Mbps QPSK), 4Mbps 6QAM), and 48Mbps 64QAM). V. RESULTS In ths secton we present smulaton results to evaluate the performance of the proposed collson detecton mechansm. We also compare the performance of the proposed mechansm wth the most accurate detecton mechansm n exstng lterature: a scheme proposed n [] that uses three metrcs, receved sgnal strength, bt error rate and errors per symbol, to classfy packets. The mechansm proposed n [] uses a metrc vote,.e., whenever at least one of the metrcs ndcates a collson, the cause of packet loss s classfed as a collson. The performance of the proposed detecton mechansm s evaluated n terms of two metrcs: the false postve rate defned as the proporton of the number of channel losses that were classfed as collson losses) and the accuracy defned as the proporton of the total number of classfcatons that were correct). The smulaton settngs used for obtanng the results are gven n Secton IV. Fgure 3 compares the false postve rates of the proposed mechansm and the mechansm from [] as a functon of the dstance between the nterferer and the recever. We observe that the proposed mechansm has very low false postve rates and outperforms the classfer proposed n []. The correspondng accuraces for the two schemes s shown n Fgure 4. We observe that whle the scheme from [] has better accuracy when the dstance between the recever and the nterferer s small, our method performs better as ths dstance ncreases. However, t s mportant to note that the accuracy of the mechansm n [] depends on the tranng data that s used to set ts thresholds. In the smulaton results reported here, the tranng and evaluaton scenaros were qute smlar, and the hgh accuracy s not surprsng. In contrast, our mechansm
6 VI. CONCLUSIONS Ths paper proposed a mechansm based on EVM to determne the root cause of a packet loss n a wreless lnk. The proposed methodology s based on evaluatng the EVM value assocated wth a packet and comparng t aganst a threshold value. An analytc model s proposed to determne the threshold value such that the crossover error rate s acheved. The proposed mechansm s compatble wth exstng OFDM based IEEE 80. hardware and protocol specfcatons. The accuracy of the proposed mechansm was evaluated and establshed through extensve smulaton results. Fg. 4. Comparson of Accuracy does not depend on any tranng data and s thus expected to be more robust n a varety of envronments. In addton, the mechansm n [] needs three metrcs and thus has a hgher complexty and overhead. The proposed scheme, however, s based on only one metrc. Overall, the proposed mechansm outperforms the mechansm n [] n terms of the false postve rates and has comparable performance n terms of the accuracy, and ths performance s acheved at lower complexty and greater robustness. Fnally we note that another metrc for comparng the performance of the classfers s the false negatve rate, defned as the proporton of collsons that were ncorrectly classfed as channel errors. Compared to the false negatves, the false postves have a more sgnfcant effect on the performance of a collson detecton mechansm. A hgher false postve rate wll result n an ncrease n the number of backoffs and retransmssons. Thus t s desrable to keep the false postve rate as low as possble and the results show that the proposed mechansm s better at achevng ths objectve, as compared to the mechansm n []. REFERENCES [] S. Rayanchu, A. Mshra, D. Agrawal, S. Saha, S. Benerjee, Dagnosng Wreless Packet Losses n 80.: Separatng Collson from Weak Sgnal, Proc. IEEE INFOCOM, Phoenx, AZ, Aprl 008. [] S. H. Wong, H. Yang, L. Lu, and B. Bhargavan, Robust Rate Adaptaton n 80. Wreless Networks, Proc. ACM MOBICOM, Los Angeles, CA, September 006. [3] J. Km, S. Km, S. Cho, and D. Qao, CARA: Collson-aware rate adaptaton for 80. WLANs, Proc. IEEE INFOCOM, Barcelona, Span, March 006. [4] M. A. Y. Khan, and D. Vetch, Isolatng Physcal PER for Smart Rate Selecton n 80., Proc. IEEE INFOCOM, Ro de Jenero, Brazl, Aprl 009. [5] C. Zhao, and R.J. Baxley, Error Vector Magntude Analyss for OFDM Systems, Sgnals, Systems and Computers, 006. ACSSC 06. Forteth Aslomar Conference on, October 006. [6] L. L. Peterson, and B. S. Dave, Computer Networks - A systems Approach, Elsever Inc., 007. [7] Y. S. Choo, J. Km, W. Y. Yang, and C. G. Kang, MIMO-OFDM Wreless Communcatons wth MATLAB, IEEE press, 00. [8] W. C. Jakes, Mcrowave Moble Communcatons, IEEE press, 974. [9] IEEE Standard 80.a-999, Hgh-speed Physcal Layer n the 5 GHz Band, 999. [0] S. Forester, P. Bouysse, R. Quere, A. Mallet, J. M. Nebus, and L. Laperre, Jont Optmzaton of the Power-Added Effcency and the Error-Vector Measurement of 0-GHz phemt Amplfer through a New Dynamc Bas-Control Method, IEEE Transactons on Mcrowave Theory Tech., vol.5, no.4, pp.3-4, 004.
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 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 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 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 informationTLCOM 612 Advanced Telecommunications Engineering II
TLCOM 62 Advanced Telecommuncatons Engneerng II Wnter 2 Outlne Presentatons The moble rado sgnal envronment Combned fadng effects and nose Delay spread and Coherence bandwdth Doppler Shft Fast vs. Slow
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 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 informationSignal space Review on vector space Linear independence Metric space and norm Inner product
Sgnal space.... Revew on vector space.... Lnear ndependence... 3.3 Metrc space and norm... 4.4 Inner product... 5.5 Orthonormal bass... 7.6 Waveform communcaton system... 9.7 Some examples... 6 Sgnal space
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 informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
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 informationTemperature. Chapter Heat Engine
Chapter 3 Temperature In prevous chapters of these notes we ntroduced the Prncple of Maxmum ntropy as a technque for estmatng probablty dstrbutons consstent wth constrants. In Chapter 9 we dscussed the
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 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 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationChapter 8 Indicator Variables
Chapter 8 Indcator Varables In general, e explanatory varables n any regresson analyss are assumed to be quanttatve n nature. For example, e varables lke temperature, dstance, age etc. are quanttatve n
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 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 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 informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationCopyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for U Charts. Dr. Wayne A. Taylor
Taylor Enterprses, Inc. Adjusted Control Lmts for U Charts Copyrght 207 by Taylor Enterprses, Inc., All Rghts Reserved. Adjusted Control Lmts for U Charts Dr. Wayne A. Taylor Abstract: U charts are used
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 informationTurbulence classification of load data by the frequency and severity of wind gusts. Oscar Moñux, DEWI GmbH Kevin Bleibler, DEWI GmbH
Turbulence classfcaton of load data by the frequency and severty of wnd gusts Introducton Oscar Moñux, DEWI GmbH Kevn Blebler, DEWI GmbH Durng the wnd turbne developng process, one of the most mportant
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More 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 informationChapter 13: Multiple Regression
Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to
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 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 informationOn Spatial Capacity of Wireless Ad Hoc Networks with Threshold Based Scheduling
On Spatal Capacty of Wreless Ad Hoc Networks wth Threshold Based Schedulng Yue Lng Che, Ru Zhang, Y Gong, and Lngje Duan Abstract arxv:49.2592v [cs.it] 9 Sep 24 Ths paper studes spatal capacty n a stochastc
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 informationSecret Communication using Artificial Noise
Secret Communcaton usng Artfcal Nose Roht Neg, Satashu Goel C Department, Carnege Mellon Unversty, PA 151, USA {neg,satashug}@ece.cmu.edu Abstract The problem of secret communcaton between two nodes over
More informationDistributed Optimal TXOP Control for Throughput Requirements in IEEE e Wireless LAN
Dstrbuted Optmal TXOP Control for Throughput Requrements n IEEE 80.e Wreless LAN Ju Yong Lee, Ho Young Hwang, Jtae Shn, and Shahrokh Valaee KAIST Insttute for Informaton Technology Convergence, KAIST,
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 information( ) = ( ) + ( 0) ) ( )
EETOMAGNETI OMPATIBIITY HANDBOOK 1 hapter 9: Transent Behavor n the Tme Doman 9.1 Desgn a crcut usng reasonable values for the components that s capable of provdng a tme delay of 100 ms to a dgtal sgnal.
More informationFUZZY FINITE ELEMENT METHOD
FUZZY FINITE ELEMENT METHOD RELIABILITY TRUCTURE ANALYI UING PROBABILITY 3.. Maxmum Normal tress Internal force s the shear force, V has a magntude equal to the load P and bendng moment, M. Bendng moments
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 informationHomework Assignment 3 Due in class, Thursday October 15
Homework Assgnment 3 Due n class, Thursday October 15 SDS 383C Statstcal Modelng I 1 Rdge regresson and Lasso 1. Get the Prostrate cancer data from http://statweb.stanford.edu/~tbs/elemstatlearn/ datasets/prostate.data.
More informationOutline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1]
DYNAMIC SHORTEST PATH SEARCH AND SYNCHRONIZED TASK SWITCHING Jay Wagenpfel, Adran Trachte 2 Outlne Shortest Communcaton Path Searchng Bellmann Ford algorthm Algorthm for dynamc case Modfcatons to our algorthm
More informationNegative Binomial Regression
STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...
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 informationProbability Theory. The nth coefficient of the Taylor series of f(k), expanded around k = 0, gives the nth moment of x as ( ik) n n!
8333: Statstcal Mechancs I Problem Set # 3 Solutons Fall 3 Characterstc Functons: Probablty Theory The characterstc functon s defned by fk ep k = ep kpd The nth coeffcent of the Taylor seres of fk epanded
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 informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More informationCHAPTER 4 SPEECH ENHANCEMENT USING MULTI-BAND WIENER FILTER. In real environmental conditions the speech signal may be
55 CHAPTER 4 SPEECH ENHANCEMENT USING MULTI-BAND WIENER FILTER 4.1 Introducton In real envronmental condtons the speech sgnal may be supermposed by the envronmental nterference. In general, the spectrum
More informationUNIVERSITY OF TORONTO Faculty of Arts and Science. December 2005 Examinations STA437H1F/STA1005HF. Duration - 3 hours
UNIVERSITY OF TORONTO Faculty of Arts and Scence December 005 Examnatons STA47HF/STA005HF Duraton - hours AIDS ALLOWED: (to be suppled by the student) Non-programmable calculator One handwrtten 8.5'' x
More informationCopyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor
Taylor Enterprses, Inc. Control Lmts for P Charts Copyrght 2017 by Taylor Enterprses, Inc., All Rghts Reserved. Control Lmts for P Charts Dr. Wayne A. Taylor Abstract: P charts are used for count data
More informationMULTISPECTRAL IMAGE CLASSIFICATION USING BACK-PROPAGATION NEURAL NETWORK IN PCA DOMAIN
MULTISPECTRAL IMAGE CLASSIFICATION USING BACK-PROPAGATION NEURAL NETWORK IN PCA DOMAIN S. Chtwong, S. Wtthayapradt, S. Intajag, and F. Cheevasuvt Faculty of Engneerng, Kng Mongkut s Insttute of Technology
More informationUncertainty and auto-correlation in. Measurement
Uncertanty and auto-correlaton n arxv:1707.03276v2 [physcs.data-an] 30 Dec 2017 Measurement Markus Schebl Federal Offce of Metrology and Surveyng (BEV), 1160 Venna, Austra E-mal: markus.schebl@bev.gv.at
More informationLecture 3: Shannon s Theorem
CSE 533: Error-Correctng Codes (Autumn 006 Lecture 3: Shannon s Theorem October 9, 006 Lecturer: Venkatesan Guruswam Scrbe: Wdad Machmouch 1 Communcaton Model The communcaton model we are usng conssts
More informationOFDM is a good candidate for wireless multimedia communication
Detecton of OFDM-CPM Sgnals over Multpath Channels Imran A. Tasadduq and Raveendra K. Rao Department of Electrcal & Computer Engneerng Elborn College, 11 Western Road The Unversty of Western Ontaro London,
More informationWeek3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity
Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle
More informationBasic Statistical Analysis and Yield Calculations
October 17, 007 Basc Statstcal Analyss and Yeld Calculatons Dr. José Ernesto Rayas Sánchez 1 Outlne Sources of desgn-performance uncertanty Desgn and development processes Desgn for manufacturablty A general
More informationPredictive Analytics : QM901.1x Prof U Dinesh Kumar, IIMB. All Rights Reserved, Indian Institute of Management Bangalore
Sesson Outlne Introducton to classfcaton problems and dscrete choce models. Introducton to Logstcs Regresson. Logstc functon and Logt functon. Maxmum Lkelhood Estmator (MLE) for estmaton of LR parameters.
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 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 informationApplication of Nonbinary LDPC Codes for Communication over Fading Channels Using Higher Order Modulations
Applcaton of Nonbnary LDPC Codes for Communcaton over Fadng Channels Usng Hgher Order Modulatons Rong-Hu Peng and Rong-Rong Chen Department of Electrcal and Computer Engneerng Unversty of Utah Ths work
More informationPerforming Modulation Scheme of Chaos Shift Keying with Hyperchaotic Chen System
6 th Internatonal Advanced echnologes Symposum (IAS 11), 16-18 May 011, Elazığ, urkey Performng Modulaton Scheme of Chaos Shft Keyng wth Hyperchaotc Chen System H. Oğraş 1, M. ürk 1 Unversty of Batman,
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 31 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 6. Rdge regresson The OLSE s the best lnear unbased
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 informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have
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 informationClock-Gating and Its Application to Low Power Design of Sequential Circuits
Clock-Gatng and Its Applcaton to Low Power Desgn of Sequental Crcuts ng WU Department of Electrcal Engneerng-Systems, Unversty of Southern Calforna Los Angeles, CA 989, USA, Phone: (23)74-448 Massoud PEDRAM
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 informationRELIABILITY ASSESSMENT
CHAPTER Rsk Analyss n Engneerng and Economcs RELIABILITY ASSESSMENT A. J. Clark School of Engneerng Department of Cvl and Envronmental Engneerng 4a CHAPMAN HALL/CRC Rsk Analyss for Engneerng Department
More information4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA
4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected
More informationA Robust Method for Calculating the Correlation Coefficient
A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal
More informationC4B Machine Learning Answers II. = σ(z) (1 σ(z)) 1 1 e z. e z = σ(1 σ) (1 + e z )
C4B Machne Learnng Answers II.(a) Show that for the logstc sgmod functon dσ(z) dz = σ(z) ( σ(z)) A. Zsserman, Hlary Term 20 Start from the defnton of σ(z) Note that Then σ(z) = σ = dσ(z) dz = + e z e z
More informationSimulation and Random Number Generation
Smulaton and Random Number Generaton Summary Dscrete Tme vs Dscrete Event Smulaton Random number generaton Generatng a random sequence Generatng random varates from a Unform dstrbuton Testng the qualty
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 informationMultigradient for Neural Networks for Equalizers 1
Multgradent for Neural Netorks for Equalzers 1 Chulhee ee, Jnook Go and Heeyoung Km Department of Electrcal and Electronc Engneerng Yonse Unversty 134 Shnchon-Dong, Seodaemun-Ku, Seoul 1-749, Korea ABSTRACT
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 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 informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
More informationAnswers Problem Set 2 Chem 314A Williamsen Spring 2000
Answers Problem Set Chem 314A Wllamsen Sprng 000 1) Gve me the followng crtcal values from the statstcal tables. a) z-statstc,-sded test, 99.7% confdence lmt ±3 b) t-statstc (Case I), 1-sded test, 95%
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 informationConvergence of random processes
DS-GA 12 Lecture notes 6 Fall 216 Convergence of random processes 1 Introducton In these notes we study convergence of dscrete random processes. Ths allows to characterze phenomena such as the law of large
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationBoostrapaggregating (Bagging)
Boostrapaggregatng (Baggng) An ensemble meta-algorthm desgned to mprove the stablty and accuracy of machne learnng algorthms Can be used n both regresson and classfcaton Reduces varance and helps to avod
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 informationA Particle Filter Algorithm based on Mixing of Prior probability density and UKF as Generate Importance Function
Advanced Scence and Technology Letters, pp.83-87 http://dx.do.org/10.14257/astl.2014.53.20 A Partcle Flter Algorthm based on Mxng of Pror probablty densty and UKF as Generate Importance Functon Lu Lu 1,1,
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 informationOn balancing multiple video streams with distributed QoS control in mobile communications
On balancng multple vdeo streams wth dstrbuted QoS control n moble communcatons Arjen van der Schaaf, José Angel Lso Arellano, and R. (Inald) L. Lagendjk TU Delft, Mekelweg 4, 68 CD Delft, The Netherlands
More informationCS 798: Homework Assignment 2 (Probability)
0 Sample space Assgned: September 30, 2009 In the IEEE 802 protocol, the congeston wndow (CW) parameter s used as follows: ntally, a termnal wats for a random tme perod (called backoff) chosen n the range
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 informationProf. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model
EXACT OE-DIMESIOAL ISIG MODEL The one-dmensonal Isng model conssts of a chan of spns, each spn nteractng only wth ts two nearest neghbors. The smple Isng problem n one dmenson can be solved drectly n several
More information2 Finite difference basics
Numersche Methoden 1, WS 11/12 B.J.P. Kaus 2 Fnte dfference bascs Consder the one- The bascs of the fnte dfference method are best understood wth an example. dmensonal transent heat conducton equaton T
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 informationOutline. Bayesian Networks: Maximum Likelihood Estimation and Tree Structure Learning. Our Model and Data. Outline
Outlne Bayesan Networks: Maxmum Lkelhood Estmaton and Tree Structure Learnng Huzhen Yu janey.yu@cs.helsnk.f Dept. Computer Scence, Unv. of Helsnk Probablstc Models, Sprng, 200 Notces: I corrected a number
More informationLab 2e Thermal System Response and Effective Heat Transfer Coefficient
58:080 Expermental Engneerng 1 OBJECTIVE Lab 2e Thermal System Response and Effectve Heat Transfer Coeffcent Warnng: though the experment has educatonal objectves (to learn about bolng heat transfer, etc.),
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 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 informationDifferentiating Gaussian Processes
Dfferentatng Gaussan Processes Andrew McHutchon Aprl 17, 013 1 Frst Order Dervatve of the Posteror Mean The posteror mean of a GP s gven by, f = x, X KX, X 1 y x, X α 1 Only the x, X term depends on the
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
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 informationConcepts for Wireless Ad Hoc
Bandwdth and Avalable Bandwdth oncepts for Wreless Ad Hoc Networks Marco A. Alzate Unversdad Dstrtal, Bogotá Néstor M. Peña Unversdad de los Andes, Bogotá Mguel A. abrador Unversty of South Florda, Tampa
More informationCOGNITIVE RADIO NETWORKS BASED ON OPPORTUNISTIC BEAMFORMING WITH QUANTIZED FEEDBACK
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
More information8.592J: Solutions for Assignment 7 Spring 2005
8.59J: Solutons for Assgnment 7 Sprng 5 Problem 1 (a) A flament of length l can be created by addton of a monomer to one of length l 1 (at rate a) or removal of a monomer from a flament of length l + 1
More information