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

Size: px
Start display at page:

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

Transcription

1 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 ABSRAC Multiple-iput multiple-output MIMO) systems are today regarded as oe of the most promisig research areas of wireless commuicatios. his is due to the fact that a MIMO chael ca offer a sigificat capacity gai over a traditioal sigle-iput sigle-output SISO) chael. I this paper, a tutorial itroductio o the chael capacity of a MIMO chael will be give. 1. INRODUCION he icrease i spectral efficiecy offered by MIMO systems is based o the utilizatio of space or atea) diversity at both the trasmitter ad the receiver. Due to the utilizatio of space diversity, MIMO systems are also referred to as multiple-elemet atea systems MEAs). With a MIMO system, the data stream from a sigle user is demultiplexed ito separate sub-streams. he umber equals the umber of trasmit ateas. Each sub-stream is the ecoded ito chael symbols. It is commo to impose the same data rate o all trasmitters, but adaptive modulatio rate ca also be utilized o each of the sub-streams [1]. he sigals are received by R receive ateas. With this trasmissio scheme, there is a liear icrease i spectral efficiecy compared to a logarithmic icrease i more traditioal systems utilizig receivediversity or o diversity. he high spectral efficiecies attaied by a MIMO system are eabled by the fact that i a rich scatterig eviromet, the sigals from each idividual trasmitter appear highly ucorrelated at each of the receive ateas. Whe the sigals are coveyed through ucorrelated chaels betwee the trasmitter ad receiver, the sigals correspodig to each of the idividual trasmit ateas have attaied differet spatial sigatures. he receiver ca use these differeces i spatial sigature to simultaeously ad at the same frequecy separate the sigals that origiated from differet trasmit ateas.. CHANNEL CAPACIY At the iput of a commuicatio system, discrete source symbols are mapped ito a sequece of chael symbols. he chael symbols are the trasmitted/coveyed through a wireless chael that by ature is radom. I additio, radom oise is added to the chael symbols. I geeral, it is possible that two differet iput sequeces may give rise to the same output sequece, causig differet iput sequeces to be cofusable at the output. o avoid this situatio, a o-cofusable subset of iput sequeces must be chose so that with a high probability, there is oly oe iput sequece causig a particular output. It is the possible to recostruct all the iput sequeces at the output with egligible probability of error. A measure of how much iformatio that ca be trasmitted ad received with a egligible probability of error is called the chael capacity. o determie this measure of chael potetial, assume that a chael ecoder receives a source symbol every s secod. With a optimal source code, the average code legth of all source symbols is equal to the etropy rate of the source. If S represets the set of all source symbols ad the etropy rate of the source is writte as HS), the chael ecoder will receive o average HS) s iformatio bits per secod. 1 Assume that a chael codeword leaves the chael ecoder every c secod. I order to be able to trasmit all the iformatio from the source, there must be R = HS) c 1) s 1 he etropy rate is a fuctio of the statistical distributio of the source S. If the source S represet a discrete memoryless radom variable, the etropy rate of the source is equal to the source etropy, ad is defied as HS) = E[ log b p S )]. It is commo to use b = ad the etropy is the expressed i iformatio bits per source symbol.

2 iformatio bits per chael symbol. he umber R is called the iformatio rate of the chael ecoder. he maximum iformatio rate that ca be used causig egligible probability of errors at the output is called the capacity of the chael. By trasmittig iformatio with rate R, the chael is used every c secods. he chael capacity is the measured i bits per chael use. Assumig that the chael has badwidth W, the iput ad output ca be represeted by samples take s = 1 W secods apart. With a bad-limited chael, the capacity is measured i iformatio bits per secod. It is commo to represet the chael capacity withi a uit badwith of the chael. he chael capacity is the measured i bits/s/hz. It is desirable to desig trasmissio schemes that exploit the chael capacity as much as possible. Represetig the iput ad output of a memoryless wireless chael with the radom variables X ad Y respectively, the chael capacity is defied as [] C =maxix; Y ), ) px) where IX; Y ) represetsthemutual iformatio betwee X ad Y. Eq.) states that the mutual iformatio is maximized with respect to all possible trasmitter statistical distributios px). Mutual iformatio is a measure of the amout of iformatio that oe radom variable cotais about aother variable. he mutual iformatio betwee X ad Y ca also be writte as IX; Y )=HY ) HY X), 3) where HY X) represets the coditioal etropy betwee the radom variables X ad Y. he etropy of a radom variable ca be described as a measure of the amout of iformatio required o average to describe the radom variable. It ca also described as a measure of the ucertaity of the radom variable. Due to 3), mutual iformatio ca be described as the reductio i the ucertaity of oe radom variable due to the kowledge of the other. Note that the mutual iformatio betwee X ad Y depeds o the properties of the chael through a chael matrix H) ad the properties of X through the probability distributio of X). he chael matrix H used i the represetatio of the iput/output relatios of a MIMO chael is defied i the ext sectio. 3. SYSEM MODEL It is commo to represet the iput/output relatios of a arrowbad, sigle-user MIMO lik by the complex basebad vector otatio y = Hx +, 4) where x is the 1) trasmit vector, y is the R 1) receive vector, H is the R ) chael matrix, ad is the R 1) additive white Gaussia oise AWGN) vector at a give istat i time. hroughout the paper, it is assumed that the chael matrix is radom ad that the receiver has perfect chael kowledge. It is also assumed that the chael is memoryless, i.e., for each use of the chael a idepedet realizatio of H is draw. his meas that the capacity ca be computed as the maximum of the mutual iformatio as defied i ). he results are also valid whe H is geerated by a ergodic process because as log as the receiver observes the H process, oly the first order statistics are eeded to determie the chael capacity [3]. A geeral etry of the chael matrix is deoted by h ij }. his represets the complex gai of the chael betwee the jth trasmitter ad the ith receiver. With a MIMO system cosistig of trasmit ateas ad R receive ateas, the chael matrix is writte as h 11 h 1 h 1 h H = , 5) h R1 h R where h ij = α + jβ 6) = α + β e j arcta β α 7) = h ij e jφij. 8) I a rich scatterig eviromet with o lie-of-sight LOS), the chael gais h ij are usually Rayleigh distributed. If α ad β are idepedet ad ormal distributed radom variables, the h ij is a Rayleigh distributed radom variable. 4. SISO CHANNEL CAPACIY he ergodic mea) capacity of a radom chael with = R = 1 ad a average trasmit power costrait P ca be expressed as [] } C = E H max IX; Y ), 9) px):p P where P is the average power of a sigle chael codeword trasmitted over the chael ad E H deotes the expectatio over all chael realizatios. Compared to the defiitio i ), the capacity of the chael is ow defied as the maximum of the mutual iformatio betwee the iput ad the output over all statistical distributios o the iput that satisfy the power costrait. If each chael symbol at

