BER Analysis and Optimization of Generalized Spatial Modulation in Correlated Fading Channels

Size: px
Start display at page:

Download "BER Analysis and Optimization of Generalized Spatial Modulation in Correlated Fading Channels"

Transcription

1 BER Aalysis ad Optimizatio of Geeralized Spatial odulatio i Correlated Fadig Chaels Thomas Hadte, Adreas üller ad Joachim Speidel Istitute of Telecommuicatios, Uiversity of Stuttgart, Germay {hadte, mueller, speidel}@iue.ui-stuttgart.de Abstract We propose ad aalyze a geeralized spatial modulatio scheme, where depedig o the bits to be trasmitted a certai data symbol as well as a certai beamformig vector is chose. The receiver the has to estimate both the used beamformig vector ad the trasmitted data symbol for beig able to recostruct the origially trasmitted bit sequece. We aalyze our scheme theoretically by derivig a very tight upper boud o the average bit error rate BER) for arbitrary symbol costellatios ad beamformig codebooks i correlated Rayleigh fadig chaels. Based o this boud, we determie a desig criterio for optimizig the used beamformig codebook i presece of spatial correlatio at the trasmitter-side. Simulatio results are show to be i excellet agreemet with our aalytical calculated BERs ad they illustrate the sigificat performace gais that ca be obtaied with our geeralized scheme compared to covetioal spatial modulatio. I. ITRODUCTIO The ever icreasig demad for higher data rates i wireless commuicatio systems requires iovative trasmissio schemes achievig a high spectral efficiecy. I this regard, multiple-iput multiple-output IO) systems have become a key techology for achievig this target ad a great variety of correspodig trasmissio schemes has bee proposed ad thoroughly aalyzed i literature withi the past few years. With the well-kow vertical Bell Labs layered spacetime V-BLAST) architecture, for example, complex data symbols are simultaeously trasmitted usig differet atea elemets, thus directly icreasig the achievable data rates by a factor of i the ideal case []. However, due to the iheret iter-chael iterferece ICI) of such systems, rather complex receiver structures like maximum likelihood L) or ordered successive iterferece cacelatio OSIC) receivers are required for achievig a good performace. I order to mitigate the computatioal requiremets at the receiver-side while still achievig a good performace, recetly so-called spatial modulatio has bee proposed [], [3]. Spatial modulatio is a fudametally ovel trasmissio techique for IO systems, where depedig o the iput bits both a sigle trasmit atea elemet as well as a complex data symbol is chose. Hece, the actual iformatio to be trasmitted is cotaied i the trasmitted data symbol as well as i the selected trasmit atea elemet. Sice oly oe trasmit atea is active per poit i time, ICI is completely avoided, thus allowig sigificatly less complex receiver structures, which ow have to estimate both the active trasmit atea ad the actual data symbol [], [3]. The performace of spatial modulatio has bee thoroughly ivestigated for certai low-complexity receiver structures i [3] ad it has bee show that it is possible to achieve a comparable performace to covetioal V-BLAST systems with a remarkably lower complexity. Besides, the optimal detectio algorithm of a spatial modulatio system has recetly bee preseted i [4] ad aalytical expressios for the average BER have bee obtaied based o the correspodig pairwise error probabilities PEP). However, the derived results are oly valid for real-valued sigal poit costellatios ad scearios without ay spatial correlatio at the trasmitter- or receiver-side. Recetly, i [5] the authors proposed so-called geeralized space-shift keyig as a special case of spatial modulatio, where the data to be trasmitted is exclusively ecoded i the selectio of a certai set of trasmit ateas, without performig ay symbol modulatio. I this paper, we first geeralize the origial spatial modulatio scheme itroduced i [] by ot selectig a sigle trasmit atea elemet based o the bits to be trasmitted, but rather a certai beamformig vector from a give codebook. I a ext step, we aalyze the correspodig performace by derivig a very tight upper boud o the average BER, which i cotrast to the results i [4] is valid for arbitrary complex-valued data symbols as well as arbitrarily correlated chaels. Based o this result, we determie a simple criterio for optimizig the BER performace by choosig a appropriate log-term beamformig codebook depedig o the spatial correlatio properties at the trasmitter-side. Simulatio results show that it is possible to reduce the average BERs tremedously compared to a covetioal spatial modulatio system. The paper is orgaized as follows: Sectio II itroduces the system model ad the detectio algorithm. I Sectio III, we derive the tight BER boud, whereas the optimizatio criterio is preseted i Sectio IV. Simulatio results are show i Sectio V ad Sectio VI fially cocludes the paper. Throughout this paper, we use the followig otatio. Bold lower case letters represet vectors, while bold upper case letters deote matrices. The Hermitia trasposed, the trace ad the determiat of a matrix A are idicated by A H, tr A) ad det A), respectively. We use for the Kroecker product ad vec A) stacks all colums of A ito a vector. Furthermore, E [.] represets the expected value of a radom variable RV) ad a complex Gaussia distributio with mea m ad variace σ is deoted by C m, σ ).The-th partial derivative with respect to variable s is idicated by s /9/$5. 9 IEEE

