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

Size: px
Start display at page:

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

Transcription

1 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, GA Abstract Although multiple pulse-positio modulatio performs well o ideal chaels, its performace o multipath chaels is degraded sigificatly. I a attempt to quatify the iheret pealty due to multipath dispersio, we evaluate upper bouds for the error probability of each modulatio scheme i the presece of itersymbol iterferece, cosiderig both a uequalized receiver ad the optimal maximum-likelihood sequece detectio receiver. We also preset upper ad lower bouds of the chael capacity for multiple pulse-positio modulatio ad its variats, PPM ad overlappig PPM. Numerical results show that the PPM-based schemes are sigificatly more sesitive to multipath dispersio tha is o-off keyig. I. Itroductio [6] cosidered the chael capacity for over a photo coutig chael, without itersymbol iterferece. Hirt [7] calculated the chael capacity for a biary discrete-time Gaussia chael usig a Mote Carlo approximatio. Shamai [8] derived lower ad upper bouds of the chael capacity with i.i.d. iput symbols for a scalar discrete-time Gaussia chael. I this paper, we examie the chael capacity of various modulatio schemes o the chael () uder the costraits of (). I Sect. II, we develop the geeral system model for multiple PPM ad its variats. I Sect. III, we aalyze the performace of the uequalized receiver ad the maximum-likelihood sequece detector. I Sect. IV, we preset the expressio for chael capacity o the ideal chael ad boud the chael capacity of PPM-based schemes over ISI chaels. We preset umerical results i Sect. V. No-directed ifrared radiatio offers several advatages over radio as a medium for idoor wireless etworks, icludig a immese widow of uregulated badwidth, immuity to multipath fadig (but ot multipath distortio), ad a lack of iterferece from oe room to aother []. But the itese backgroud light of typical idoor eviromets is a severe impedimet, ad power-efficiet modulatio is eeded to achieve high data rates or log rage. The wireless ifrared chael is accurately modeled by the followig basebad AWGN model []: y(t) = x(τ)h(t τ) dτ + (t), () where x(t) represets the istataeous optical power of the trasmitter, y(t) represets the istataeous curret of the receivig photodetector, h(t) represets the multipath impulse respose, ad (t) is white Gaussia oise with two-sided power spectral desity N. The high itesity of the backgroud light makes the Gaussia oise model extremely accurate. Because x(t) represets optical power, it must satisfy: x(t) ad x(t) P, () where P is the average optical power costrait of the trasmitter. A recet paper [3] examied the performace of multiple PPM o the wireless ifrared chael assumig o multipath dispersio. Audeh ad Kah [4] examied the effects of itersymbol iterferece (ISI) o PPM. We exted these results by examiig the effects of ISI o multiple PPM ad overlappig PPM. The chael capacity is cosidered to be a fudametal limit for reliable trasmissio over a give chael [5]. Georghiades II. System Model Cosider the system model show i Fig. (a). Iformatio bits with rate R b b s eter the ecoder, which groups the bits ito blocks of legth log L ad maps each block to oe of L codewords c c L, where each codeword is a biary -tuples of weight w. The set of allowable codewords is what distiguishes the differet modulatio schemes. Whe all ( w) -tuples of weight w are valid codewords, the resultig modulatio scheme is called multiple PPM (). Whe the oly valid codewords are those biary -tuples of weight w i which the w oes are cosecutive, the result is overlappig PPM (OPPM). Fially, whe w is restricted to uity, both ad OPPM reduce to covetioal PPM modulatio. Note that the umber of codewords L for, OPPM, ad PPM is ( w), w +, ad, respectively. The output of the ecoder is a sequece of codewords {x k } with rate T = R b log L. This sequece is serialized to produce the biary chip sequece {x j } with rate T, where x k = [x k, x k +,, x k + ] T. The biary chip sequece drives a trasmitter filter with a rectagular pulse shape p(t) of duratio T ad uity height. To satisfy the power costrait of (), the filter output is multiplied by (P w) before the sigal is set across the chael. As show i Fig. (a), the receiver uses a uit-eergy filter f(t) ad samples the output at the chip rate T producig y j. The receiver groups the samples y j ito blocks of legth, producig a sequece of observatio vectors {y k }, where y k = [y k, y k +,, y k + ] T. The receiver passes each observatio vector through a decisio device to form a estimate xˆ k of x k. Supported by NSF uder grat umber NCR = T lim ( ) dt T T T To appear, Iteratioal Symposium o Persoal, Idoor ad Mobile Radio Commuicatios, Taipei, October 996.