3 the trasmitter is deoted by s, the average power costrait ca be expressed as P = E [ s ] P. 10) Usig 9), the ergodic mea) capacity of a SISO system = R = 1) with a radom complex chael gai h 11 is give by [4] C = E H log 1+ρ h11 )}, 11) where ρ is the average sigal-to-oise SNR) ratio at the receiver brach. If h 11 is Rayleigh, h 11 follows a chi-squared distributio with two degrees of freedom [5]. Eq.11) ca the be writte as [4] C = E H log 1+ρ χ )}, 1) where χ is a chi-square distributed radom variable with two degrees of freedom. Figure 1 shows the Capacity [bit/s/hz] SISO capacity SNR [db] Figure 1: Ergodic capacity a Rayleigh fadig SISO chael dotted lie) compared to the Shao capacity of a SISO chael solid lie). Shao capacity for a gaussia chael solid lie) ad the capacity of a Rayleigh fadig chael dotted lie) accordig to 1). he Rayleigh fadig curve preseted i Figure 1 equals the result i [6] capacity of a Rayleigh fadig chael with optimal power ad rate adaptio at the trasmitter uder the assumptio of perfect chael estimatio ad retur chael free of errors ad delay). 5. MIMO CHANNEL CAPACIY he capacity of a radom MIMO chael with power costrait P cabeexpressedas } C = E H max Ix; y), 13) px):trφ) P where Φ = Exx } is the covariace matrix of the trasmit sigal vector x. he total trasmit power is limited to P, irrespective of the umber of trasmit ateas. By usig 4) ad the relatioship betwee mutual iformatio ad etropy, 13) ca be expaded as follows for a give H Ix; y) = hy) hy x) 14) = hy) hhx + x) 15) = hy) h x) 16) = hy) h), 17) where h ) i this case deotes the differetial etropy of a cotiuous radom variable. It is assumed that the trasmit vector x ad the oise vector are idepedet. Eq. 17) is maximized whe y is gaussia, sice the ormal distributio maximizes the etropy for a give variace []. he differetial etropy of a real gaussia vector y R with zero mea ad covariace matrix K is equal to 1 log πe) det K). For a complex gaussia vector y C, the differetial etropy is less tha or equal to log detπek), with equality if ad oly if y is a circularly symmetric complex Gaussia with Eyy } = K [3]. Assumig the optimal gaussia distributio for the trasmit vector x, the covariace matrix of the received complex vector y is give by E yy } = E Hx + )Hx + ) } 18) = E Hxx H } + E } 19) = HΦH + K 0) = K d + K. 1) he superscript d ad deotes respectively the desired part ad the oise part of 1). he maximum mutual iformatio of a radom MIMO chael is the give by I = hy) h) [ = log det πe K d + K ))] log πek )] [ = log det K d + K )] log K )] K = log d + K ) K ) 1)] )] = log K d K ) 1 + I R )] = log HΦH K ) 1 + I R. Whe the trasmitter has o kowledge about the chael, it is optimal to use a uiform power distributio [3]. he trasmit covariace matrix is the give by Φ = P I. It is also commo to assume he superscript deotes Hermitia traspose