2 II. SYSTE ODEL Figure shows the cosidered IO system with trasmit ad receive ateas. The covetioal) spatial mapper maps a certai umber of iput bits b oto a vector symbol qe i, where e i = [......] T deotes the i-th uit vector havig oe o-zero etry at the i-th positio.the modulatio symbol q ca be draw from ay real- or complexvalued symbol costellatio. For illustratig the basic priciple i detail, a exemplary mappig process is show i Fig. for a IO system with four trasmit ateas ad a QPSK costellatio. Before every trasmissio iterval, four bits are take from the iput stream, where the first two bits are used for selectig a uit vector e i ad hece oe out of four available ateas whereas the other two bits are mapped to a complex QPSK symbol q. I the case of covetioal spatial modulatio as itroduced i [], the sigal qe i would the be directly trasmitted, thus havig always oly oe active trasmit atea. The umber of simultaeously trasmitted bits per chael use or equivaletly the spectral efficiecy is clearly give by η = η symb + log ), ) where η symb deotes the umber of bits per data symbol q ad depeds o the applied sigal poit costellatio. As a geeralizatio, we propose to select a geeral beamformig vector p i from a give codebook based o the first iput bits rather tha a uit vector e i. Hece, the actual trasmit sigal is geerally give by qp i ad the symbol q is ot ecessarily trasmitted over oly oe sigle atea elemet. This approach ca be easily implemeted by multiplyig the output of the covetioal spatial mapper with a precodig matrix P =[p,..., p ] as depicted i Fig., which i fact represets the codebook of available beamformig vectors. Clearly, if P is chose as the idetity matrix of size, our geeralized scheme reduces to covetioal spatial modulatio as a special case. Besides, it is quite obvious that the liear trasformatio doe by P eeds to be ivertible i.e. det P) ) ad that the total mea trasmit power must ot be affected by P i.e. tr P H P ) = ). I the followig, we always assume that the vector s = qp i is trasmitted through a correlated frequecy-flat Rayleigh fadig chael H = A H H W B, where the matrices A ad B are the square roots of the correlatio matrices R rx = A H A ad R tx = B H B, respectively. Furthermore, the etries of H W b Spatial apper qe i Geeralized Spatial apper ˆb P qp i Spatial Demapper ˆq ê i H + L Detector r Fig.. b...] [...,, e e e 3 e 4 e j π 4 e j 3π 4 e j 7π 4 e j 5π 4 e j 3π 4 qe i Exemplary mappig process iside the Spatial apper =4, QPSK). are modeled as idepedet, complex Gaussia RVs accordig to C, ). It is well-kow that autocorrelatio matrix R HH of H is the give by R HH = R tx R rx. The elemets of the AWG vector are assumed to be idepedet ad idetically distributed accordig to C,σ). The received sigal vector r is the give by r = Hs + ad a maximum likelihood L) detector [4] estimates the trasmitted symbol vectors accordig to ˆq, ê i ) = arg mi q,ei) r HPqe i. Provided that the mea symbol power is ormalized i.e., E [ q ] =) ad that P fulfills the metioed prerequisites, the average SR per receive atea is geerally give by σ. Due to the isertio of the prefilter matrix P, geerally more tha oe TX atea is active per poit i time, resultig i a higher trasmitter ad receiver complexity. However, this approach has the big advatage that the available trasmit power ca be equally distributed amog all atea elemets while covetioal spatial modulatio assigs the power to oly oe atea elemet. This has for example the potetial to sigificatly reduce the requiremets o the used amplifiers. I fact, if P is chose as a discrete Fourier trasform matrix [P] p,q =exp j π ) p ) q ) p, q =,...,, ) every atea elemet is always active ad trasmits at the same costat power level. Clearly, without spatial correlatio at the trasmitter-side, ay uitary matrix P achieves the same performace as covetioal spatial modulatio sice the statistical properties of H W ad H W P are idetical. However, i presece of spatial correlatio, this is geerally o loger the case ad P might be chose appropriately i order to achieve a more reliable trasmissio. We follow this idea i Sectio IV, where we derive a desig criterio for the matrix P for such a sceario. III. PERFORACE AALYSIS I the followig, we derive a tight upper boud o the average BER of our geeralized spatial modulatio scheme based o the PEP P x ˆx), which deotes the probability that the receiver decides more likely i favor of a vector symbol ˆx tha i favor of the actually trasmitted vector symbol x. Havig a L detector at the receiver-side, this PEP ca be formulated as P x ˆx) =Prob [ r x Hx > r x Hˆx ], 3) Fig.. Cosidered system model. Please ote that the receiver complexity is higher tha i [4], sice r eeds to be compared to qhp i istead of qh i.