2 The equivalet discrete-time chael betwee trasmitted ad received chips is: y j = h i x j i + j = s j + j, (3) i = where h j is the equivalet chip-rate impulse respose: P h j = p(t) g(t) f(t), (4) w t = jt ad where s j is defied by (3). We assume that f(t) * f( t) is a Nyquist pulse, which will be true whe f(t) is matched to p(t) or whe f(t) is a whiteedmatched filter. I this case, the oise samples { j } will be idepedet zero-mea Gaussia radom variables with variace N. As show i Fig. (b), the equivalet vector chael betwee trasmitted codewords x k ad observatio vectors y k is give by: µ y k = H l x k l + k = s k + k, (5) where the chael impulse respose is a Toeplitz sequece H k, with [H k ] ij = h k + i j, s k = [s k, s k +,, s k + ] T is the sigal compoet, k = [ k, k +,, k + ] T is the oise compoet ad µ is the umber of memories i vector ISI chael. Throughout this paper we costrai the iput symbols x k to be idepedet ad uiformly distributed over a or OPPM alphabet. III-A. Without Equalizatio III. Performace Aalysis By defiitio, the uequalized receiver uses the decisio device that would be optimal were there o ISI. I other words, it decides o the codeword c l that maximizes the correlatio: Λ l = c l T y k for,, L. (6) If we kew that x k = c i, ad if we kew all past ad future codewords X = {, x k, x k, x k+, x k+, }, the the probability of error xˆ k x k ca be bouded usig the uio boud: L Pr[error x k = c i, X ] Pr[Λ i Λ j x k = c i, X ] (7) L = Pr[(c i c j ) T k > (c i c j ) T s k x k = c i, X ]. But (c i c j ) T k is a zero-mea Gaussia radom variable with variace d ij N, where d ij = d H (c i, c j ) is the Hammig distace betwee codewords c i ad c j. Therefore, (7) reduces to: L ( Pr[error x k = c i, X ] Q c i c j ) T s k (8) d ij N o Averagig overall all possible codeword sequeces gives: L L ( Pr[error] , (9) L M + Q c i c j ) T s k X d i = ij N o where the first summatio is over all X C M, where C is the set of L valid codewords ad M + is the umber of ozero terms i the impulse respose {H k }. Fially, the bit-error probability is: log L Pr[bit error] = ( Pr[error]). () For o-off keyig (), the bit stream, symbol stream, ad chip stream are all oe i the same. By averagig over all possible bit streams {x }, the total bit error probability is: Pr[bit error] = , () M Q h x h j x N o where the summatio is overall all biary M-tuples {x }, where M + is the umber of ozero terms i h j. Hereafter, we preset simplified expressios for the symbol error probability for the special case of a ideal chael, without ISI. First, cosider multiple PPM: whe the chael has o ISI, the expressio (9) simplifies to: w k w Pr[error] a k Q ks , () N o k = w where a k = ( )( k ) is the umber of codewords with mutual distace k, ad s = (P w) log L R b. This expressio follows from the ISI-free results for the photo coutig chael of [6]. Whe w =, (i.e., for PPM), () simplifies further to: Pr[error] (L )Q s , (3) N o where s = P Llog L R b. Next, cosider ( w) OPPM: whe the chael has o ISI, the expressio (9) simplifies to: b x P w (t) i k x j x(t) y y j k xˆ k ENC P S p(t) g(t) f(t) S P DEC T rate rate rate (a) rate rate rate log L T T T T T T k x k y k H(z) Fig.. (a) Block diagram of multiple PPM system; (b) equivalet vector model. (b)

