APPROXIMATE FULL DIVERSITY LINEAR EQUALIZERS FOR DOUBLY SELECTIVE CHANNELS
|
|
- Erika Shana Wiggins
- 6 years ago
- Views:
Transcription
1 17th Europea Sigal Processig Coferece (EUSIPCO 2009 Glasgow, Scotlad, August 24-28, 2009 APPROXIMATE FULL DIVERSITY LINEAR EQUALIZERS FOR DOUBLY SELECTIVE CHANNELS Shakti Prasad Sheoy, Irfa Ghauri, ad Dirk T.M. Slock EURECOM, Dept. of Mobile Commuicatios, 2229 Route des Crêtes, Sophia Atipolis Cedex, Frace Ifieo Techologies Frace SAS, GAIA, 2600 Route des Crêtes, Sophia Atipolis Cedex, Frace ABSTRACT It is kow that liear miimum mea square error zeroforcig (MMSE-ZF equalizatio ca achieve full joit multipath-doppler diversity offered by doubly selective chaels [1] whe appropriate precodig is applied at the trasmitter. However, brute force implemetatio MMSE- ZF equalizer ivolves a matrix iversio operatio that results i sigificat computatioal burde. I order to alleviate this problem, first a iterative implemetatio of MMSE- ZF equalizer based o polyomial expasio (PE approximatio is proposed. The, the structure of a matrix ivolved i this approximatio is exploited to reduce the computatioal complexity of the PE approximatio. Simulatio results are provided to show that while this approach reduces the computatioal complexity compared to the brute-force implemetatio of the MMSE-ZF equalizer, it does ot effect the diversity order. 1. INTRODUCTION Practical wireless commuicatio chaels are proe to sigal fadig due to the presece of multiple sigal paths (time dispersive chael, time-varyig ature of the chael (frequecy dispersive chael or both (time-frequecy dispersive or the so called, doubly dispersive chael. However, its is possible for the receiver to employ equalizatio techiques that optimally exploit the iheret diversity i these chaels as a coveiet couter-measure agaist fadig. For istace, the frequecy selectivity of time dispersive chaels provide multipath diversity due to the presece of multiple idepedetly fadig compoets i the chael. I block trasmissio systems, whe the chael coherece time is shorter tha the trasmit block legth, temporal variatios of the chael provides Doppler diversity [2] which ca be exploited by the receiver. Doubly selective chaels offer joit multipath-doppler diversity that ca be haressed by suitable equalizatio techiques ad proper precodig. I [3], the authors used the Complex-Expoetial Basis Expasio Model (CE-BEM [4] with Q+1 basis fuctios to model the doubly selective chael of memory L ad showed that by employig liear precoded block trasmissio, the maximum diversity i the chael is upper bouded by (Q + 1(L + 1 ad ca be achieved whe maximumlikelihood equalizatio (MLE is used at the receiver. However, MLE icurs a huge computatioal complexity therefore the diversity order achieved by liear equalizatio (LE which is a low-complexity albeit sub-optimal alterative to optimal maximum-likelihood equalizatio (MLE was ivestigated i [5] [6] [1]. It is ow kow that liear miimum mea squared error zero forcig (MMSE-ZF receivers achieve maximal diversity offered by time/frequecy ad doubly selective chaels. Recogizig the fact that the structure of MMSE-ZF receivers ca be exploited i order to reduce the complexity of these full-diversity achievig receivers, low complexity liear equalizers were proposed i [7] ad [8] for frequecy selective chaels. Sice the computatioal complexity i the MMSE-ZF receiver is predomiatly due to the matrix iversio ivolved i buildig the equalizer, we propose a reduced-complexity implemetatio of the MMSE-ZF receiver based o polyomial expasio (PE approximatio. PE approximatio is ot a ew idea, it was first proposed i [9] where, i order to avoid explicit matrix iversio, the Cayley Hamilto theorem [10] was applied to express the matrix iverse as a fiite sum of weighted matrix polyomials. The weights themselves were chose to optimize a desired performace metric at the output of the equalizer. I this paper, we adopt a approach where the complexity reductio is achieved by first approximatig the MMSE-ZF receiver usig PE approximatio a the exploitig the structure of a matrix ivolved i the PE approximatio. I the sequel, we will explai our approach i more detail ad show that a decrease i the computatioal effort is achieved with o loss o the diversity order of the resultig approximated equalizer. 2. SIGNAL MODEL I Fig. 1 we show the block diagram of the trasmissio model. At the trasmitter, complex data symbols s[i] are s[i] Parser s[k] x[k] y[k] Θ h i,l Equalizer Figure 1: Block diagram of trasmissio model. first parsed ito N-legth blocks.the -th symbol i the k-th block is give by [s[k]] = s[kn + ] with [0, 1,..., N 1]. Each block s[k] is precoded by a M N matrix Θ where M N ad the resultat block x[k] is trasmitted over the block fadig chael. We cosider a chael memory of order L. It is well kow that the temporal variatio of the chael taps i doubly selective chaels with a fiite Doppler spread ca be captured by fiite Fourier bases. We therefore use CE-BEM [4] with Q + 1 basis fuctios to model the time variatio of each tap i a block duratio. The basis coefficiets remai costat for the block duratio but are allowed to vary with every block. The time-varyig chael for each block trasmissio is thus completely described by the Q + 1 Fourier bases ad (Q + 1(L + 1 coefficiets. ŝ[i] EURASIP,
2 I geeral Q is chose such that Q = 2 f max MT s where 1/T s is the samplig frequecy ad f max is the Doppler spread of the chael. The coefficiets themselves are assumed to be zero-mea complex i.i.d Gaussia radom variables. Usig i as the discrete time (sample idex, we ca represet the l-th tap of the chael i the k-th block h i,l = h q (k, le j2πfqi, l [0, L], f q = (q Q/2/M. The correspodig receive sigal is formed by collectig M samples at the receiver to form [y(km + 0, y(km + 1,...,y(kM + M 1] T. Whe M L, this block trasmissio system ca be represeted i matrix-vector otatio as [3] H ds [k; 0]Θs[k] + H ds [k; 1]Θs[k 1] + v[k], (1 where v[k] is a AWGN vector whose etries have zeromea ad variace σv 2 ad is defied i the same way as y[k]. H ds [k; 0] ad H ds [k; 1] are M M matrices whose etries are give by [H ds [k; t]] r,s = h (km+r,tm+r s with t [0, 1], r, s [0,..., M 1]. Defiig D[f q ] as a diagoal matrix whose diagoal etries are give by [D[f q ]] m,m = e j2πfqm, m [0, 1,..., M 1], ad further defiig [H q [k; t]] r,s = h q (k, tm + r s as Toeplitz matrices formed of BEM coefficiets, it is straightforward to represet Eq. (1 as 1 t=0 D[f q ]H q [k; t]θs[k t] + v[k], (2 3. PRECODED TRANSMISSION IN DOUBLY SELECTIVE CHANNELS The precodig matrix Θ cosidered here is give by Θ = F H P+Q T 1 T 2. where represets the Kroecker product of matrices, F P+Q is a (P + Q-poit DFT matrix, T 1 = [I P 0 P Q ] T, T 2 = [I K 0 K L ] T. P ad K are chose such that M = (P + Q(K+L ad N = PK. This precoder was proposed i [3] ad was show to eable diversity order of (Q + 1(L + 1 for ML receivers i doubly selective chaels. Whe this precoder is applied at the trasmitter, the received sigal ca be represeted as (F H P+Q I K+L H[k]s[k] + v[k], (3 where H[k] is give by (see Sec. 7 for derivatio. (J P+Q [q]t 1 (D K+L [f q ] H q [k; 0]T 2. (4 I the followig we will drop the block idex k i the iterest of simplifyig otatios. For this scheme, it was show i [1] that MMSE-ZF equalizatio collects full diversity offered by the chael. I other words, the slope of the outage probability curve of the MMSE-ZF receiver i the high-snr regime is (Q+1(L+1. This beig the case, it is of iterest to explore the possibility of lowerig the complexity of such a receiver sice brute-force implemetatio of the MMSE- ZF receiver ivolves the computatio of the matrix iverse (H H H 1 which is computatioally expesive. 4. POLYNOMIAL EXPANSION APPROXIMATION FOR LE IN DOUBLY SELECTIVE CHANNELS I order to reduce the above metioed computatioal cost, we propose here a reduced complexity implemetatio of the MMSE-ZF equalizer for doubly selective chaels. We start with a alterative represetatio of the received sigal i Eq. (3 y = H tv Θs + v, where H tv represets the chael matrix i the time-domai ad ca i tur be represeted as the sum of two matrices H tv = H κ + H ν, H κ = (D P+Q [f q (K + L] e j ωq H q, H ν = (D P+Q [f q (K + L] (D K+L [f q ] e j ωq I K+L H q. ω q = ω q (K + L 1/2. Represetig the received sigal i this form allows us to iteratively estimate the trasmit symbol vector s. The symbol estimate after the m-th iteratio is give by ŝ (m = (H κ Θ (y H ν Θŝ (m 1. (5 where the superscript represets the Moore-Perose pseudo-iverse. From Eq. (5, we ca derive the sigal to iterferece oise ratio (SINR expressio for the -th symbol of the symbol estimate ŝ (m as ρ[g s G H s SINR = ], ρḡḡ H + [G v G H ], (6 v, where ρ is the sigal to oise ratio (SNR ad ḡ is the -th row of G s without the elemet [G], ad G s = I + ( 1 m ((H κ Θ H ν Θ m+1, G v = ( ( 1 k ((H κ Θ H ν Θ k (H κ Θ. Alteratively, it is possible to evisage a polyomial expasio approximatio for the MMSE-ZF receiver that miimizes the mea squared error at the receiver. I this case, the symbol vector estimate after m iteratios is give by ŝ (m = Λ k R k z. (7 where R = (H κ Θ H ν Θ, z = (H κ Θ y, ad the diagoal scale factor matrices Λ k of order N are estimated by pluggig i the expressio for ŝ (m i Eq. (7 i the LMMSE criterio Λ opt k = arg mi E s ŝ (m 2. (8 Λ k :k {0,1,m} Note that Eq. (5 correspods to the special case of Eq. (8 where the diagoal elemets of all Λ k are uity. Aother special case of Eq. (8 where the diagoal matrices Λ k are 334
3 reduced to scalar weightig coefficiets λ k are addressed before (for istace i [9]. Let λ,k = [Λ k ], ad λ = [λ,0,, λ,m ] the Eq. (8 ca be solved by fidig the optimum λ opt separately for each trasmit symbol {0, 1,, N 1} i the symbol vector s as λ opt = argmi E s[] λ q[] 2. (9 λ q[] = [w 0 [] w 1 [] w m []] T ad w m [] are elemets of w m = R m z. Oce the N vectors correspodig to λ opt are obtaied the diagoal matrices Λ k are formed ad substituted i Eq. (7 to get the symbol estimate. The SINR at the output of this equalizer is give by SINR MMSE PE = ρ[g s G H s ], ρḡḡ H + [G v G H v ],, (10 where ḡ is ow the -th row of G s without the elemet [G], ad G s = G v = Λ k R k (I + (H κ Θ H ν Θ, Λ k R k (H κ Θ. Sice both Eq. (7 ad Eq. (5 require the calculatio of the pseudo-iverse (H κ Θ we ow focus our attetio to reducig the complexity of the matrix iversio that eeds to be performed i order to obtai (H κ Θ. Notice that H κ Θ ca be factored as show i (12 where we replace the blockcirculat-with-toeplitz-blocks (BCTB matrix i (11 with a block-circulat-with-circulat-blocks matrix (BCCB. i.e., H BCCB = (J P+Q [q] e j ωq H c q. where H c q is a circulat matrix whose first colum is the same as the first colum of H q, This allows us to take advatage of the fact that H BCCB is diagoalizable as D = (F H P+Q FH K+L H BCCB(F P+Q F K+L, where Θ N,F = N(Θ H, ad N(. deotes the ull space of a matrix. The solutio to Eq. (14 allows us to compute (DΘ F as Θ F D 1 [I D H Θ N,F (Θ H N,F D 1 D H Θ N,F 1 Θ H N,F D 1 ] (15 which ivolves iversio of a matrix of dimesio M N i place of iversio of matrix of dimesio M i the bruteforce approach. Moreover, Θ is oly depedet o the precodig matrix hece it ca also be precomputed ad used F across blocks. 4.1 Optimizatio of trasmissio parameters The reductio i computatioal complexity of (H κ Θ usig Eq. (15 is related to the redudacy i the trasmit block (i.e., M N. Oe ca therefore optimize the trasmissio parametersp, Q, K, L to reduce the computatioal complexity of overall PE approximatio of the MMSE-ZF equalizer. Such a optimizatio has to take ito accout the iterrelatios of the trasmissio parameters. For a fixed f max ad T s, we kow that L is fixed but Q icreases proportioally to M due to the fact that α = Q/M is fixed due to the relatio Q = 2 f max MT s. This also implies that the available diversity at the receiver icreases with M 5. NUMERICAL RESULTS I this sectio we provide simulatio results to show that the approximatio for the MMSE-ZF equalizer proposed i the paper does ot etail ay loss i terms of the diversity order collected by the receiver. It is well accepted that the slope of the outage probability curve i the high SNR regime provides a accurate estimate of the diversity order of a receiver. The outage probability curve was plotted by computig the post-equalizatio SINR (SNR for the case of brute for MMSE-ZF equalizer for the symbol idex correspodig to N/2 sice it suffers the maximum iter-symboliterferece withi the block. Mote-Carlo simulatios were carried out for a fixed trasmissio rate for differet SNR poits. For the brute-force implemetatio of the MMSE-ZF receiver, the post-equalizatio SNR for a arbitrary symbol idex i the symbol block s is give by SNR = ρ [(H H H 1 ],, Now pluggig this ito (12 we have where H represets the equivalet doubly selective chael after precodig ad ρ is the SNR. For the polyomial expasio equalizers, the post-equalizatio SINR was computed H κ Θ = (I P+Q F K+L DΘ F. as give by Eq. (6 ad Eq. (10. Whe the post-equalizatio where Θ F = (I P+Q F H Θ which i tur leads us to K+L SINR was below the SNR required to support the fixed trasmissio rate, the chael was declared to be i outage. (H κ Θ = (DΘ F (I P+Q F K+L H. (13 The slope of the outage probability curve thus obtaied provides a estimate of the diversity order. I additio to The problem of computig (H κ Θ is thus reduced to the this, we compare the slope of the receiver to that of the problem of computig (DΘ F. This ca be accomplished matched filter boud (MFB which is kow to collect all by formulatig the problem of computig the pseudo-iverse the available diversity i the chael. as that of fidig the N (M N matrix Ξ that correspods Fig. 2 illustrates the evolutio of the diversity order slope to the solutio of the miimizatio problem [7] achieved agaist the order of approximatio i the polyomial expasio equalizer i Eq. (5. It is see that the slope arg mi Tr{(Θ Ξ FD 1 +ΞΘ N,F D 1 H (Θ flattes out uderstadably at lower order approximatios FD 1 +ΞΘ N,F D 1 } due to large approximatio errors but starts to stabilize at (14 about secod order approximatio of the equalizer. 335
4 H κ Θ = (F H I P+Q K+L (J P+Q [q] e j ωq H q (T 1 T 2, (11 H κ Θ = (F H P+Q I K+L (J P+Q [q] e j ωq H c q(t 1 T 2. (12 0 th order approximatio 1 st order approximatio d order approximatio 3 rd order approximatio PE order 1 MMSE PE order 1 PE order 2 MMSE PE order 2 PE order 3 MMSE PE order Figure 2: Evolutio of diversity order for differet iteratios. Figure 4: Compariso of performace of the two PE approximatios. miimizes the MSE at the receiver Eq. (7 is show i Fig. 4. We see a sigificat ehacemet i performace for the first order approximatio whe compared to the PE approximatio i Eq. (5. However, for higher orders the the differece i their performace appears egligible MFB Brute force MMSE ZF 1 st order approximatio 2 d order approximatio Figure 3: Diversity order of LE approximated by PE. Fig. 3 shows the compariso of the diversity order of brute-force implemetatio of the MMSE-ZF equalizer for doubly selective chaels for the case of Q = 2 ad L = 1. Observe that the slope of the outage probability curves for both the implemetatios are the same. The polyomial expasio equalizer has a SNR offset whe compared to the brute force implemetatio which is to be expected sice the equalizer is a approximatio of the MMSE-ZF receiver however, it succeeds i collectig full diversity offered by the doubly selective chael at relatively low order of approximatio. The performace of PE approximatio that 6. CONCLUSIONS I this cotributio we propose two approximatios for the MMSE-ZF equalizer for doubly selective chaels. The proposed equalizers are based o polyomial expasio approximatio ad lead to a decrease i the computatioal complexity of the equalizer whe compared with the brute-force implemetatio. Simulatio results show that such a approximatio does ot icur a pealty i terms of the diversity order achieved by the approximated equalizers. 7. APPENDIX Due to the presece of the zero-paddig matrix T 2, it ca be easily show that the iter-block-iterferece compoet i the received sigal is zero, i.e., H q [k; 1]Θs[k 1] = 0. As a result, the received block i Eq. (1 ca ow be represeted as D[f q ]H q [k; 0]Θs[k] + v[k], (A1 Usig stadard Kroecker product idetities, oe ca show that H q [k; 0]Θ = F H T P+Q 1 H q [k; 0]T 2, (A2 336
5 where H q [k; 0] is a K + L K + L Toeplitz matrix formed by the first K + L rows ad colums of H q [k; 0]. Eq. (A1 ca the be re-writte as Note that D[f q ] (F HP+Q T 1 H q [k; 0]T 2 s[k]+v[k], (A3 D[f q ] = D P+Q [f q (K + L] D K+L [f q ], (A4 The above equatio represets D[f q ] as Kroecker product of time-variatio over two scales. D P+Q [f q (K + L] is a diagoal matrix of size P + Q that represets time-variatio at a coarse scale (complex-expoetials sampled at sub-samplig iterval of (K + LT s ad D K+L [f q ] is a diagoal matrix of size K +L that represets the time-variatio over a fier grid correspodig to the samplig period T s. Usig Eq. (A4 ad stadard matrix idetities, we ca decompose the received sigal as i Eq. (A6 where J[q] = J (q Q/2 ad J is a circulat matrix with [0, 1, 0 1 P+Q 2 ] T as the first colum. Sice the matrix (F H P+Q I K+L has o effect o the diversity of the doubly selective chael, for the aalysis of the diversity order of MMSE-ZF receiver, the effective chael matrix ca be represeted as (J P+Q [q]t 1 (D K+L [f q ] H q [k; 0]T 2, (A7 Fig. 5 provides a illustratio of the structure of the equivalet chael matrix due to precodig. Here H q represets the product matrix D K+L [f q ] H q [k; 0] for ease of illustratio. I particular, it is a block-toeplitz matrix with costituet blocks which are i tur formed by the product of a diagoal matrix D K+L [f q ] ad a Toeplitz matrix formed by the correspodig BEM coefficiets of the q-th basis fuctio. REFERENCES [1] S. P. Sheoy, I. Ghauri, ad D. T. M. Slock, Diversity order of liear equalizers for doubly selective chaels, i SPAWC 2009, 10th IEEE Iteratioal Workshop o Sigal Processig Advaces i Wireless Commuicatios, Jue 21-24, 2009, Perugia, Italy, Ju [2] A. Sayeed ad B. Aazhag, Joit multipath-doppler diversity i mobile wireless commuicatios, Commuicatios, IEEE Trasactios o, vol. 47, o. 1, pp , Ja [3] X. Ma ad G. Giaakis, Maximum-diversity trasmissios over doubly selective wireless chaels, Iformatio Theory, IEEE Trasactios o, vol. 49, o. 7, pp , July (P+Q (K+L H Q H Q H Q 01 K 0 0 = D K+L[f 0] H 0[k; 0] P K 0 Figure 5: Equivalet chael matrix for doubly selective chael. [4] G. Giaakis ad C. Tepedelelioglu, Basis expasio models ad diversity techiques for blid idetificatio ad equalizatio of time-varyig chaels, Proceedigs of the IEEE, vol. 86, o. 10, pp , Oct [5] C. Tepedelelioglu, Maximum multipath diversity with liear equalizatio i precoded OFDM systems, Iformatio Theory. IEEE Trasactios o, vol. 50, o. 1, pp , Ja [6] S. P. Sheoy, I. Ghauri, ad D. T. M. Slock, Diversity order of liear equalizers for block trasmissio i fadig chaels, i Asilomar 2008, Coferece o Sigals, Systems, ad Computers, October 26-29, 2008, Asilomar, USA, Oct [7] C. Tepedelelioglu ad Q. Ma, O the performace of liear equalizers for block trasmissio systems, Global Telecommuicatios Coferece, GLOBECOM 05. IEEE, vol. 6, pp. 5 pp., Nov.-2 Dec [8] S. Sheoy, F. Negro, I. Ghauri, ad D. Slock, Low- Complexity Liear Equalizatio for Block Trasmissio i Multipath Chaels, i Wireless Commuicatios ad Networkig Coferece, WCNC IEEE, April 2009, pp [9] S. Moshavi, E. G. Katerakis, ad D. L. Schillig, Multistage liear receivers for DS-CDMA systems, Iteratioal Joural of Wireless Iformatio Networks, vol. 3, pp. 1 17, October [10] G. H. Golub ad C. F. V. Loa, Matrix Computatios. The Johs Hopkis Uiversity Press, K+L ( (D P+Q [f q (K + L]F H P+QT 1 (D K+L [f q ] H q [k; 0]T 2 s[k] + v[k], (F H P+Q I K+L ( (J P+Q [q]t 1 (D K+L [f q ] H q [k; 0]T 2 s[k] + v[k], (A5 (A6 337
Frequency Domain Filtering
Frequecy Domai Filterig Raga Rodrigo October 19, 2010 Outlie Cotets 1 Itroductio 1 2 Fourier Represetatio of Fiite-Duratio Sequeces: The Discrete Fourier Trasform 1 3 The 2-D Discrete Fourier Trasform
More informationOFDM Precoder for Minimizing BER Upper Bound of MLD under Imperfect CSI
MIMO-OFDM OFDM Precoder for Miimizig BER Upper Boud of MLD uder Imperfect CSI MCRG Joit Semiar Jue the th 008 Previously preseted at ICC 008 Beijig o May the st 008 Boosar Pitakdumrogkija Kazuhiko Fukawa
More informationLinear Regression Demystified
Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationFFTs in Graphics and Vision. The Fast Fourier Transform
FFTs i Graphics ad Visio The Fast Fourier Trasform 1 Outlie The FFT Algorithm Applicatios i 1D Multi-Dimesioal FFTs More Applicatios Real FFTs 2 Computatioal Complexity To compute the movig dot-product
More informationOrthogonal Gaussian Filters for Signal Processing
Orthogoal Gaussia Filters for Sigal Processig Mark Mackezie ad Kiet Tieu Mechaical Egieerig Uiversity of Wollogog.S.W. Australia Abstract A Gaussia filter usig the Hermite orthoormal series of fuctios
More informationCALCULATING FIBONACCI VECTORS
THE GENERALIZED BINET FORMULA FOR CALCULATING FIBONACCI VECTORS Stuart D Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithacaedu ad Dai Novak Departmet
More informationDiscrete Orthogonal Moment Features Using Chebyshev Polynomials
Discrete Orthogoal Momet Features Usig Chebyshev Polyomials R. Mukuda, 1 S.H.Og ad P.A. Lee 3 1 Faculty of Iformatio Sciece ad Techology, Multimedia Uiversity 75450 Malacca, Malaysia. Istitute of Mathematical
More informationDiscrete-Time Systems, LTI Systems, and Discrete-Time Convolution
EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationBayesian Methods: Introduction to Multi-parameter Models
Bayesia Methods: Itroductio to Multi-parameter Models Parameter: θ = ( θ, θ) Give Likelihood p(y θ) ad prior p(θ ), the posterior p proportioal to p(y θ) x p(θ ) Margial posterior ( θ, θ y) is Iterested
More informationCEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering
CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio
More informationPAijpam.eu ON TENSOR PRODUCT DECOMPOSITION
Iteratioal Joural of Pure ad Applied Mathematics Volume 103 No 3 2015, 537-545 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://wwwijpameu doi: http://dxdoiorg/1012732/ijpamv103i314
More informationCHAPTER 5. Theory and Solution Using Matrix Techniques
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
More informationSession 5. (1) Principal component analysis and Karhunen-Loève transformation
200 Autum semester Patter Iformatio Processig Topic 2 Image compressio by orthogoal trasformatio Sessio 5 () Pricipal compoet aalysis ad Karhue-Loève trasformatio Topic 2 of this course explais the image
More informationFrequency Response of FIR Filters
EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we itroduce the idea of the frequecy respose of LTI systems, ad focus specifically o the frequecy respose of FIR filters.. Steady-state
More informationTMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods
TMA4205 Numerical Liear Algebra The Poisso problem i R 2 : diagoalizatio methods September 3, 2007 c Eiar M Røquist Departmet of Mathematical Scieces NTNU, N-749 Trodheim, Norway All rights reserved A
More informationLecture 7: MIMO Architectures Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH
: Theoretical Foudatios of Wireless Commuicatios 1 Thursday, May 19, 2016 12:30-15:30, Coferece Room SIP 1 Textbook: D. Tse ad P. Viswaath, Fudametals of Wireless Commuicatio 1 / 1 Overview Lecture 6:
More informationChandrasekhar Type Algorithms. for the Riccati Equation of Lainiotis Filter
Cotemporary Egieerig Scieces, Vol. 3, 00, o. 4, 9-00 Chadrasekhar ype Algorithms for the Riccati Equatio of Laiiotis Filter Nicholas Assimakis Departmet of Electroics echological Educatioal Istitute of
More informationMachine Learning for Data Science (CS 4786)
Machie Learig for Data Sciece CS 4786) Lecture & 3: Pricipal Compoet Aalysis The text i black outlies high level ideas. The text i blue provides simple mathematical details to derive or get to the algorithm
More informationSensitivity Analysis of Daubechies 4 Wavelet Coefficients for Reduction of Reconstructed Image Error
Proceedigs of the 6th WSEAS Iteratioal Coferece o SIGNAL PROCESSING, Dallas, Texas, USA, March -4, 7 67 Sesitivity Aalysis of Daubechies 4 Wavelet Coefficiets for Reductio of Recostructed Image Error DEVINDER
More information6.867 Machine learning, lecture 7 (Jaakkola) 1
6.867 Machie learig, lecture 7 (Jaakkola) 1 Lecture topics: Kerel form of liear regressio Kerels, examples, costructio, properties Liear regressio ad kerels Cosider a slightly simpler model where we omit
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More informationEECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1
EECS564 Estimatio, Filterig, ad Detectio Hwk 2 Sols. Witer 25 4. Let Z be a sigle observatio havig desity fuctio where. p (z) = (2z + ), z (a) Assumig that is a oradom parameter, fid ad plot the maximum
More informationRun-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE
Geeral e Image Coder Structure Motio Video (s 1,s 2,t) or (s 1,s 2 ) Natural Image Samplig A form of data compressio; usually lossless, but ca be lossy Redudacy Removal Lossless compressio: predictive
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More informationLinear Algebra Issues in Wireless Communications
Rome-Moscow school of Matrix Methods ad Applied Liear Algebra August 0 September 18, 016 Liear Algebra Issues i Wireless Commuicatios Russia Research Ceter [vladimir.lyashev@huawei.com] About me ead of
More informationPractical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement
Practical Spectral Aaysis (cotiue) (from Boaz Porat s book) Frequecy Measuremet Oe of the most importat applicatios of the DFT is the measuremet of frequecies of periodic sigals (eg., siusoidal sigals),
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More informationSince X n /n P p, we know that X n (n. Xn (n X n ) Using the asymptotic result above to obtain an approximation for fixed n, we obtain
Assigmet 9 Exercise 5.5 Let X biomial, p, where p 0, 1 is ukow. Obtai cofidece itervals for p i two differet ways: a Sice X / p d N0, p1 p], the variace of the limitig distributio depeds oly o p. Use the
More informationChapter 8. DFT : The Discrete Fourier Transform
Chapter 8 DFT : The Discrete Fourier Trasform Roots of Uity Defiitio: A th root of uity is a complex umber x such that x The th roots of uity are: ω, ω,, ω - where ω e π /. Proof: (ω ) (e π / ) (e π )
More information6. Kalman filter implementation for linear algebraic equations. Karhunen-Loeve decomposition
6. Kalma filter implemetatio for liear algebraic equatios. Karhue-Loeve decompositio 6.1. Solvable liear algebraic systems. Probabilistic iterpretatio. Let A be a quadratic matrix (ot obligatory osigular.
More informationFall 2011, EE123 Digital Signal Processing
Lecture 5 Miki Lustig, UCB September 14, 211 Miki Lustig, UCB Motivatios for Discrete Fourier Trasform Sampled represetatio i time ad frequecy umerical Fourier aalysis requires a Fourier represetatio that
More information1 Approximating Integrals using Taylor Polynomials
Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................
More informationInformation-based Feature Selection
Iformatio-based Feature Selectio Farza Faria, Abbas Kazeroui, Afshi Babveyh Email: {faria,abbask,afshib}@staford.edu 1 Itroductio Feature selectio is a topic of great iterest i applicatios dealig with
More informationChapter 7: The z-transform. Chih-Wei Liu
Chapter 7: The -Trasform Chih-Wei Liu Outlie Itroductio The -Trasform Properties of the Regio of Covergece Properties of the -Trasform Iversio of the -Trasform The Trasfer Fuctio Causality ad Stability
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationThe Maximum-Likelihood Decoding Performance of Error-Correcting Codes
The Maximum-Lielihood Decodig Performace of Error-Correctig Codes Hery D. Pfister ECE Departmet Texas A&M Uiversity August 27th, 2007 (rev. 0) November 2st, 203 (rev. ) Performace of Codes. Notatio X,
More informationThe Discrete Fourier Transform
The iscrete Fourier Trasform The discrete-time Fourier trasform (TFT) of a sequece is a cotiuous fuctio of!, ad repeats with period. I practice we usually wat to obtai the Fourier compoets usig digital
More informationProperties and Hypothesis Testing
Chapter 3 Properties ad Hypothesis Testig 3.1 Types of data The regressio techiques developed i previous chapters ca be applied to three differet kids of data. 1. Cross-sectioal data. 2. Time series data.
More informationSemi-Blind Channel Estimation for LTE DownLink
TECHNICAL UNIVERSITY OF DENMARK Semi-Blid Chael Estimatio for LTE DowLik by Nicolò Michelusi A thesis submitted i partial fulfillmet for the degree of Master of Sciece MSc i Telecommuicatio Egieerig Supervisors:
More informationMonte Carlo Integration
Mote Carlo Itegratio I these otes we first review basic umerical itegratio methods (usig Riema approximatio ad the trapezoidal rule) ad their limitatios for evaluatig multidimesioal itegrals. Next we itroduce
More informationOPTIMAL PIECEWISE UNIFORM VECTOR QUANTIZATION OF THE MEMORYLESS LAPLACIAN SOURCE
Joural of ELECTRICAL EGIEERIG, VOL. 56, O. 7-8, 2005, 200 204 OPTIMAL PIECEWISE UIFORM VECTOR QUATIZATIO OF THE MEMORYLESS LAPLACIA SOURCE Zora H. Perić Veljo Lj. Staović Alesadra Z. Jovaović Srdja M.
More informationTHE KALMAN FILTER RAUL ROJAS
THE KALMAN FILTER RAUL ROJAS Abstract. This paper provides a getle itroductio to the Kalma filter, a umerical method that ca be used for sesor fusio or for calculatio of trajectories. First, we cosider
More informationDefinitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.
Defiitios ad Theorems Remember the scalar form of the liear programmig problem, Miimize, Subject to, f(x) = c i x i a 1i x i = b 1 a mi x i = b m x i 0 i = 1,2,, where x are the decisio variables. c, b,
More informationEigenvalues and Eigenvectors
5 Eigevalues ad Eigevectors 5.3 DIAGONALIZATION DIAGONALIZATION Example 1: Let. Fid a formula for A k, give that P 1 1 = 1 2 ad, where Solutio: The stadard formula for the iverse of a 2 2 matrix yields
More informationSimple Linear Regression
Chapter 2 Simple Liear Regressio 2.1 Simple liear model The simple liear regressio model shows how oe kow depedet variable is determied by a sigle explaatory variable (regressor). Is is writte as: Y i
More informationGoodness-Of-Fit For The Generalized Exponential Distribution. Abstract
Goodess-Of-Fit For The Geeralized Expoetial Distributio By Amal S. Hassa stitute of Statistical Studies & Research Cairo Uiversity Abstract Recetly a ew distributio called geeralized expoetial or expoetiated
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationClassification of problem & problem solving strategies. classification of time complexities (linear, logarithmic etc)
Classificatio of problem & problem solvig strategies classificatio of time complexities (liear, arithmic etc) Problem subdivisio Divide ad Coquer strategy. Asymptotic otatios, lower boud ad upper boud:
More informationProblem Set 4 Due Oct, 12
EE226: Radom Processes i Systems Lecturer: Jea C. Walrad Problem Set 4 Due Oct, 12 Fall 06 GSI: Assae Gueye This problem set essetially reviews detectio theory ad hypothesis testig ad some basic otios
More informationLainiotis filter implementation. via Chandrasekhar type algorithm
Joural of Computatios & Modellig, vol.1, o.1, 2011, 115-130 ISSN: 1792-7625 prit, 1792-8850 olie Iteratioal Scietific Press, 2011 Laiiotis filter implemetatio via Chadrasehar type algorithm Nicholas Assimais
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationTHE SYSTEMATIC AND THE RANDOM. ERRORS - DUE TO ELEMENT TOLERANCES OF ELECTRICAL NETWORKS
R775 Philips Res. Repts 26,414-423, 1971' THE SYSTEMATIC AND THE RANDOM. ERRORS - DUE TO ELEMENT TOLERANCES OF ELECTRICAL NETWORKS by H. W. HANNEMAN Abstract Usig the law of propagatio of errors, approximated
More informationStatistical Inference Based on Extremum Estimators
T. Rotheberg Fall, 2007 Statistical Iferece Based o Extremum Estimators Itroductio Suppose 0, the true value of a p-dimesioal parameter, is kow to lie i some subset S R p : Ofte we choose to estimate 0
More informationSymmetric Two-User Gaussian Interference Channel with Common Messages
Symmetric Two-User Gaussia Iterferece Chael with Commo Messages Qua Geg CSL ad Dept. of ECE UIUC, IL 680 Email: geg5@illiois.edu Tie Liu Dept. of Electrical ad Computer Egieerig Texas A&M Uiversity, TX
More informationLinear time invariant systems
Liear time ivariat systems Alejadro Ribeiro Dept. of Electrical ad Systems Egieerig Uiversity of Pesylvaia aribeiro@seas.upe.edu http://www.seas.upe.edu/users/~aribeiro/ February 25, 2016 Sigal ad Iformatio
More informationLecture 1: Channel Equalization 1 Advanced Digital Communications (EQ2410) 1. Overview. Ming Xiao CommTh/EES/KTH
: 1 Advaced Digital Commuicatios (EQ2410) 1 Tuesday, Ja. 20, 2015 8:15-10:00, D42 1 Textbook: U. Madhow, Fudametals of Digital Commuicatios, 2008 1 / 1 Overview 2 / 1 Chael Model Itersymbol iterferece
More informationChimica Inorganica 3
himica Iorgaica Irreducible Represetatios ad haracter Tables Rather tha usig geometrical operatios, it is ofte much more coveiet to employ a ew set of group elemets which are matrices ad to make the rule
More informationAnalysis of the Expected Number of Bit Comparisons Required by Quickselect
Aalysis of the Expected Number of Bit Comparisos Required by Quickselect James Alle Fill Takéhiko Nakama Abstract Whe algorithms for sortig ad searchig are applied to keys that are represeted as bit strigs,
More informationThe Discrete Fourier Transform
The Discrete Fourier Trasform Complex Fourier Series Represetatio Recall that a Fourier series has the form a 0 + a k cos(kt) + k=1 b k si(kt) This represetatio seems a bit awkward, sice it ivolves two
More informationCorrelation Regression
Correlatio Regressio While correlatio methods measure the stregth of a liear relatioship betwee two variables, we might wish to go a little further: How much does oe variable chage for a give chage i aother
More informationw (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.
2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For
More informationADVANCED DIGITAL SIGNAL PROCESSING
ADVANCED DIGITAL SIGNAL PROCESSING PROF. S. C. CHAN (email : sccha@eee.hku.hk, Rm. CYC-702) DISCRETE-TIME SIGNALS AND SYSTEMS MULTI-DIMENSIONAL SIGNALS AND SYSTEMS RANDOM PROCESSES AND APPLICATIONS ADAPTIVE
More informationThe Method of Least Squares. To understand least squares fitting of data.
The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve
More informationComparison of Minimum Initial Capital with Investment and Non-investment Discrete Time Surplus Processes
The 22 d Aual Meetig i Mathematics (AMM 207) Departmet of Mathematics, Faculty of Sciece Chiag Mai Uiversity, Chiag Mai, Thailad Compariso of Miimum Iitial Capital with Ivestmet ad -ivestmet Discrete Time
More informationCHAPTER I: Vector Spaces
CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig
More informationReliability and Queueing
Copyright 999 Uiversity of Califoria Reliability ad Queueig by David G. Messerschmitt Supplemetary sectio for Uderstadig Networked Applicatios: A First Course, Morga Kaufma, 999. Copyright otice: Permissio
More informationCO-LOCATED DIFFUSE APPROXIMATION METHOD FOR TWO DIMENSIONAL INCOMPRESSIBLE CHANNEL FLOWS
CO-LOCATED DIFFUSE APPROXIMATION METHOD FOR TWO DIMENSIONAL INCOMPRESSIBLE CHANNEL FLOWS C.PRAX ad H.SADAT Laboratoire d'etudes Thermiques,URA CNRS 403 40, Aveue du Recteur Pieau 86022 Poitiers Cedex,
More informationLecture 7: October 18, 2017
Iformatio ad Codig Theory Autum 207 Lecturer: Madhur Tulsiai Lecture 7: October 8, 207 Biary hypothesis testig I this lecture, we apply the tools developed i the past few lectures to uderstad the problem
More informationSupport vector machine revisited
6.867 Machie learig, lecture 8 (Jaakkola) 1 Lecture topics: Support vector machie ad kerels Kerel optimizatio, selectio Support vector machie revisited Our task here is to first tur the support vector
More informationFinite-length Discrete Transforms. Chapter 5, Sections
Fiite-legth Discrete Trasforms Chapter 5, Sectios 5.2-50 5.0 Dr. Iyad djafar Outlie The Discrete Fourier Trasform (DFT) Matrix Represetatio of DFT Fiite-legth Sequeces Circular Covolutio DFT Symmetry Properties
More informationProbability of error for LDPC OC with one co-channel Interferer over i.i.d Rayleigh Fading
IOSR Joural of Electroics ad Commuicatio Egieerig (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 9, Issue 4, Ver. III (Jul - Aug. 24), PP 59-63 Probability of error for LDPC OC with oe co-chael
More informationA. Basics of Discrete Fourier Transform
A. Basics of Discrete Fourier Trasform A.1. Defiitio of Discrete Fourier Trasform (8.5) A.2. Properties of Discrete Fourier Trasform (8.6) A.3. Spectral Aalysis of Cotiuous-Time Sigals Usig Discrete Fourier
More information4.1 Sigma Notation and Riemann Sums
0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas
More informationCS284A: Representations and Algorithms in Molecular Biology
CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by
More informationVector Quantization: a Limiting Case of EM
. Itroductio & defiitios Assume that you are give a data set X = { x j }, j { 2,,, }, of d -dimesioal vectors. The vector quatizatio (VQ) problem requires that we fid a set of prototype vectors Z = { z
More information1 Adiabatic and diabatic representations
1 Adiabatic ad diabatic represetatios 1.1 Bor-Oppeheimer approximatio The time-idepedet Schrödiger equatio for both electroic ad uclear degrees of freedom is Ĥ Ψ(r, R) = E Ψ(r, R), (1) where the full molecular
More informationApply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.
Eigevalue-Eigevector Istructor: Nam Su Wag eigemcd Ay vector i real Euclidea space of dimesio ca be uiquely epressed as a liear combiatio of liearly idepedet vectors (ie, basis) g j, j,,, α g α g α g α
More information17. Joint distributions of extreme order statistics Lehmann 5.1; Ferguson 15
17. Joit distributios of extreme order statistics Lehma 5.1; Ferguso 15 I Example 10., we derived the asymptotic distributio of the maximum from a radom sample from a uiform distributio. We did this usig
More informationSignal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University.
Sigal Processig Lecture 02: Discrete Time Sigals ad Systems Ahmet Taha Koru, Ph. D. Yildiz Techical Uiversity 2017-2018 Fall ATK (YTU) Sigal Processig 2017-2018 Fall 1 / 51 Discrete Time Sigals Discrete
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013. Large Deviations for i.i.d. Random Variables
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013 Large Deviatios for i.i.d. Radom Variables Cotet. Cheroff boud usig expoetial momet geeratig fuctios. Properties of a momet
More informationDiversity Combining Techniques
Diversity Combiig Techiques Whe the required sigal is a combiatio of several waves (i.e, multipath), the total sigal amplitude may experiece deep fades (i.e, Rayleigh fadig), over time or space. The major
More informationTime-Domain Representations of LTI Systems
2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable
More information[412] A TEST FOR HOMOGENEITY OF THE MARGINAL DISTRIBUTIONS IN A TWO-WAY CLASSIFICATION
[412] A TEST FOR HOMOGENEITY OF THE MARGINAL DISTRIBUTIONS IN A TWO-WAY CLASSIFICATION BY ALAN STUART Divisio of Research Techiques, Lodo School of Ecoomics 1. INTRODUCTION There are several circumstaces
More informationLecture 19: Convergence
Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may
More informationMechanical Quadrature Near a Singularity
MECHANICAL QUADRATURE NEAR A SINGULARITY 215 Mechaical Quadrature Near a Sigularity The purpose of this ote is to preset coefficiets to facilitate computatio of itegrals of the type I x~^fix)dx. If the
More informationWe are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n
Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at
More informationChapter 9 - CD companion 1. A Generic Implementation; The Common-Merge Amplifier. 1 τ is. ω ch. τ io
Chapter 9 - CD compaio CHAPTER NINE CD-9.2 CD-9.2. Stages With Voltage ad Curret Gai A Geeric Implemetatio; The Commo-Merge Amplifier The advaced method preseted i the text for approximatig cutoff frequecies
More informationAssignment 2 Solutions SOLUTION. ϕ 1 Â = 3 ϕ 1 4i ϕ 2. The other case can be dealt with in a similar way. { ϕ 2 Â} χ = { 4i ϕ 1 3 ϕ 2 } χ.
PHYSICS 34 QUANTUM PHYSICS II (25) Assigmet 2 Solutios 1. With respect to a pair of orthoormal vectors ϕ 1 ad ϕ 2 that spa the Hilbert space H of a certai system, the operator  is defied by its actio
More information(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:
Math 5-4 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig facts,
More informationON POINTWISE BINOMIAL APPROXIMATION
Iteratioal Joural of Pure ad Applied Mathematics Volume 71 No. 1 2011, 57-66 ON POINTWISE BINOMIAL APPROXIMATION BY w-functions K. Teerapabolar 1, P. Wogkasem 2 Departmet of Mathematics Faculty of Sciece
More informationAbstract Vector Spaces. Abstract Vector Spaces
Astract Vector Spaces The process of astractio is critical i egieerig! Physical Device Data Storage Vector Space MRI machie Optical receiver 0 0 1 0 1 0 0 1 Icreasig astractio 6.1 Astract Vector Spaces
More informationOrthogonal transformations
Orthogoal trasformatios October 12, 2014 1 Defiig property The squared legth of a vector is give by takig the dot product of a vector with itself, v 2 v v g ij v i v j A orthogoal trasformatio is a liear
More informationAnalysis of Discrete-Time MIMO OFDM-Based Orthogonal Time Frequency Space Modulation
Aalysis of Discrete-Time MIMO OFDM-Based Orthogoal Time Frequecy Space Modulatio Ahmad RezazadehReyhai, Arma Farhag, Migyue Ji, Rog Rog Che ad Behrouz Farhag-Boroujey ECE Departmet, Uiversity of Utah,
More informationLecture 2: Monte Carlo Simulation
STAT/Q SCI 43: Itroductio to Resamplig ethods Sprig 27 Istructor: Ye-Chi Che Lecture 2: ote Carlo Simulatio 2 ote Carlo Itegratio Assume we wat to evaluate the followig itegratio: e x3 dx What ca we do?
More informationApproximations and more PMFs and PDFs
Approximatios ad more PMFs ad PDFs Saad Meimeh 1 Approximatio of biomial with Poisso Cosider the biomial distributio ( b(k,,p = p k (1 p k, k λ: k Assume that is large, ad p is small, but p λ at the limit.
More information