3 where r x = Hx + deotes the oisy received sigal. Please ote that the defiitio of the PEP i 3) takes oly two vector symbols x ad ˆx ito accout. As the Euclidea distace from r x to all other vector symbols x ˆx of the sigal space is ot cosidered, there might actually be aother vector symbol which is more likely detected tha ˆx. Followig the aalysis i [6], the PEP accordig to 3) coditioed o H ca be rewritte as P x ˆx H) =Q H x ˆx), 4) σ where Q ) deotes the Gaussia Q-fuctio. Averagig 4) over the distributio of H may be accomplished usig a alterative expressio for the Q-fuctio as i [7], where it is show that the ucoditioal PEP ca be obtaied by P x ˆx) = π ) Φ π 4σ si dθ, 5) θ with Φs) deotig the momet-geeratig fuctio GF) of the RV Hδ, where δ = x ˆx. Clearly, Hδ ca be expressed as a complex quadratic form like i [7] as Hδ = vec H H ) H H W R s I δδ H) R s vec H H ) W, 6) with the short-had otatio R s = R rx R tx.usigthe results derived i [8], the GF of 6) ca the be expressed as Φs) = ). 7) det I sr H s I δδ H ) R s athematical maipulatios as i [7, eqs. 7)-9)] lead to Φs) = sψ i= j= i ξ j, 8) where the parameters ψ i ad ξ j deote the eigevalues of the matrices δδ H R tx ad R rx, respectively. Clearly, δδ H R tx has for ay δ ad R tx always rak oe due to the factor δδ H. For that reaso, there is geerally oly oe sigle o-zero eigevalue ψ, which ca be determied by ψ = ψ i = tr δδ H ) R tx = δ H R tx δ, 9) i so that Φs) ca be rewritte as P Φs) =, ) j j= sψξ j ) where ξ,...,ξ P deote the P distict eigevalues of R rx, which occur with multiplicities,..., P. Combiig ) with 5), it is evetually possible to derive exact aalytical closed-form expressios for the correspodig PEPs. Expadig Φs) accordig to ) ito partial fractios, we obtai Φs) = P j j= m= A j,m sψξ j ) m ) where the parameters A j,m deote the correspodig expasio coefficiets, which ca geerally be determied as A j,m = j m)! ψξ j ) j m j m P ) s j m. sψξ ν ) ν ν= ν j s= ψξ j Combiig ) with 5) ad usig the itegratio result preseted i [9, App. B], we fially obtai the exact aalytical closed-form expressio for the PEP P x ˆx) = = P j j= m= P j ψξj A j,m μ j= m= m ν= 4σ A j,m π ) m π m +ν ν si θ si θ + ψξj 4σ )[ μ )] ν ψξj, 4σ ) m dθ 3) 4) where the short-had otatio μ x) is defied as μ x) = ) +, x. 5) x If we have spatial correlatio at the trasmitter-side oly, the PEP expressio of 4) ca be simplified as R rx correspods to the idetity matrix ad thus P = ad the eigevalue ξ is equal to oe ad has a multiplicity of =. It ca be show that i this case the -th expasio coefficiet A, equals oe ad all other coefficiets A,m m are equal to zero. Hece, we obtai for the PEP ) ψ P x ˆx) =μ +k ) [ )] k ψ 4σ k μ 4σ k= 6) with μ x) accordig to 5). A. Havig aalytical closed-form expressios for the average PEP, we ca derive a accurate approximatio for the average BER []. Cosiderig oly a sigle vector symbol x, itca easily be see that its average BER is geerally bouded by P e,bit x) d x, ˆx) P x ˆx), 7) η where d x, ˆx) deotes the Hammig distace ad idicates the umber of differeces i the bits associated with the vector symbols x ad ˆx, respectively. Averagig P e,bit x) over all η differet symbols x leads to the total bit error probability. P tot e,bit E [ η ] d x, ˆx) P x ˆx) = η η x d x, ˆx) P x ˆx). 8)

4 B. Theoretical BER Limits of Spatial odulatio The asymptotic performace of ay space-time code is usually quatified i terms of the correspodig diversity order ad codig gai. I this regard, the diversity order specifies how fast the average BER decays with icreasig SR i the high SR regime whereas the codig gai is reflected by a certai SR shift. I fact, spatial modulatio basically represets just a special space-time code ad hece it ca be aalyzed i exactly the same way. I geeral, the maximum achievable diversity order is determied by the umber of ozero eigevalues ψ i ad ξ j. Assumig a receive correlatio matrix R rx with full rak, the RX diversity is equal to. However, as ca be see from 9), there is always oe ozero eigevalue ψ. Therefore, spatial modulatio ca ever achieve a higher diversity order tha. Cosiderig a system without chael codig, spatial modulatio therefore experieces geerally a performace pealty compared to most other space-time codes, which are capable of exploitig trasmit diversity as well. This also holds for the well-kow Alamouti code [], for example, which trasmits the iformatio i two cosecutive time itervals over two trasmit ateas, thus achievig a diversity order of resultig i a lower BER i the high SR regime. However, at low ad medium SR, the BER of spatial modulatio ca evertheless be lower due to a higher codig gai. IV. OPTIIZATIO OF THE PREFILTER ATRIX As already metioed before, spatial modulatio caot exploit ay trasmit diversity ad therefore the oly way to improve its performace by choosig a appropriate beamformig codebook P is to optimize the codig gai. Keepig i mid that the eigevalues ξ j of R rx are idepedet of the prefilter parameters, oly ψ may be iflueced. I the followig, δ is cosidered to be the differece betwee two sigal vectors from the Spatial apper. I presece of a prefilter P, ψ is give by ψ = δ H P H R tx Pδ. 9) Clearly, miimizig the average BER is equivalet to a joit miimizatio of all PEPs. As it ca be see from 4) ad 5), the PEPs are miimized if their correspodig ψ is maximized. Assumig that all PEPs cotribute equally to the average BER, the followig optimizatio criterio is adequate { } P = arg max P mi {ψ δ)} δ. ) As the prefilter has to fulfill the power costrait, the optimizatio i ) is subjected to tr PP H) =. Please ote that the miimum operator i ) is take over every sigal vector differece, which yields i geeral η η ) differet combiatios. The expoetially growig amout of combiatios i ) requires a computer aided evaluatio. However, a prefilter sample may be rapidly checked for its performace by calculatig its ψ mi = mi {ψ δ)}. The higher ψ mi is, the lower the BER will be. δ Furthermore, it should be oted that this optimizatio criterio is ivariat with respect to the applied mappig sice the impact of d x, ˆx) has bee eglected. V. SIULATIO RESULTS I the followig, we preset selected performace results to illustrate that our aalytically calculated average BERs are i good agreemet with simulated values ad how the performace might be sigificatly improved by choosig a appropriate codebook matrix P. I this regard, we assume that the receiver performs a L detectio ad that for the selectio of a appropriate modulatio symbol q a stadard Gray mappig is used. Besides, spatial correlatio at the trasmitter ad receiver-side is modeled usig a expoetial correlatio model with two idepedet parameters ρ tx ad ρ rx, respectively. Hece, the correspodig correlatio matrices R tx ad R rx are geerally give by { ρ p q tx q p [R tx ] p,q = [ ρ q p] p, q =,..., ) tx q>p { ρ p q rx q p [R rx ] p,q = [ρrx q p ] p, q =,...,. ) q>p Figure 3 shows the average BER of covetioal spatial modulatio P = I) with =4TX ad =4RX ateas as well as QPSK, resultig i a total spectral efficiecy of bit 4 s Hz. Both simulatio ad aalytical results are plotted for the o-correlated, TX or RX correlated case. First of all, it ca be see that the deviatio betwee the simulated ad the aalytical results is almost egligible, especially i the high SR regio. Clearly, this holds for all cosidered correlatio coefficiets ρ tx ad ρ rx. oreoever, it is obvious that i presece of spatial correlatio either at the trasmitteror the receiver-side, the performace degrades cosiderably compared to the totally ucorrelated case, resultig i a effective SR loss of more tha 6.5 db i the high SR regio, for example. Figure 4 shows the BER performace of a IO scheme with =TX ad =4RX ateas. Covetioal spatial modulatio with QPSK is compared to a Alamouti scheme with 8-PSK, so that the spectral efficiecy is equal to 3 bit s Hz i both cases. Cosiderig the totally ucorrelated case, spatial modulatio clearly exhibits a smaller BER tha the Alamouti scheme i the low SR regio. However, with icreasig SR the Alamouti scheme beefits from its higher diversity order, therefore geerally leadig to a better performace. The itersectio of both BER curves will move to higher SR, whe η icreases because the Alamouti scheme suffers from the higher modulatio order. I case of TX correlatio, the Alamouti scheme has a lower BER tha covetioal spatial modulatio, yieldig a gai of 4 db at a BER of 3. Figure 5 shows the BER of a spatial modulatio scheme with =TX, =4RX ateas ad QPSK with ad without spatial correlatio at the trasmitter-side. I order to improve the performace, i this case, the codebook matrix P has bee optimized by meas of a exhaustive search ad is