3 w Pr[error] --- b, (4) L k Q ks N o k = (L k) k =,,, w where b k =, (5) (L w)(l w + ) k = w ad s = (P w) log L R b. This result uses the photo-coutig results of [6]. Fially, cosider : whe the chael has o ISI, the h j from (4) reduces to (P R b )δ j, ad so the error probability from () simplifies to Q(P N R b ). III-B. ML Sequece Detectio The maximum-likelihood (ML) sequece detector for PPM is derived i [9], ad it easily geeralizes to multiple PPM ad overlappig PPM. The receiver filter is the whiteed-matched filter, so that h j is causal ad miimum phase. The probability of a symbol (block) error for the ML sequece detector is well approximated at high SNR by: Pr[error] Q(d mi N ), (6) where d mi is the miimum distace betwee received sequeces: d mi = mi H m e k m. (7) {e k } k The above miimizatio is performed over all possible error sequeces {e k } startig at time zero, usig a error alphabet of {u v: u v; u, v C}, where C is the set of valid multiple PPM codewords. IV. IV-A. Memoryless Chael m Chael Capacity If the chael is memoryless (ISI-free), so that H = I, H for all l i (5), the the chael capacity (i bits per codeword) uder the i.i.d. costrait is [5]: I iid = I(x; x + ) = e y x L l σ log L ( πσ ) e y x l σ dy. (8) --- e y x L m σ Lm = Followig [], we substitute z = (y x l ) / σ ad v m = x m / σ, so that (8) reduces to: L --- L I iid = log L e z log π ( e v l v m )z v L l v m e dz. (9) m = The above equatio cotais a dimesioal itegral ad has o simple closed form solutio. As a cosequece, we shall use the Mote Carlo method to estimate I iid i Sect. V. IV-B. Multipath Chael Followig [8], we ca also represet the chael (5) usig matrix otatio: Y = HX + N = S + N, () where Y = [y T, y T,..., y N T ] T, X = [x T, x T,..., x N T ] T, S = [s T, s T,..., s N T ] T, ad N = [ T, T,..., N T ] T are N colum vectors. The two equatios (5) ad () are equivalet as N, ad the rows of H are specified by circular shifts of {H i }:. () The chael capacity for () uder the i.i.d. costrait is [5][7]: lim lim I iid = ----I ( Y; X) = ---- ( h( Y) h( Y X) ) () = log L log L N e z π N Exact evaluatio of this expressio is ot possible, so we resort to upper ad lower bouds. I the followig discussio, we preset lower ad upper bouds for the chael capacity uder the i.i.d. costrait. Our presetatio is a straightforward geeralizatio of the scalar results of Shamai [8] to the vector chael (5). Followig [8], we represet the etropy of the output vector i () usig the chai rule: h( Y) = h( y l y l, y l, y ). (4) Sice coditioig decreases the etropy: h(y) H = L lim ---- N N H H H H µ H L ( S l S m )z S l S m e dz (3) m = h( s l + l s l,, s, l,, ) = h( s l + l s l,, s ), (5) where the last equality follows because s l, l, l,, are idepedet. Sice s l =, (5) reduces to: j H l j x j h(y) h( H x l + l ). (6) The mutual iformatio betwee the iput ad output vectors is: I( X; Y) = h( Y) h( N) { h( H x l + l ) h( l )} = I( H x l + l ; x l ). (7) This leads to the followig lower boud I L for the chael capacity uder the i.i.d. costrait:

