Fading Channels: Capacity, BER and Diversity
|
|
- Shana Hutchinson
- 5 years ago
- Views:
Transcription
1 Fading Channel: Capacity, BER and Diverity Mater Univeritario en Ingeniería de Telecomunicación I. Santamaría Univeridad de Cantabria
2 Introduction Capacity BER Diverity Concluion Content Introduction Capacity BER Diverity Concluion Fading Channel: Capacity, BER and Diverity 0/50
3 Introduction Capacity BER Diverity Concluion Introduction We have een that the randomne of ignal attenuation (fading) i the main challenge of wirele communication ytem In thi lecture, we will dicu how fading affect 1. The capacity of the channel 2. The Bit Error Rate (BER) We will alo tudy how thi channel randomne can be ued or exploited to improve performance diverity Fading Channel: Capacity, BER and Diverity 1/50
4 Introduction Capacity BER Diverity Concluion General communication ytem model Source Channel Encoder b[n] Modulator [n] Channel ˆ [ n] Demod. Channel Decoder b ˆ[ n ] Noie The channel encoder (FEC, convolutional, turbo, LDPC...) add redundancy to protect the ource againt error introduced by the channel The capacity depend on the fading model of the channel (contant channel, ergodic/block fading), a well a on the channel tate information (CSI) available at the Tx/Rx Let u tart reviewing the Additive White Gauian Noie (AWGN) channel: no fading Fading Channel: Capacity, BER and Diverity 2/50
5 Introduction Capacity BER Diverity Concluion AWGN Channel Let u conider a dicrete-time AWGN channel y[n] = h[n] + r[n] where r[n] i the additive white Gauian noie, [n] i the tranmitted ignal and h = h e jθ i the complex channel The channel i aumed contant during the reception of the whole tranmitted equence The channel i known to the Rx (coherent detector) The noie i white and Gauian with power pectral denity N 0 /2 (with unit W/Hz or dbm/hz, for intance) We will mainly conider paband modulation (BPSK, QPSK, M-PSK, M-QAM), for which if the bandwith of the lowpa ignal i W the bandwidth of the paband ignal i 2W Fading Channel: Capacity, BER and Diverity 3/50
6 Introduction Capacity BER Diverity Concluion Signal-to-Noie-Ratio Tranmitted ignal power: P Received ignal power: P h 2 Total noie power: N = 2WN 0 /2 = WN 0 The received SNR i SNR = γ = P WN 0 h 2 In term of the energy per ymbol P = E /T We aume Nyquit pule with β = 1 (roll-off factor) o W = 1/T Under thee condition SNR = E T T N 0 h 2 = E N 0 h 2 Fading Channel: Capacity, BER and Diverity 4/50
7 Introduction Capacity BER Diverity Concluion For M-ary modulation, the energy per bit i E b = E log(m) SNR = E b N 0 log(m) h 2 To model the noie we generate zero-mean circular complex Gauian random variable with σ 2 = WN 0 r[n] CN(0, σ 2 ) or r[n] CN(0, WN 0 ) The real and imaginary part have variance σi 2 = σq 2 = σ2 2 = WN 0 2 Fading Channel: Capacity, BER and Diverity 5/50
8 Introduction Capacity BER Diverity Concluion Capacity AWGN Channel Let u conider a dicrete-time AWGN channel y[n] = h[n] + r[n] where r[n] i the additive white Gauian noie, [n] i the tranmitted ymbol and h = h e jθ i the complex channel The channel i aumed contant during the reception of the whole tranmitted equence The channel i known to the Rx (coherent detector) The capacity (in bit/eg or bp) i given by the well-known Shannon formula C = W log (1 + SNR) = W log (1 + γ) where W i the channel bandwidth, and SNR = P h 2 WN 0 ; with P being the tranmit power, h 2 the power channel gain and N 0 /2 the power pectral denity (PSD) of the noie Fading Channel: Capacity, BER and Diverity 6/50
9 Introduction Capacity BER Diverity Concluion Sometime, we will find ueful to expre C in bp/hz (or bit/channel ue) C = log (1 + SNR) A few thing to recall 1. Shannon coding theorem prove that a code exit that achieve data rate arbitrarily cloe to capacity with vanihingly mall probability of bit error The codeword might be very long (delay) Practical (delay-contrained) code only approach capacity 2. Shannon coding theorem aume Gauian codeword, but digital communication ytem ue dicrete modulation (PSK,16-QAM) Fading Channel: Capacity, BER and Diverity 7/50
10 Introduction Capacity BER Diverity Concluion Capacity (bp/hz) 10 Shaping gain (1.53 db) 8 6 Gauian input log(1+snr) 64-QAM 4 16-QAM 2 4-QAM (QPSK) 0 Pe (ymbol) = 10-6 (uncoded) SNR db For dicrete modulation, with increaing SNR we hould increae the contellation ize M (or ue a le powerful channel encoder) to increae the rate and hence approach capacity: Adaptive modulation and coding (more on thi later) Fading Channel: Capacity, BER and Diverity 8/50
11 Introduction Capacity BER Diverity Concluion AWGN v. Fading channel AWGN channel: h i a determinitic contant the SNR at the receiver i contant Intantaneou SNR = Average SNR = wlog we may take h 2 = 1 P WN 0 h 2 Fading channel: The intantaneou ignal-to-noie-ratio SNR = γ = γ h 2 i a random variable Intantaneou SNR = γ h 2 = Average SNR = γ = wlog we may take E[ h 2 ] = 1 γ = P WN 0 h 2 P WN 0 E[ h 2 ] P WN 0 Fading Channel: Capacity, BER and Diverity 9/50
12 Introduction Capacity BER Diverity Concluion Capacity fading channel Let u conider the following example 1 Fading channel Channel Encoder Random Switch AWGN C = 1 bp/hz AWGN C = 2 bp/hz The channel encoder i fixed The witch take both poition with equal probability We wih to tranmit a codeword formed by a long equence of coded bit, which are then mapped to ymbol What i the capacity for thi channel? 1 Taken from E. Biglieri, Coding for Wirele Communication, Springer, 2005 Fading Channel: Capacity, BER and Diverity 10/50
13 Introduction Capacity BER Diverity Concluion The anwer depend on the rate of change of the fading 1. Fat fading: If the witch change poition every ymbol period, the codeword experience both channel with equal probabilitie o we could ue a fixed channel encoder, and tranmit at a maximum rate C = 1 2 C C 2 = 1.5 bp/hz 2. Slow fading: If the witch remain fixed at the ame (unknown) poition during the tranmiion of the whole codeword, then we hould ue a fixed channel encoder, and tranmit at a maximum rate C = C 1 = 1 bp/hz or otherwie half of the codeword would be lot Fading Channel: Capacity, BER and Diverity 11/50
14 Introduction Capacity BER Diverity Concluion What would be the capacity if the witch chooe from a continuum of AWGN channel whoe SNR, γ = P h 2 WN 0, 0 γ <, follow an exponential ditribution (Rayleigh channel) C1 = log( 1+ γ 1) Channel Encoder Random Switch C2 = log( 1+ γ 2) C3 = log( 1+ γ 3) Fading Channel: Capacity, BER and Diverity 12/50
15 Introduction Capacity BER Diverity Concluion Fat fading (ergodic) channel Each ymbol uffer a different channel realization The channel encoder operate over L channel realization h1 h2 L hl h 1 h2 The channel capacity (aka ergodic capacity) i C = E [log(1 + γ)] = 0 L L h log(1 + γ)f (γ)dγ (1) where f (γ) i the pdf of the SNR, which in turn depend on the fading ditribution Fading Channel: Capacity, BER and Diverity 13/50
16 Introduction Capacity BER Diverity Concluion Remember that for a Rayleigh channel where γ i the average SNR f (γ) = 1 γ e γ/γ (2) The ergodic capacity of a Rayleigh channel i ( ) ( ) 1 1 C = log 2 (e) exp E 1 γ γ where E 1 (x) = x e t t dt i the Exponential integral function 2 2 y=expint(x) in Matlab Fading Channel: Capacity, BER and Diverity 14/50
17 Introduction Capacity BER Diverity Concluion The ergodic capacity i in general hard to compute in cloed form for other fading ditribution (we can alway reort to numerical integration) We can apply Jenen inequality to gain ome qualitative inight into the effect of fat fading on capacity Jenen inequality If f (x) i a convex function and X i a random variable E [f (X )] f (E [X ]) If f (x) i a concave function and X i a random variable E [f (X )] f (E [X ]) log( ) i a concave function, therefore C = E [log(1 + γ)] log (1 + E[γ]) = log (1 + γ) Fading Channel: Capacity, BER and Diverity 15/50
18 Fading Channel: Capacity, BER and Diverity 16/50 17 SISO Fading Channel: Ergodic Capacity Introduction Capacity BER Diverity Concluion Fading hurt: The capacity of a fading channel with receiver CSI me iid i le Rayleigh than the fading capacity with of σ an AWGN channel with the ame h 2 average SNR = E[ h 2 ] = 1, and σz 2 = Capacity (bp/hz) AWGN Channel Capacity Fading Channel Ergodic Capacity Average SNR (db)
19 Introduction Capacity BER Diverity Concluion Slow (block) fading channel The channel remain fixed during the tranmiion of a equence of L ymbol (a packet or a frame) For the next frame or packet, the channel take a new value (a new channel realization) The channel encoder operate over a packet: no coding over conecutive packet h 1 L L Block fading model: The channel realization are iid h2 L hn Fading Channel: Capacity, BER and Diverity 17/50
20 Introduction Capacity BER Diverity Concluion Slow (block) fading channel For a Rayleigh ditribution there i no nonzero rate at which codeword can be tranmitted with vanihingly mall probability or error Strictly, the capacity for the Rayleigh block fading channel would be zero In thi ituation, it i more ueful to define the outage capacity C out = r Pr(log(1 + γ) < r) = Pr(C(h) < r) = P out Suppoe we tranmit at a rate C out with probability of outage P out = 0.01 thi mean that with probability 0.99 the intantaneou capacity of the channel (a realization of a r.v.) will be larger than rate and the tranmiion will be ucceful; wherea with probability 0.01 the intantaneou capacity will be lower than the rate and the all bit in the codeword will be decoded incorrectly Fading Channel: Capacity, BER and Diverity 18/50
21 Introduction Capacity BER Diverity Concluion P out i the error probability ince data i only correctly received on 1 P out tranmiion What i the outage probability of a block fading Rayleigh channel with average SNR = γ for a tranmiion rate r? P out = Pr(log(1 + γ) < r) The rate i a monotonic increaing function with the SNR = γ; therefore, there i a γ min needed to achieve the rate log(1 + γ min ) = r γ min = 2 r 1 and P out can be obtained a P out =Pr(γ < γ min ) = =1 e γ min γ γmin 0 = 1 e 2r 1 γ f (γ)dγ = γmin 0 1 γ e γ/γ dγ = Fading Channel: Capacity, BER and Diverity 19/50
22 Introduction Capacity BER Diverity Concluion Rate (bp/hz) P out v C out (rate) for γ = 100 (10 db) P out Fading Channel: Capacity, BER and Diverity 20/50
23 Introduction Capacity BER Diverity Concluion Summary h 1 L AWGN L h1 h1 L C = log( 1+ γ ) h1 h2 L Ergodic (fat fading) h L h 1 h2 L h L C = E[log( 1+ γ )] Block fading h 1 L h2 L L hn C outage Fading Channel: Capacity, BER and Diverity 21/50
24 Introduction Capacity BER Diverity Concluion Final note All capacity reult een o far correpond to the cae of perfect CSI at the receiver ide (CSIR) If the tranmitter alo know the channel, we can perform power adaptation and the reult are different We ll ee more on thi later Now, let move to analyze the impact of fading on the Bit Error Rate (BER) Fading Channel: Capacity, BER and Diverity 22/50
25 Introduction Capacity BER Diverity Concluion BER analyi for the AWGN channel (a brief reminder) BPSK [n] { 1, +1} P = P b = Q 2E h 2 = Q N 0 ( ) 2SNR where SNR i the contant average ignal-to-noie ratio and Q(x) = 1 x 2π exp (x 2 /2) QPSK [n] { 1 j 2, 1+j 2, 1 j 2, 1+j 2 } ( ( )) 2 P = 1 1 Q SNR ( ) Nearet neighbor approximation P 2Q SNR With Gray encoding Pe = P /2 Fading Channel: Capacity, BER and Diverity 23/50
26 Introduction Capacity BER Diverity Concluion M-PAM contellation A i = (2i 1 M)d/2, i = 1,..., M Ditance between neighbor: d Average ymbol energy E = 1 3 (M2 1) ( ) 2 d = (M2 1)d Symbol Error Rate P = M 2 M 2Q = 2(M 1) M ( ) d + 2 ( ) d 2σ r M Q 2σ r Q 6 SNR M 2 1 With Gray encoding Pe P /M Fading Channel: Capacity, BER and Diverity 24/50
27 Introduction Capacity BER Diverity Concluion M-QAM: the contellation for the I and Q branche are A i = (2i 1 M)d/2, i = 1,..., M At the I and Q branche we have orthogonal M PAM ignal, each with half the SNR Symbol Error Rate P = 1 1 2( M 1) Q M 3 SNR M 1 Nearet neighbor approximation (4 nearet neighbor) P 4Q 3 SNR M 1 2 Fading Channel: Capacity, BER and Diverity 25/50
28 Introduction Capacity BER Diverity Concluion The impact of fading on the BER Let u conider for implicity a SISO channel with a BPSK ource ignal x[n] = h[n] + r[n] [n] {+1, 1}, r[n] CN(0, σ 2 ) i the noie (additive, white and Gauian) An AWGN channel or a fading channel behave alo differently in term of BER AWGN channel: h i contant Rayleigh fading channel: h ~ CN(0,1) h h Fading Channel: Capacity, BER and Diverity 26/50
29 Introduction Capacity BER Diverity Concluion The receiver know perfectly the channel coherent det. Since we are ending a BPSK ignal over a complex channel the optimal coherent detector i ( h ) x[n] +1 Re 0 (3) h 1 Auming that the tranmitted power i normalized to unity E[ [n] 2 ] = 1, the average SNR i SNR = 1 σ 2 and the intantaneou Signal-to-Noie-Ratio i SNR h 2 For an AWGN channel, SNR h 2 i a contant value and the BER i ( ) ( ) 2 h P e = Q = Q 2 h σ 2 SNR Fading Channel: Capacity, BER and Diverity 27/50
30 Introduction Capacity BER Diverity Concluion For a fading channel SNR h 2 i now a random variable ( ) We can therefore think of P e = Q 2 h 2 SNR a another random variable The BER for the fading channel would be the average over the channel ditribution E[P e ] Thi applie to both fat fading and low fading channel model BER for a Rayleigh channel h i a Rayleigh random variable and z = h 2 i exponential with pdf f (z) = exp( z), the BER i given by ( ) P e = Q 2zSNR e z dz = 1 SNR SNR 4SNR 0 Fading Channel: Capacity, BER and Diverity 28/50
31 Introduction Capacity BER Diverity Concluion BER AWGN Rayleigh SNR (db) At an error probability of P e = 10 3, a Rayleigh fading channel need 17 db more than an AWGN (contant) channel, even though we have perfect channel knowledge in both cae!! Fading Channel: Capacity, BER and Diverity 29/50
32 Introduction Capacity BER Diverity Concluion The main reaon of the poor performance i that there i a ignificant probability that the channel i in a deep fade, and not becaue of noie The intantaneou ignal-to-noie-ratio i h 2 SNR, and we may conider that the channel i in a deep fade when h 2 SNR < 1 In thi event, the eparation between contellation point will be of the order of magnitude of σ (noie tandard deviation) and the probability of error will be high For a Rayleigh channel, the prob. of being in a deep fade i Pr( h 2 SNR < 1) = ( = 1 1/SNR SNR + which i of the ame order a P e e z dz = 1 e 1/SNR = ( ) ) SNR 1 SNR Fading Channel: Capacity, BER and Diverity 30/50
33 Introduction Capacity BER Diverity Concluion Remark Although our example conidered a BPSK modulation, the ame reult i obtained for other modulation On the Rayleigh channel, all modulation cheme are equally bad and for all them the BER decreae a SNR 1 The gap between the AWGN and the Rayleigh channel in term of BER i much higher than in term of capacity Thi ugget that coding can be very beneficial to compenate fading Fading Channel: Capacity, BER and Diverity 31/50
34 Introduction Capacity BER Diverity Concluion Diverity The negative lope (at high SNR) of the BER curve with repect to the SNR i called the diverity gain or diverity order log(p e d = lim log(snr) SNR In other word, in a ytem with diverity order d, the P e at high SNR varie a P e = SNR d For a SISO Rayleigh channel the diverity order i 1 (remember that P e 1/(4SNR) SNR 1!! Fading Channel: Capacity, BER and Diverity 32/50
35 Introduction Capacity BER Diverity Concluion SIMO ytem Conider now that the Rx ha N antenna and that the reulting SIMO (ingle-input multiple-output) channel i patially uncorrelated [n] h 1 h 2 r 2 [ n] r 1 [ n] h1[ n] r1 [ n] h n] r [ 2 [ 2 n ] r h N [n] N hn [ n] rn [ n] If the channel h i are faded independently, the probability that the SIMO channel i in a deep fade will be approximately ( ) N Pr(( h 1 2 SNR < 1)&... &( h N 2 SNR < 1)) = Pr( h 2 1 SNR < 1) SNR N Fading Channel: Capacity, BER and Diverity 33/50
36 Introduction Capacity BER Diverity Concluion In conequence, the diverity order of a SIMO ytem with N uncorrelated receive antenna i N Notice the impact of antenna correlation: if all antenna are very cloe to each other o that the channel become fully correlated, then h 1 h 2 h N, and the diverity reduce to that of a SISO channel There are different way to proce the receive vector and extract all patial diverity of the SIMO channel Auming that the channel h = (h 1, h 2,..., h N ) T i known at the Rx, the optimal cheme called maximum ratio combining (MRC) Fading Channel: Capacity, BER and Diverity 34/50
37 Introduction Capacity BER Diverity Concluion Maximum Ratio Combining The MRC cheme linearly combine (with optimal weight w i ) the output of the ignal received at each antenna r 1 [ n] h [ ] [ ] h 1 n r1 n w 1 1 h r 2 [ n] 2 h2[ n] r2 [ n] w 2 h N r N [n] h [ n] r [ n] N N w N z[n] The ignal z[n] can be written in matrix form a h 1 r 1 [n] z[n] = ( ) h 2 w 1 w 2... w N. [n] + r 2 [n]. = wt (h[n] + r[n]) h N r N [n] Fading Channel: Capacity, BER and Diverity 35/50
38 Introduction Capacity BER Diverity Concluion A long a w = 1 the noie ditribution after combining doe not change: i.e., w T r[n] CN(0, σ 2 ) It i eay to how that the optimal weight are given by w = h h, which i jut the matched filter for thi problem! Thee are the optimal weight becaue they maximize the ignal-to-noie-ratio at the output of the combiner: SNR MRC = h 2 σ 2 = h 2 SNR For a BPSK tranmitted ignal, the optimal detector i Re(z[n]) = Re ( ) h H x[n] +1 0 h 1 where ( ) H denote Hermitian (complex conjugate and tranpoe). Notice the imilarity with the optimal coherent detector for the SISO cae, which wa given by (3) Fading Channel: Capacity, BER and Diverity 36/50
39 Introduction Capacity BER Diverity Concluion Similarly to the SISO cae, the P e can be derived exactly ( ) P e = Q 2 h 2 SNR, which i a random variable becaue h i random (fading channel) Under Rayleigh fading, each h i i i.i.d CN(0, 1) and x = h 2 = N h i 2 follow a Chi-quare ditribution with 2N degree of freedom f (x) = i=1 1 (N 1)! x N 1 exp( x), x 0 Note that the exponential ditribution (SISO cae with N = 1) i a Chi-quare with 2 degree of freedom The average error probability can be explicitly computed, here we only provide a high-snr approximation P e = 0 ( ( ) Q 2xSNR f (x)dx 2N 1 N ) 1 (4SNR) N Fading Channel: Capacity, BER and Diverity 37/50
40 Introduction Capacity BER Diverity Concluion The probability of being in a deep fade with MRC i Pr( h 2 SNR < 1) = Concluion (for x mall) 1/SNR 0 1/SNR 0 1 (N 1)! x N 1 exp( x)dx 1 (N 1)! x N 1 dx = 1 N!SNR N The P e i again dominated by the probability of being in a deep fade Both (the P e and the probability of being in a deep fade) decreae with the number of antenna roughly a (SNR) N MRC extract all patial diverity of the SIMO channel!! However, MRC i not the only multiantenna technique that extract all patial diverity of a SIMO channel Fading Channel: Capacity, BER and Diverity 38/50
41 Introduction Capacity BER Diverity Concluion Antenna election r 1 h 1 h 2 r 2 RF chain ADC x[ n] hmax[ n] r[ n] h N r N Selection of the bet link In antenna election the path with the highet SNR i elected and proceed: x[n] = h max[n] + r[n], where h max = max ( h 1, h 2,..., h N ) In comparion to MRC, only a ingle RF chain i needed!! Fading Channel: Capacity, BER and Diverity 39/50
42 Introduction Capacity BER Diverity Concluion Intuitively, the probability that the bet channel i in a deep fade i Pr( h max 2 SNR < 1) = N Pr( h i 2 SNR < 1) 1 i=1 SNR N and, therefore, the diverity of antenna election i alo N The ame concluion can be reached by tudying the P e (we would need the ditribution of h max 2 ) However, the output SNR of MRC i higher than that of antenna election (AS) SNR MRC = h 1 2 σ h N 2 σ 2 SNR AS = h max 2 σ 2 Fading Channel: Capacity, BER and Diverity 40/50
43 Introduction Capacity BER Diverity Concluion Array gain The SNR increae in a multiantenna ytem with repect to that of a SISO ytem i called array gain Wherea the diverity gain i reflected in lope of the BER v. SNR, the array gain provoke a hift to the left in the curve N=1 BER N= Array Gain SNR (db) Fading Channel: Capacity, BER and Diverity 41/50
44 Introduction Capacity BER Diverity Concluion For a receiver with N antenna, MRC i optimal becaue it achieve maximum patial diverity and maximum array gain MRC achieve the maximum array gain by coherently combining all ignal path On average, the output SNR of MRC i N time that of a SISO ytem, o it array gain i 10 log 10 N (db) For intance, uing 2 Rx antenna, MRC provide 3 extra db in comparion to a SISO ytem and in addition to the patial diverity gain Fading Channel: Capacity, BER and Diverity 42/50
45 Introduction Capacity BER Diverity Concluion 10 0 Antenna Selection 10 1 MRC SER N=3 N= SNR (db) Fading Channel: Capacity, BER and Diverity 43/50
46 Introduction Capacity BER Diverity Concluion Maximum Ratio Tranmiion Similar concept apply for a a MISO (multiple-input ingle-input) channel: the optimal cheme i now called Maximum Ratio Tranmiion (MRT) w 1 w 2 h2 [n] w N h N h 1 r[n] w T h [ n] r[ ] z[ n] n Again, the optimal tranmit beamformer that achieve full patial diverity (N) and full array gain (10 log 10 N) i w = h h, The main difference i that now the channel mut be known at the Tx (through a feedback channel) Fading Channel: Capacity, BER and Diverity 44/50
47 Introduction Capacity BER Diverity Concluion Spatial diverity of a MIMO channel An n R n T MIMO channel with i.i.d. entrie ha a patial diverity n R n T, which i the number of independent path offered to the ource ignal for going from the Tx to the Rx Some cheme extract the full patial diverity of the MIMO channel Optimal combining at both ide (MRT+MRC) Antenna election at both ide Antenna election at one ide and optimal combining at the other ide Repetition coding at the Tx ide (ame ymbol tranmitted through all Tx antenna) + optimal combining at the Rx ide But other might not: think of a ytem that tranmit independent data tream over different tranmit antenna (more on thi later) Fading Channel: Capacity, BER and Diverity 45/50
48 Introduction Capacity BER Diverity Concluion Time and frequency diverity We have mainly focued the dicuion on the patial diverity concept, but the ame idea can be applied to the time and frequency domain Time diverity: 1. The ame ymbol i tranmitted over different time intant, t 1 and t 2 2. For the channel to fade more or le independently: t 1 t 2 > T c = 1 D Frequency diverity: 1. The ame ymbol i tranmitted over different frequencie (ubcarrier in OFDM), f 1 and f 2 2. For the channel to fade more or le independently: f 1 f 2 > B c = 1 τ rm To achieve time or frequency diverity, interleaving i typically ued Fading Channel: Capacity, BER and Diverity 46/50
49 Introduction Capacity BER Diverity Concluion Interleaving The ymbol or coded bit are dipered over different coherence interval (in time or frequency) A typical interleaver conit of an P Q matrix: the input ignal are written rowwie into the matrix and then read columnwie and tranmitted (after modulation) Example: A 4 8 interleaving matrix from ource to channel Fading Channel: Capacity, BER and Diverity 47/50
50 Introduction Capacity BER Diverity Concluion burt of error Without interleaving h1 h2 h h With interleaving h1 h h 3 h Fading Channel: Capacity, BER and Diverity 48/50
51 Introduction Capacity BER Diverity Concluion Remark: Doppler pread in typical ytem range from 1 to 100 Hz, correponding roughly to coherence time from 0.01 to 1 ec. If tranmiion rate range from to bp, thi would imply that block of length L ranging from L = = 200 bit to L = = bit would be affected by approximately the ame fading gain Deep interleaving might be needed in ome cae But notice that interleaving involve a delay proportional to the ize of the interleaving matrix In delay-contrained ytem (tranmiion of real-time peech) thi might be difficult or even unfeaible Fading Channel: Capacity, BER and Diverity 49/50
52 Introduction Capacity BER Diverity Concluion Concluion We have analyzed the effect of fading from the point of view of capacity (only CSIR) and BER Depending of the channel model (ergodic or block fading) we ue ergodic capacity or outage capacity With CSIR only, the capacity of a fading channel i alway le than the capacity of an AWGN with the ame average SNR The effect of fading i more ignificant in term of BER than in term of capacity (power of coding gain + interleaving) Diverity: lope of the BER wrt SNR at high SNR Diverity technique with multiantenna ytem: MRT, MRC, antenna election, etc We can extract the time and frequency diverity of the channel through interleaving Fading Channel: Capacity, BER and Diverity 50/50
PRACTICE FINAL EXAM SOLUTION Jing Liang 12/06/2006
PRACICE FIAL EXAM SOLUIO Jing Liang /6/6 PROBLEM (a) (b) (c) (d) (e) he propagation ignal experience power variation due to the contructive and detructive addition of multi-path ignal component, and therefore
More informationSingle-User MIMO systems: Introduction, capacity results, and MIMO beamforming
Single-User MIMO systems: Introduction, capacity results, and MIMO beamforming Master Universitario en Ingeniería de Telecomunicación I. Santamaría Universidad de Cantabria Contents Introduction Multiplexing,
More informationChapter 2 Sampling and Quantization. In order to investigate sampling and quantization, the difference between analog
Chapter Sampling and Quantization.1 Analog and Digital Signal In order to invetigate ampling and quantization, the difference between analog and digital ignal mut be undertood. Analog ignal conit of continuou
More informationA Study on Simulating Convolutional Codes and Turbo Codes
A Study on Simulating Convolutional Code and Turbo Code Final Report By Daniel Chang July 27, 2001 Advior: Dr. P. Kinman Executive Summary Thi project include the deign of imulation of everal convolutional
More informationEE 5407 Part II: Spatial Based Wireless Communications
EE 5407 Part II: Spatial Based Wireless Communications Instructor: Prof. Rui Zhang E-mail: rzhang@i2r.a-star.edu.sg Website: http://www.ece.nus.edu.sg/stfpage/elezhang/ Lecture II: Receive Beamforming
More informationSAMPLING. Sampling is the acquisition of a continuous signal at discrete time intervals and is a fundamental concept in real-time signal processing.
SAMPLING Sampling i the acquiition of a continuou ignal at dicrete time interval and i a fundamental concept in real-time ignal proceing. he actual ampling operation can alo be defined by the figure belo
More informationImproved Interference Cancellation Scheme for Two-User Detection of Alamouti Code
Improved Interference Cancellation Scheme for Two-Uer Detection of Alamouti Code Manav R hatnagar and Are Hjørungne Abtract In thi correpondence, we propoe an improved interference cancellation method
More informationA Genetic Algorithm for Designing Constellations with Low Error Floors
A Genetic Algorithm for Deigning Contellation with Low Error Floor Matthew C. Valenti and Raghu Doppalapudi Wet Virginia Univerity Morgantown, WV Email: {mvalenti,doppala}@cee.wvu.edu Don Torrieri U.S.
More informationChannel Coding 2.
Channel Coding Dr.-Ing. Dirk Wübben Intitute for Telecommunication and High-Frequency Technique Department of Communication Engineering Room: N3, Phone: /8-6385 wuebben@ant.uni-bremen.de Lecture Tueday,
More informationOrthogonal Signals With orthogonal signals, we select only one of the orthogonal basis functions for transmission:
4..4 Orthogonal, Biorthogonal and Simplex Signal 4.- In PAM, QAM and PSK, we had only one ai function. For orthogonal, iorthogonal and implex ignal, however, we ue more than one orthogonal ai function,
More informationAmplify and Forward Relaying; Channel Model and Outage Behaviour
Amplify and Forward Relaying; Channel Model and Outage Behaviour Mehdi Mortazawi Molu Intitute of Telecommunication Vienna Univerity of Technology Guhautr. 5/E389, 4 Vienna, Autria Email: mmortaza@nt.tuwien.ac.at
More informationA Simple Example Binary Hypothesis Testing Optimal Receiver Frontend M-ary Signal Sets Message Sequences. = 4 for QPSK) E b Q 2. 2E b.
Exercie: QPSK I Find the error rate for the ignal et n (t) = p 2E /T co(2pf c t + n p/2 + p/4), for n = 0,, 3 I Anwer: (Recall h P = d min 2 E b = 4 for QPSK) E Pr{e} = 2Q Q 2 = 2Q = 2Q 2E b h P E b 2
More informationC up (E) C low (E) E 2 E 1 E 0
Spreading in lock-fading hannel. Muriel Médard David N.. Te medardmit.edu Maachuett Intitute of Technoy dteeec.berkeley.edu Univerity of alifornia at erkeley btract We conider wideband fading channel which
More informationBogoliubov Transformation in Classical Mechanics
Bogoliubov Tranformation in Claical Mechanic Canonical Tranformation Suppoe we have a et of complex canonical variable, {a j }, and would like to conider another et of variable, {b }, b b ({a j }). How
More informationLecture 4. Capacity of Fading Channels
1 Lecture 4. Capacity of Fading Channels Capacity of AWGN Channels Capacity of Fading Channels Ergodic Capacity Outage Capacity Shannon and Information Theory Claude Elwood Shannon (April 3, 1916 February
More informationProperties of Z-transform Transform 1 Linearity a
Midterm 3 (Fall 6 of EEG:. Thi midterm conit of eight ingle-ided page. The firt three page contain variou table followed by FOUR eam quetion and one etra workheet. You can tear out any page but make ure
More informationSampling and the Discrete Fourier Transform
Sampling and the Dicrete Fourier Tranform Sampling Method Sampling i mot commonly done with two device, the ample-and-hold (S/H) and the analog-to-digital-converter (ADC) The S/H acquire a CT ignal at
More informationGNSS Solutions: What is the carrier phase measurement? How is it generated in GNSS receivers? Simply put, the carrier phase
GNSS Solution: Carrier phae and it meaurement for GNSS GNSS Solution i a regular column featuring quetion and anwer about technical apect of GNSS. Reader are invited to end their quetion to the columnit,
More informationChapter 4: Applications of Fourier Representations. Chih-Wei Liu
Chapter 4: Application of Fourier Repreentation Chih-Wei Liu Outline Introduction Fourier ranform of Periodic Signal Convolution/Multiplication with Non-Periodic Signal Fourier ranform of Dicrete-ime Signal
More informationJul 4, 2005 turbo_code_primer Revision 0.0. Turbo Code Primer
Jul 4, 5 turbo_code_primer Reviion. Turbo Code Primer. Introduction Thi document give a quick tutorial on MAP baed turbo coder. Section develop the background theory. Section work through a imple numerical
More informationDigital Communications I: Modulation and Coding Course. Term Catharina Logothetis Lecture 8
Digital Communication I: odulation and Coding Coure Term 3-8 Catharina Logotheti Lecture 8 Lat time we talked about: Some bandpa modulation cheme -A, -SK, -FSK, -QA How to perform coherent and noncoherent
More informationSignaling over MIMO Multi-Base Systems: Combination of Multi-Access and Broadcast Schemes
Signaling over MIMO Multi-Bae Sytem: Combination of Multi-Acce and Broadcat Scheme Mohammad Ali Maddah-Ali Abolfazl S. Motahari and Amir K. Khandani Coding & Signal Tranmiion Laboratory (www.ct.uwaterloo.ca)
More informationinto a discrete time function. Recall that the table of Laplace/z-transforms is constructed by (i) selecting to get
Lecture 25 Introduction to Some Matlab c2d Code in Relation to Sampled Sytem here are many way to convert a continuou time function, { h( t) ; t [0, )} into a dicrete time function { h ( k) ; k {0,,, }}
More informationQuestion 1 Equivalent Circuits
MAE 40 inear ircuit Fall 2007 Final Intruction ) Thi exam i open book You may ue whatever written material you chooe, including your cla note and textbook You may ue a hand calculator with no communication
More informationELEC546 Review of Information Theory
ELEC546 Review of Information Theory Vincent Lau 1/1/004 1 Review of Information Theory Entropy: Measure of uncertainty of a random variable X. The entropy of X, H(X), is given by: If X is a discrete random
More informationÇankaya University ECE Department ECE 376 (MT)
Çankaya Univerity ECE Department ECE 376 (M) Student Name : Date : 13.4.15 Student Number : Open Source Exam Quetion 1. (7 Point) he time waveform of the ignal et, and t t are given in Fig. 1.1. a. Identify
More informationSource slideplayer.com/fundamentals of Analytical Chemistry, F.J. Holler, S.R.Crouch. Chapter 6: Random Errors in Chemical Analysis
Source lideplayer.com/fundamental of Analytical Chemitry, F.J. Holler, S.R.Crouch Chapter 6: Random Error in Chemical Analyi Random error are preent in every meaurement no matter how careful the experimenter.
More informationSocial Studies 201 Notes for March 18, 2005
1 Social Studie 201 Note for March 18, 2005 Etimation of a mean, mall ample ize Section 8.4, p. 501. When a reearcher ha only a mall ample ize available, the central limit theorem doe not apply to the
More informationSocial Studies 201 Notes for November 14, 2003
1 Social Studie 201 Note for November 14, 2003 Etimation of a mean, mall ample ize Section 8.4, p. 501. When a reearcher ha only a mall ample ize available, the central limit theorem doe not apply to the
More informationLRA DSP. Multi-Rate DSP. Applications: Oversampling, Undersampling, Quadrature Mirror Filters. Professor L R Arnaut 1
ulti-rate Application: Overampling, Underampling, Quadrature irror Filter Profeor L R Arnaut ulti-rate Overampling Profeor L R Arnaut Optimal Sampling v. Overampling Sampling at Nyquit rate F =F B Allow
More informationDigital Control System
Digital Control Sytem - A D D A Micro ADC DAC Proceor Correction Element Proce Clock Meaurement A: Analog D: Digital Continuou Controller and Digital Control Rt - c Plant yt Continuou Controller Digital
More informationSINGLE CARRIER BLOCK TRANSMISSION WITHOUT GUARD INTERVAL
SINGLE CARRIER BLOCK TRANSMISSION WITHOUT GUARD INTERVAL Kazunori Hayahi Hideaki Sakai Graduate School of Informatic, Kyoto Univerity Kyoto, JAPAN ABSTRACT Thi paper propoe a imple detection cheme for
More informationChapter 2: Problem Solutions
Chapter 2: Solution Dicrete Time Proceing of Continuou Time Signal Sampling à 2.. : Conider a inuoidal ignal and let u ample it at a frequency F 2kHz. xt 3co000t 0. a) Determine and expreion for the ampled
More informationChapter 5 Optimum Receivers for the Additive White Gaussian Noise Channel
Chapter 5 Optimum Receiver for the Additive White Gauian Noie Channel Table of Content 5.1 Optimum Receiver for Signal Corrupted by Additive White Noie 5.1.1 Correlation Demodulator 5.1. Matched-Filter
More informationClustering Methods without Given Number of Clusters
Clutering Method without Given Number of Cluter Peng Xu, Fei Liu Introduction A we now, mean method i a very effective algorithm of clutering. It mot powerful feature i the calability and implicity. However,
More informationDetermination of the local contrast of interference fringe patterns using continuous wavelet transform
Determination of the local contrat of interference fringe pattern uing continuou wavelet tranform Jong Kwang Hyok, Kim Chol Su Intitute of Optic, Department of Phyic, Kim Il Sung Univerity, Pyongyang,
More informationSIMON FRASER UNIVERSITY School of Engineering Science ENSC 320 Electric Circuits II. Solutions to Assignment 3 February 2005.
SIMON FRASER UNIVERSITY School of Engineering Science ENSC 320 Electric Circuit II Solution to Aignment 3 February 2005. Initial Condition Source 0 V battery witch flip at t 0 find i 3 (t) Component value:
More informationEE 477 Digital Signal Processing. 4 Sampling; Discrete-Time
EE 477 Digital Signal Proceing 4 Sampling; Dicrete-Time Sampling a Continuou Signal Obtain a equence of ignal ample uing a periodic intantaneou ampler: x [ n] = x( nt ) Often plot dicrete ignal a dot or
More informationIEOR 3106: Fall 2013, Professor Whitt Topics for Discussion: Tuesday, November 19 Alternating Renewal Processes and The Renewal Equation
IEOR 316: Fall 213, Profeor Whitt Topic for Dicuion: Tueday, November 19 Alternating Renewal Procee and The Renewal Equation 1 Alternating Renewal Procee An alternating renewal proce alternate between
More informationLecture 4 Capacity of Wireless Channels
Lecture 4 Capacity of Wireless Channels I-Hsiang Wang ihwang@ntu.edu.tw 3/0, 014 What we have learned So far: looked at specific schemes and techniques Lecture : point-to-point wireless channel - Diversity:
More informationLecture 8. PID control. Industrial process control ( today) PID control. Insights about PID actions
Lecture 8. PID control. The role of P, I, and D action 2. PID tuning Indutrial proce control (92... today) Feedback control i ued to improve the proce performance: tatic performance: for contant reference,
More informationLecture 7: Testing Distributions
CSE 5: Sublinear (and Streaming) Algorithm Spring 014 Lecture 7: Teting Ditribution April 1, 014 Lecturer: Paul Beame Scribe: Paul Beame 1 Teting Uniformity of Ditribution We return today to property teting
More informationProblem 1. Construct a filtered probability space on which a Brownian motion W and an adapted process X are defined and such that
Stochatic Calculu Example heet 4 - Lent 5 Michael Tehranchi Problem. Contruct a filtered probability pace on which a Brownian motion W and an adapted proce X are defined and uch that dx t = X t t dt +
More informationNonuniform probability modulation for reducing energy consumption of remote sensors
Nonuniform probability modulation for reducing energy conumption of remote enor Jarek Duda Jagiellonian Univerity, Golebia 24, 31-007 Krakow, Poland. Email: dudajar@gmail.com arxiv:1608.04271v1 [c.it]
More informationLecture 4 Capacity of Wireless Channels
Lecture 4 Capacity of Wireless Channels I-Hsiang Wang ihwang@ntu.edu.tw 3/0, 014 What we have learned So far: looked at specific schemes and techniques Lecture : point-to-point wireless channel - Diversity:
More informationSpring 2014 EE 445S Real-Time Digital Signal Processing Laboratory. Homework #0 Solutions on Review of Signals and Systems Material
Spring 4 EE 445S Real-Time Digital Signal Proceing Laboratory Prof. Evan Homework # Solution on Review of Signal and Sytem Material Problem.. Continuou-Time Sinuoidal Generation. In practice, we cannot
More informationMAE140 Linear Circuits Fall 2012 Final, December 13th
MAE40 Linear Circuit Fall 202 Final, December 3th Intruction. Thi exam i open book. You may ue whatever written material you chooe, including your cla note and textbook. You may ue a hand calculator with
More informationCodes Correcting Two Deletions
1 Code Correcting Two Deletion Ryan Gabry and Frederic Sala Spawar Sytem Center Univerity of California, Lo Angele ryan.gabry@navy.mil fredala@ucla.edu Abtract In thi work, we invetigate the problem of
More informationTrellis Shaping Techniques for Satellite Telecommunication Systems
> 1 Trelli Technique for Satellite Telecommunication Sytem M. Álvarez-Díaz 1, M. Neri, C. Moquera 1 and G. E. Corazza 1 Dept. Signal Theory and Communication (TSC), Univerity of Vigo Campu Univeritario
More informationMarch 18, 2014 Academic Year 2013/14
POLITONG - SHANGHAI BASIC AUTOMATIC CONTROL Exam grade March 8, 4 Academic Year 3/4 NAME (Pinyin/Italian)... STUDENT ID Ue only thee page (including the back) for anwer. Do not ue additional heet. Ue of
More informationAssignment for Mathematics for Economists Fall 2016
Due date: Mon. Nov. 1. Reading: CSZ, Ch. 5, Ch. 8.1 Aignment for Mathematic for Economit Fall 016 We now turn to finihing our coverage of concavity/convexity. There are two part: Jenen inequality for concave/convex
More informationLecture 21. The Lovasz splitting-off lemma Topics in Combinatorial Optimization April 29th, 2004
18.997 Topic in Combinatorial Optimization April 29th, 2004 Lecture 21 Lecturer: Michel X. Goeman Scribe: Mohammad Mahdian 1 The Lovaz plitting-off lemma Lovaz plitting-off lemma tate the following. Theorem
More informationLaplace Transformation
Univerity of Technology Electromechanical Department Energy Branch Advance Mathematic Laplace Tranformation nd Cla Lecture 6 Page of 7 Laplace Tranformation Definition Suppoe that f(t) i a piecewie continuou
More informationSuccessive Refinement via Broadcast: Optimizing Expected Distortion of a Gaussian Source over a Gaussian Fading Channel
Succeive Refinement via Broadcat: Optimizing Expected Ditortion of a Gauian Source over a Gauian Fading Channel Chao Tian, Member, IEEE, Avi Steiner, Student Member, IEEE, Shlomo Shamai (Shitz, Fellow,
More informationThe Performance of Error and Outage Capacity in SIMO and MISO FSO Links
International Journal of Computer Science and Telecommunication [Volume 3, Iue 7, July ] 36 ISS 47-3338 The Performance of Error and Outage Capacity in SIO and ISO FSO Link. ofidi, A. Chaman-motlagh and.
More informationNetwork based Sensor Localization in Multi-Media Application of Precision Agriculture Part 2: Time of Arrival
Network baed Senor Localization in Multi-Media Application of Preciion Agriculture Part : Time of Arrival Herman Sahota IBM, Silicon Valley Laboratory Email: hahota@u.ibm.com Ratneh Kumar, IEEE Fellow
More informationEnd-to-End BER Analysis of Space Shift Keying in Decode-and-Forward Cooperative Relaying
3 IEEE Wirele Communication and Networking Conference (WCNC: PHY End-to-End BER Analyi of Space Shift Keying in Decode-and-Forwa Cooperative Relaying Pritam Som and A. Chockalingam Department of ECE, Indian
More informationSuggested Answers To Exercises. estimates variability in a sampling distribution of random means. About 68% of means fall
Beyond Significance Teting ( nd Edition), Rex B. Kline Suggeted Anwer To Exercie Chapter. The tatitic meaure variability among core at the cae level. In a normal ditribution, about 68% of the core fall
More informationDigital Band-pass Modulation PROF. MICHAEL TSAI 2011/11/10
Digital Band-pass Modulation PROF. MICHAEL TSAI 211/11/1 Band-pass Signal Representation a t g t General form: 2πf c t + φ t g t = a t cos 2πf c t + φ t Envelope Phase Envelope is always non-negative,
More informationWireless Communications Lecture 10
Wireless Communications Lecture 1 [SNR per symbol and SNR per bit] SNR = P R N B = E s N BT s = E b N BT b For BPSK: T b = T s, E b = E s, and T s = 1/B. Raised cosine pulse shaper for other pulses. T
More informationEC381/MN308 Probability and Some Statistics. Lecture 7 - Outline. Chapter Cumulative Distribution Function (CDF) Continuous Random Variables
EC38/MN38 Probability and Some Statitic Yanni Pachalidi yannip@bu.edu, http://ionia.bu.edu/ Lecture 7 - Outline. Continuou Random Variable Dept. of Manufacturing Engineering Dept. of Electrical and Computer
More informationLecture 7 MIMO Communica2ons
Wireless Communications Lecture 7 MIMO Communica2ons Prof. Chun-Hung Liu Dept. of Electrical and Computer Engineering National Chiao Tung University Fall 2014 1 Outline MIMO Communications (Chapter 10
More informationLecture 10 Filtering: Applied Concepts
Lecture Filtering: Applied Concept In the previou two lecture, you have learned about finite-impule-repone (FIR) and infinite-impule-repone (IIR) filter. In thee lecture, we introduced the concept of filtering
More informationLecture 9: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1. Overview. Ragnar Thobaben CommTh/EES/KTH
: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1 Rayleigh Wednesday, June 1, 2016 09:15-12:00, SIP 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication
More informationLecture 7: Wireless Channels and Diversity Advanced Digital Communications (EQ2410) 1
Wireless : Wireless Advanced Digital Communications (EQ2410) 1 Thursday, Feb. 11, 2016 10:00-12:00, B24 1 Textbook: U. Madhow, Fundamentals of Digital Communications, 2008 1 / 15 Wireless Lecture 1-6 Equalization
More informationFinding the location of switched capacitor banks in distribution systems based on wavelet transform
UPEC00 3t Aug - 3rd Sept 00 Finding the location of witched capacitor bank in ditribution ytem baed on wavelet tranform Bahram nohad Shahid Chamran Univerity in Ahvaz bahramnohad@yahoo.com Mehrdad keramatzadeh
More informationLecture 9: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1
: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1 Rayleigh Friday, May 25, 2018 09:00-11:30, Kansliet 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless
More information5.5 Application of Frequency Response: Signal Filters
44 Dynamic Sytem Second order lowpa filter having tranfer function H()=H ()H () u H () H () y Firt order lowpa filter Figure 5.5: Contruction of a econd order low-pa filter by combining two firt order
More informationOn the Channel Capacity of Multilevel Modulation Schemes with Coherent Detection
On the Channel Capacity of Multilevel Modulation Scheme with Coherent Detection Ivan B Djordjevic a Lei Xu b Ting Wang b a Univerity of Arizona Department of Electrical & Computer Engineering Tucon AZ
More informationFUNDAMENTALS OF POWER SYSTEMS
1 FUNDAMENTALS OF POWER SYSTEMS 1 Chapter FUNDAMENTALS OF POWER SYSTEMS INTRODUCTION The three baic element of electrical engineering are reitor, inductor and capacitor. The reitor conume ohmic or diipative
More informationPerformance Degradation due to I/Q Imbalance in Multi-Carrier Direct Conversion Receivers: A Theoretical Analysis
Performance egradation due to I/Q Imbalance in Multi-Carrier irect Converion Receiver: A Theoretical Analyi Marcu Windich, Gerhard Fettwei reden Univerity of Technology, Vodafone Chair Mobile Communication
More informationDimensional Analysis A Tool for Guiding Mathematical Calculations
Dimenional Analyi A Tool for Guiding Mathematical Calculation Dougla A. Kerr Iue 1 February 6, 2010 ABSTRACT AND INTRODUCTION In converting quantitie from one unit to another, we may know the applicable
More informationDIFFERENTIAL EQUATIONS
DIFFERENTIAL EQUATIONS Laplace Tranform Paul Dawkin Table of Content Preface... Laplace Tranform... Introduction... The Definition... 5 Laplace Tranform... 9 Invere Laplace Tranform... Step Function...4
More informationDesign By Emulation (Indirect Method)
Deign By Emulation (Indirect Method he baic trategy here i, that Given a continuou tranfer function, it i required to find the bet dicrete equivalent uch that the ignal produced by paing an input ignal
More informationLecture 5: Antenna Diversity and MIMO Capacity Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH
: Antenna Diversity and Theoretical Foundations of Wireless Communications Wednesday, May 4, 206 9:00-2:00, Conference Room SIP Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication
More informationMODELING OF NEGATIVE INFLUENCES AT THE SIGNAL TRANSMISSION IN THE OPTICAL MEDIUM. Rastislav Róka, Filip Čertík
MODELING OF NEGATIVE INFLUENCES AT THE SIGNAL TRANSMISSION IN THE OPTICAL MEDIUM Ratilav Róka, Filip Čertík Intitute of Telecommunication, FEEIT, Slovak Univerity of Technology in Bratilava E-mail: ratilav.roka@tuba.k,
More information1 if X v I v (X) = 0 if X < v. e sx p(x)dx
Homework 3 Solution Problem Chernoff Bound: The indicator function I v (X) for a real random variable X i defined a, { if X v I v (X) 0 if X < v For 0 (i) if X < v (ii) if X v E{e X } e v P rx v I v (X)
More informationμ + = σ = D 4 σ = D 3 σ = σ = All units in parts (a) and (b) are in V. (1) x chart: Center = μ = 0.75 UCL =
Our online Tutor are available 4*7 to provide Help with Proce control ytem Homework/Aignment or a long term Graduate/Undergraduate Proce control ytem Project. Our Tutor being experienced and proficient
More informationON THE APPROXIMATION ERROR IN HIGH DIMENSIONAL MODEL REPRESENTATION. Xiaoqun Wang
Proceeding of the 2008 Winter Simulation Conference S. J. Maon, R. R. Hill, L. Mönch, O. Roe, T. Jefferon, J. W. Fowler ed. ON THE APPROXIMATION ERROR IN HIGH DIMENSIONAL MODEL REPRESENTATION Xiaoqun Wang
More informationR. W. Erickson. Department of Electrical, Computer, and Energy Engineering University of Colorado, Boulder
R. W. Erickon Department of Electrical, Computer, and Energy Engineering Univerity of Colorado, Boulder Cloed-loop buck converter example: Section 9.5.4 In ECEN 5797, we ued the CCM mall ignal model to
More informationRaneNote BESSEL FILTER CROSSOVER
RaneNote BESSEL FILTER CROSSOVER A Beel Filter Croover, and It Relation to Other Croover Beel Function Phae Shift Group Delay Beel, 3dB Down Introduction One of the way that a croover may be contructed
More informationDigital Transmission of Analog Signals: PCM, DPCM and DM
A T CHAPTER 6 Digital Tranmiion of Analog Signal: PCM, DPCM and DM 6.1 Introduction Quite a few of the information bearing ignal, uch a peech, muic, video, etc., are analog in nature; that i, they are
More informationFilter Dispersion. with respect to frequency otherwise signal dispersion (and thus signal distortion) will result. Right?
3/1/005 Filter Diperion.doc 1/6 Filter Diperion Any ignal that carrie ignificant information mut ha ome non-zero bandwidth. In other word, the ignal energy (a well a the information it carrie) i pread
More information16.36 Communication Systems Engineering
MIT OpenCourseWare http://ocw.mit.edu 16.36 Communication Systems Engineering Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 16.36: Communication
More informationDYNAMIC MODELS FOR CONTROLLER DESIGN
DYNAMIC MODELS FOR CONTROLLER DESIGN M.T. Tham (996,999) Dept. of Chemical and Proce Engineering Newcatle upon Tyne, NE 7RU, UK.. INTRODUCTION The problem of deigning a good control ytem i baically that
More informationDepartment of Mechanical Engineering Massachusetts Institute of Technology Modeling, Dynamics and Control III Spring 2002
Department of Mechanical Engineering Maachuett Intitute of Technology 2.010 Modeling, Dynamic and Control III Spring 2002 SOLUTIONS: Problem Set # 10 Problem 1 Etimating tranfer function from Bode Plot.
More informationOnline Appendix for Managerial Attention and Worker Performance by Marina Halac and Andrea Prat
Online Appendix for Managerial Attention and Worker Performance by Marina Halac and Andrea Prat Thi Online Appendix contain the proof of our reult for the undicounted limit dicued in Section 2 of the paper,
More informationCHAPTER 6. Estimation
CHAPTER 6 Etimation Definition. Statitical inference i the procedure by which we reach a concluion about a population on the bai of information contained in a ample drawn from that population. Definition.
More information4th National Conference on Electrical, Electronics and Computer Engineering (NCEECE 2015)
4th National Conference on Electrical, Electronic and Computer Engineering (NCEECE 25) The Reearch on Anti-interference Performance of Ambiguity Function Baed Digital Communication Sytem Xiaodong Han,
More informationEE Control Systems LECTURE 14
Updated: Tueday, March 3, 999 EE 434 - Control Sytem LECTURE 4 Copyright FL Lewi 999 All right reerved ROOT LOCUS DESIGN TECHNIQUE Suppoe the cloed-loop tranfer function depend on a deign parameter k We
More informationCharacterizing the Effect of Channel Estimation Error on Distributed Reception with Hard Decision Exchanges
Characterizing the Effect of Channel Etimation Error on Ditributed Reception with Hard Deciion Exchange Sabah Razavi and D. Richard Brown III Department of Electrical and Computer Engineering Worceter
More informationSUPPLEMENTARY INFORMATION
DOI: 10.1038/NPHOTON.014.108 Supplementary Information "Spin angular momentum and tunable polarization in high harmonic generation" Avner Fleicher, Ofer Kfir, Tzvi Dikin, Pavel Sidorenko, and Oren Cohen
More informationLecture 2. Capacity of the Gaussian channel
Spring, 207 5237S, Wireless Communications II 2. Lecture 2 Capacity of the Gaussian channel Review on basic concepts in inf. theory ( Cover&Thomas: Elements of Inf. Theory, Tse&Viswanath: Appendix B) AWGN
More informationEE6604 Personal & Mobile Communications. Week 13. Multi-antenna Techniques
EE6604 Personal & Mobile Communications Week 13 Multi-antenna Techniques 1 Diversity Methods Diversity combats fading by providing the receiver with multiple uncorrelated replicas of the same information
More informationChapter 4: Continuous channel and its capacity
meghdadi@ensil.unilim.fr Reference : Elements of Information Theory by Cover and Thomas Continuous random variable Gaussian multivariate random variable AWGN Band limited channel Parallel channels Flat
More informationEfficient Methods of Doppler Processing for Coexisting Land and Weather Clutter
Efficient Method of Doppler Proceing for Coexiting Land and Weather Clutter Ça gatay Candan and A Özgür Yılmaz Middle Eat Technical Univerity METU) Ankara, Turkey ccandan@metuedutr, aoyilmaz@metuedutr
More informationPerformance Analysis of Multiple Antenna Systems with VQ-Based Feedback
Performance Analysis of Multiple Antenna Systems with VQ-Based Feedback June Chul Roh and Bhaskar D. Rao Department of Electrical and Computer Engineering University of California, San Diego La Jolla,
More informationLinear Motion, Speed & Velocity
Add Important Linear Motion, Speed & Velocity Page: 136 Linear Motion, Speed & Velocity NGSS Standard: N/A MA Curriculum Framework (006): 1.1, 1. AP Phyic 1 Learning Objective: 3.A.1.1, 3.A.1.3 Knowledge/Undertanding
More information11.5 MAP Estimator MAP avoids this Computational Problem!
.5 MAP timator ecall that the hit-or-mi cot function gave the MAP etimator it maimize the a oteriori PDF Q: Given that the MMS etimator i the mot natural one why would we conider the MAP etimator? A: If
More information5.5 Sampling. The Connection Between: Continuous Time & Discrete Time
5.5 Sampling he Connection Between: Continuou ime & Dicrete ime Warning: I don t really like how the book cover thi! It i not that it i wrong it jut ail to make the correct connection between the mathematic
More information