5 ρ tx=.ρ rx=. Aalytical ρ tx=.ρ rx=. Simulatio ρ tx=.ρ rx=.9 Aalytical ρ tx=.ρ rx=.9 Simulatio ρ tx=.9ρ rx=. Aalytical ρ tx=.9ρ rx=. Simulatio Average SR [db] Fig. 3. BER as a fuctio of SR for covetioal spatial modulatio with 4 TX, 4 RX ateas ad QPSK. Simulatio ad aalytical results are compared Sp. od. ρ tx=. Aalytical Sp. od. ρ tx=. Simulatio Sp. od. ρ tx=.9 Aalytical Sp. od. ρ tx=.9 Simulatio Alamouti ρ tx=. Simulatio Alamouti ρ tx=.9 Simulatio Average SR [db] Fig. 4. Compariso betwee spatial modulatio ad a Alamouticode, usig a IO scheme with TX ad 4 RX ateas. To achieve η =3 bit s Hz spatial modulatio uses QPSK ad the Alamouti scheme uses 8-PSK. give by ).5+j.5.5+j.5 P =. 3).5 j.5.5 +j.5 Obviously, without prefilter ad spatial correlatio, there is a sigificat loss of 6 db at BER 3 compared to the ucorrelated case. With the prefilter of 3), i cotrast, this loss is oly up to about db, what illustrates the sigificat gais that ca be gaied by meas of our geeralized spatial modulatio scheme. VI. COCLUSIO We have proposed a geeralized spatial modulatio scheme, where the bits to be trasmitted are ecoded through the choice of a certai beamformig vector as well as a particular data symbol. Furthermore, we have performed a theoretical aalysis of our approach by derivig a very tight upper boud o the average BER for arbitrary sigal poit costellatios ad beamformig codebooks i spatially correlated Rayleigh fadig chaels. As codebooks provide ew degrees of freedom, we have determied a simple optimizatio criterio for desigig a appropriate beamformig codebook, reducig the BER i presece of spatial correlatio at the trasmitter-side. Fially, simulatio results were show to be i good agreemet with our aalytically calculated BERs ad they illustrated that our geeralized approach ca yield SR gais i the order of several dbs compared to covetioal spatial modulatio. REFERECES [] P. W. Woliasky, G. J. Foschii, G. D. Golde, ad R. A. Valezuela, V-BLAST: A architecture for realizig very high data rates over the rich-scatterig wireless chael, URSI It. Symp. o Sigals, Systems, ad Electroics, pp. 95 3, Sep-Oct 998. [] R. esleh, H. Haas, C. W. Ah, ad S. Yu, Spatial modulatio - A ew low complexity spectral efficiecy ehacig techique, It. Cof. o Commu. ad etw. i Chia, 6., Oct. 6. [3] R. esleh, H. Haas, S. Siaovic, C. W. Ah, ad S. Yu, Spatial modulatio, IEEE Tras. o Veh. Techol., vol. 57, o. 4, pp. 8 4, July ρ tx=. w/o Prefilter Aalytical) ρ tx=. w/o Prefilter Simulatio) ρ tx=.9 w/o Prefilter Aalytical) ρ tx=.9 w/o Prefilter Simulatio) ρ tx=.9 w/ Prefilter Aalytical) ρ tx=.9 w/ Prefilter Simulatio) Average SR [db] Fig. 5. Performace of spatial modulatio with ad without prefilter uder differet TX correlatio properties. The IO scheme features TX, 4 RX ateas ad QPSK symbols. ρ rx = [4] J. Jegaatha, A. Ghrayeb, ad L. Szczeciski, Spatial modulatio: Optimal detectio ad performace aalysis, IEEE Commu. Lett., vol., o. 8, pp , Aug. 8. [5], Geeralized space shift keyig modulatio for mimo chaels, IEEE It. Symp. o Persoal, Idoor ad obile Radio Commu., 8., Sept. 8. [6]. Simo ad.-s. Alouii, Digital Commuicatio over Fadig Chaels, d ed. Wiley Itersciece, 5. [7] A. Hedayat, H. Shah, ad A. osratiia, Aalysis of space-time codig i correlated fadig chaels, IEEE Tras. o Wireless Commu., vol. 4, o. 6, pp , ov. 5. [8] G. L. Turi, The characteristic fuctio of hermitia quadratic forms i complex ormal variables, Biometrika, vol. 47, o. -, pp. 99, 96. [9].-S. Alouii ad A. Goldsmith, A uified approach for calculatig error rates of liearly modulated sigals over geeralized fadig chaels, IEEE Tras. o Commu., vol. 47, o. 9, pp , Sep 999. [] J. G. Proakis, Digital Commuicatios, 4th ed. cgraw-hill, 4. [] S. Alamouti, A simple trasmit diversity techique for wireless commuicatios, IEEE Joural o Selected Areas i Commu., vol. 6, o. 8, pp , Oct 998.