4 lim ---- I( X; Y) We ca evaluate (8) by replacig x with H x i (8). As poited out i [9], the lower boud of the chael capacity is equivalet to the mutual iformatio betwee the iput ad the output of a error-free block zero-forcig decisio feedback equalizer. We ow preset a upper boud I U for the capacity I iid of (3). By the chai rule, we ca represet the mutual iformatio betwee the iput ad output of () as: I(Y; X) = I( Y; x l x l, x l,, x ) = Sice {x k } are i.i.d. ad coditioig decreases the etropy: = = I( x l ; H x l +, H x l +,, H µ x l + µ ) = I(x l ; Ỹ ), (3) where Ỹ = H x l + Ñ, ad where H = [H T, H T,..., H T µ ] T ad Ñ = [ T, T,..., T µ ] T. T Let V = H Ỹ = Bx l + w, where H T is a matched filter, so that B = lim ---- I H ( x l + l ; x l ) = I( H x + ; x) (8) [ h( x l x l, x l,, x ) h( x l x l, x l,, x, Y) ]. (9) I( Y; X) [ h( x l x, x,, x, l x, l + x, l +, x N ) h( x l x, x,, x, l x, l + x, l +, x Y N, ) ] I( x l ; x, x,, x, l x, l + x, l +, x Y N, ) µ m = H m T H m ad w is a zero-mea Gaussia vector with correlatio matrix E[ww T ] = σ B. Sice B is positive defiite, it ca be factored ito B = ΓΓ T for some matrix Γ. We ca white the oise by applyig Γ - to V, yieldig Z = Γ - V = Γ T x l +, where has the same distributio as l, a zero-mea Gaussia vector with correlatio matrix σ I. Sice both the matched filter ad oise whiteer are iformatio lossless, we have I(x l ; Ỹ ) = I(x l ; V) = I(x l ; Z). Therefore, (3) reduces to: I(Y; X) I(x l ; Γ T x l + l ). (3) Fially, takig the limit as N yields our upper boud I U of the chael capacity uder the i.i.d costrait: lim ---- I( X; Y) lim ---- I x ( l + l ; x l ) = I( Γ T x + ; x). (3) We ca evaluate (3) by replacig x with Γ T x i (8). Note that, for the scalar case, the matrix Γ T reduces to m h m upper boud (3) reduces to the matched filter boud [8]., ad the V. Numerical Results To geerate umerical results, we assume that the uderlyig cotiuous-time chael i Fig. has impulse respose g(t) = We Wt u(t), a first-order low-pass filter with a 3-dB badwidth of W, where u(t) is the uit step fuctio. Observe that the chael has uity d.c. gai. We also assume that the receive filter f(t) is a uit-eergy whiteed-matched filter.to reduce computatioal complexity, we trucate the vector chael of (5) to four 3 terms, so that y k = H l x k l + k. This trucatio will have o appreciable effect whe is large or whe R b W is small, although it may ot be accurate for small ad large R b W. Observe that the chael has uity d.c. gai. We calculated the optical power required to achieve a -6 bit-error rate over this ISI chael. The results are summarized i Fig., where the ormalized power requiremet is plotted versus the bit-rate-to-badwidth ratio R b W. The power requiremets are ormalized by P = N Q ( 6 R b ), the power required by i the ideal case (W = ) to achieve a -6 bit error rate. I Fig. (a) we plot power requiremet versus R b W whe equalizatio is ot used. We see that some modulatio schemes Normalized Power Requiremet (db) Normalized Power Requiremet (db) Without Equalizatio ( 4 ) 4-PPM 8-PPM ( 6 3 ) OPPM -PPM ( 8 4 ) OPPM PPM OPPM 6.. Bit Rate Badwidth (R b W) With MLSD ( 6 3 ) OPPM -PPM ( 8 4 ) OPPM ( 4 ) 4-PPM PPM 4 OPPM 8-PPM 6.. Bit Rate Badwidth (R b W) Fig.. Power requiremet vs bit rate o a ISI chael:. (a) Uequalized system (b) ML sequece detectio. (a) (b)

