I-Hsiang Wang Principle of Communications Lecture 02
|
|
- Derick Hardy
- 6 years ago
- Views:
Transcription
1 Lecture 02: Digital Modulation Outline Digital-to-analog and analog-to-digital: a signal space perspective Pulse aplitude odulation (PAM), pulse shaping, and the Nyquist criterion Quadrature aplitude odulation (QAM), and the equivalent coplex aseand representation Syol apping and constellation set his lecture introduces the principle of digital odulation, which serves as the ridge etween the cyer world and the physical world. he channel noise is neglected in this lecture, and how to deodulate the signal under noise using optial detection principles is the thee of the next lecture. he asic architecture of digital odulation is depicted in Fig.. {c i } Syol Mapper {u } Pulse Shaper x (t) Up Converter x(t) coded its discrete sequence aseand wavefor passand wavefor Noisy Channel {ĉ i } Syol Deapper {û } Sapler + Filter y (t) Down Converter y(t) Figure : Digital odulation For the transitter, there are three ajor coponents: (a) Syol apping: it sequence syol sequence () Pulse shaping: syol sequence (aseand) wavefor (c) Up conversion: aseand wavefor passand wavefor o e assigned: constellation set o e assigned: pulse, andwidth to e assigned: carrier frequency In the following, we will first introduce the concept of signal space, which is a vector space with wavefor as vectors. With the concept of signal space in ind, we then develop the asic principles of converting sequences to wavefors and vice versa, using orthogonal expansions and projections. hen, we introduce a standard way of converting syol sequences to wavefors, called Pulse Aplitude Modulation (PAM), where the key coponent is pulse shaping. In pulse shaping, in order to e ale to reconstruct the syols fro wavefors at the receiver, certain condition needs to e satisfied for the wavefor. Nyquist Criterion is a sufficient condition that is siple to evaluate. Next, we switch gear to aseand-passand conversion and introduce a standard way called Quadrature Aplitude Modulation (QAM). With QAM, we then derive the equivalent coplex aseand representation. Finally, the design of syol apping is discussed, and a prevalent way called Gray Mapping is introduced. he design of constellation set is also covered, and several standard constellation sets including PSK, PAM, and QAM are introduced. Fall 207 National aiwan University Page
2 Prelude Fro the discussions in Lecture 0, two key eleents in digital counication systes can e identified: (a) Conversion etween its and syol sequences: Source coding: quantization; tale lookup Channel coding: syol apper; syol deapper () Conversion etween (discrete-tie) sequences and (continuous-tie) wavefors: Source coding: sapling; interpolation filter Channel coding: pulse shaping; sapling his step uilds the ridge etween the cyer and the physical world and enales us to do things digitally. We shall egin with the latter one: conversion etween sequences and wavefors, and then coe ack to the forer one later. 2 Signal space 2. Exaples of conversion etween sequences and wavefors Recall fro the course Signals and Systes, we have learned two approaches for the conversion etween sequences and wavefors: Fourier Series for tie-liited signals {x(t), t } where is an interval with length Sapling heore for and-liited signals {x(t)} with Fourier transfor x(f) = 0 for all f > W. he following tale suarizes how to do analysis (fro wavefor to sequence) and synthesis (fro sequence to wavefor). Recall that sinc(t) sin(πt) πt. Fourier Series Analysis (x(t) x[]) x[] = Sapling heore x[] = x ( ) x(t)e j2π t dt x(t) = x(t) = Synthesis (x[] x(t)) = = x[]e j 2π t x[] sinc( t ) ale : Forulas of analysis and synthesis in Fourier Series and Sapling heore he fors look siilar. It turns out that such siilarity is no coincidence, and there is an unifying principle ehind the. Such principle is called Signal Space, which can e viewed as an inner product space with wavefors identified as vectors. Below we riefly review vector space and inner product space. For ore details, please read Chapter 5 of []. 2.2 Vector space and inner product space Recall that a vector space (V, F) is a collection of vectors v V along with a set F of scalars, following soe axios. he scalar set F is usually the real field R or the coplex field C. When the scalars are Fall 207 National aiwan University Page 2
3 constrained to e real, the corresponding vector space is called a real vector space. If the scalars are coplex, the corresponding vector space is called a coplex vector space. In the following, we focus on coplex vector spaces, that is, the aient scalar set F is C. When the context is clear, that is, the scalar field is well-understood fro the context, we often use V to denote the vector space. A vector space follows soe axios (you can check your Linear Algera textook or Chapter 5 of []). One of the ost iportant consequences is linearity: α, β C, u, v V, αu + βv V. () Recall the following profound result fro your Linear Algera course. heore : For any finite-diensional vector space V (that is, there exists a spanning set of V with finite cardinality), the following hold: If {v,..., v } span V ut are linearly dependent, then a suset of {v,..., v } for a asis for V with n < vectors. If {v,..., v } are linearly independent ut do not span V, then there exists a asis for V with n > vectors that contains {v,..., v }. Every asis of V has the sae cardinality Inner product and nor One of the ost iportant kinds of vector space are Euclidean spaces R n, C n. he vectors here have the natural notion of angle and length, which can e further astracted into the concepts of inner product and nor. An inner product, on a coplex vector space V satisfies the following axios: for u, v, w V and α, β C, (a) Heritian syetry: () Heritian ilinearity: (c) Positivity: v, u = u, v. (2) αu + βv, w = α u, w + β v, w. (3) v, v 0, with equality iff v = 0. (4) A vector space with an inner product is called an inner product space. he nor v of a vector v is defined as v v, v. (5) In an inner product space, a set of vectors {ϕ, ϕ 2,...} is orthonoral if { 0 i j ϕ i, ϕ j = i = j. (6) Projection For an orthonoral asis Φ = {ϕ i } of an inner product space V, the expansion of a vector v V over the asis is fairly siple: v = α i ϕ i, with α i = v, ϕ i. (7) i Furtherore, v 2 = i α i 2. More generally, we have a ore general projection theore as follows: Fall 207 National aiwan University Page 3
4 heore 2 (Projection): Consider a suspace S of an inner product space V and an orthonoral asis Φ of S. For any vector v V, there exists an unique v S S such that v v S, s = 0 for all s S. Furtherore, this unique v S is given as v S = i α i ϕ i, with α i = v, ϕ i. (8) Denoting v v S y v S, we can see that any vector v can e decoposed into two orthogonal parts v S and v S, with v S eing the projection of v onto S. 2.3 Signal space point of view Now, let us eploy the linear algeraic point of view to interpret the two exaples of conversion etween sequences and wavefors Fourier Series and Sapling heore. First, we view a wavefor u(t) as a vector v and define the inner product etween two wavefors as u, v u(t)v (t) dt. (9) For Fourier Series, we then identify the coplex sinusoids as the asis (so-called Fourier Basis) and rewrite the Fourier Series expansion as follows: ϕ ϕ (t) exp(j 2π t), Z, (0) x[] = x x(t) = = x(t) e j2π t dt x, ϕ () x[] e j 2π t x[]ϕ. (2) Siilarly for Sapling heore, we identify the uniforly shifted sinc functions as the asis (so-called Sinc Basis) ϕ ϕ (t) sinc( t ), Z, (3) and rewrite Sapling heore as follows: x[] = x(/ ) = {x(t) sinc( t)} t=/ = x, ϕ x x(t) = x(/ ) sinc( t ) = Exercise. = = x[]ϕ (t) (a) Show that the Fourier Basis (0) and the Sinc Basis (3) are orthonoral. () Prove the last two equalities in equation (4). x(t) sinc( t ) dt (4) (5) x[]ϕ. (6) As shown in the Exercise, oth the Fourier Basis and the Sinc Basis are orthonoral ases. Hence, we can otain a linear algeraic interpretation of analysis and sythesis of wavefor signals: Fall 207 National aiwan University Page 4
5 Synthesis can e viewed as expansion over an orthonoral asis: {x[]} {ϕ (t)} x(t) = = Analysis can e viewed as projection onto an orthonoral asis x(t) ϕ (t) x[] = 3 Pulse aplitude odulation (PAM) x[]ϕ (t) (7) x(t)ϕ (t) dt. (8) With the signal space interpretation, we can see that for the conversion etween sequences and wavefors in digital odulation, there are infinitely nuer of ways to select the orthonoral asis {ϕ (t), Z}. On the other hand, a prevalent way in digital counication systes nowadays, is called Pulse Aplitude Modulation (PAM), where the asis consists of uniforly-tie-shifted pulses: ϕ (t) = p(t ), =, (9) where is called the transission interval. = which will e ade clear later. is deterined y the operational andwidth W, 3. PAM odulation pulse shaping PAM odulation follows the synthesis forula elow (using the notation in the syste diagra Fig. ): x (t) = Hence, the aove step is called pulse shaping. he pulse p(t) needs to e chosen carefully. following properties are desirale: = u p(t ). (20) Fro the point of view of the transitter, ideally the (a) ie-liited: p(t) = 0 for all t < τ with soe finite τ > 0. his is ecause each syol u arrives at the odulator at soe finite tie, say τ, so the contriution of u to the transitted wavefor x (t) cannot start until τ, which iplies p(t) = 0 for t < τ. () Band-liited: p(f) = 0 for all f > B. Otherwise, the pulse easily violates physical constraints. Reark. It is ipossile to ake a pulse wavefor p(t) tie-liited and and-liited siultaneously. In practice, frequency-doain constraints are usually ore stringent. Hence, we keep the property of eing and-liited ut replace that of eing tie-liited y eing approxiately tie-liited, that is, p(t) 0 rapidly as t. When we ipleent the pulse, usually the pulse p(t) is truncated, that is, the wave for is set to zero for all t < τ for soe τ 0. his truncation process will introduce additional error and result in noise effectively. Hence, the faster p(t) 0, the less noisy it will e. We use p(f) to denote the Fourier transfor of p(t). Fall 207 National aiwan University Page 5
6 3.2 PAM deodulation filtering + sapling Although for odulation using an orthonoral asis, the optial deodulation is to do projection as discussed in Section 2, in PAM we first filter the received signal y a filter q(t) and then saple the output signal at -spaced saple ties: û = y (τ)q( τ) dτ. (2) Recall that in this lecture, we assue that there is no noise (that is, y (t) = x (t)), and hence the goal of the receiver is to ensure the reconstructed syols û = u,. If this is satisfied, then we say the PAM syste with pulse p(t) and filter q(t) is free of inter-syol interference (ISI), that is, no aliasing effect happens. Since x (t) = u k p(t k ), y the linearity of convolution, we have k= û = (x q)( ) = k= u k g( k ) = k= u k g(( k) )), (22) where g(t) (p q)(t). Hence, a sufficient condition for û = u is { g(k 0 if k 0 ) = if k = 0. (23) Definition 3 (Ideal Nyquist): We say g(t) is ideal Nyquist with interval if the aove condition holds, that is, g(k ) = δ k. In other words, if the pulse p(t) and the filter q(t) are chosen such that g(t) = (p q)(t) is ideal Nyquist with interval, then there is no inter-syol interference (ISI), that is, the recovered û = u when y (t) = x (t). Coined with the desired tie-liited and and-liited properties of p(t), the desired properties for g(t) are suarized as follows: (a) ie-liited: g(t) = 0 for all t < τ with soe finite τ > 0. Recall fro the previous reark, we shall relax this criterion to approxiately tie-liited, that is, g(t) 0 rapidly as t. () Band-liited: ğ(f) = 0 for all f > B. (c) g(t) is ideal Nyquist with interval. 3.3 Nyquist criterion Let us introduce a siple equivalent condition in the frequency doain for checking the property of ideal Nyquist, as stated in the following theore. heore 4 (Nyquist criterion): g(t) is ideal Nyquist with interval if and only if its frequency doain response ğ(f) satisfies the following Nyquist Criterion: rect( f) = ( ğ f ) rect( f), (24) where the function rect(f) { 0 f 2 otherwise. (25) Fall 207 National aiwan University Page 6
7 Proof he proof of this theore is a siple application of the aliasing theore. First, define s(t) ( ) t g( ) sinc. (26) Hence, g(t) is ideal Nyquist s(t) = sinc ( ) t rect( f) = g( )e j2π f rect( f). o coplete the proof, it reains to show the following equality: ( ğ f ) = g( )e j2π f. (27) Oserving that the left-hand side (LHS) of (27) is the convolution of ğ(f) and the frequency doain ipulse train δ(f / ), we see the Inverse Fourier ransfor (IF) of the LHS of (27) is the ultiplication of the IF of ğ(f) and the IF of the ipulse train: ( ) g(t) δ(t ) = g( )δ(t ). (28) On the other hand, the IF of the right-hand side (RHS) of (27) is also equal to (28). Proof is coplete. In Fig. 2, an illustrative exaple of the Nyquist criterion is given. ğ(f + / ) ğ(f) ğ(f / ) f 2 W 2 W Figure 2: Illustration of the Nyquist Criterion (frequency doain) 3.4 Band-edge syetry and excessive andwidth It can een seen fro the illustration in Fig. 2 that the actual andwidth B and the operational andwidth W need to satisfy B W. he reason why the operational andwidth W is usually strictly saller than the actual andwidth B is to allow soother transition in the frequency doain so that the pulse vanishes to zero faster. Hence, the excessive andwidth is defined as B W. On the other hand, we do not want to ake B W too large. A typical choice for the effective andwidth B is to satisfy W B. In this case, one can easily verify the Nyquist Criterion (24) ecoes the following and-edge syetry condition: ğ (W ) + ğ(w + ) =, [0, W ] (29) Fall 207 National aiwan University Page 7
8 which is equivalent to { Re {ğ(w )} + Re {ğ(w + )} = I {ğ(w )} = I {ğ(w + )}, [0, W ] (30) his can e proved y revoking the fact that oth p(t) and q(t) are real-valued, and so does g(t). he proof is left as ani{ exercise. See} the I{ illustration in} Fig. 3. Re{ğ(W ĝ(w ) )} Re{ğ(f)} ĝ(f) f ĝ(w Re{ğ(W + ) + )} 0 W B Figure 3: Illustration of and-edge syetry (odifieded fro Figure 6.3 of []). Exaple 5 (Sinc pulse): he tie-doain and frequency-doain representation of a sinc pulse is given elow: ( ) t g(t) = sinc, (3) he operational andwidth W is equal to the actual andwidth B. ğ(f) = rect(f ). (32) Exaple 6 (Raised cosine pulse): he tie-doain and frequency-doain representation of a raised cosine pulse is given elow ( ) π 4 sinc 2β, if t = 2β g β (t) = sinc ( ) t cos( πβt ) (33), otherwise 4 β2 t 2 2 if f β 2 ğ β (f) = 0 if f > +β (34) 2 cos 2 ( π β 2β ( f 2 )) β +β if 2 < f 2 he excessive andwidth B W = ( + β)w W = βw is paraeterized y β [0, ], called the rolloff factor. he larger it is, the soother it transits fro to 0 in the frequency doain, and hence converges to zero faster in the tie doain. In practice, rolloffs as sharp as 5% to 0% is used. Reark. Engineers often define the rolloff factor as B W. You can easily check that oth the sinc pulse and the raised cosine pulse satisfy the and-edge syetry condition (29). his is left as an exercise. Exercise 2. (a) Prove the and-edge syetry condition (29) for real g(t) when W B. () Check the Fourier transfor of the raised cosine pulse g β (t) in (33) is indeed the ğ β (f) in (34). Fall 207 National aiwan University Page 8
9 (c) Check that the raised cosine pulse satisfy the and-edge syetry condition and hence ideal Nyquist with interval. (d) Show that the sinc pulse converges to 0 as t in the order of /t, while the raised cosine pulse converges to zero in the order of /t Choosing {p(t )} as an orthonoral set Now we have seen the desired properties of g(t) (p q)(t): approxiately tie-liited, and-liited, and ideal Nyquist with interval. Earlier in Section 2, we also deonstrated the effectiveness of using the wavefor expansion over and projection onto an orthonoral asis of a signal space to interpret the conversion etween sequences and wavefors. What reains in this section, is to show that for the -space shifted pulses {p(t )}, it fors an orthonoral asis if and only if p(f) 2 satisfy the Nyquist criterion. Let us egin with soe siple oservations. Since ğ(f) = p(f) q(f), we can siply choose p(f) = q(f) = ğ(f). With this choice, we have the following nice theore relating ISI-free condition and orthogonality: heore 7: Suppose ğ(f) = p(f) 2 and satisfies the Nyquist Criterion with interval. hen, {p(t ) : Z} for an orthonoral set. Conversely, if {p(t ) : Z} for an orthonoral set, then p(f) 2 satisfies the Nyquist Criterion. Proof o ake ğ(f) = p(f) 2, we need to choose q(f) = p (f) q(t) = p ( t). Plugging in g(t) = (p q)(t), we get g(k ) = p(t)p ( k + t) dt = If g(t) is ideal Nyquist with interval, then we can conclude that p(t ), p(t n ) = p(t )p (t n ) dt = p(t)p (t k ) dt. (35) p(τ)p (τ (n ) ) dτ = { n = 0 n. (36) Conversely, if {p(t )} for an orthonoral set, we can show that g(k ) = if and only if k = 0 using a siilar calculation. Proof coplete. Suary o su up, for PAM odulation and deodulation, the following principles are usually used for the design of the pulse p(t) at the transitter and the corresponding filter q(t) at the receiver: (a) p(f) = q (f) (phase offset) () p(f) 2 satisfies the Nyquist Criterion (c) If p(t) R (which is norally the case), then q(f) = p (f) = p( f) and hence q(t) = p( t). (d) For faster decay in the tie-doain (less approxiation error) in t = need larger roo for soother transition fro to 0 in the frequency doain. Exercise 3. Ipleent and siulate a PAM odulator/deodulator for the ideal aseand channel y (t) = x (t) using raised cosine pulses in your coputer. Fall 207 National aiwan University Page 9
10 4 Quadrature aplitude odulation (QAM) 4. QAM odulation In any counication systes, the transitted signals have to oey certain constraints in the frequency doain and can only occupy a certain passand frequency and. Hence, at the transitter it is necessary to convert the aseand signal to a passand signal. In this course, we introduce a widely used approach called quadrature aplitude odulation (QAM), which is essentially a coination of two individual ranches of PAM wavefors, say, x (I) (t) and x (Q) (t). One ranch is ixed with a cosine wavefor with center frequency f c, while the other is ixed with a sine wavefor with the sae center frequency: By defining a coplex aseand wavefor x(t) = x (I) (t) 2 cos(2πf c t) x (Q) (t) 2 sin(2πf c t) (37) we have an equivalent representation for the passand signal: x (t) x (I) (t) + jx (Q) (t), (38) x(t) = 2Re {x (t) exp(j2πf c t)}. (39) Conventionally, x (I) (t) and x (Q) (t) are called the in-phase part and the quadrature part of the coplex asedand wavefor x (t). Recall that oth x (I) (t) and x (Q) (t) are PAM wavefors: and hence the coplex asedand wavefor x (I) (t) = x (Q) (t) = u (I) p(t ) (40) u (Q) p(t ) (4) x (t) = u p(t ), (42) where u u (I) + ju (Q) C is a coplex syol. In words, the QAM odulation can e viewed purely in the coplex doain and the equivalent realdoain ipleentation, as illustrated in Fig. 4. he ixing with the coplex sinusoid 2 exp(j2πf c t) (or the ixing with the cosine/sine wavefors in the real-doain ipleentation) is called up-conversion. 4.2 QAM deodulation As for the QAM deodulation, one should split the received signal y(t) into two ranches. One ranch ais to reconstruct the in-phase syol sequence, while the other ais to reconstruct the quadrature part. For the in-phase part, the received signal is first ultiplied y the cosine wavefor 2 cos(2πf c t), low-pass filtered with one-sided andwidth B, filtered y q(t), and then uniforly sapled with interval. For the quadrature part, the received signal is first ultiplied y the sine wavefor 2 sin(2πf c t), low-pass filtered with one-sided andwidth B, filtered y q(t), and then uniforly sapled with interval. he ixing of the passand signal with cosine and the sine wavefors followed y low-pass filtering with one-sided andwidth B is called down-conversion. Note that the concatenation of the low-pass filter rect( f 2B ) and the PAM deodulation filter q(f) is always equal to q(f). Hence, these two locks can e erged into one. See Fig. 5 for an illustration. Fall 207 National aiwan University Page 0
11 I-Hsiang Wang Principle of Counications Lecture 02 2 cos(2 fc t) {u(i) } PAM p(t) (I) x (t) 2 sin(2 fc t) {u(q) } PAM p(t) x(t) (Q) x (t) (a) Real-doain ipleentation 2 exp(j2 fc t) {u } PAM p(t) x (t) Re{ } x(t) () Equivalent coplex aseand odel Figure 4: QAM odulation: PAM odulations + up-conversion Fall 207 National aiwan University Page
12 I-Hsiang Wang Principle of Counications Lecture 02 2 cos(2 fc t) = (I) y (t) LPF { f B } Filter q(t) {u (I) } 2 sin(2 fc t) y(t) = (Q) y (t) LPF { f B } Filter q(t) {u (Q) } (a) Real-doain ipleentation 2 exp( j2 fc t) = Step Filter {f 0} y(t) Filter q(t) y (t) {u } () Equivalent coplex-doain ipleentation 2 cos(2 fc t) = Filter q(t) y(t) {u (I) } 2 sin(2 fc t) = Filter q(t) {u (Q) } (c) Siplified ipleentation Figure 5: QAM deodulation: down-conversion + PAM deodulations Fall 207 National aiwan University Page 2
13 Exercise 4. Show that in the equivalent coplex-doain ipleentation of QAM deodulation in Fig. 5(), the coplex aseand signal y (t) is indeed equal to 4.3 Frequency-doain illustration y (I) (t) + jy (Q) (t). (43) In the slides, we use a series of pictures to illustration the idea of up conversion and down conversion via a frequency-doain approach. It is useful to recall the following properties of a signal s(t) and its Fourier F transfor s(f): for the pair s(t) s(f), Shift: s(t t 0 ) Reversal: s( t) Conjugate: s (t) F F exp( j2πt 0 f) s(f); s(f f 0 ) exp(j2πf 0 t)s(t). F s( f). F s ( f); s F (f) s ( t). For s(t) R, s(f) = s ( f), that is, Re{ s(f)} = Re{ s( f)} I{ s(f)} = I{ s( f)} s(f) = s( f) s(f) = s( f) od 2π (44) aking the real part: Re{s(t)} F 2 ( s(f) + s ( f)). 4.4 Orthonoral asis expansion of passand wavefors Effectively, the transitted passand signal in (37) can e further expanded as follows: x(t) = u (I) p(t ) 2 cos(2πf c t) k u (Q) k p(t k ) 2 sin(2πf c t). (45) When {p(t ) : Z} is chosen to e an orthonoral set, let us identify p(t ) ϕ (t) p(t ) 2 cos(2πf c t) ψ (I) (t) p(t ) 2 sin(2πf c t) ψ (Q) (t), (46) and rewrite x(t) = u (I) ψ (I) (t) + u (Q) ψ (Q) (t). (47) he following theore tells us that the aove (47) is also an expansion over an orthonoral set. heore 8: Consider an orthonoral set of wavefors {ϕ (t) : Z}. Assue the Fourier transfor exists for each ϕ (t) and is and-liited, that is, ϕ (f) = 0, f > B. (48) hen for a center frequency f c > B, {ψ (I) (t), ψ (Q) (t) Z} also for an orthonoral set, where ψ (I) (t) ϕ (t) 2 cos(2πf c t), ψ (Q) (t) ϕ (t) 2 sin(2πf c t). (49) Fall 207 National aiwan University Page 3
14 Proof Proof is left as an exercise (see Hoework ). One property that you ight find useful for the proof is the Plancherel theore stated elow: for two (finite-energy) wavefors u(t) and v(t) with Fourier transfors ŭ(f) and v(f) respectively, u(t)v (t) dt = 5 Design of constellation set and syol apping ŭ(f) v (f) df. (50) So far, we have een focusing on the last two layers of digital odulation, naely, conversion of sequences to aseand wavefors, and conversion fro aseand to passand. With QAM, it is now clear that the syols to e transitted can e conveniently represented y coplex nuers, that is, u C. In this last section, we address the question regarding how to convert a sequence of coded its {c i } to a sequence of coplex syols {u }. A standard way to do this is to group a fixed nuer (say l) of its and ap the to a corresponding syol elonging to a finite alphaet A with cardinality A = M 2 l : (c, c 2,..., c l ) u A {a, a 2,..., a M } C {0, } l (5) he jargon in digital counications for the syol alphaet A is constellation set, and its eleent is usually called a constellation point. he constellation set A = {a, a 2,..., a M } is a suset of M = 2 l constellation points in the coplex plane. he ain design question is, how to put these M points on the coplex plane. It turns out the design largely deterines the perforance of deodulation when noise is present, that is, the channel is not perfect anyore. How to do deodulation in the presence of noise, called detection, will e discussed in the next lecture. For this lecture, we introduce several coon constellation sets, along with a popular apping rule called Gray apping. 5. Constellation sets We introduce two failies of constellation sets: standard PAM/QAM constellation sets, and phase-shiftkeying (PSK) constellation sets. (a) he M = 2 l -ary standard PAM constellation set consists of uniforly spaced points on the real line and takes the following for: { } A PAM,2 l ±d, ±3d,..., ±(2 l )d, (52) where 2d is the iniu distance and deterines the average transit energy of the constellation set, which we discuss in ore details later in this section. () he M = 2 2l -ary standard QAM constellation set is siply the direct product of two 2 l -ary standard PAM constellation sets, which takes the following for: { } A QAM,2 2l a (I) + ja (Q) a (I), a (Q) A PAM,2 l. (53) (c) he M-ary PSK constellation set consists of angularly uniforly spaced points on a sphere in the coplex plane and takes the following for: { ( A PSK,M d exp j 2π ) M k k = 0,,..., M }. (54) See Fig. 6 and 7 for the illustration of these constellation sets. Fall 207 National aiwan University Page 4
15 gray 0 nongray gray d d 3d d d 3d (a) 2-PAM () 4-PAM Figure 6: Standard PAM constellation sets d( + j) 0 00 d 2 ( + j) d( j) (a) 6-QAM () 8-PSK Figure 7: Standard QAM and PSK constellation sets Fall 207 National aiwan University Page 5
16 5.2 Syol apping Definition 9 (Gray Mapping): Gray apping assigns the 2 l possile coinations of ordered l its to constellation points in a way such that there is only one-it difference etween nearest neighoring points. In Fig. 6(), one can see the coparison etween a Gray apping and a non-gray (natural) apping. Gray apping has the enefit of saller axial it error proaility when the channel is suject to noise. his will e ade clear in the next lecture. 5.3 Design principles It is quite ovious that the larger M is, the faster the it streas can e delivered (rate is higher). However, in the following, we will see that for a given constellation set, the transit power of the passand wavefor is deterined y the distance paraeter d. On the other hand, as we intuitively argue elow (and ade ore rigorous in the next lecture), the capaility to coat noise also depends on d. Hence, under a given power and reliaility constraint, the rate cannot e too large. Finding the optial tradeoff will e the suject of Lecture 04: reliale counications. In the following we view wavefor as vectors in the signal space. As entioned in Section 4.4, the passand wavefors can also e expanded over an orthonoral set. Hence, for a passand wavefor x(t) x = x[]ϕ, (55) its total energy is x(t) 2 dt = x 2 = where the last inequality is due to the projection theore. x[] 2. (56) Now, suppose in the total nuer of syols sent out is K. Let all the constellation points are sent with equal chance. As K tends to infinity, the average energy per syol ecoes E s li x[] 2 [ = E K K U Unif{A} U 2 ] alost surely. (57) In Hoework, you are asked to derive E s for standard PAM and QAM constellations. What you will see is that E s depends on the nuer of constellation points M and the iniu distance d in etween constellation points. Under a fixed power constraint, on one hand increasing d in can give etter protection to the syste under noise. On the other hand, to transit at a higher rate, decreasing d in can increase M and hence pack ore its into one syol. Such a rate-reliaility tradeoff will e ade clear and foral in Lecture 03. References [] R. G. Gallager, Principles of Digital Counication. Caridge University Press, Fall 207 National aiwan University Page 6
I-Hsiang Wang Principles of Communications Lecture 02
Lecture 02: Digital Modulation Outline Digital-to-analog and analog-to-digital: a signal space perspective Pulse aplitude odulation (PAM), pulse shaping, and the Nyquist criterion Quadrature aplitude odulation
More informationFourier Series Summary (From Salivahanan et al, 2002)
Fourier Series Suary (Fro Salivahanan et al, ) A periodic continuous signal f(t), - < t
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationExample: Bipolar NRZ (non-return-to-zero) signaling
Baseand Data Transmission Data are sent without using a carrier signal Example: Bipolar NRZ (non-return-to-zero signaling is represented y is represented y T A -A T : it duration is represented y BT. Passand
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search
Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths
More informationRepresentation of Band-pass Signal
EGR 544 Counication heory 5. Representation of Diitally Modulated Sinals Z. Aliyaziciolu Electrical and Coputer Enineerin Departent Cal Poly Poona Suary Representation of Band-pass Sinal Band-pass sinal
More information1 Bounding the Margin
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost
More informationMulti-Scale/Multi-Resolution: Wavelet Transform
Multi-Scale/Multi-Resolution: Wavelet Transfor Proble with Fourier Fourier analysis -- breaks down a signal into constituent sinusoids of different frequencies. A serious drawback in transforing to the
More informationReversibility of Turing Machine Computations
Reversiility of Turing Machine Coputations Zvi M. Kede NYU CS Technical Report TR-2013-956 May 13, 2013 Astract Since Bennett s 1973 seinal paper, there has een a growing interest in general-purpose, reversile
More informationChaotic Coupled Map Lattices
Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each
More information. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe
PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal
More informationEQUIVALENT CIRCUIT MODEL OF SEMICONDUCTOR LASERS TAKING ACCOUNT OF GAIN SUPPRESSION
EQUIVALENT CIRCUIT MODEL OF SEMICONDUCTOR LASERS TAKING ACCOUNT OF GAIN SUPPRESSION Kaiz Aedi and Mohsen Khanzadeh Departent of Electrical Engineering, Faculty of Electrical and Coputer Engineering, Shahid
More informationNuclear Instruments and Methods in Physics Research B 262 (2007)
Nuclear Instruents and Methods in Physics Research B 262 (27) 33 322 NIM B Bea Interactions with Materials & Atos www.elsevier.co/locate/ni Peak shape ethods for general order theroluinescence glow-peaks:
More informationSimple procedures for finding mean first passage times in Markov chains
Res. Lett. Inf. Math. Sci., 2005, Vol. 8, pp 209-226 209 Availale online at http://iis.assey.ac.nz/research/letters/ Siple procedures for finding ean first passage ties in Markov chains JEFFREY J. HUNER
More informationOutline. Digital Communications. Lecture 12 Performance over Fading Channels and Diversity Techniques. Flat-Flat Fading. Intuition
Digital Counications Lecture 2 Perforance over Fading Channels and Diversity Techniques Pierluigi SALVO ROSSI Outline Noncoherent/Coherent Detection 2 Channel Estiation Departent of Industrial and Inforation
More informationOptimal Jamming Over Additive Noise: Vector Source-Channel Case
Fifty-first Annual Allerton Conference Allerton House, UIUC, Illinois, USA October 2-3, 2013 Optial Jaing Over Additive Noise: Vector Source-Channel Case Erah Akyol and Kenneth Rose Abstract This paper
More informationlecture 36: Linear Multistep Mehods: Zero Stability
95 lecture 36: Linear Multistep Mehods: Zero Stability 5.6 Linear ultistep ethods: zero stability Does consistency iply convergence for linear ultistep ethods? This is always the case for one-step ethods,
More information3.8 Three Types of Convergence
3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to
More informationA Simple Regression Problem
A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where
More informationLecture 8.2 Fluids For a long time now we have been talking about classical mechanics, part of physics which studies macroscopic motion of
Lecture 8 luids or a long tie now we have een talking aout classical echanics part of physics which studies acroscopic otion of particle-like ojects or rigid odies Using different ethods we have considered
More informationPERIODIC STEADY STATE ANALYSIS, EFFECTIVE VALUE,
PERIODIC SEADY SAE ANALYSIS, EFFECIVE VALUE, DISORSION FACOR, POWER OF PERIODIC CURRENS t + Effective value of current (general definition) IRMS i () t dt Root Mean Square, in Czech boo denoted I he value
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationPhysics 215 Winter The Density Matrix
Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it
More informationSquare Root Raised Cosine Filter
Wireless Information Transmission System Lab. Square Root Raised Cosine Filter Institute of Communications Engineering National Sun Yat-sen University Introduction We consider the problem of signal design
More informationFast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials
Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter
More information13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationN-Point. DFTs of Two Length-N Real Sequences
Coputation of the DFT of In ost practical applications, sequences of interest are real In such cases, the syetry properties of the DFT given in Table 5. can be exploited to ake the DFT coputations ore
More informationAn Approximate Model for the Theoretical Prediction of the Velocity Increase in the Intermediate Ballistics Period
An Approxiate Model for the Theoretical Prediction of the Velocity... 77 Central European Journal of Energetic Materials, 205, 2(), 77-88 ISSN 2353-843 An Approxiate Model for the Theoretical Prediction
More informationIN modern society that various systems have become more
Developent of Reliability Function in -Coponent Standby Redundant Syste with Priority Based on Maxiu Entropy Principle Ryosuke Hirata, Ikuo Arizono, Ryosuke Toohiro, Satoshi Oigawa, and Yasuhiko Takeoto
More information26 Impulse and Momentum
6 Ipulse and Moentu First, a Few More Words on Work and Energy, for Coparison Purposes Iagine a gigantic air hockey table with a whole bunch of pucks of various asses, none of which experiences any friction
More informationA New Algorithm for Reactive Electric Power Measurement
A. Abiyev, GAU J. Soc. & Appl. Sci., 2(4), 7-25, 27 A ew Algorith for Reactive Electric Power Measureent Adalet Abiyev Girne Aerican University, Departernt of Electrical Electronics Engineering, Mersin,
More informationKernel Methods and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic
More informationProbability Distributions
Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples
More information2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all
Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either
More informationANALYSIS OF HALL-EFFECT THRUSTERS AND ION ENGINES FOR EARTH-TO-MOON TRANSFER
IEPC 003-0034 ANALYSIS OF HALL-EFFECT THRUSTERS AND ION ENGINES FOR EARTH-TO-MOON TRANSFER A. Bober, M. Guelan Asher Space Research Institute, Technion-Israel Institute of Technology, 3000 Haifa, Israel
More informationBit Error Probability of M-ary Phase Shift Keying with MRC Receive Diversity over Nakagami-m Fading Channel
7th nternational Syposiu on age and and Analysis (SPA ) Septeer 4-6,, Durovnik, Croatia Bit Error Proaility of M-ary Phase Shift Keying with MRC Receive Diversity over Nakagai- Fading Channel Vepati Srinivasa
More informationPrinciples of Optimal Control Spring 2008
MIT OpenCourseWare http://ocw.it.edu 16.323 Principles of Optial Control Spring 2008 For inforation about citing these aterials or our Ters of Use, visit: http://ocw.it.edu/ters. 16.323 Lecture 10 Singular
More informationOcean 420 Physical Processes in the Ocean Project 1: Hydrostatic Balance, Advection and Diffusion Answers
Ocean 40 Physical Processes in the Ocean Project 1: Hydrostatic Balance, Advection and Diffusion Answers 1. Hydrostatic Balance a) Set all of the levels on one of the coluns to the lowest possible density.
More informationEquational Security Proofs of Oblivious Transfer Protocols
Equational Security Proofs of Olivious Transfer Protocols Baiyu Li Daniele Micciancio January 9, 2018 Astract We exeplify and evaluate the use of the equational fraework of Micciancio and Tessaro (ITCS
More informationCh 12: Variations on Backpropagation
Ch 2: Variations on Backpropagation The basic backpropagation algorith is too slow for ost practical applications. It ay take days or weeks of coputer tie. We deonstrate why the backpropagation algorith
More information1 Generalization bounds based on Rademacher complexity
COS 5: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #0 Scribe: Suqi Liu March 07, 08 Last tie we started proving this very general result about how quickly the epirical average converges
More informationSharp Time Data Tradeoffs for Linear Inverse Problems
Sharp Tie Data Tradeoffs for Linear Inverse Probles Saet Oyak Benjain Recht Mahdi Soltanolkotabi January 016 Abstract In this paper we characterize sharp tie-data tradeoffs for optiization probles used
More informationOn Constant Power Water-filling
On Constant Power Water-filling Wei Yu and John M. Cioffi Electrical Engineering Departent Stanford University, Stanford, CA94305, U.S.A. eails: {weiyu,cioffi}@stanford.edu Abstract This paper derives
More informationOn Conditions for Linearity of Optimal Estimation
On Conditions for Linearity of Optial Estiation Erah Akyol, Kuar Viswanatha and Kenneth Rose {eakyol, kuar, rose}@ece.ucsb.edu Departent of Electrical and Coputer Engineering University of California at
More informationBUCKLING OF WING SPARS UNDER COMBINED LOADING
5 TH INTERNATIONAL CONGRESS OF THE AERONAUTICAL SCIENCES BUCLING OF WING SPARS UNDER COMBINED LOADING David ennedy*, Dharesh C. Patel*, Carol A. Featherston* *Cardiff School of Engineering, Cardiff University,
More information1 Rademacher Complexity Bounds
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #10 Scribe: Max Goer March 07, 2013 1 Radeacher Coplexity Bounds Recall the following theore fro last lecture: Theore 1. With probability
More informationCOS 424: Interacting with Data. Written Exercises
COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well
More informationFigure 1: Equivalent electric (RC) circuit of a neurons membrane
Exercise: Leaky integrate and fire odel of neural spike generation This exercise investigates a siplified odel of how neurons spike in response to current inputs, one of the ost fundaental properties of
More informationThe Transactional Nature of Quantum Information
The Transactional Nature of Quantu Inforation Subhash Kak Departent of Coputer Science Oklahoa State University Stillwater, OK 7478 ABSTRACT Inforation, in its counications sense, is a transactional property.
More information3D acoustic wave modeling with a time-space domain dispersion-relation-based Finite-difference scheme
P-8 3D acoustic wave odeling with a tie-space doain dispersion-relation-based Finite-difference schee Yang Liu * and rinal K. Sen State Key Laboratory of Petroleu Resource and Prospecting (China University
More informationUnderstanding Machine Learning Solution Manual
Understanding Machine Learning Solution Manual Written by Alon Gonen Edited by Dana Rubinstein Noveber 17, 2014 2 Gentle Start 1. Given S = ((x i, y i )), define the ultivariate polynoial p S (x) = i []:y
More informationPhysics 139B Solutions to Homework Set 3 Fall 2009
Physics 139B Solutions to Hoework Set 3 Fall 009 1. Consider a particle of ass attached to a rigid assless rod of fixed length R whose other end is fixed at the origin. The rod is free to rotate about
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationInspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information
Cite as: Straub D. (2014). Value of inforation analysis with structural reliability ethods. Structural Safety, 49: 75-86. Value of Inforation Analysis with Structural Reliability Methods Daniel Straub
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2016/2017 Lessons 9 11 Jan 2017 Outline Artificial Neural networks Notation...2 Convolutional Neural Networks...3
More informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course Notes for EE227C (Spring 2018): Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee227c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee227c@berkeley.edu October
More informationEfficient Filter Banks And Interpolators
Efficient Filter Banks And Interpolators A. G. DEMPSTER AND N. P. MURPHY Departent of Electronic Systes University of Westinster 115 New Cavendish St, London W1M 8JS United Kingdo Abstract: - Graphical
More informationSolutions of some selected problems of Homework 4
Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next
More informationDesign of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding
IEEE TRANSACTIONS ON INFORMATION THEORY (SUBMITTED PAPER) 1 Design of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding Lai Wei, Student Meber, IEEE, David G. M. Mitchell, Meber, IEEE, Thoas
More informationE0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis
E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationLecture 16: Scattering States and the Step Potential. 1 The Step Potential 1. 4 Wavepackets in the step potential 6
Lecture 16: Scattering States and the Step Potential B. Zwiebach April 19, 2016 Contents 1 The Step Potential 1 2 Step Potential with E>V 0 2 3 Step Potential with E
More informationUsing EM To Estimate A Probablity Density With A Mixture Of Gaussians
Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points
More informationConvolutional Codes. Lecture Notes 8: Trellis Codes. Example: K=3,M=2, rate 1/2 code. Figure 95: Convolutional Encoder
Convolutional Codes Lecture Notes 8: Trellis Codes In this lecture we discuss construction of signals via a trellis. That is, signals are constructed by labeling the branches of an infinite trellis with
More informationChapter 10: Sinusoidal Steady-State Analysis
Chapter 0: Sinusoidal Steady-State Analysis Sinusoidal Sources If a circuit is driven by a sinusoidal source, after 5 tie constants, the circuit reaches a steady-state (reeber the RC lab with t = τ). Consequently,
More informationEE5900 Spring Lecture 4 IC interconnect modeling methods Zhuo Feng
EE59 Spring Parallel LSI AD Algoriths Lecture I interconnect odeling ethods Zhuo Feng. Z. Feng MTU EE59 So far we ve considered only tie doain analyses We ll soon see that it is soeties preferable to odel
More informationUsing a De-Convolution Window for Operating Modal Analysis
Using a De-Convolution Window for Operating Modal Analysis Brian Schwarz Vibrant Technology, Inc. Scotts Valley, CA Mark Richardson Vibrant Technology, Inc. Scotts Valley, CA Abstract Operating Modal Analysis
More informationFixed-to-Variable Length Distribution Matching
Fixed-to-Variable Length Distribution Matching Rana Ali Ajad and Georg Böcherer Institute for Counications Engineering Technische Universität München, Gerany Eail: raa2463@gail.co,georg.boecherer@tu.de
More informationdt dt THE AIR TRACK (II)
THE AIR TRACK (II) References: [] The Air Track (I) - First Year Physics Laoratory Manual (PHY38Y and PHYY) [] Berkeley Physics Laoratory, nd edition, McGraw-Hill Book Copany [3] E. Hecht: Physics: Calculus,
More informationi ij j ( ) sin cos x y z x x x interchangeably.)
Tensor Operators Michael Fowler,2/3/12 Introduction: Cartesian Vectors and Tensors Physics is full of vectors: x, L, S and so on Classically, a (three-diensional) vector is defined by its properties under
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationSelfish Traffic Allocation for Server Farms
Selfish Traffic Allocation for Server Fars Artur Czua Departent of Coputer Science New Jersey Institute of Technology czua@cis.nit.edu Piotr Krysta Max-Planck-Institut für Inforatik Saarrücken, Gerany
More informationA Quantum Observable for the Graph Isomorphism Problem
A Quantu Observable for the Graph Isoorphis Proble Mark Ettinger Los Alaos National Laboratory Peter Høyer BRICS Abstract Suppose we are given two graphs on n vertices. We define an observable in the Hilbert
More informationTesting Properties of Collections of Distributions
Testing Properties of Collections of Distributions Reut Levi Dana Ron Ronitt Rubinfeld April 9, 0 Abstract We propose a fraework for studying property testing of collections of distributions, where the
More information(a) As a reminder, the classical definition of angular momentum is: l = r p
PHYSICS T8: Standard Model Midter Exa Solution Key (216) 1. [2 points] Short Answer ( points each) (a) As a reinder, the classical definition of angular oentu is: l r p Based on this, what are the units
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lessons 7 20 Dec 2017 Outline Artificial Neural networks Notation...2 Introduction...3 Key Equations... 3 Artificial
More informationA Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay
A Low-Coplexity Congestion Control and Scheduling Algorith for Multihop Wireless Networks with Order-Optial Per-Flow Delay Po-Kai Huang, Xiaojun Lin, and Chih-Chun Wang School of Electrical and Coputer
More informationRECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS MEMBRANE
Proceedings of ICIPE rd International Conference on Inverse Probles in Engineering: Theory and Practice June -8, 999, Port Ludlow, Washington, USA : RECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS
More informationCHAPTER 19: Single-Loop IMC Control
When I coplete this chapter, I want to be able to do the following. Recognize that other feedback algoriths are possible Understand the IMC structure and how it provides the essential control features
More informationarxiv: v1 [cs.ds] 17 Mar 2016
Tight Bounds for Single-Pass Streaing Coplexity of the Set Cover Proble Sepehr Assadi Sanjeev Khanna Yang Li Abstract arxiv:1603.05715v1 [cs.ds] 17 Mar 2016 We resolve the space coplexity of single-pass
More informationMath 1600A Lecture 3, Section 002
Math 1600 Lecture 3 1 of 5 Math 1600A Lecture 3, Section 002 Announceents: More texts, solutions anuals and packages coing soon. Read Section 1.3 for next class. Work through recoended hoework questions.
More informationIntelligent Systems: Reasoning and Recognition. Artificial Neural Networks
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley MOSIG M1 Winter Seester 2018 Lesson 7 1 March 2018 Outline Artificial Neural Networks Notation...2 Introduction...3 Key Equations... 3 Artificial
More informationECS455: Chapter 5 OFDM
ECS455: Chapter 5 OFDM 5.4 Cyclic Prefix (CP) 1 Dr.Prapun Suksopong prapun.co/ecs455 Office Hours: BKD 3601-7 Tuesday 9:30-10:30 Friday 14:00-16:00 Three steps towards odern OFDM 1. Mitigate Multipath
More informationDetermination of Relaxation and Retardation Spectrum from Modulus of Complex Frequency-Domain Material functions
Deterination of Relaxation and Retardation Spectru fro Modulus of Coplex Frequency-Doain Material functions VAIRIS SHTRAUSS, ALDIS KALPINSH Institute of Polyer Mechanics University of Latvia 3 Aizkraukles
More informationSupport Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization
Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering
More informationHandout 7. and Pr [M(x) = χ L (x) M(x) =? ] = 1.
Notes on Coplexity Theory Last updated: October, 2005 Jonathan Katz Handout 7 1 More on Randoized Coplexity Classes Reinder: so far we have seen RP,coRP, and BPP. We introduce two ore tie-bounded randoized
More informationSummary: ISI. No ISI condition in time. II Nyquist theorem. Ideal low pass filter. Raised cosine filters. TX filters
UORIAL ON DIGIAL MODULAIONS Part 7: Intersymbol interference [last modified: 200--23] Roberto Garello, Politecnico di orino Free download at: www.tlc.polito.it/garello (personal use only) Part 7: Intersymbol
More informationLecture #8-3 Oscillations, Simple Harmonic Motion
Lecture #8-3 Oscillations Siple Haronic Motion So far we have considered two basic types of otion: translation and rotation. But these are not the only two types of otion we can observe in every day life.
More informationPower Spectral Density of Digital Modulation Schemes
Digital Communication, Continuation Course Power Spectral Density of Digital Modulation Schemes Mikael Olofsson Emil Björnson Department of Electrical Engineering ISY) Linköping University, SE-581 83 Linköping,
More informationNow multiply the left-hand-side by ω and the right-hand side by dδ/dt (recall ω= dδ/dt) to get:
Equal Area Criterion.0 Developent of equal area criterion As in previous notes, all powers are in per-unit. I want to show you the equal area criterion a little differently than the book does it. Let s
More informationG G G G G. Spec k G. G Spec k G G. G G m G. G Spec k. Spec k
12 VICTORIA HOSKINS 3. Algebraic group actions and quotients In this section we consider group actions on algebraic varieties and also describe what type of quotients we would like to have for such group
More informationA DISCRETE ZAK TRANSFORM. Christopher Heil. The MITRE Corporation McLean, Virginia Technical Report MTR-89W00128.
A DISCRETE ZAK TRANSFORM Christopher Heil The MITRE Corporation McLean, Virginia 22102 Technical Report MTR-89W00128 August 1989 Abstract. A discrete version of the Zak transfor is defined and used to
More informationIntroduction to Machine Learning. Recitation 11
Introduction to Machine Learning Lecturer: Regev Schweiger Recitation Fall Seester Scribe: Regev Schweiger. Kernel Ridge Regression We now take on the task of kernel-izing ridge regression. Let x,...,
More informationBirthday Paradox Calculations and Approximation
Birthday Paradox Calculations and Approxiation Joshua E. Hill InfoGard Laboratories -March- v. Birthday Proble In the birthday proble, we have a group of n randoly selected people. If we assue that birthdays
More informationA Study on B-Spline Wavelets and Wavelet Packets
Applied Matheatics 4 5 3-3 Published Online Noveber 4 in SciRes. http://www.scirp.org/ournal/a http://dx.doi.org/.436/a.4.5987 A Study on B-Spline Wavelets and Wavelet Pacets Sana Khan Mohaad Kaliuddin
More informationUSEFUL HINTS FOR SOLVING PHYSICS OLYMPIAD PROBLEMS. By: Ian Blokland, Augustana Campus, University of Alberta
1 USEFUL HINTS FOR SOLVING PHYSICS OLYMPIAD PROBLEMS By: Ian Bloland, Augustana Capus, University of Alberta For: Physics Olypiad Weeend, April 6, 008, UofA Introduction: Physicists often attept to solve
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationPHYSICS 110A : CLASSICAL MECHANICS MIDTERM EXAM #2
PHYSICS 110A : CLASSICAL MECHANICS MIDTERM EXAM #2 [1] Two blocks connected by a spring of spring constant k are free to slide frictionlessly along a horizontal surface, as shown in Fig. 1. The unstretched
More informationFairness via priority scheduling
Fairness via priority scheduling Veeraruna Kavitha, N Heachandra and Debayan Das IEOR, IIT Bobay, Mubai, 400076, India vavitha,nh,debayan}@iitbacin Abstract In the context of ulti-agent resource allocation
More information