Diversity Combining Techniques

Diversity 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 information

OFDM Precoder for Minimizing BER Upper Bound of MLD under Imperfect CSI

OFDM 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 information

Session 5. (1) Principal component analysis and Karhunen-Loève transformation

Session 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 information

BER results for a narrowband multiuser receiver based on successive subtraction for M-PSK modulated signals

BER results for a narrowband multiuser receiver based on successive subtraction for M-PSK modulated signals results for a arrowbad multiuser receiver based o successive subtractio for M-PSK modulated sigals Gerard J.M. Jasse Telecomm. ad Traffic-Cotrol Systems Group Dept. of Iformatio Techology ad Systems Delft

More information

The Maximum-Likelihood Decoding Performance of Error-Correcting Codes

The 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 information

Lecture 7: MIMO Architectures Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH

Lecture 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 information

Linear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d

Linear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d Liear regressio Daiel Hsu (COMS 477) Maximum likelihood estimatio Oe of the simplest liear regressio models is the followig: (X, Y ),..., (X, Y ), (X, Y ) are iid radom pairs takig values i R d R, ad Y

More information

A statistical method to determine sample size to estimate characteristic value of soil parameters

A statistical method to determine sample size to estimate characteristic value of soil parameters A statistical method to determie sample size to estimate characteristic value of soil parameters Y. Hojo, B. Setiawa 2 ad M. Suzuki 3 Abstract Sample size is a importat factor to be cosidered i determiig

More information

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j The -Trasform 7. Itroductio Geeralie the complex siusoidal represetatio offered by DTFT to a represetatio of complex expoetial sigals. Obtai more geeral characteristics for discrete-time LTI systems. 7.

More information

Linear Regression Demystified

Linear 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 information

Probability of error for LDPC OC with one co-channel Interferer over i.i.d Rayleigh Fading

Probability 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 information

Optimally Sparse SVMs

Optimally 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 information

OPTIMAL PIECEWISE UNIFORM VECTOR QUANTIZATION OF THE MEMORYLESS LAPLACIAN SOURCE

OPTIMAL 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 information

Since 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

Since 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 information

1 Introduction to reducing variance in Monte Carlo simulations

1 Introduction to reducing variance in Monte Carlo simulations Copyright c 010 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a ukow mea µ = E(X) of a distributio by

More information

The Method of Least Squares. To understand least squares fitting of data.

The 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 information