5 are more sesitive to ISI tha others. At large badwidth (R b W <.), the ISI pealties are small. At oe extreme is (represeted by the symbol ), with a power requiremet icreasig slowly with decreasig badwidth. At the other extreme is OPPM, for which the power requiremet grows rapidly with decreasig badwidth. It is thus highly desirable to use sigal processig at the receiver to mitigate ISI, either equalizatio or maximum-likelihood sequece detectio. I cotrast to the uequalized results of Fig. (a), the results of Fig. (b) are based o the maximum-likelihood sequece detector (MLSD). Comparig Fig. (a) ad Fig. (b), we see that MLSD offers sigificat improvemet. The power requiremets do ot grow as rapidly as i the uequalized case, ad the ormalized power requiremet is always less tha db, eve whe R b W =. We ote that MLSD is much more effective i reducig the power requiremet for tha for other modulatio schemes. The exact capacity I iid of (3) is difficult to evaluate, but we ca form a estimate Î iid by choosig N suitably large i (3) rather tha lettig N, ad by usig the Mote Carlo method with Q sample vectors to approximate the multiple itegral. I Fig. 3, I ideal (9), I L (8), ad I U (3) are show for PPM, ad compared to the approximate chael capacity Î iid (based o N = 6, Q = ). Our results show that I L ad I U are.5 db apart at moderate SNR whe R b W =.5. Whe SNR = 3.3 db, the chael capacity is.95 bits codeword whe the chael is ideal, but is oly.8 bits codeword whe R b W =.5. To achieve a capacity of.95 bits codeword usig PPM at R b W =.5, the required SNR is 9.5 db. I cotrast, we see from Fig. (b) that a ucoded -PPM system with MLSD requires a additioal 3.3 db, or.8 db SNR, to achieve -6 BER at R b W =.5. Thus, the codig gai for a code based o -PPM ca be at most 3.3 db i this case. Higher codig gais are possible for higher-order alphabets. Liks, IEEE Trasactios o Commuicatios, vol. 43, o. -4, pp , Feb.-Apr [3] H. Park ad J. R. Barry, Modulatio Aalysis for Wireless Ifrared Commuicatio, Proc. of Itl. Cof. o Comm., Seattle, WA, pp. 8-86, Jue 995. [4] M. D. Audeh ad J. M. Kah, Performace Evaluatio of L-Pulse Positio Modulatio o No-Directed Idoor Ifrared Chaels, ICC, New Orleas, LA, pp , May 994. [5] R. G. Gallager, Iformatio Theory ad Reliable Commuicatio, New York, Wiley, 968. [6] C. N. Georghiades, Modulatio ad Codig for Throughput-Efficiet Optical Systems, IEEE Trasactios o Iformatio Theory, vol. 4, o.5, pp , September 994. [7] W. Hirt, Capacity ad Iformatio Rates of Discrete- Time Chaels with Memory, Ph. D. Dissertatio, Swiss Federal Istitute of Techology, Zürich, 988. [8] S. Shamai (Shitz), L. H. Ozarow, ad A. D. Wyer, Iformatio Rates for a Discrete-Time Gaussia Chael with Itersymbol Iterferece ad Statioary Iputs, IEEE Trasactios o Iformatio Theory, vol. 37, No. 6, , November 99. [9] J. R. Barry, Sequece Detectio ad Equalizatio for Pulse-Positio Modulatio, Proc. of Itl. Cof. o Comm., New Orleas, LA, pp , May 994. [] R. E. Blahut, Priciples ad Practice of Iformatio Theory, Readig, MA, Addiso-Wesley, 987. VI. Coclusios We have examied the performace of multiple PPM ad its variats PPM ad OPPM o ISI chaels with additive white Gaussia oise. We have derived the chael capacity over ISI chaels of multiple PPM ad its variats PPM, OPPM, ad with additive white Gaussia oise, assumig the codewords are idepedet ad uiformly distributed. For umerical comparisos we cosidered a first-order low-pass filter chael with badwidth W. The error probability ad chael capacity results idicates that, although PPM modulatio schemes are extremely power efficiet across ISI-free chaels, their power efficiecy drops dramatically o ISI chaels. Bits / Codeword R b / W =.5 I ideal I U I L Î iid VII. Refereces [] F. R. Gfeller, U. Bapst, Wireless I-House Data Commuicatios via Diffuse Ifrared Radiatio, Proceedigs of the IEEE, vol. 67, o., pp , November 979. [] J. M. Kah, W. J. Krause, ad J. B. Carruthers, Experimetal Characterizatio of No-Directed Idoor Ifrared SNR (db) Fig. 3. Bouds o the chael capacity for PPM vs SNR = P / N R b for R b W =.5. (The capacity I ideal for the ideal case R b W = is icluded for referece.)

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

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

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

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

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

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

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

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

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

1.0 Probability of Error for non-coherent BFSK

1.0 Probability of Error for non-coherent BFSK Probability of Error, Digital Sigalig o a Fadig Chael Ad Equalizatio Schemes for ISI Wireless Commuicatios echologies Sprig 5 Lectures & R Departmet of Electrical Egieerig, Rutgers Uiversity, Piscataway,

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

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

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

Free Space Optical Wireless Communications under Turbulence Channel Effect