4 ucorrelated oise i each receiver brach described by the covariace matrix K = σ I R. he ergodic mea) capacity for a complex AWGN MIMO chael cathebeexpressedas[3,4] C = E H log I R + his ca also be writte as C = E H log P σ HH I R + ρ HH )]}. ) )]}, 3) where ρ = P σ is the average sigal-to-oise SNR) ratio at each receiver brach. By the law of large umbers, the term 1 HH I R as gets large ad R is fixed. hus the capacity i the limit of large is C = E H R log 1 + ρ)}. 4) Further aalysis of the MIMO chael capacity give i 3) is possible by diagoalizig the product matrix HH either by eigevalue decompositio or sigular value decompositio. By usig eigevalue decompositio, the matrix product is writte as HH = EΛE, 5) where E is the eigevector matrix with orthoormal colums ad Λ is a diagoal matrix with the eigevalues o the mai diagoal. Usig this otatio, 3) ca be writte as: C = E H log I R + ρ )]} EΛE. 6) he matrix product HH ca also be described by usig sigular value decompositio o the chael matrix H writte as H = UΣV, 7) where U ad V are uitary matrices of left ad right sigular vectors respectively, ad Σ is a diagoal matrix with sigular values o the mai diagoal. All elemets o the diagoal are zero except for the first k elemets. he umber of o-zero sigular values k equals the rak of the chael matrix. Usig 7) i 3), the MIMO chael capacity ca be writte as C = E H log I R + ρ )]} UΣΣ U. 8) After diagoalizig the product matrix HH,thecapacity formulas of the MIMO chael ow icludes uitary ad diagoal matrices oly. It is the easier to see that the total capacity of a MIMO chael is made up by the sum of parallel AWGN SISO subchaels. he umber of parallel subchaels is determied by the rak of the chael matrix. I geeral, the rak of the chael matrix is give by rakh) =k mi, R }. 9) Usig 9) together with the fact that the determiat of a uitary matrix is equal to 1, 6) ad 8) ca be expressed respectively as k C = E H log 1+ ρ ) } λ i 30) k = E H log 1+ ρ ) } σi. 31) I 30), λ i are the eigevalues of the diagoal matrix Λ ad i ad 31), σi are the squared sigular values of the diagoal matrix Σ. he maximum capacity of a MIMO chael is reached i the urealistic situatio whe each of the trasmitted sigals is received by the same set of R ateas without iterferece. It ca also be described as if each trasmitted sigal where received by a separate set receive ateas, givig a total umber of R receivig ateas. With optimal combiig at the receiver ad receive diversity oly = 1), the chael capacity cabeexpressedas[4] )} C = E H log 1+ρ χ R, 3) where χ R is a chi-distributed radom variable with R degrees of freedom. If there are trasmit ateas ad optimal combiig betwee R ateas at the receiver, the capacity ca be writte as 3 [4] [ C = E H log 1+ ρ ]} χ R. 33) Eq.33) represet the upper boud of a Rayleigh fadig MIMO chael. I Figure, the Shao capacity of a SISO chael is compared to the upper boud of 33) with = R = 6. Eve though this boud o the MIMO chael represet a special case, Figure clearly shows the potetial of the MIMO techology. Whe the chael is kow at the trasmitter, the maximum capacity of a MIMO chael ca be achieved by usig the water-fillig priciple [] o the trasmit covariace matrix. he capacity is the give by k ) } ρ C = E H log 1+ɛ i λ i 34) k ) } ρ = E H log 1+ɛ i σi, 35) 3 Assumig the artificial case of o iterferece betwee the received sigals.