ANALYTICAL APPROACH IN ESTIMATING ERROR PERFORMANCE OF PARTIALLY COHERENT PSK RECEIVER OVER KAPPA-MU FADING UDC ( :519.

ANALYTICAL APPROACH IN ESTIMATING ERROR PERFORMANCE OF PARTIALLY COHERENT PSK RECEIVER OVER KAPPA-MU FADING UDC ( :519. FACTA UNIVERSITATIS Series: Automatic Cotrol ad Robotics Vol. 15, N o 1, 016, pp. 33-4 ANALYTICAL APPROACH IN ESTIMATING ERROR PERFORMANCE OF PARTIALLY COHERENT PSK RECEIVER OVER KAPPA-MU FADING UDC (61.395.38:519.74)

More information

Topic 9: Sampling Distributions of Estimators

Topic 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 information

Information-based Feature Selection

Information-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 information

Unifying Performance Analysis of Linear MIMO Receivers in Correlated Rayleigh Fading Environments

Unifying Performance Analysis of Linear MIMO Receivers in Correlated Rayleigh Fading Environments Uifyig Performace Aalysis of Liear MIMO Receivers i Correlated Rayleigh Fadig Eviromets Mario Kiesslig,2, Joachim Speidel Istitute of Telecommuicatios, Uiversity of Stuttgart, Germay 2 Siemes AG, Iformatio

More information

Support vector machine revisited

Support 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 information

Performance Analysis and Channel Capacity for Multiple-Pulse Position Modulation on Multipath Channels

Performance Analysis and Channel Capacity for Multiple-Pulse Position Modulation on Multipath Channels Performace Aalysis ad Chael Capacity for Multiple-Pulse Positio Modulatio o Multipath Chaels Hyucheol Park ad Joh R. Barry School of Electrical ad Computer Egieerig Georgia Istitute of Techology, Atlata,

More information

Vector Quantization: a Limiting Case of EM

Vector 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 information

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.

w (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 information

Basics of Probability Theory (for Theory of Computation courses)

Basics of Probability Theory (for Theory of Computation courses) Basics of Probability Theory (for Theory of Computatio courses) Oded Goldreich Departmet of Computer Sciece Weizma Istitute of Sciece Rehovot, Israel. oded.goldreich@weizma.ac.il November 24, 2008 Preface.

More information

Symmetric Two-User Gaussian Interference Channel with Common Messages

Symmetric 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 information

Random Variables, Sampling and Estimation

Random Variables, Sampling and Estimation Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig

More information

The target reliability and design working life

The target reliability and design working life Safety ad Security Egieerig IV 161 The target reliability ad desig workig life M. Holický Kloker Istitute, CTU i Prague, Czech Republic Abstract Desig workig life ad target reliability levels recommeded

More information

Principle Of Superposition

Principle Of Superposition ecture 5: PREIMINRY CONCEP O RUCUR NYI Priciple Of uperpositio Mathematically, the priciple of superpositio is stated as ( a ) G( a ) G( ) G a a or for a liear structural system, the respose at a give

More information

The Random Walk For Dummies

The Random Walk For Dummies The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli

More information

Problem Set 4 Due Oct, 12

Problem 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 information

Goodness-Of-Fit For The Generalized Exponential Distribution. Abstract

Goodness-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 information

Cooperative Communication Fundamentals & Coding Techniques

Cooperative Communication Fundamentals & Coding Techniques 3 th ICACT Tutorial Cooperative commuicatio fudametals & codig techiques Cooperative Commuicatio Fudametals & Codig Techiques 0..4 Electroics ad Telecommuicatio Research Istitute Kiug Jug 3 th ICACT Tutorial

More information

An Introduction to Randomized Algorithms

An 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 information

THE KALMAN FILTER RAUL ROJAS

THE 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 information

62. 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 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 information

Fixed-Threshold Polar Codes

Fixed-Threshold Polar Codes Fixed-Threshold Polar Codes Jig Guo Uiversity of Cambridge jg582@cam.ac.uk Albert Guillé i Fàbregas ICREA & Uiversitat Pompeu Fabra Uiversity of Cambridge guille@ieee.org Jossy Sayir Uiversity of Cambridge

More information

CS284A: Representations and Algorithms in Molecular Biology

CS284A: 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 information

Fig. 2. Block Diagram of a DCS

Fig. 2. Block Diagram of a DCS Iformatio source Optioal Essetial From other sources Spread code ge. Format A/D Source ecode Ecrypt Auth. Chael ecode Pulse modu. Multiplex Badpass modu. Spread spectrum modu. X M m i Digital iput Digital

More information

Performance Analysis of Adaptive Coded Modulation with Antenna Diversity and Feedback Delay

Performance Analysis of Adaptive Coded Modulation with Antenna Diversity and Feedback Delay Performace Aalysis of Adaptive Coded Modulatio with Atea Diversity ad Feedback Delay Kjell J. Hole, Herik Holm, ad Geir E. Øie Abstract A geeral adaptive codig scheme for spectrally efficiet trasmissio

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

1 Adiabatic and diabatic representations

1 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 information

Orthogonal Gaussian Filters for Signal Processing

Orthogonal 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 information

Channel coding, linear block codes, Hamming and cyclic codes Lecture - 8

Channel coding, linear block codes, Hamming and cyclic codes Lecture - 8 Digital Commuicatio Chael codig, liear block codes, Hammig ad cyclic codes Lecture - 8 Ir. Muhamad Asial, MSc., PhD Ceter for Iformatio ad Commuicatio Egieerig Research (CICER) Electrical Egieerig Departmet

More information

Run-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE

Run-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 information

Discrete Orthogonal Moment Features Using Chebyshev Polynomials

Discrete 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 information

Encoding-Assisted Temporal Direct Mode Decision for B Pictures in H.264/AVC

Encoding-Assisted Temporal Direct Mode Decision for B Pictures in H.264/AVC Ecodig-Assisted Temporal Direct Mode Decisio for B Pictures i H.64/AVC Ya-Neg Fag ad Yiyi Li Hui-Jae Hsieh Departmet of Commuicatio Egieerig Departmet of Iformatio Maagemet Natioal Cetral Uiversity, Taiwa

More information

CALCULATION OF FIBONACCI VECTORS

CALCULATION 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 information

ON THE CAPACITY OF THE MIMO CHANNEL - A TUTORIAL INTRODUCTION - Bengt Holter

ON THE CAPACITY OF THE MIMO CHANNEL - A TUTORIAL INTRODUCTION - Bengt Holter ON HE CAPACIY OF HE MIMO CHANNEL - A UORIAL INRODUCION - Begt Holter Norwegia Uiversity of Sciece ad echology Departmet of elecommuicatios O.S.Bragstads plass B, N-7491 rodheim, Norway bholter@tele.tu.o

More information

Chapter 9 - CD companion 1. A Generic Implementation; The Common-Merge Amplifier. 1 τ is. ω ch. τ io

Chapter 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 information

Time-Domain Representations of LTI Systems

Time-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

Bounds for the Extreme Eigenvalues Using the Trace and Determinant

Bounds for the Extreme Eigenvalues Using the Trace and Determinant ISSN 746-7659, Eglad, UK Joural of Iformatio ad Computig Sciece Vol 4, No, 9, pp 49-55 Bouds for the Etreme Eigevalues Usig the Trace ad Determiat Qi Zhog, +, Tig-Zhu Huag School of pplied Mathematics,

More information

Self-normalized deviation inequalities with application to t-statistic

Self-normalized deviation inequalities with application to t-statistic Self-ormalized deviatio iequalities with applicatio to t-statistic Xiequa Fa Ceter for Applied Mathematics, Tiaji Uiversity, 30007 Tiaji, Chia Abstract Let ξ i i 1 be a sequece of idepedet ad symmetric

More information

The method of types. PhD short course Information Theory and Statistics Siena, September, Mauro Barni University of Siena

The method of types. PhD short course Information Theory and Statistics Siena, September, Mauro Barni University of Siena PhD short course Iformatio Theory ad Statistics Siea, 15-19 September, 2014 The method of types Mauro Bari Uiversity of Siea Outlie of the course Part 1: Iformatio theory i a utshell Part 2: The method

More information

On Random Line Segments in the Unit Square

On Random Line Segments in the Unit Square O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,

More information

Sample Size Estimation in the Proportional Hazards Model for K-sample or Regression Settings Scott S. Emerson, M.D., Ph.D.

Sample Size Estimation in the Proportional Hazards Model for K-sample or Regression Settings Scott S. Emerson, M.D., Ph.D. ample ie Estimatio i the Proportioal Haards Model for K-sample or Regressio ettigs cott. Emerso, M.D., Ph.D. ample ie Formula for a Normally Distributed tatistic uppose a statistic is kow to be ormally

More information

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering

CEE 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 information

Formation of A Supergain Array and Its Application in Radar

Formation of A Supergain Array and Its Application in Radar Formatio of A Supergai Array ad ts Applicatio i Radar Tra Cao Quye, Do Trug Kie ad Bach Gia Duog. Research Ceter for Electroic ad Telecommuicatios, College of Techology (Coltech, Vietam atioal Uiversity,

More information

Entropies & Information Theory

Entropies & Information Theory Etropies & Iformatio Theory LECTURE I Nilajaa Datta Uiversity of Cambridge,U.K. For more details: see lecture otes (Lecture 1- Lecture 5) o http://www.qi.damtp.cam.ac.uk/ode/223 Quatum Iformatio Theory

More information

Assignment 2 Solutions SOLUTION. ϕ 1 Â = 3 ϕ 1 4i ϕ 2. The other case can be dealt with in a similar way. { ϕ 2 Â} χ = { 4i ϕ 1 3 ϕ 2 } χ.

Assignment 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

FIR Filter Design: Part II

FIR Filter Design: Part II EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we cosider how we might go about desigig FIR filters with arbitrary frequecy resposes, through compositio of multiple sigle-peak

More information

Stochastic Matrices in a Finite Field

Stochastic Matrices in a Finite Field Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices

More information

Lecture 24: Variable selection in linear models

Lecture 24: Variable selection in linear models Lecture 24: Variable selectio i liear models Cosider liear model X = Z β + ε, β R p ad Varε = σ 2 I. Like the LSE, the ridge regressio estimator does ot give 0 estimate to a compoet of β eve if that compoet

More information

3. 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 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 information

Asymptotic Coupling and Its Applications in Information Theory

Asymptotic Coupling and Its Applications in Information Theory Asymptotic Couplig ad Its Applicatios i Iformatio Theory Vicet Y. F. Ta Joit Work with Lei Yu Departmet of Electrical ad Computer Egieerig, Departmet of Mathematics, Natioal Uiversity of Sigapore IMS-APRM

More information

Long-Term CSI Based Multi-User Scheduling for Collaborative. Spatial Multiplexing in Mobile-WiMAX

Long-Term CSI Based Multi-User Scheduling for Collaborative. Spatial Multiplexing in Mobile-WiMAX Log-Term CSI Based ulti-user Schedulig for Collaborative Spatial ultiplexig i obile-wiax Ji-Woo Lee ad Yog-Hwa Lee School of Electrical Egieerig ad INC Seoul Natioal Uiversity, Seoul, Korea Email: jiu@ttl.su.ac.kr

More information

Module 5 EMBEDDED WAVELET CODING. Version 2 ECE IIT, Kharagpur

Module 5 EMBEDDED WAVELET CODING. Version 2 ECE IIT, Kharagpur Module 5 EMBEDDED WAVELET CODING Versio ECE IIT, Kharagpur Lesso 4 SPIHT algorithm Versio ECE IIT, Kharagpur Istructioal Objectives At the ed of this lesso, the studets should be able to:. State the limitatios

More information

6. Kalman filter implementation for linear algebraic equations. Karhunen-Loeve decomposition

6. 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 information

On Nonsingularity of Saddle Point Matrices. with Vectors of Ones

On Nonsingularity of Saddle Point Matrices. with Vectors of Ones Iteratioal Joural of Algebra, Vol. 2, 2008, o. 4, 197-204 O Nosigularity of Saddle Poit Matrices with Vectors of Oes Tadeusz Ostrowski Istitute of Maagemet The State Vocatioal Uiversity -400 Gorzów, Polad

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 [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 information

The standard deviation of the mean

The standard deviation of the mean Physics 6C Fall 20 The stadard deviatio of the mea These otes provide some clarificatio o the distictio betwee the stadard deviatio ad the stadard deviatio of the mea.. The sample mea ad variace Cosider

More information

Introduction to Optimization Techniques. How to Solve Equations

Introduction to Optimization Techniques. How to Solve Equations Itroductio to Optimizatio Techiques How to Solve Equatios Iterative Methods of Optimizatio Iterative methods of optimizatio Solutio of the oliear equatios resultig form a optimizatio problem is usually

More information

Numerical Conformal Mapping via a Fredholm Integral Equation using Fourier Method ABSTRACT INTRODUCTION

Numerical Conformal Mapping via a Fredholm Integral Equation using Fourier Method ABSTRACT INTRODUCTION alaysia Joural of athematical Scieces 3(1): 83-93 (9) umerical Coformal appig via a Fredholm Itegral Equatio usig Fourier ethod 1 Ali Hassa ohamed urid ad Teh Yua Yig 1, Departmet of athematics, Faculty

More information

R. van Zyl 1, A.J. van der Merwe 2. Quintiles International, University of the Free State

R. van Zyl 1, A.J. van der Merwe 2. Quintiles International, University of the Free State Bayesia Cotrol Charts for the Two-parameter Expoetial Distributio if the Locatio Parameter Ca Take o Ay Value Betwee Mius Iity ad Plus Iity R. va Zyl, A.J. va der Merwe 2 Quitiles Iteratioal, ruaavz@gmail.com

More information

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course Sigal-EE Postal Correspodece Course 1 SAMPLE STUDY MATERIAL Electrical Egieerig EE / EEE Postal Correspodece Course GATE, IES & PSUs Sigal System Sigal-EE Postal Correspodece Course CONTENTS 1. SIGNAL

More information

17 Phonons and conduction electrons in solids (Hiroshi Matsuoka)

17 Phonons and conduction electrons in solids (Hiroshi Matsuoka) 7 Phoos ad coductio electros i solids Hiroshi Matsuoa I this chapter we will discuss a miimal microscopic model for phoos i a solid ad a miimal microscopic model for coductio electros i a simple metal.

More information

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 11

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 11 Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract We will itroduce the otio of reproducig kerels ad associated Reproducig Kerel Hilbert Spaces (RKHS). We will cosider couple

More information

Chapter 6 Sampling Distributions

Chapter 6 Sampling Distributions Chapter 6 Samplig Distributios 1 I most experimets, we have more tha oe measuremet for ay give variable, each measuremet beig associated with oe radomly selected a member of a populatio. Hece we eed to

More information

Properties and Hypothesis Testing

Properties 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 information

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

Mathematical Modeling of Optimum 3 Step Stress Accelerated Life Testing for Generalized Pareto Distribution

Mathematical Modeling of Optimum 3 Step Stress Accelerated Life Testing for Generalized Pareto Distribution America Joural of Theoretical ad Applied Statistics 05; 4(: 6-69 Published olie May 8, 05 (http://www.sciecepublishiggroup.com/j/ajtas doi: 0.648/j.ajtas.05040. ISSN: 6-8999 (Prit; ISSN: 6-9006 (Olie Mathematical

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak

More information

IP Reference guide for integer programming formulations.

IP Reference guide for integer programming formulations. IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more

More information

Element sampling: Part 2

Element sampling: Part 2 Chapter 4 Elemet samplig: Part 2 4.1 Itroductio We ow cosider uequal probability samplig desigs which is very popular i practice. I the uequal probability samplig, we ca improve the efficiecy of the resultig

More information

This is an introductory course in Analysis of Variance and Design of Experiments.

This is an introductory course in Analysis of Variance and Design of Experiments. 1 Notes for M 384E, Wedesday, Jauary 21, 2009 (Please ote: I will ot pass out hard-copy class otes i future classes. If there are writte class otes, they will be posted o the web by the ight before class

More information

Rademacher Complexity

Rademacher Complexity EECS 598: Statistical Learig Theory, Witer 204 Topic 0 Rademacher Complexity Lecturer: Clayto Scott Scribe: Ya Deg, Kevi Moo Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved for

More information

PAijpam.eu ON TENSOR PRODUCT DECOMPOSITION

PAijpam.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 information

ECE 901 Lecture 12: Complexity Regularization and the Squared Loss

ECE 901 Lecture 12: Complexity Regularization and the Squared Loss ECE 90 Lecture : Complexity Regularizatio ad the Squared Loss R. Nowak 5/7/009 I the previous lectures we made use of the Cheroff/Hoeffdig bouds for our aalysis of classifier errors. Hoeffdig s iequality

More information

Singular Continuous Measures by Michael Pejic 5/14/10

Singular Continuous Measures by Michael Pejic 5/14/10 Sigular Cotiuous Measures by Michael Peic 5/4/0 Prelimiaries Give a set X, a σ-algebra o X is a collectio of subsets of X that cotais X ad ad is closed uder complemetatio ad coutable uios hece, coutable

More information

Definitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.

Definitions 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 information

Information Theory Tutorial Communication over Channels with memory. Chi Zhang Department of Electrical Engineering University of Notre Dame

Information Theory Tutorial Communication over Channels with memory. Chi Zhang Department of Electrical Engineering University of Notre Dame Iformatio Theory Tutorial Commuicatio over Chaels with memory Chi Zhag Departmet of Electrical Egieerig Uiversity of Notre Dame Abstract A geeral capacity formula C = sup I(; Y ), which is correct for

More information

GG313 GEOLOGICAL DATA ANALYSIS

GG313 GEOLOGICAL DATA ANALYSIS GG313 GEOLOGICAL DATA ANALYSIS 1 Testig Hypothesis GG313 GEOLOGICAL DATA ANALYSIS LECTURE NOTES PAUL WESSEL SECTION TESTING OF HYPOTHESES Much of statistics is cocered with testig hypothesis agaist data

More information

Chapter 7: The z-transform. Chih-Wei Liu

Chapter 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 information

Rotationally invariant integrals of arbitrary dimensions

Rotationally invariant integrals of arbitrary dimensions September 1, 14 Rotatioally ivariat itegrals of arbitrary dimesios James D. Wells Physics Departmet, Uiversity of Michiga, A Arbor Abstract: I this ote itegrals over spherical volumes with rotatioally

More information

Machine Learning Brett Bernstein

Machine Learning Brett Bernstein Machie Learig Brett Berstei Week 2 Lecture: Cocept Check Exercises Starred problems are optioal. Excess Risk Decompositio 1. Let X = Y = {1, 2,..., 10}, A = {1,..., 10, 11} ad suppose the data distributio

More information

Semi-Blind Channel Estimation for LTE DownLink

Semi-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 information

The Capacity Region of the Degraded Finite-State Broadcast Channel

The Capacity Region of the Degraded Finite-State Broadcast Channel The Capacity Regio of the Degraded Fiite-State Broadcast Chael Ro Dabora ad Adrea Goldsmith Dept. of Electrical Egieerig, Staford Uiversity, Staford, CA Abstract We cosider the discrete, time-varyig broadcast

More information

5.1 Review of Singular Value Decomposition (SVD)

5.1 Review of Singular Value Decomposition (SVD) MGMT 69000: Topics i High-dimesioal Data Aalysis Falll 06 Lecture 5: Spectral Clusterig: Overview (cotd) ad Aalysis Lecturer: Jiamig Xu Scribe: Adarsh Barik, Taotao He, September 3, 06 Outlie Review of

More information

Analysis of Algorithms. Introduction. Contents

Analysis of Algorithms. Introduction. Contents Itroductio The focus of this module is mathematical aspects of algorithms. Our mai focus is aalysis of algorithms, which meas evaluatig efficiecy of algorithms by aalytical ad mathematical methods. We

More information

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

More information