Free Space Optical Wireless Communications under Turbulence Channel Effect IOSR Joural of Electroics ad Commuicatio Egieerig (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue 3, Ver. III (May - Ju. 014), PP 01-08 Free Space Optical Wireless Commuicatios uder Turbulece

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

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

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1 EECS564 Estimatio, Filterig, ad Detectio Hwk 2 Sols. Witer 25 4. Let Z be a sigle observatio havig desity fuctio where. p (z) = (2z + ), z (a) Assumig that is a oradom parameter, fid ad plot the maximum

More 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

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

Lecture 1: Channel Equalization 1 Advanced Digital Communications (EQ2410) 1. Overview. Ming Xiao CommTh/EES/KTH

Lecture 1: Channel Equalization 1 Advanced Digital Communications (EQ2410) 1. Overview. Ming Xiao CommTh/EES/KTH : 1 Advaced Digital Commuicatios (EQ2410) 1 Tuesday, Ja. 20, 2015 8:15-10:00, D42 1 Textbook: U. Madhow, Fudametals of Digital Commuicatios, 2008 1 / 1 Overview 2 / 1 Chael Model Itersymbol iterferece

More 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

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

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

Statistical Noise Models and Diagnostics

Statistical Noise Models and Diagnostics L. Yaroslavsky: Advaced Image Processig Lab: A Tutorial, EUSIPCO2 LECTURE 2 Statistical oise Models ad Diagostics 2. Statistical models of radom iterfereces: (i) Additive sigal idepedet oise model: r =

More information

Exmple Questions for the Examination for 4041 OPTICAL COMMUNICATION ENGINEERING

Exmple Questions for the Examination for 4041 OPTICAL COMMUNICATION ENGINEERING Exmple Questios for the Examiatio for 441 OPTICAL COMMUNICATION ENGINEERING Official Readig Time: 1 mis Writig Time: 1 mis Total Duratio: 13 mis NOTE: The 8 Exam will have of 6 (!) Questios ad thus will

More information

Stochastic Simulation

Stochastic Simulation Stochastic Simulatio 1 Itroductio Readig Assigmet: Read Chapter 1 of text. We shall itroduce may of the key issues to be discussed i this course via a couple of model problems. Model Problem 1 (Jackso

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

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

Lecture 7: October 18, 2017

Lecture 7: October 18, 2017 Iformatio ad Codig Theory Autum 207 Lecturer: Madhur Tulsiai Lecture 7: October 8, 207 Biary hypothesis testig I this lecture, we apply the tools developed i the past few lectures to uderstad the problem

More 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

Universal source coding for complementary delivery

Universal source coding for complementary delivery SITA2006 i Hakodate 2005.2. p. Uiversal source codig for complemetary delivery Akisato Kimura, 2, Tomohiko Uyematsu 2, Shigeaki Kuzuoka 2 Media Iformatio Laboratory, NTT Commuicatio Sciece Laboratories,

More information

Generalized Semi- Markov Processes (GSMP)

Generalized Semi- Markov Processes (GSMP) Geeralized Semi- Markov Processes (GSMP) Summary Some Defiitios Markov ad Semi-Markov Processes The Poisso Process Properties of the Poisso Process Iterarrival times Memoryless property ad the residual

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

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

Chapter 9: Numerical Differentiation

Chapter 9: Numerical Differentiation 178 Chapter 9: Numerical Differetiatio Numerical Differetiatio Formulatio of equatios for physical problems ofte ivolve derivatives (rate-of-chage quatities, such as velocity ad acceleratio). Numerical

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

FIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser

FIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser FIR Filters Lecture #7 Chapter 5 8 What Is this Course All About? To Gai a Appreciatio of the Various Types of Sigals ad Systems To Aalyze The Various Types of Systems To Lear the Skills ad Tools eeded

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

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

ECEN 655: Advanced Channel Coding Spring Lecture 7 02/04/14. Belief propagation is exact on tree-structured factor graphs.

ECEN 655: Advanced Channel Coding Spring Lecture 7 02/04/14. Belief propagation is exact on tree-structured factor graphs. ECEN 655: Advaced Chael Codig Sprig 014 Prof. Hery Pfister Lecture 7 0/04/14 Scribe: Megke Lia 1 4-Cycles i Gallager s Esemble What we already kow: Belief propagatio is exact o tree-structured factor graphs.

More information

Complex Algorithms for Lattice Adaptive IIR Notch Filter

Complex Algorithms for Lattice Adaptive IIR Notch Filter 4th Iteratioal Coferece o Sigal Processig Systems (ICSPS ) IPCSIT vol. 58 () () IACSIT Press, Sigapore DOI:.7763/IPCSIT..V58. Complex Algorithms for Lattice Adaptive IIR Notch Filter Hog Liag +, Nig Jia

More information

Characterization and Simulation of HF Propagation in a realistic disturbed and horizontally inhomogeneous Ionosphere

Characterization and Simulation of HF Propagation in a realistic disturbed and horizontally inhomogeneous Ionosphere Characterizatio ad Simulatio of HF Propagatio i a realistic disturbed ad horizotally ihomogeeous Ioosphere Vadim E. Gherm ad Nikolay N.Zerov Departmet of Radiophysics Uiversity of St.Petersburg St.Petersburg

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

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

Monte Carlo Integration

Monte Carlo Integration Mote Carlo Itegratio I these otes we first review basic umerical itegratio methods (usig Riema approximatio ad the trapezoidal rule) ad their limitatios for evaluatig multidimesioal itegrals. Next we itroduce

More information

MODEL CHANGE DETECTION WITH APPLICATION TO MACHINE LEARNING. University of Illinois at Urbana-Champaign

MODEL CHANGE DETECTION WITH APPLICATION TO MACHINE LEARNING. University of Illinois at Urbana-Champaign MODEL CHANGE DETECTION WITH APPLICATION TO MACHINE LEARNING Yuheg Bu Jiaxu Lu Veugopal V. Veeravalli Uiversity of Illiois at Urbaa-Champaig Tsighua Uiversity Email: bu3@illiois.edu, lujx4@mails.tsighua.edu.c,

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

The Poisson Process *

The Poisson Process * OpeStax-CNX module: m11255 1 The Poisso Process * Do Johso This work is produced by OpeStax-CNX ad licesed uder the Creative Commos Attributio Licese 1.0 Some sigals have o waveform. Cosider the measuremet

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

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

Lecture 15: Strong, Conditional, & Joint Typicality

Lecture 15: Strong, Conditional, & Joint Typicality EE376A/STATS376A Iformatio Theory Lecture 15-02/27/2018 Lecture 15: Strog, Coditioal, & Joit Typicality Lecturer: Tsachy Weissma Scribe: Nimit Sohoi, William McCloskey, Halwest Mohammad I this lecture,

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

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

Chapter 3 Soft Decision and Quantised Soft Decision Decoding

Chapter 3 Soft Decision and Quantised Soft Decision Decoding Chapter 3 Soft Decisio ad Quatised Soft Decisio Decodig 3.1 Itroductio The use of hard decisio decodig results i a decodig loss compared to soft decisio decodig. There are several refereces that have quatified

More information

Introduction to Machine Learning DIS10

Introduction to Machine Learning DIS10 CS 189 Fall 017 Itroductio to Machie Learig DIS10 1 Fu with Lagrage Multipliers (a) Miimize the fuctio such that f (x,y) = x + y x + y = 3. Solutio: The Lagragia is: L(x,y,λ) = x + y + λ(x + y 3) Takig

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

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

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

Introduction to Signals and Systems, Part V: Lecture Summary

Introduction to Signals and Systems, Part V: Lecture Summary EEL33: Discrete-Time Sigals ad Systems Itroductio to Sigals ad Systems, Part V: Lecture Summary Itroductio to Sigals ad Systems, Part V: Lecture Summary So far we have oly looked at examples of o-recursive

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

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

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled 1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how

More 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

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

Markov Decision Processes

Markov Decision Processes Markov Decisio Processes Defiitios; Statioary policies; Value improvemet algorithm, Policy improvemet algorithm, ad liear programmig for discouted cost ad average cost criteria. Markov Decisio Processes

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

Hybrid Coding for Gaussian Broadcast Channels with Gaussian Sources

Hybrid Coding for Gaussian Broadcast Channels with Gaussian Sources Hybrid Codig for Gaussia Broadcast Chaels with Gaussia Sources Rajiv Soudararaja Departmet of Electrical & Computer Egieerig Uiversity of Texas at Austi Austi, TX 7871, USA Email: rajivs@mailutexasedu

More information

FIR Filter Design: Part I

FIR Filter Design: Part I EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I. Itroductio FIR Filter Desig: Part I I this set o otes, we cotiue our exploratio o the requecy respose o FIR ilters. First, we cosider some

More information

On forward improvement iteration for stopping problems

On forward improvement iteration for stopping problems O forward improvemet iteratio for stoppig problems Mathematical Istitute, Uiversity of Kiel, Ludewig-Mey-Str. 4, D-24098 Kiel, Germay irle@math.ui-iel.de Albrecht Irle Abstract. We cosider the optimal

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

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

Complexity Bounds of LDPC Codes for Parallel Channels

Complexity Bounds of LDPC Codes for Parallel Channels Complexity Bouds of DPC Codes for Parallel Chaels Youjia (Eugee) iu, eugeeliu@ieee.org Departmet of Electrical ad Computer Egieerig Uiversity of Colorado at Boulder Jilei Hou, jhou@qualcomm.com Qualcomm

More information

Frequency Response of FIR Filters

Frequency Response of FIR Filters EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we itroduce the idea of the frequecy respose of LTI systems, ad focus specifically o the frequecy respose of FIR filters.. Steady-state

More information

Signals & Systems Chapter3

Signals & Systems Chapter3 Sigals & Systems Chapter3 1.2 Discrete-Time (D-T) Sigals Electroic systems do most of the processig of a sigal usig a computer. A computer ca t directly process a C-T sigal but istead eeds a stream of

More information

2(25) Mean / average / expected value of a stochastic variable X: Variance of a stochastic variable X: 1(25)

2(25) Mean / average / expected value of a stochastic variable X: Variance of a stochastic variable X: 1(25) Lecture 5: Codig of Aalog Sources Samplig ad Quatizatio Images ad souds are ot origially digital! The are cotiuous sigals i space/time as well as amplitude Typical model of a aalog source: A statioary

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

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

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows

More information

Kinetics of Complex Reactions

Kinetics of Complex Reactions Kietics of Complex Reactios by Flick Colema Departmet of Chemistry Wellesley College Wellesley MA 28 wcolema@wellesley.edu Copyright Flick Colema 996. All rights reserved. You are welcome to use this documet

More information

Lecture 7: Properties of Random Samples

Lecture 7: Properties of Random Samples Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ

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

Bayesian Methods: Introduction to Multi-parameter Models

Bayesian Methods: Introduction to Multi-parameter Models Bayesia Methods: Itroductio to Multi-parameter Models Parameter: θ = ( θ, θ) Give Likelihood p(y θ) ad prior p(θ ), the posterior p proportioal to p(y θ) x p(θ ) Margial posterior ( θ, θ y) is Iterested

More 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

Economics 241B Relation to Method of Moments and Maximum Likelihood OLSE as a Maximum Likelihood Estimator

Economics 241B Relation to Method of Moments and Maximum Likelihood OLSE as a Maximum Likelihood Estimator Ecoomics 24B Relatio to Method of Momets ad Maximum Likelihood OLSE as a Maximum Likelihood Estimator Uder Assumptio 5 we have speci ed the distributio of the error, so we ca estimate the model parameters

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

There is no straightforward approach for choosing the warmup period l.

There is no straightforward approach for choosing the warmup period l. B. Maddah INDE 504 Discrete-Evet Simulatio Output Aalysis () Statistical Aalysis for Steady-State Parameters I a otermiatig simulatio, the iterest is i estimatig the log ru steady state measures of performace.

More information

17.1 Channel coding with input constraints

17.1 Channel coding with input constraints 7. Chaels with iput costraits. Gaussia chaels. 7. Chael codig with iput costraits Motivatios: Let us look at the additive Gaussia oise. The the Shao capacity is ifiite, sice sup P I(X; X + Z) = achieved

More information

Statistical Inference Based on Extremum Estimators

Statistical Inference Based on Extremum Estimators T. Rotheberg Fall, 2007 Statistical Iferece Based o Extremum Estimators Itroductio Suppose 0, the true value of a p-dimesioal parameter, is kow to lie i some subset S R p : Ofte we choose to estimate 0

More information

Statistical and Mathematical Methods DS-GA 1002 December 8, Sample Final Problems Solutions

Statistical and Mathematical Methods DS-GA 1002 December 8, Sample Final Problems Solutions Statistical ad Mathematical Methods DS-GA 00 December 8, 05. Short questios Sample Fial Problems Solutios a. Ax b has a solutio if b is i the rage of A. The dimesio of the rage of A is because A has liearly-idepedet

More information

Riemann Sums y = f (x)

Riemann Sums y = f (x) Riema Sums Recall that we have previously discussed the area problem I its simplest form we ca state it this way: The Area Problem Let f be a cotiuous, o-egative fuctio o the closed iterval [a, b] Fid

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

Finite Block-Length Gains in Distributed Source Coding

Finite Block-Length Gains in Distributed Source Coding Decoder Fiite Block-Legth Gais i Distributed Source Codig Farhad Shirai EECS Departmet Uiversity of Michiga A Arbor,USA Email: fshirai@umichedu S Sadeep Pradha EECS Departmet Uiversity of Michiga A Arbor,USA

More information

On Some Aspects of Random Walks for. Modelling Mobility in a Communication Network* E.R. Barnes

On Some Aspects of Random Walks for. Modelling Mobility in a Communication Network* E.R. Barnes ESL-P-783 Noveiber 1977 O Some Aspects of Radom Walks for Modellig Mobility i a Commuicatio Network* S.K. Leug-Ya-Cheog E.R. Bares This ote examies a two-dimesioal symmetric radom walk model of mobility

More information

Basis for simulation techniques

Basis for simulation techniques Basis for simulatio techiques M. Veeraraghava, March 7, 004 Estimatio is based o a collectio of experimetal outcomes, x, x,, x, where each experimetal outcome is a value of a radom variable. x i. Defiitios

More information

Lecture 11: Decision Trees

Lecture 11: Decision Trees ECE9 Sprig 7 Statistical Learig Theory Istructor: R. Nowak Lecture : Decisio Trees Miimum Complexity Pealized Fuctio Recall the basic results of the last lectures: let X ad Y deote the iput ad output spaces

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

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

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018) Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black

More information