5 Capacity [bit/s/hz] Ergodic capacity of a MIMO fadig chael SNR [db] Figure : he Shao capacity of a SISO chael dotted lie) compared to the ergodic capacity of a Rayleigh fadig MIMO chael solid lie) with = R =6. where ɛ i is a scalar, represetig the portio of the available trasmit power goig ito the ith subchael. he power costrait at the trasmitter ca be expressed as ɛ i. Clearly, with a reduced umber of o-zero sigular values i 31) ad 35), the capacity of the MIMO chael will be reduced because of a rak deficiet chael matrix. his is the situatio whe the sigals arrivig at the receivers are correlated. Eve though a high chael rak is ecessary to obtai high spectral efficiecy o a MIMO chael, low correlatio is ot a guaratee of high capacity [7]. I [8], the existece of pi-hole chaels is demostrated. Such chaels exhibit low fadig correlatio betwee the ateas at both the receiver ad trasmitter side, but the chaels still have poor rak properties ad hece low capacity. 6. ANENNA SELECION he MIMO chael capacity has so far bee optimized based o the assumptio that all trasmit ad receive ateas are used at the same time. Recetly, several authors have preseted papers o MIMO systems with either trasmit or receive atea selectio. As see earlier i this paper, the capacity of the MIMO chael is reduced with a rak deficiet chael matrix. A rak deficiet chael matrix meas that some colums i the chael matrix are liearly depedet. Whe they are liearly depedet, they ca be expressed as a liear combiatio of the other colums i the matrix. he iformatio withi these colums is the i some way redudat ad is ot cotributig to the capacity of the chael. he idea of trasmit atea selectio is to improve the capacity by ot usig the trasmit ateas that correspod to the liearly depedet colums, but istead redistributig the power amog the other ateas. Sice the total umber of parallel subchaels i the sums of eq.31) ad 35) is equal to the rak of the chael matrix, the optimal choice is to distribute the trasmit power o a subset of k trasmit ateas that maximizes the chael capacity. It is show i [9] that the optimal choice of k trasmit ateas that maximizes the chael capacity results i a chael matrix that is full rak. I [10], a computatioally efficiet, ear-optimal search techique for the optimal subset based o classical waterpourig is described. I [11], the capacity of MIMO systems with receive atea selectio is aalyzed. With such a reducedcomplexity MIMO scheme, a selectio of the L best ateas of the available R ateas at the reciever is used. his has the advatage that oly L receiver chais are required compared to R i the full-complexity scheme. I [11], it is demostrated through Mote Carlo simulatios that for =3ad R =8,thecapacity of the reduced-complexity scheme is 0bits/s/Hz compared to 3bits/s/Hz of a full-complexity scheme. 7. OUAGE CAPACIY I this paper, the ergodic mea) capacity has bee used as a measure for the spectral efficiecy of the MIMO chael. he capacity uder chael ergodicity where i 9) ad 13) defied as the average of the maximal value of the mutual iformatio betwee the trasmitted ad the received sigal, where the maximizatio was carried out with respect to all possible trasmitter statistical distributios. Aother measure of chael capacity that is frequetly used is outage capacity. With outage capacity, the chael capacity is associated to a outage probability. Capacity is treated as a radom variable which depeds o the chael istataeous respose ad remais costat durig the trasmissio of a fiite-legth coded block of iformatio. If the chael capacity falls below the outage capacity, there is o possibility that the trasmitted block of iformatio ca be decoded with o errors, whichever codig scheme is employed. he probability that the capacity is less tha the outage capacity deoted by C outage is q. his ca be expressed i mathematical terms by Prob C C outage } = q. 36) I this case, 36) represets a upper boud due to fact that there is a fiite probability q that the chael capacity is less tha the outage capacity. It ca also be writte as a lower boud, represetig the case where there is a fiite probability 1 q) thatthe

6 chael capacity is higher tha C outage, i.e., Prob C >C outage } =1 q. 37) 8. SUMMARY I this paper, a tutorial itroductio o the capacity of the MIMO chael has bee give. he use of multiple ateas o both the trasmitter ad receiver side of a commuicatio lik have show to greatly improve the spectral efficiecy of both fixed ad wireless systems. he are may research papers published o MIMO systems, reflectig the perceptio that MIMO techology is see as oe of the most promisig research areas of radio commuicatio today. [10] S. Sadhu, R. U. Nabar, D. A. Gore, A. Paulraj, Near-optimal selectio of trasmit ateas for a MIMO chael based o shao capacity, Coferece Record of the 34th Asilomar Coferece o Sigals, Systems ad Computers, 1: , 000. [11] A. F. Molisch, M. Z. Wi, J. H. Witers, A. Paulraj, Capacity of MIMO systems with atea selectio, I Proc. IEEE Iteratioal Coferece o Commuicatios ICC), : , REFERENCES [1] S.Catreux,P.F.Driesse,L.J.Greestei, Attaiable throughput of a iterferece-limited multiple-iput multiple-output MIMO) cellular system, IEEE rasactios o Commuicatios, 498): , aug 001. [].M.Cover,J.A.homas, Elemets of Iformatio theory, Joh Wiley & Sos, Ic., [3] I. elatar, Capacity of multi-atea gaussia chaels, A& echical Memoradum, ju [4] G. J. Foschii, M. J. Gas, O limits of wireless commuicatios i a fadig eviromet whe usig multiple ateas, Wireless Persoal Commuicatios, 6: , aug [5] J. G. Proakis, Digital Commuicatios, McGraw-Hill, Ic., [6] M-S. Alouii, A. Goldsmith, Capacity of akagami multipath fadig chaels, Proc. Vehicular echology Coferece, 1:358 36, [7] D. Chizhik, G. J. Foschii, R. A. Valezuela, Capacities of multi-elemet trasmit ad receive ateas: Correlatios ad keyholes, Electroic Letters, 3613): , ju 000. [8]D.Gesbert,H.Bölcskei, D. Gore, A. Paulraj, MIMO wireless chaels: capacity ad performace predictio, Global elecommuicatios Coferece GLOBECOM 00), : , 000. [9] D. A. Gore, R. U. Nabar, A. Paulraj, Selectig a optimal set of trasmit ateas for a low rak matrix chael, Proc. ICASSP 000, 498): , aug 000.

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

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

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

Information Theory and Coding

Information Theory and Coding Sol. Iformatio Theory ad Codig. The capacity of a bad-limited additive white Gaussia (AWGN) chael is give by C = Wlog 2 ( + σ 2 W ) bits per secod(bps), where W is the chael badwidth, is the average power

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

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

Lecture 11: Channel Coding Theorem: Converse Part

Lecture 11: Channel Coding Theorem: Converse Part EE376A/STATS376A Iformatio Theory Lecture - 02/3/208 Lecture : Chael Codig Theorem: Coverse Part Lecturer: Tsachy Weissma Scribe: Erdem Bıyık I this lecture, we will cotiue our discussio o chael codig

More information

Lecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound

Lecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound Lecture 7 Ageda for the lecture Gaussia chael with average power costraits Capacity of additive Gaussia oise chael ad the sphere packig boud 7. Additive Gaussia oise chael Up to this poit, we have bee

More information

The Fading Number of Multiple-Input Multiple-Output Fading Channels with Memory

The Fading Number of Multiple-Input Multiple-Output Fading Channels with Memory The Fadig Number of Multiple-Iput Multiple-Output Fadig Chaels with Memory Stefa M. Moser Departmet of Commuicatio Egieerig Natioal Chiao Tug Uiversity NCTU Hsichu, Taiwa Email: stefa.moser@ieee.org Abstract

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

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

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

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

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

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

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 9 Multicolliearity Dr Shalabh Departmet of Mathematics ad Statistics Idia Istitute of Techology Kapur Multicolliearity diagostics A importat questio that

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

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

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

Complexity Analysis of Highly Improved Hybrid Turbo Codes

Complexity Analysis of Highly Improved Hybrid Turbo Codes I J C T A, 8(5, 015, pp. 433-439 Iteratioal Sciece Press Complexity Aalysis of Highly Improved Hybrid Turbo Codes M. Jose Ra* ad Sharmii Eoch** Abstract: Moder digital commuicatio systems eed efficiet

More information

ECE 564/645 - Digital Communication Systems (Spring 2014) Final Exam Friday, May 2nd, 8:00-10:00am, Marston 220

ECE 564/645 - Digital Communication Systems (Spring 2014) Final Exam Friday, May 2nd, 8:00-10:00am, Marston 220 ECE 564/645 - Digital Commuicatio Systems (Sprig 014) Fial Exam Friday, May d, 8:00-10:00am, Marsto 0 Overview The exam cosists of four (or five) problems for 100 (or 10) poits. The poits for each part

More information

Linear Algebra Issues in Wireless Communications

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

Lecture 7: Channel coding theorem for discrete-time continuous memoryless channel

Lecture 7: Channel coding theorem for discrete-time continuous memoryless channel Lecture 7: Chael codig theorem for discrete-time cotiuous memoryless chael Lectured by Dr. Saif K. Mohammed Scribed by Mirsad Čirkić Iformatio Theory for Wireless Commuicatio ITWC Sprig 202 Let us first

More information

Increasing timing capacity using packet coloring

Increasing timing capacity using packet coloring 003 Coferece o Iformatio Scieces ad Systems, The Johs Hopkis Uiversity, March 4, 003 Icreasig timig capacity usig packet colorig Xi Liu ad R Srikat[] Coordiated Sciece Laboratory Uiversity of Illiois e-mail:

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

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

BER Analysis and Optimization of Generalized Spatial Modulation in Correlated Fading Channels 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 Email: {hadte,

More information

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and Filter bas Separately, the lowpass ad highpass filters are ot ivertible T removes the highest frequecy / ad removes the lowest frequecy Together these filters separate the sigal ito low-frequecy ad high-frequecy

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

ADVANCED DIGITAL SIGNAL PROCESSING

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

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

Parallel Vector Algorithms David A. Padua

Parallel Vector Algorithms David A. Padua Parallel Vector Algorithms 1 of 32 Itroductio Next, we study several algorithms where parallelism ca be easily expressed i terms of array operatios. We will use Fortra 90 to represet these algorithms.

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

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

A new scalable decoder for linear space-time block codes with intersymbol interference

A new scalable decoder for linear space-time block codes with intersymbol interference A ew scalale der for liear space-time lock s with itersymol iterferece Marc Kuh, Armi Wittee Uiversity of Saarlad, Istitute of Digital Commuicatios, D 6604 Saarruecke, Germay Email: marc.kuh@lnt.ui-saarlad.de,

More information

Apply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.

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

The DOA Estimation of Multiple Signals based on Weighting MUSIC Algorithm

The DOA Estimation of Multiple Signals based on Weighting MUSIC Algorithm , pp.10-106 http://dx.doi.org/10.1457/astl.016.137.19 The DOA Estimatio of ultiple Sigals based o Weightig USIC Algorithm Chagga Shu a, Yumi Liu State Key Laboratory of IPOC, Beijig Uiversity of Posts

More information

Shannon s noiseless coding theorem

Shannon s noiseless coding theorem 18.310 lecture otes May 4, 2015 Shao s oiseless codig theorem Lecturer: Michel Goemas I these otes we discuss Shao s oiseless codig theorem, which is oe of the foudig results of the field of iformatio

More information

Lecture 14: Graph Entropy

Lecture 14: Graph Entropy 15-859: Iformatio Theory ad Applicatios i TCS Sprig 2013 Lecture 14: Graph Etropy March 19, 2013 Lecturer: Mahdi Cheraghchi Scribe: Euiwoog Lee 1 Recap Bergma s boud o the permaet Shearer s Lemma Number

More information

Direct Position Determination Algorithm Based on Multi-array in the Presence of Gain-phase Errors

Direct Position Determination Algorithm Based on Multi-array in the Presence of Gain-phase Errors 2016 Joit Iteratioal Coferece o Artificial Itelligece ad Computer Egieerig (AICE 2016) ad Iteratioal Coferece o Network ad Commuicatio Security (NCS 2016) ISBN: 978-1-60595-362-5 Direct Positio Determiatio

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

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING Lectures MODULE 5 STATISTICS II. Mea ad stadard error of sample data. Biomial distributio. Normal distributio 4. Samplig 5. Cofidece itervals

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

An Improved Proportionate Normalized Least Mean Square Algorithm with Orthogonal Correction Factors for Echo Cancellation

An Improved Proportionate Normalized Least Mean Square Algorithm with Orthogonal Correction Factors for Echo Cancellation 202 Iteratioal Coferece o Electroics Egieerig ad Iformatics (ICEEI 202) IPCSI vol. 49 (202) (202) IACSI Press, Sigapore DOI: 0.7763/IPCSI.202.V49.33 A Improved Proportioate Normalized Least Mea Square

More information

THE SYSTEMATIC AND THE RANDOM. ERRORS - DUE TO ELEMENT TOLERANCES OF ELECTRICAL NETWORKS

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

More information

ECE 308 Discrete-Time Signals and Systems

ECE 308 Discrete-Time Signals and Systems ECE 38-5 ECE 38 Discrete-Time Sigals ad Systems Z. Aliyazicioglu Electrical ad Computer Egieerig Departmet Cal Poly Pomoa ECE 38-5 1 Additio, Multiplicatio, ad Scalig of Sequeces Amplitude Scalig: (A Costat

More information

A COMBINED STOCHASTIC/DECISION-AIDED SNR ESTIMATOR. Witthaya Panyaworayan and Rolf Matzner

A COMBINED STOCHASTIC/DECISION-AIDED SNR ESTIMATOR. Witthaya Panyaworayan and Rolf Matzner A COMBINED STOCHASTIC/DECISION-AIDED SNR ESTIMATOR Witthaya Payaworaya ad Rolf Matzer Istitute for Commuicatios Egieerig Federal Armed Forces Uiversity Muich, Germay tpaya@daisy.et.uibw-mueche.de, rolf@ieee.org

More information

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

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

Deterministic Model of Multipath Fading for Circular and Parabolic Reflector Patterns

Deterministic Model of Multipath Fading for Circular and Parabolic Reflector Patterns To appear i the Proceedigs of the 5 IEEE outheastco, (Ft. Lauderdale, FL), April 5 Determiistic Model of Multipath Fadig for Circular ad Parabolic Reflector Patters Dwight K. Hutcheso dhutche@clemso.edu

More information

Random Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices

Random Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices Radom Matrices with Blocks of Itermediate Scale Strogly Correlated Bad Matrices Jiayi Tog Advisor: Dr. Todd Kemp May 30, 07 Departmet of Mathematics Uiversity of Califoria, Sa Diego Cotets Itroductio Notatio

More information

Lecture 22: Review for Exam 2. 1 Basic Model Assumptions (without Gaussian Noise)

Lecture 22: Review for Exam 2. 1 Basic Model Assumptions (without Gaussian Noise) Lecture 22: Review for Exam 2 Basic Model Assumptios (without Gaussia Noise) We model oe cotiuous respose variable Y, as a liear fuctio of p umerical predictors, plus oise: Y = β 0 + β X +... β p X p +

More information

Physics 324, Fall Dirac Notation. These notes were produced by David Kaplan for Phys. 324 in Autumn 2001.

Physics 324, Fall Dirac Notation. These notes were produced by David Kaplan for Phys. 324 in Autumn 2001. Physics 324, Fall 2002 Dirac Notatio These otes were produced by David Kapla for Phys. 324 i Autum 2001. 1 Vectors 1.1 Ier product Recall from liear algebra: we ca represet a vector V as a colum vector;

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

Chapter Vectors

Chapter Vectors Chapter 4. Vectors fter readig this chapter you should be able to:. defie a vector. add ad subtract vectors. fid liear combiatios of vectors ad their relatioship to a set of equatios 4. explai what it

More information

A Partial Decode-Forward Scheme For A Network with N relays

A Partial Decode-Forward Scheme For A Network with N relays A Partial Decode-Forward Scheme For A etwork with relays Yao Tag ECE Departmet, McGill Uiversity Motreal, QC, Caada Email: yaotag2@mailmcgillca Mai Vu ECE Departmet, Tufts Uiversity Medford, MA, USA Email:

More information

On Multipath Fading Channels at High SNR

On Multipath Fading Channels at High SNR O Multipath Fadig Chaels at High SNR Tobias Koch Amos Lapidoth ETH Zurich, Switzerlad Email: toch, lapidoth}@isi.ee.ethz.ch ISIT 008, Toroto, Caada, July 6 -, 008 Abstract This paper studies the capacity

More information

Lecture 19: Convergence

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

Approximate Analysis of Power Offset over Spatially Correlated MIMO Channels

Approximate Analysis of Power Offset over Spatially Correlated MIMO Channels Commuicatios ad Network, 9, 5-3 doi:.36/c.9. Published Olie August 9 (http://www.scirp.org/joural/c) Approximate Aalysis of Power Offset over Spatially Correlated MIMO Chaels Guagwei YU, Xuzhe WANG School

More information

Sequence Optimization in CDMA Point-to-point Transmission with Multipath

Sequence Optimization in CDMA Point-to-point Transmission with Multipath Sequece Optimizatio i CDMA Poit-to-poit Trasmissio with Multipath Li Gao ad Ta F. Wog Departmet of Electrical & Computer Egieerig Uiversity of Florida Gaiesville, Florida 36-630 E-mail: lgao@ecel.ufl.edu

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

Olli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5

Olli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5 Sigals ad Systems Sigals ad Systems Sigals are variables that carry iformatio Systemstake sigals as iputs ad produce sigals as outputs The course deals with the passage of sigals through systems T-6.4

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science. BACKGROUND EXAM September 30, 2004.

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science. BACKGROUND EXAM September 30, 2004. MASSACHUSETTS INSTITUTE OF TECHNOLOGY Departmet of Electrical Egieerig ad Computer Sciece 6.34 Discrete Time Sigal Processig Fall 24 BACKGROUND EXAM September 3, 24. Full Name: Note: This exam is closed

More information

Approximations and more PMFs and PDFs

Approximations 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

Direction of Arrival Estimation Method in Underdetermined Condition Zhang Youzhi a, Li Weibo b, Wang Hanli c

Direction of Arrival Estimation Method in Underdetermined Condition Zhang Youzhi a, Li Weibo b, Wang Hanli c 4th Iteratioal Coferece o Advaced Materials ad Iformatio Techology Processig (AMITP 06) Directio of Arrival Estimatio Method i Uderdetermied Coditio Zhag Youzhi a, Li eibo b, ag Hali c Naval Aeroautical

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

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

Journal of Multivariate Analysis. Superefficient estimation of the marginals by exploiting knowledge on the copula

Journal of Multivariate Analysis. Superefficient estimation of the marginals by exploiting knowledge on the copula Joural of Multivariate Aalysis 102 (2011) 1315 1319 Cotets lists available at ScieceDirect Joural of Multivariate Aalysis joural homepage: www.elsevier.com/locate/jmva Superefficiet estimatio of the margials

More information

Statistical Analysis on Uncertainty for Autocorrelated Measurements and its Applications to Key Comparisons

Statistical Analysis on Uncertainty for Autocorrelated Measurements and its Applications to Key Comparisons Statistical Aalysis o Ucertaity for Autocorrelated Measuremets ad its Applicatios to Key Comparisos Nie Fa Zhag Natioal Istitute of Stadards ad Techology Gaithersburg, MD 0899, USA Outlies. Itroductio.

More information

ECON 3150/4150, Spring term Lecture 3

ECON 3150/4150, Spring term Lecture 3 Itroductio Fidig the best fit by regressio Residuals ad R-sq Regressio ad causality Summary ad ext step ECON 3150/4150, Sprig term 2014. Lecture 3 Ragar Nymoe Uiversity of Oslo 21 Jauary 2014 1 / 30 Itroductio

More information

Information Theory Model for Radiation

Information Theory Model for Radiation Joural of Applied Mathematics ad Physics, 26, 4, 6-66 Published Olie August 26 i SciRes. http://www.scirp.org/joural/jamp http://dx.doi.org/.426/jamp.26.487 Iformatio Theory Model for Radiatio Philipp

More information

Random assignment with integer costs

Random assignment with integer costs Radom assigmet with iteger costs Robert Parviaie Departmet of Mathematics, Uppsala Uiversity P.O. Box 480, SE-7506 Uppsala, Swede robert.parviaie@math.uu.se Jue 4, 200 Abstract The radom assigmet problem

More information

Lecture 10: Universal coding and prediction

Lecture 10: Universal coding and prediction 0-704: Iformatio Processig ad Learig Sprig 0 Lecture 0: Uiversal codig ad predictio Lecturer: Aarti Sigh Scribes: Georg M. Goerg Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved

More information

SINGLE-CHANNEL QUEUING PROBLEMS APPROACH

SINGLE-CHANNEL QUEUING PROBLEMS APPROACH SINGLE-CHANNEL QUEUING ROBLEMS AROACH Abdurrzzag TAMTAM, Doctoral Degree rogramme () Dept. of Telecommuicatios, FEEC, BUT E-mail: xtamta@stud.feec.vutbr.cz Supervised by: Dr. Karol Molár ABSTRACT The paper

More information

The multiplicative structure of finite field and a construction of LRC

The multiplicative structure of finite field and a construction of LRC IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio

More information

5.1. The Rayleigh s quotient. Definition 49. Let A = A be a self-adjoint matrix. quotient is the function. R(x) = x,ax, for x = 0.

5.1. The Rayleigh s quotient. Definition 49. Let A = A be a self-adjoint matrix. quotient is the function. R(x) = x,ax, for x = 0. 40 RODICA D. COSTIN 5. The Rayleigh s priciple ad the i priciple for the eigevalues of a self-adjoit matrix Eigevalues of self-adjoit matrices are easy to calculate. This sectio shows how this is doe usig

More information

Reliability and Queueing

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

Summary and Discussion on Simultaneous Analysis of Lasso and Dantzig Selector

Summary and Discussion on Simultaneous Analysis of Lasso and Dantzig Selector Summary ad Discussio o Simultaeous Aalysis of Lasso ad Datzig Selector STAT732, Sprig 28 Duzhe Wag May 4, 28 Abstract This is a discussio o the work i Bickel, Ritov ad Tsybakov (29). We begi with a short

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

Chapter 11 Output Analysis for a Single Model. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

Chapter 11 Output Analysis for a Single Model. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Chapter Output Aalysis for a Sigle Model Baks, Carso, Nelso & Nicol Discrete-Evet System Simulatio Error Estimatio If {,, } are ot statistically idepedet, the S / is a biased estimator of the true variace.

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

Sensitivity Analysis of Daubechies 4 Wavelet Coefficients for Reduction of Reconstructed Image Error

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

TMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods

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

Probability 2 - Notes 10. Lemma. If X is a random variable and g(x) 0 for all x in the support of f X, then P(g(X) 1) E[g(X)].

Probability 2 - Notes 10. Lemma. If X is a random variable and g(x) 0 for all x in the support of f X, then P(g(X) 1) E[g(X)]. Probability 2 - Notes 0 Some Useful Iequalities. Lemma. If X is a radom variable ad g(x 0 for all x i the support of f X, the P(g(X E[g(X]. Proof. (cotiuous case P(g(X Corollaries x:g(x f X (xdx x:g(x

More information

Vector Permutation Code Design Algorithm. Danilo SILVA and Weiler A. FINAMORE

Vector Permutation Code Design Algorithm. Danilo SILVA and Weiler A. FINAMORE Iteratioal Symposium o Iformatio Theory ad its Applicatios, ISITA2004 Parma, Italy, October 10 13, 2004 Vector Permutatio Code Desig Algorithm Dailo SILVA ad Weiler A. FINAMORE Cetro de Estudos em Telecomuicações

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

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

ECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015

ECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015 ECE 8527: Itroductio to Machie Learig ad Patter Recogitio Midterm # 1 Vaishali Ami Fall, 2015 tue39624@temple.edu Problem No. 1: Cosider a two-class discrete distributio problem: ω 1 :{[0,0], [2,0], [2,2],

More information

On Evaluating the Rate-Distortion Function of Sources with Feed-Forward and the Capacity of Channels with Feedback.

On Evaluating the Rate-Distortion Function of Sources with Feed-Forward and the Capacity of Channels with Feedback. O Evaluatig the Rate-Distortio Fuctio of Sources with Feed-Forward ad the Capacity of Chaels with Feedback. Ramji Vekataramaa ad S. Sadeep Pradha Departmet of EECS, Uiversity of Michiga, A Arbor, MI 4805

More information

EL 675 UHF Propagation for Modern Wireless Systems. Henry L. Bertoni Polytechnic University

EL 675 UHF Propagation for Modern Wireless Systems. Henry L. Bertoni Polytechnic University EL 675 UHF Propagatio for Moder Wireless Systems Hery L. Bertoi Polytechic Uiversity otext for Discussig Wireless hael haracteristics Frequecies above ~ 300 MHz (λ < m) adio liks i ma-made eviromets At

More information

Queuing Theory. Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues

Queuing Theory. Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Queuig Theory Basic properties, Markovia models, Networks of queues, Geeral service time distributios, Fiite source models, Multiserver queues Chapter 8 Kedall s Notatio for Queuig Systems A/B/X/Y/Z: A

More information

On the Capacity of Symmetric Gaussian Interference Channels with Feedback

On the Capacity of Symmetric Gaussian Interference Channels with Feedback O the Capacity of Symmetric Gaussia Iterferece Chaels with Feedback La V Truog Iformatio Techology Specializatio Departmet ITS FPT Uiversity, Haoi, Vietam E-mail: latv@fpteduv Hirosuke Yamamoto Dept of

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

Introduction of Expectation-Maximization Algorithm, Cross-Entropy Method and Genetic Algorithm

Introduction of Expectation-Maximization Algorithm, Cross-Entropy Method and Genetic Algorithm Itroductio of Expectatio-Maximizatio Algorithm, Cross-Etropy Method ad Geetic Algorithm Wireless Iformatio Trasmissio System Lab. Istitute of Commuicatios Egieerig Natioal Su Yat-se Uiversity 2012/07/23

More information

ELEC1200: A System View of Communications: from Signals to Packets Lecture 3

ELEC1200: A System View of Communications: from Signals to Packets Lecture 3 ELEC2: A System View of Commuicatios: from Sigals to Packets Lecture 3 Commuicatio chaels Discrete time Chael Modelig the chael Liear Time Ivariat Systems Step Respose Respose to sigle bit Respose to geeral

More information

A Study of Capacity and Spectral Efficiency of Fiber Channels

A Study of Capacity and Spectral Efficiency of Fiber Channels A Study of Capacity ad Spectral Efficiecy of Fiber Chaels Gerhard Kramer (TUM) based o joit work with Masoor Yousefi (TUM) ad Frak Kschischag (Uiv. Toroto) MIO Workshop Muich, Germay December 8, 2015 Istitute

More information