EE4512 Analog and Digital Communications Chapter 4. Chapter 4 Receiver Design
|
|
- Stephany Marlene Stevenson
- 6 years ago
- Views:
Transcription
1 Chapter 4 Receiver Design
2 Chapter 4 Receiver Design Probability of Bit Error Pages
3 Probability of Bit Error The low pass filtered and sampled PAM signal results in an expression for the probability of bit error P b (S&M p ). 127). A is the amplitude at the sampling point and γ is the attenuation of the channel (0 γ 1) P{ ith bit in error } = P(b i = 0) P{ n o [ (i-1) 1)T b + T b /2 ] < γa A } + P(b i = 1) P{ n o [ (i-1) 1)T b + T b /2 ] γa A }
4 Review of Probability and Stochastic Processes (S&M p ) 132) Probability distribution function F X (a) = P{ X = a } Probability density function f X (x) = d F X (x) / dx Mean (or expected value) µ X = x f X (x) dx Variance σ X2 = (x µ X ) f X (x) dx E { (X( µ X ) 2 }
5 Review of Probability and Stochastic Processes (S&M p ) 132) Joint probability distribution function Joint probability density function F X,Y (a (a,, b) = P{ X = a and Y = b } f X,Y (x, y)) = 2 F X,Y (x, y) / x y Conditional probabilities P { X > a and event Z } = P { event Z } P{ X > a event Z }
6 Chapter 4 Receiver Design Examining Thermal Noise Pages
7 Johnson Nyquist noise or thermal noise is the electronic noise generated by the thermal agitation of the charge carriers (usually the electrons) ) inside an electrical conductor at equilibrium. This thermal noise was first measured by John B. Johnson at Bell Labs in He described his findings to Harry Nyquist,, also at Bell Labs, who was able to explain the results. Harry Nyquist
8 Thermal (or Gaussian) noise is approximately white, meaning that the power spectral density is equal throughout the frequency spectrum.. Additionally, the amplitude of the signal has very nearly a Gaussian probability density function with mean µ n = 0. S&M Figure 4-34 µ n = 0 σ n = 1
9 Since thermal noise has a Gaussian probability density function the probability that a noise voltage n(t) ) at time t o will be less than or equal to a threshold γa A is (S&M Eq. 4.27): γa 1 (x -µ 2 ) ( n) P{ n(to γa } = FX γa) = exp dx 2 2π σ 2σ n n and the probability that a noise voltage n(t) ) at time t o will be greater than a threshold γa is (S&M Eq. 4.28): 2 1 (x -µ ) > ( n) P{ n(to γa } = 1 FX γa) = exp 2 dx γa 2π σn 2σn
10 The probabilistic properties of thermal noise do not change with time (stationarity( stationarity). Thermal noise is an insidious property of communication systems that limits the speed of reliable data transmission and the detection of weak signals.
11 A MATLAB and Simulink simulation verifies the spectral characteristics of thermal noise and the performance of low-pass filtered f cutoff = khz thermal noise. MS Figure 1.11
12 Thermal noise PSD = N o, f MS Figure 1.12 N o N o (single-sided sided spectrum) N o Thermal noise LPF PSD = N o, f < khz N o khz
13 Thermal noise PSD = N o, f MS Figure 1.12 uncorrelated Thermal noise autocorrelation MS Figure 1.14 uncorrelated
14 Thermal noise LPF PSD = N o, f < khz uncorrelated LPF thermal noise autocorrelation MS Figure 1.14 correlated
15 Simulink Histogram block from the Statistics, Signal Processing Blockset is analogous to the pdf. The Vector Scope block from the Sinks, Signal Processing Blockset, displays the histogram. Simulink blocks to calculate the mean µ and variance σ 2 are in Statistics. NoiseHistogram.mdl
16 Thermal noise histogram display µ = 10 σ 2 = 1 Gaussian pdf LPF f cutoff = 1 khz thermal noise histogram display µ = σ o2 = 0.64 pdf remains Gaussian after LPF
17 LPF thermal noise has an average normalized power: σ 2 o = N o f cutoff (S&M p. 135) The probability that the ith-bit is received in error is: P(b = 0) P{ n(t ) < γa } + P(b = 1) P{ n(t ) γa } = i o i o γa 2 1 (x -µ o ) P(b i = 0) exp 2 dx + 2π σo 2σo 2 1 (x -µ o ) P(b i = 1) exp 2 dx γa 2π σo 2σo
18 If and only if the binary thresholds are symmetrical ( γa( and γa), the P(b i = 0) + P(b i = 1) = 1 and the Gaussian normal pdfs are symmetrical the probability that the ith-bit is received in error becomes (S&M p. 136): P(b = 0) P{ n(t ) < γa } + P(b = 1) P{ n(t ) γa } = i o i o γa 1 2π σ o (x -µ o ) exp 2 2σo 2 dx -γa γa
19 Chapter 4 Receiver Design Gaussian Probability Density Function, Probability of Bit Error Pages
20 Gaussian (normal) probability density function (pdf)
21 Gaussian (normal) probability distribution function
22 Gaussian (Normal) Probability Distribution Abraham de Moivre was a French mathematician famous for de Moivre's formula,, which links complex numbers and trigonometry,, and for his work on the normal distribution and probability theory in He wrote a book on probability theory entitled The Doctrine of Chances which was said to be highly prized by gamblers Gauss rigorously justified and extended the work in 1809.
23 Gaussian (Normal) Probability Distribution Johann Carl Friedrich Gauss was a German mathematician and scientist who contributed significantly to many fields, including number theory, geometry, electrostatics, astronomy and optics
24 Gaussian pdfs µ = 0, σ = 1 S&M Figure 4-6a4 µ = 1.6, σ = 1 S&M Figure 4-6b4
25 Gaussian pdfs µ = 0, σ = 2 S&M Figure 4-6c4 µ = 1, σ = 2 S&M Figure 4-6d4
26 The probability of bit error is the area under the Gaussian pdf from the threshold a to which could be tabulated. However, the probability of bit error is determined by three independent variables (a,( µ and σ) ) and this would be an unwieldy table. Q-function S&M Figure 4-74
27 Rather, construct a single table with µ =0 and σ = 1 for the probability of bit error as the area under the Gaussian pdf as a function of the threshold a only which is known as the complementary error or Q-function. Q-function S&M Figure 4-74
28 The Q-function for µ =0 and σ = 1 as a function of the threshold a is listed in Table 4-14 (S&M p. 141) and Appendix B (MS p )
29 Reading the Q-function table correctly What is Q(1.82)? What is Q(2.63)? What is Q(3.18)?
30 Reading the Q-function table correctly Q(1.82) = Q(2.63) = Q(3.18) =
31 What if µ 0? It can be shown that the Q-function table remains valid if the threshold variable in the table is changed from a to a µ.. Note that the areas under the Gaussian pdfs are the same. S&M Figure 4-8a4 Figure 4-8b4 a a µ
32 What if µ 0 and σ 1? It can also be shown that the Q-function table remains valid if the threshold variable in the table is first changed from a to a µ and a S&M Figure 4-9a4 Figure 4-9b4 a µ
33 then the threshold variable in the Q-function table is changed from a µ to (a( µ) ) / σ. Note that argument on the x-axis is compressed by σ and the y-axis is expanded by σ. a µ S&M Figure 4-9b4 Figure 4-9c4 (a µ) / σ
34 For simple baseband PAM the probability of bit error P b is expressed by the Q-function: Q noise margin of sampled value P b = Q average normalized noise power at the input to the single point sampler sampling at T b /2 binary rectangular PAM data with AWGN
35 Chapter 4 Receiver Design Optimal Receiver: The Matched Filter or Correlation Receiver Pages
36 The simple baseband PAM receiver structure is: But is this the best that there is?? What about sampling an odd number of times (like 3) during each bit time T b? T b
37 Although sampling can be increased to a very large, odd number of samples during T b, there is an optimal way: Since LPF in PAM improved performance, assume that the optimal processing is a linear filter H(f) ) (S&M p. 150)
38 After development (S&M p ) 153) the optimal processing is a linear filter H o (f) The optimal linear filter H o (f) ) has an impulse response h o (t) ) and is known as a matched filter since the processing is matched to input signal s(t): H o(f) = k S (f) exp( j 2π f i Tb ) -1-1 h o(t) = F { H o(f) } = k F { S (f) exp( j 2π f i Tb ) } h (t) = k s(it t) o b impulse response matched to s(t)
39 The impulse response of the optimum filter h o (t) ) is a scaled (by k), time delayed (by iti b ) and time reversed (function of iti b t): h (t) = k s(it t) o b
40 When optimum processing is used the argument inside the Q-function Q is maximized (S&M p ) 154) and the probability of bit error P b is: P P P b b b r(i T b) h(i Tb) = Q maximum σ p r(i Tb) * h(i Tb) = Q maximum 2 σp 2 E b = Q S&M Eq No where E b is the energy per bit of the received signal. 2
41 The optimum filter H o (f) ) is equivalent to the correlation receiver (S&M p ). 156). Optimum Filter h (t) = k s(i t) o T b Correlation Receiver
42 Since the optimum filter H o (f) ) and the correlation receiver are equivalent, with s 1 (t) = s(t) ) for a matched filter and r(t) ) = γ s(t) ) where γ is the communication channel attenuation, the energy-per per-bit E b is (S&M p. 156, Eq 4.62): E b it b (i-1) T itb 2 2 = γ s(t) γ s(t) dt = γ s(t) dt b (i-1) T b
43 The expected or mean value a i (it b ) is the output of the correlation receiver when r(t) ) = γ s i (t) ) and n(t) ) = 0 where γ is the communication channel attenuation. it b a(i T )= γ s (t) s (t) dt S&M Eq i b i 1 (i-1) T b
44 P b = Q( (2 E b / N o ) ) and the ratio E b / N o can be expressed in db: 10 log 10 (E b / N o ). The resulting plot of P b verses E b / N o in db is a characteristic of binary symmetric PAM with AWGN. S&M Figure 4-144
45 Symmetric binary PAM implies that the two transmitted signals for binary 1 and binary 0 s(t) and the resulting outputs a(it b ) from the correlation receiver are equal in magnitude but opposite in sign: Threshold = 0 s bi=1 =1 (t) = s bi=0 (t) S&M Figure 4-154
46 The probability of bit error for equally-likely likely binary symmetric PAM is the sum of the error regions shown. P(b i =0) = P(b i =1) = 0.5 S&M Figure 4-164
47 The binary PAM signals are symmetrical and the threshold is 0 (equidistant( from the means or expected values ± a(it b ) ).). The error regions are equal in area. S&M Figure 4-164
48 The probability of bit error does not minimize if the correlation receiver threshold is misadjusted (τ 0). With a misadjusted threshold the apriori probabilities are now important since the area of the error regions are no longer equal. S&M Figure 4-174
49 The correlation receiver is also known as the integrate- and-dump dump which describes the process. matched filter or correlation receiver MS Figure 2.29
50 EE4512 Analog and Digital Communications Chapter 3 Chapter 2 Baseband Modulation and Demodulation Optimum Binary Baseband Receiver: The Correlation Receiver Pages
51 The correlation receiver can be simulated in Simulink: MS Figure 2.29
52 The Simulink Integrate and Dump block is in the Comm Filters, Communications Blockset
53 The parameters of the Simulink Integrate and Dump block are the integration period and offset in simulation samples. f simulation T simulation simulation = 50 khz simulation = 1/f simulation 0.02 msec T b = 1 msec simulation = Integration period = T b /T simulation = 1/ 0.02 = 50 samples Offset = 0 samples
54 The complete binary symmetrical rectangular PAM digital communication system with BER analysis and optimum receiver. MS Figure 2.30 Transmitter Receiver BER
55 Observed BER as a function of SNR for binary rectangular PAM in a LPF simple receiver (LPF( LPF) ) and the optimum correlation receiver (CR( CR) ) with normalized signal power = 25 W (MS Table 2.3 p. 27 and Table 2.6 p. 43). SNR db AWGN σ 2 V 2 BER (LPF( LPF) BER (CR( CR)
56 The energy per bit E b = V 2 -sec (S&M Eq. 4.62, p. 156) for rectangular ± 5 V PAM with the channel attenuation γ = 1: E b it b (i-1) T itb 2 2 = γ s(t) γ s(t) dt = γ s(t) dt b (i-1) T b The observed bit error rate (BER) can be compared to the theoretical probability of bit error P b (S&M Eq. 4.58, p. 154) to validate the basic simulation. P b 2 Eb = Q No
57 The ratio of the energy per bit E b to the noise power spectral density N o (E b / N o ) rather than the SNR is the conventional metric used for BER performance. E b it b (i-1) T itb 2 2 = γ s(t) γ s(t) dt = γ s(t) dt b P b 2 Eb = Q No (i-1) T b S&M Eq S&M Eq. 4.58
58 The BER and P b comparison (MS Table 2.7, p. 44): Table 2.7 Observed BER and Theoretical P b as a Function of E b / N o in a Binary Symmetrical Rectangular PAM Digital Communication System with Optimum Receiver E b / N o db BER P b
59 Chapter 4 Receiver Design Correlation Receiver for Asymmetric PAM, Optimum Thresholds, Synchronization Pages
60 Asymmetric PAM signals do not have equal means or expected values of the output of the correlation receiver: a 2 (it b ) a 1 (it b ) S&M Figure 4-194
61 The optimum threshold τ opt is again equidistant between the means or expected values of the output of the correlation receiver: τ opt a(i T )+a(i T ) = 2 b 1 2 b S&M Eq S&M Figure Here a 2 (it b ) + τ opt = a 1 (it b ) τopt and the threshold is equidistant from the means or expected values.
62 If the apriori probabilities are not equal then the optimum threshold τ opt is not equidistant from the means or expected value of output of the correlation receiver. An asymmetric binary PAM signal is shown: a 2 (it b ) a 1 (it b ) S&M Figure 4-234
63 The optimum threshold τ opt where the apriori probabilities are (1 M) ) and M (which sums to 1) is: τ opt = 2 σ ln ( M / (1 M) ) + a (i T ) a (i T ) o 2 b 1 b [ T T ] 2 a (i ) a (i ) 2 b 1 b S&M Eq if M = 0.5 then: τ opt a(i T )+a(i T ) = 2 b 1 2 b S&M Eq. 4.71
64 Asymmetric PAM with an optimum threshold τ opt has a probability of bit error P b : S&M Figure P P P b b b =Q a 1(i Tb) a 2(i Tb) 2 σo 2 [ a (i T ) a (i T ) ] N =Q σ = 1 b 2 b 2 o 2 o 4 σ o 2 S&M Eq and Eq itb E { ( )} 2 d = Q where E = d γ s 1(t) s 2(t) dt 2 No (i-1) Tb
65 The optimum correlation receiver for asymmetric binary PAM uses the difference signal s 1 (t) s 2 (t) as the reference: S&M Figure 4-204
66 The optimum correlation receiver can be reconfigured as an alternate but universal structure which can be used for both asymmetric or symmetric binary PAM signals: S&M Figure 4-214
67 If the apriori probabilities are not equal then the optimum threshold τ opt is not equidistant from the means or expected value of output of the correlation receiver. An asymmetric binary PAM signal is shown: a 2 (it b ) a 1 (it b ) S&M Figure 4-234
68 The optimum threshold τ opt where the apriori probabilities are (1 M) ) and M (which sums to 1) is: τ opt = 2 σ ln ( M / (1 M) ) + a (i T ) a (i T ) o 2 b 1 b [ T T ] 2 a (i ) a (i ) 2 b 1 b S&M Eq if M = 0.5 then: τ opt a(i T )+a(i T ) = 2 b 1 2 b S&M Eq. 4.71
69 The probability of bit error P b then is: S&M Eq a(i 1 Tb) τopt τ opt a(i 2 Tb) Pb = M Q + (1 M) Q σo σo ( ) 2 ( ) 2 a(i 1 Tb) τopt τ opt a(i 2 Tb) P = Q b M + (1 M) Q 2 No 2 No
70 If the apriori probabilities are equal (M( = 0.5): S&M Figure a(i T = 2 b)+a(i T 1 b) τopt 2 and P b becomes: P P b b ( ) 2 ( ) 2 a(i 1 Tb) τopt τ opt a(i 2 Tb) = 0.5 Q Q 2 No 2 No 2 ( ) a(i 1 Tb) - a(i 2 Tb) = Q Ed = Q S&M p N o 2 No
71 The BER and P b comparison (MS Table 2.8, p. 49): Table 2.8 Observed BER and Theoretical P b as a Function of E d / N o in an Asymmetrical Binary Rectangular PAM Digital Communication System with Optimum Receiver. E d / N o db BER P b
72 Since for binary rectangular PAM E d = 4 E b (S&M p. 168) the BER performance for asymmetric PAM is comparable to symmetric PAM if a E d / N o is reduced by 6 db (10 log (4) = 6) : E d / N o db BER Asymmetric PAM (MS Table 2.8, p. 49) P b E b / N o db BER P b Symmetric PAM (MS Table 2.7, p. 44)
73 Chapter 2 Baseband Modulation and Demodulation The Correlation Receiver for Baseband Asymmetrical Signals Pages
74 The optimum threshold τ opt requires the additive Gaussian noise variance σ 2 as processed by the correlation receiver or σ o2 : τ opt = 2 σ ln ( M / (1 M) ) + a (i T ) a (i T ) o 2 b 1 b [ T T ] 2 a (i ) a (i ) 2 b 1 b σ o MS Figure 2.31
75 The optimum threshold τ opt also requires the apriori probabilities P 1 = M and P 0 = M 1: τ opt = 2 σ ln ( M / (1 M ) ) + a (i T ) a (i T ) o 2 b 1 b [ T T ] 2 a (i ) a (i ) 2 b 1 b Here P 1 = = M and P 0 = 1 M = Mean MS Figure 2.32
76 The Mean and Variance blocks are in the Statistics, Signal Processing Blockset
77 The parameter of the Mean block can be set for running mean or an average over the simulation period. The result can be shown by a Display block from the Simulink Blockset. MS Figure 2.32
78 The parameter of the Variance block can be set for running variance or an average over the simulation period. The result can be shown by a Display block from the Simulink Blockset.
79 The Simulink simulation for binary asymmetrical PAM with BER analysis has a threshold adjustment based on the estimate of τ opt from measurements of σ o and M. τ opt = 2 σ ln ( M / (1 M) ) + a (i T ) a (i T ) o 2 b 1 b [ T T ] 2 a (i ) a (i ) 2 b 1 b Reference MS Figure 2.33 Threshold
80 The Simulink simulation for the alternative and universal structure for the correlation receiver: MS Figure 2.34 S&M Figure 4-214
81 Synchronization (not considered here) provides timing recovery or the exact beginning and end of a bit time T b : S&M Figure start of T b?
82 Synchronization of both symbol time and carrier frequency and phase is one of the advanced topics in EE4542 Telecommunications Engineering.. The effect is called jitter.
83 Chapter 4 Receiver Design Multi-level level PAM (M-ary PAM) Pages
84 Multi-level level (M-ary) PAM is another means to minimize the bandwidth required for a data transmission rate r b b/sec. Rather than transmitting a binary signal in a bit time T b, send a multi-level level (usually a power-of of-2) signal during the same period called the symbol time T S. A multi-state comparator determines the received symbol which is then decoded to the received bits. S&M Figure M = 4
85 The three optimum thresholds if the apriori probabilities are equally likely (P i = 0.25) are: τ τ τ opt1 opt2 opt3 = = = a(i T )+a(i T ) 1 S 2 2 a(i T )+a(i T ) 2 S 3 2 a(i T )+a(i T ) 3 S 4 2 S S S S&M Figure 4.49 S&M Eq
86 The probability of symbol error P s, where M = 2 n is the number of levels, can be shown to be: where: E d,symbol i T { } j k = γ s(t)-s (t) dt s (i-1) T ( ) E 2M 1 P= s Q M 2N s d,symbol o 2 M = 4 S&M Eq S&M Eq
87 There are 2 (M 1) error regions due to only M = 4 adjacent regions being misinterpreted with M = 2 n equally probable symbols. The probability of occurrence P j for a misinterpreted symbol is also equally likely and is: 1 P= j 2M 1 SVU Eq ( )
88 The amplitudes of the M-ary M (M = 4) rectangular PAM signal is ± 3A and ± A. The energy difference for a symbol E d,symbol = 4γ4 2 A 2 T S (S&M Eq ): E d,symbol i T { } j k = γ s(t)-s (t) dt s (i-1) T s 2 The average received energy per symbol E avg,symbol 5γ 2 A 2 T S (S&M Eq ) avg,symbol = S&M Figure modified M =
89 Then E d,symbol = 0.4 E avg,symbol and substitute (M = 4): 3 E P= s Q 2 2N d,symbol o S&M Eq b 3 P= s Q E N avg,symbol o S&M Eq a S&M Figure modified M =
90 The average energy per bit E b = 0.5 E avg,symbol since M =4 and there are two bits per symbol: 3 P= s Q E N avg,symbol o S&M Eq a 3 P= s Q N o E b 10 S&M Eq b S&M Figure modified M =
91 The symbols transmitted can have 1 bit in error 4 / 6 of the time and 2 bits in error 2 / 6 of the time: Transmitted Di-Bit Received Di-Bit Bits In Error Pb,4-level = P(1 of 2 bits in error) + P(2 of 2 bits in error) Pb,4-level = Ps + Ps = P S&M Eq s
92 The probability of bit error P b,4-symbol = 2 P s / 3 but can that be improved? Change the assignment of symbols to di- bits as a Gray code and there is only 1 bit in error for each of the six error regions and P b,4-symbol = P s / 2 Transmitted Di-Bit Received Di-Bit Bits In Error Pb,4-level = P(1 of 2 bits in error) Pb,4-level = Ps = Ps 62 2
93 The simple change to a Gray coded symbol improves the probability of bit error P b : P P b b E b 0.8 Eb = Q = Q 32 No No E b Eb = Q = Q 22 No 4 No Straight binary coded Gray coded S&M Figure
94 Frank Gray was a researcher at Bell Labs s who made numerous innovations in television and is remembered for the Gray code.. The Gray code appeared in his 1953 patent and is a binary system often used in electronics.. Gray also conducted pioneering research on the development of television.. He proposed an early form of the flying spot scanning system for TV cameras in 1927, and helped develop a two-way way mechanically scanned TV system in Frank Gray
95 Chapter 2 Baseband Modulation and Demodulation Multilevel (M-ary) Pulse Amplitude Modulation Pages 49-55
96 The Simulink simulation of a 4-level 4 straight binary (not( Gray coded) ) rectangular PAM system with BER analysis: Transmitter MS Figure 2.35 Receiver BER bit to symbol converter symbol to bit converter
97 Although Simulink provides a Bit to Integer block and an Integer to Bit block from the Utility Blocks, Communication Blockset, these blocks use a vector of bits rather than from and to a serial bitstream.
98 A bit to symbol converter Simulink subsystem can be configured from Downsampler blocks and a Delay block from the Signal Operations, Signal Processing Blockset and the Gain and Sum blocks from the Simulink, Math Operations to produce the 4-level 4 PAM signal (0, 1, 2 or 3) from the input di-bit (00, 01, 10, or 11) with the most significant bit (MSB) first. MS Figure 2.36
99 The Simulink bit to symbol converter can be easily reconfigured to produce an 8-level 8 PAM signal (0, 1, 2, 7) from the input tri-bit (000, 001, 111) with the most significant bit (MSB) first. MS Figure 2.37
100 A symbol to bit converter Simulink subsystem can be configured from Constant blocks, Pulse Generator blocks and a Multiport Switch block from the Signal Routing, Simulink Blockset to produce the di-bit (MSB first) from the 4-level PAM signal. MS Figure 2.40
101 A symbol to bit converter Simulink subsystem can be easily reconfigured to produce the tri-bit (MSB first) from an 8-level 8 PAM signal. MS Figure 2.41
102 Binary data to 4-level 4 PAM converter MS Figure 2.36
103 Transmit binary data, r b = 1 kb/sec 01 MSB LSB Transmit 4-level 4 PAM signal, r S = 500 symbols/sec 1
104 M-ary PAM transmits n bits per symbol (M = 2 n ) but has the same rectangular pulse shape as binary PAM. The normalized power spectral density for M-ary M PAM PSD M has the same sinc shape as that for binary PAM PSD B but uses the symbol time T S rather than the bit time T b : M 2 avg ( TS ) ( T ) PSD (f) = A T sinc π f 2 PSD B(f) = A Tb sinc π b f S
105 Observed BER and theoretical P b as a function of E b / N o in a 4-level4 rectangular straight-binary coded PAM digital communication system with optimum receiver (MS Table 2.11 p. 58). E b / N o db BER P b
106 The M-ary M PAM PSD uses the average amplitude A avg where P j is the apriori probability of occurrence of the amplitude A j. 2 M = 2 A A P avg j j j=1 avg,
107 The M-ary M (M = 4) PAM PSD can be determined by a Simulink model Fig239.mdl MS Figure 2.39
108 The Simulink simulation of a 4-level 4 straight binary (not( Gray coded) ) rectangular PAM system measures the BER performance. MS Figure 2.35 Transmitter Receiver BER
109 The rectangular M-ary M pulse width is the entire symbol time T S and is optimum in the bandwidth sense. The bandwidth is similar to that for binary PAM but with T b = T S (cf. S&M Table p. 86). Table Bandwidth of a Binary Rectangular M-ary M PAM Signal as a Percentage of the Total Power (MS p. 53) Bandwidth (Hz) Percentage of Total Power 1/T S 90% 1.5/T S 93% 2/T S 95% 3/T S 96.5% 4/T S 97.5% 5/T S 98%
110 PSD M M = 4, r b = 1 kb/sec, first null bandwidth = 500 Hz 500 Hz PSD B r b = 1 kb/sec, first null bandwidth = 1 khz 1 khz
111 Chapter 2 Baseband Modulation and Demodulation Performance of M-ary M Pulse Amplitude Modulation Gray Encoded Data Pages 57-60
112 The Simulink simulation of a 4-level 4 straight binary Gray encoded rectangular PAM system with BER analysis: Transmitter MS Figure 2.42 Receiver bit to Gray encoded symbol converter BER Gray encoded symbol to bit converter
113 The M = 4 level symbol (0, 1, 2 and 3) is Gray encoded by a Lookup Table Block from the Simulink Blockset. MS Figure 2.43 M = 4 symbol bit to Gray encoded symbol converter
114 The M = 4 level symbol (0, 1, 2 and 3) is Gray encoded by a Lookup Table Block from the Simulink Blockset.
115 The M = 4 level symbol (0, 1, 2, and 3) is Gray encoded by a Lookup Table Block by mapping [0, 1, 2, 3] to [0, 1, 3, 2] Gray coding
116 The M = 4 level Gray encoded symbol is decoded as di-bits by a Lookup Table Block from the Simulink Blockset. M = 4 symbol MS Figure 2.44 Gray encoded symbol to bit converter
117 The M = 4 level symbol (0, 1, 2, and 3) is Gray decoded by a Lookup Table Block by mapping [0, 1, 2, 3] to [0, 1, 3, 2] Gray coding
118 The PSD of a Gray coded rectangular PAM signal is the same as a straight-binary rectangular PAM signal. The coding does not change the PSD. The PSD is only affected by the pulse shape and data rate. PSD M M = 4, r b = 1 kb/sec, first null bandwidth = 500 Hz 500 Hz
119 The Simulink simulation of a 4-level 4 straight binary Gray encoded rectangular PAM system measures the BER performance. MS Figure 2.42 Transmitter Receiver BER
120 Observed BER and theoretical P b as a function of E b / N o in a 4-level4 rectangular Gray coded PAM digital communication system with optimum receiver (MS Table 2.12 p. 60). E b / N o db BER P b
121 Observed BER as a function of E b / N o for binary rectangular PAM for straight-binary coded (SBC( SBC) ) and Gray coded (GC) data (MS Table 2.11 p. 58 and MS Table 2.12 p. 60). E b / N o db BER (SBC( SBC) BER (GC( GC) Although a slight improvement, Gray coding improves BER performance without an increase in E b.
122 End of Chapter 4 Receiver Design
Principles of Communications
Principles of Communications Chapter V: Representation and Transmission of Baseband Digital Signal Yongchao Wang Email: ychwang@mail.xidian.edu.cn Xidian University State Key Lab. on ISN November 18, 2012
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 informationDigital Baseband Systems. Reference: Digital Communications John G. Proakis
Digital Baseband Systems Reference: Digital Communications John G. Proais Baseband Pulse Transmission Baseband digital signals - signals whose spectrum extend down to or near zero frequency. Model of the
More informationEE5713 : Advanced Digital Communications
EE5713 : Advanced Digital Communications Week 12, 13: Inter Symbol Interference (ISI) Nyquist Criteria for ISI Pulse Shaping and Raised-Cosine Filter Eye Pattern Equalization (On Board) 20-May-15 Muhammad
More informationLecture 5b: Line Codes
Lecture 5b: Line Codes Dr. Mohammed Hawa Electrical Engineering Department University of Jordan EE421: Communications I Digitization Sampling (discrete analog signal). Quantization (quantized discrete
More informationA First Course in Digital Communications
A First Course in Digital Communications Ha H. Nguyen and E. Shwedyk February 9 A First Course in Digital Communications 1/46 Introduction There are benefits to be gained when M-ary (M = 4 signaling methods
More informationPrinciples of Communications
Principles of Communications Weiyao Lin, PhD Shanghai Jiao Tong University Chapter 4: Analog-to-Digital Conversion Textbook: 7.1 7.4 2010/2011 Meixia Tao @ SJTU 1 Outline Analog signal Sampling Quantization
More informationEs e j4φ +4N n. 16 KE s /N 0. σ 2ˆφ4 1 γ s. p(φ e )= exp 1 ( 2πσ φ b cos N 2 φ e 0
Problem 6.15 : he received signal-plus-noise vector at the output of the matched filter may be represented as (see (5-2-63) for example) : r n = E s e j(θn φ) + N n where θ n =0,π/2,π,3π/2 for QPSK, and
More informationDigital Transmission Methods S
Digital ransmission ethods S-7.5 Second Exercise Session Hypothesis esting Decision aking Gram-Schmidt method Detection.K.K. Communication Laboratory 5//6 Konstantinos.koufos@tkk.fi Exercise We assume
More information2. SPECTRAL ANALYSIS APPLIED TO STOCHASTIC PROCESSES
2. SPECTRAL ANALYSIS APPLIED TO STOCHASTIC PROCESSES 2.0 THEOREM OF WIENER- KHINTCHINE An important technique in the study of deterministic signals consists in using harmonic functions to gain the spectral
More informationA Family of Nyquist Filters Based on Generalized Raised-Cosine Spectra
Proc. Biennial Symp. Commun. (Kingston, Ont.), pp. 3-35, June 99 A Family of Nyquist Filters Based on Generalized Raised-Cosine Spectra Nader Sheikholeslami Peter Kabal Department of Electrical Engineering
More informationEE401: Advanced Communication Theory
EE401: Advanced Communication Theory Professor A. Manikas Chair of Communications and Array Processing Imperial College London Introductory Concepts Prof. A. Manikas (Imperial College) EE.401: Introductory
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 informationCHAPTER 14. Based on the info about the scattering function we know that the multipath spread is T m =1ms, and the Doppler spread is B d =0.2 Hz.
CHAPTER 4 Problem 4. : Based on the info about the scattering function we know that the multipath spread is T m =ms, and the Doppler spread is B d =. Hz. (a) (i) T m = 3 sec (ii) B d =. Hz (iii) ( t) c
More informationEE 661: Modulation Theory Solutions to Homework 6
EE 66: Modulation Theory Solutions to Homework 6. Solution to problem. a) Binary PAM: Since 2W = 4 KHz and β = 0.5, the minimum T is the solution to (+β)/(2t ) = W = 2 0 3 Hz. Thus, we have the maximum
More informationEE303: Communication Systems
EE303: Communication Systems Professor A. Manikas Chair of Communications and Array Processing Imperial College London Introductory Concepts Prof. A. Manikas (Imperial College) EE303: Introductory Concepts
More informationEE4304 C-term 2007: Lecture 17 Supplemental Slides
EE434 C-term 27: Lecture 17 Supplemental Slides D. Richard Brown III Worcester Polytechnic Institute, Department of Electrical and Computer Engineering February 5, 27 Geometric Representation: Optimal
More informationDirect-Sequence Spread-Spectrum
Chapter 3 Direct-Sequence Spread-Spectrum In this chapter we consider direct-sequence spread-spectrum systems. Unlike frequency-hopping, a direct-sequence signal occupies the entire bandwidth continuously.
More informationPerformance Analysis of Spread Spectrum CDMA systems
1 Performance Analysis of Spread Spectrum CDMA systems 16:33:546 Wireless Communication Technologies Spring 5 Instructor: Dr. Narayan Mandayam Summary by Liang Xiao lxiao@winlab.rutgers.edu WINLAB, Department
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 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 informationE303: Communication Systems
E303: Communication Systems Professor A. Manikas Chair of Communications and Array Processing Imperial College London Principles of PCM Prof. A. Manikas (Imperial College) E303: Principles of PCM v.17
More informationResidual Versus Suppressed-Carrier Coherent Communications
TDA Progress Report -7 November 5, 996 Residual Versus Suppressed-Carrier Coherent Communications M. K. Simon and S. Million Communications and Systems Research Section This article addresses the issue
More informationWeiyao Lin. Shanghai Jiao Tong University. Chapter 5: Digital Transmission through Baseband slchannels Textbook: Ch
Principles of Communications Weiyao Lin Shanghai Jiao Tong University Chapter 5: Digital Transmission through Baseband slchannels Textbook: Ch 10.1-10.5 2009/2010 Meixia Tao @ SJTU 1 Topics to be Covered
More informationOne Lesson of Information Theory
Institut für One Lesson of Information Theory Prof. Dr.-Ing. Volker Kühn Institute of Communications Engineering University of Rostock, Germany Email: volker.kuehn@uni-rostock.de http://www.int.uni-rostock.de/
More informationVID3: Sampling and Quantization
Video Transmission VID3: Sampling and Quantization By Prof. Gregory D. Durgin copyright 2009 all rights reserved Claude E. Shannon (1916-2001) Mathematician and Electrical Engineer Worked for Bell Labs
More informationPrinciples of Communications
Principles of Communications Weiyao Lin Shanghai Jiao Tong University Chapter 10: Information Theory Textbook: Chapter 12 Communication Systems Engineering: Ch 6.1, Ch 9.1~ 9. 92 2009/2010 Meixia Tao @
More informationa) Find the compact (i.e. smallest) basis set required to ensure sufficient statistics.
Digital Modulation and Coding Tutorial-1 1. Consider the signal set shown below in Fig.1 a) Find the compact (i.e. smallest) basis set required to ensure sufficient statistics. b) What is the minimum Euclidean
More informationConstellation Shaping for Communication Channels with Quantized Outputs
Constellation Shaping for Communication Channels with Quantized Outputs Chandana Nannapaneni, Matthew C. Valenti, and Xingyu Xiang Lane Department of Computer Science and Electrical Engineering West Virginia
More informationDigital Modulation 1
Digital Modulation 1 Lecture Notes Ingmar Land and Bernard H. Fleury Navigation and Communications () Department of Electronic Systems Aalborg University, DK Version: February 5, 27 i Contents I Basic
More informationSummary: SER formulation. Binary antipodal constellation. Generic binary constellation. Constellation gain. 2D constellations
TUTORIAL ON DIGITAL MODULATIONS Part 8a: Error probability A [2011-01-07] 07] Roberto Garello, Politecnico di Torino Free download (for personal use only) at: www.tlc.polito.it/garello 1 Part 8a: Error
More informationBASICS OF DETECTION AND ESTIMATION THEORY
BASICS OF DETECTION AND ESTIMATION THEORY 83050E/158 In this chapter we discuss how the transmitted symbols are detected optimally from a noisy received signal (observation). Based on these results, optimal
More informationParameter Estimation
1 / 44 Parameter Estimation Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay October 25, 2012 Motivation System Model used to Derive
More information7 The Waveform Channel
7 The Waveform Channel The waveform transmitted by the digital demodulator will be corrupted by the channel before it reaches the digital demodulator in the receiver. One important part of the channel
More informationPerformance of Coherent Binary Phase-Shift Keying (BPSK) with Costas-Loop Tracking in the Presence of Interference
TMO Progress Report 4-139 November 15, 1999 Performance of Coherent Binary Phase-Shift Keying (BPSK) with Costas-Loop Tracking in the Presence of Interference M. K. Simon 1 The bit-error probability performance
More information8 PAM BER/SER Monte Carlo Simulation
xercise.1 8 PAM BR/SR Monte Carlo Simulation - Simulate a 8 level PAM communication system and calculate bit and symbol error ratios (BR/SR). - Plot the calculated and simulated SR and BR curves. - Plot
More informationEE456 Digital Communications
EE456 Digital Communications Professor Ha Nguyen September 5 EE456 Digital Communications Block Diagram of Binary Communication Systems m ( t { b k } b k = s( t b = s ( t k m ˆ ( t { bˆ } k r( t Bits in
More informationThis examination consists of 11 pages. Please check that you have a complete copy. Time: 2.5 hrs INSTRUCTIONS
THE UNIVERSITY OF BRITISH COLUMBIA Department of Electrical and Computer Engineering EECE 564 Detection and Estimation of Signals in Noise Final Examination 6 December 2006 This examination consists of
More informationData Detection for Controlled ISI. h(nt) = 1 for n=0,1 and zero otherwise.
Data Detection for Controlled ISI *Symbol by symbol suboptimum detection For the duobinary signal pulse h(nt) = 1 for n=0,1 and zero otherwise. The samples at the output of the receiving filter(demodulator)
More informationThis examination consists of 10 pages. Please check that you have a complete copy. Time: 2.5 hrs INSTRUCTIONS
THE UNIVERSITY OF BRITISH COLUMBIA Department of Electrical and Computer Engineering EECE 564 Detection and Estimation of Signals in Noise Final Examination 08 December 2009 This examination consists of
More informationSignal Design for Band-Limited Channels
Wireless Information Transmission System Lab. Signal Design for Band-Limited Channels Institute of Communications Engineering National Sun Yat-sen University Introduction We consider the problem of signal
More informationANALYSIS OF A PARTIAL DECORRELATOR IN A MULTI-CELL DS/CDMA SYSTEM
ANAYSIS OF A PARTIA DECORREATOR IN A MUTI-CE DS/CDMA SYSTEM Mohammad Saquib ECE Department, SU Baton Rouge, A 70803-590 e-mail: saquib@winlab.rutgers.edu Roy Yates WINAB, Rutgers University Piscataway
More informationMATHEMATICAL TOOLS FOR DIGITAL TRANSMISSION ANALYSIS
ch03.qxd 1/9/03 09:14 AM Page 35 CHAPTER 3 MATHEMATICAL TOOLS FOR DIGITAL TRANSMISSION ANALYSIS 3.1 INTRODUCTION The study of digital wireless transmission is in large measure the study of (a) the conversion
More informationthat efficiently utilizes the total available channel bandwidth W.
Signal Design for Band-Limited Channels Wireless Information Transmission System Lab. Institute of Communications Engineering g National Sun Yat-sen University Introduction We consider the problem of signal
More informationMobile Communications (KECE425) Lecture Note Prof. Young-Chai Ko
Mobile Communications (KECE425) Lecture Note 20 5-19-2014 Prof Young-Chai Ko Summary Complexity issues of diversity systems ADC and Nyquist sampling theorem Transmit diversity Channel is known at the transmitter
More informationStochastic Processes. M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno
Stochastic Processes M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno 1 Outline Stochastic (random) processes. Autocorrelation. Crosscorrelation. Spectral density function.
More informationTSKS01 Digital Communication Lecture 1
TSKS01 Digital Communication Lecture 1 Introduction, Repetition, and Noise Modeling Emil Björnson Department of Electrical Engineering (ISY) Division of Communication Systems Emil Björnson Course Director
More informationPrinciples of Communications Lecture 8: Baseband Communication Systems. Chih-Wei Liu 劉志尉 National Chiao Tung University
Principles of Communications Lecture 8: Baseband Communication Systems Chih-Wei Liu 劉志尉 National Chiao Tung University cwliu@twins.ee.nctu.edu.tw Outlines Introduction Line codes Effects of filtering Pulse
More informationSummary II: Modulation and Demodulation
Summary II: Modulation and Demodulation Instructor : Jun Chen Department of Electrical and Computer Engineering, McMaster University Room: ITB A1, ext. 0163 Email: junchen@mail.ece.mcmaster.ca Website:
More information7.7 The Schottky Formula for Shot Noise
110CHAPTER 7. THE WIENER-KHINCHIN THEOREM AND APPLICATIONS 7.7 The Schottky Formula for Shot Noise On p. 51, we found that if one averages τ seconds of steady electron flow of constant current then the
More informationCoding theory: Applications
INF 244 a) Textbook: Lin and Costello b) Lectures (Tu+Th 12.15-14) covering roughly Chapters 1,9-12, and 14-18 c) Weekly exercises: For your convenience d) Mandatory problem: Programming project (counts
More informationR. Garello. Tutorial on digital modulations - Part 9b m-pam [ ] 2
TUTORIAL ON DIGITAL MODULATIONS Part 9: m-pam [2010-1-26] 26] Roerto Garello, Politecnico di Torino Free download at: www.tlc.polito.it/garello (personal use only) 1 m-pam constellations: characteristics
More informationMapper & De-Mapper System Document
Mapper & De-Mapper System Document Mapper / De-Mapper Table of Contents. High Level System and Function Block. Mapper description 2. Demodulator Function block 2. Decoder block 2.. De-Mapper 2..2 Implementation
More informationConsider a 2-D constellation, suppose that basis signals =cosine and sine. Each constellation symbol corresponds to a vector with two real components
TUTORIAL ON DIGITAL MODULATIONS Part 3: 4-PSK [2--26] Roberto Garello, Politecnico di Torino Free download (for personal use only) at: www.tlc.polito.it/garello Quadrature modulation Consider a 2-D constellation,
More informationFBMC/OQAM transceivers for 5G mobile communication systems. François Rottenberg
FBMC/OQAM transceivers for 5G mobile communication systems François Rottenberg Modulation Wikipedia definition: Process of varying one or more properties of a periodic waveform, called the carrier signal,
More informationElectrical Engineering Written PhD Qualifier Exam Spring 2014
Electrical Engineering Written PhD Qualifier Exam Spring 2014 Friday, February 7 th 2014 Please do not write your name on this page or any other page you submit with your work. Instead use the student
More informationUCSD ECE153 Handout #40 Prof. Young-Han Kim Thursday, May 29, Homework Set #8 Due: Thursday, June 5, 2011
UCSD ECE53 Handout #40 Prof. Young-Han Kim Thursday, May 9, 04 Homework Set #8 Due: Thursday, June 5, 0. Discrete-time Wiener process. Let Z n, n 0 be a discrete time white Gaussian noise (WGN) process,
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 informationDigital Communications: A Discrete-Time Approach M. Rice. Errata. Page xiii, first paragraph, bare witness should be bear witness
Digital Communications: A Discrete-Time Approach M. Rice Errata Foreword Page xiii, first paragraph, bare witness should be bear witness Page xxi, last paragraph, You know who you. should be You know who
More informationThe Performance of Quaternary Amplitude Modulation with Quaternary Spreading in the Presence of Interfering Signals
Clemson University TigerPrints All Theses Theses 1-015 The Performance of Quaternary Amplitude Modulation with Quaternary Spreading in the Presence of Interfering Signals Allison Manhard Clemson University,
More informationRevision of Lecture 4
Revision of Lecture 4 We have completed studying digital sources from information theory viewpoint We have learnt all fundamental principles for source coding, provided by information theory Practical
More informationMulticarrier transmission DMT/OFDM
W. Henkel, International University Bremen 1 Multicarrier transmission DMT/OFDM DMT: Discrete Multitone (wireline, baseband) OFDM: Orthogonal Frequency Division Multiplex (wireless, with carrier, passband)
More informationEE6604 Personal & Mobile Communications. Week 15. OFDM on AWGN and ISI Channels
EE6604 Personal & Mobile Communications Week 15 OFDM on AWGN and ISI Channels 1 { x k } x 0 x 1 x x x N- 2 N- 1 IDFT X X X X 0 1 N- 2 N- 1 { X n } insert guard { g X n } g X I n { } D/A ~ si ( t) X g X
More informationInformation Theory - Entropy. Figure 3
Concept of Information Information Theory - Entropy Figure 3 A typical binary coded digital communication system is shown in Figure 3. What is involved in the transmission of information? - The system
More informationECE 564/645 - Digital Communications, Spring 2018 Homework #2 Due: March 19 (In Lecture)
ECE 564/645 - Digital Communications, Spring 018 Homework # Due: March 19 (In Lecture) 1. Consider a binary communication system over a 1-dimensional vector channel where message m 1 is sent by signaling
More informationECE Homework Set 3
ECE 450 1 Homework Set 3 0. Consider the random variables X and Y, whose values are a function of the number showing when a single die is tossed, as show below: Exp. Outcome 1 3 4 5 6 X 3 3 4 4 Y 0 1 3
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 informationELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization
ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals 1. Sampling and Reconstruction 2. Quantization 1 1. Sampling & Reconstruction DSP must interact with an analog world: A to D D to A x(t)
More informationLecture 15: Thu Feb 28, 2019
Lecture 15: Thu Feb 28, 2019 Announce: HW5 posted Lecture: The AWGN waveform channel Projecting temporally AWGN leads to spatially AWGN sufficiency of projection: irrelevancy theorem in waveform AWGN:
More information5. Pilot Aided Modulations. In flat fading, if we have a good channel estimate of the complex gain gt, ( ) then we can perform coherent detection.
5. Pilot Aided Modulations In flat fading, if we have a good channel estimate of the complex gain gt, ( ) then we can perform coherent detection. Obtaining a good estimate is difficult. As we have seen,
More informationBlock 2: Introduction to Information Theory
Block 2: Introduction to Information Theory Francisco J. Escribano April 26, 2015 Francisco J. Escribano Block 2: Introduction to Information Theory April 26, 2015 1 / 51 Table of contents 1 Motivation
More information2A1H Time-Frequency Analysis II
2AH Time-Frequency Analysis II Bugs/queries to david.murray@eng.ox.ac.uk HT 209 For any corrections see the course page DW Murray at www.robots.ox.ac.uk/ dwm/courses/2tf. (a) A signal g(t) with period
More informationChapter [4] "Operations on a Single Random Variable"
Chapter [4] "Operations on a Single Random Variable" 4.1 Introduction In our study of random variables we use the probability density function or the cumulative distribution function to provide a complete
More informationSignals and Spectra - Review
Signals and Spectra - Review SIGNALS DETERMINISTIC No uncertainty w.r.t. the value of a signal at any time Modeled by mathematical epressions RANDOM some degree of uncertainty before the signal occurs
More informationFACULTY OF ENGINEERING MULTIMEDIA UNIVERSITY LAB SHEET
FACULTY OF ENGINEERING MULTIMEDIA UNIVERSITY LAB SHEET ETM 3136 Digital Communications Trimester 1 (2010/2011) DTL1: Pulse Code Modulation (PCM) Important Notes: Students MUST read this lab sheet before
More informationModule 4. Signal Representation and Baseband Processing. Version 2 ECE IIT, Kharagpur
Module Signal Representation and Baseband Processing Version ECE II, Kharagpur Lesson 8 Response of Linear System to Random Processes Version ECE II, Kharagpur After reading this lesson, you will learn
More informationSolutions to Selected Problems
Solutions to Selected Problems from Madhow: Fundamentals of Digital Communication and from Johannesson & Zigangirov: Fundamentals of Convolutional Coding Saif K. Mohammed Department of Electrical Engineering
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 401 Digital Signal Processing Pro. Mark Fowler Note Set #14 Practical A-to-D Converters and D-to-A Converters Reading Assignment: Sect. 6.3 o Proakis & Manolakis 1/19 The irst step was to see that
More informationDigital Communications
Digital Communications Chapter 9 Digital Communications Through Band-Limited Channels Po-Ning Chen, Professor Institute of Communications Engineering National Chiao-Tung University, Taiwan Digital Communications:
More informationPSK bit mappings with good minimax error probability
PSK bit mappings with good minimax error probability Erik Agrell Department of Signals and Systems Chalmers University of Technology 4196 Göteborg, Sweden Email: agrell@chalmers.se Erik G. Ström Department
More informationQ. 1 Q. 25 carry one mark each.
GATE 5 SET- ELECTRONICS AND COMMUNICATION ENGINEERING - EC Q. Q. 5 carry one mark each. Q. The bilateral Laplace transform of a function is if a t b f() t = otherwise (A) a b s (B) s e ( a b) s (C) e as
More informationRevision of Lecture 4
Revision of Lecture 4 We have discussed all basic components of MODEM Pulse shaping Tx/Rx filter pair Modulator/demodulator Bits map symbols Discussions assume ideal channel, and for dispersive channel
More informationOptimized Impulses for Multicarrier Offset-QAM
Optimized Impulses for ulticarrier Offset-QA Stephan Pfletschinger, Joachim Speidel Institut für Nachrichtenübertragung Universität Stuttgart, Pfaffenwaldring 47, D-7469 Stuttgart, Germany Abstract The
More informationCommunication Theory Summary of Important Definitions and Results
Signal and system theory Convolution of signals x(t) h(t) = y(t): Fourier Transform: Communication Theory Summary of Important Definitions and Results X(ω) = X(ω) = y(t) = X(ω) = j x(t) e jωt dt, 0 Properties
More informationAnalog Digital Sampling & Discrete Time Discrete Values & Noise Digital-to-Analog Conversion Analog-to-Digital Conversion
Analog Digital Sampling & Discrete Time Discrete Values & Noise Digital-to-Analog Conversion Analog-to-Digital Conversion 6.082 Fall 2006 Analog Digital, Slide Plan: Mixed Signal Architecture volts bits
More informationChannel capacity. Outline : 1. Source entropy 2. Discrete memoryless channel 3. Mutual information 4. Channel capacity 5.
Channel capacity Outline : 1. Source entropy 2. Discrete memoryless channel 3. Mutual information 4. Channel capacity 5. Exercices Exercise session 11 : Channel capacity 1 1. Source entropy Given X a memoryless
More informationX b s t w t t dt b E ( ) t dt
Consider the following correlator receiver architecture: T dt X si () t S xt () * () t Wt () T dt X Suppose s (t) is sent, then * () t t T T T X s t w t t dt E t t dt w t dt E W t t T T T X s t w t t dt
More informationEE 521: Instrumentation and Measurements
Aly El-Osery Electrical Engineering Department, New Mexico Tech Socorro, New Mexico, USA September 23, 2009 1 / 18 1 Sampling 2 Quantization 3 Digital-to-Analog Converter 4 Analog-to-Digital Converter
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 informationA Systematic Description of Source Significance Information
A Systematic Description of Source Significance Information Norbert Goertz Institute for Digital Communications School of Engineering and Electronics The University of Edinburgh Mayfield Rd., Edinburgh
More informationECE6604 PERSONAL & MOBILE COMMUNICATIONS. Week 3. Flat Fading Channels Envelope Distribution Autocorrelation of a Random Process
1 ECE6604 PERSONAL & MOBILE COMMUNICATIONS Week 3 Flat Fading Channels Envelope Distribution Autocorrelation of a Random Process 2 Multipath-Fading Mechanism local scatterers mobile subscriber base station
More informationECE 450 Homework #3. 1. Given the joint density function f XY (x,y) = 0.5 1<x<2, 2<y< <x<4, 2<y<3 0 else
ECE 450 Homework #3 0. Consider the random variables X and Y, whose values are a function of the number showing when a single die is tossed, as show below: Exp. Outcome 1 3 4 5 6 X 3 3 4 4 Y 0 1 3 4 5
More informationModulation & Coding for the Gaussian Channel
Modulation & Coding for the Gaussian Channel Trivandrum School on Communication, Coding & Networking January 27 30, 2017 Lakshmi Prasad Natarajan Dept. of Electrical Engineering Indian Institute of Technology
More informationPulse-Code Modulation (PCM) :
PCM & DPCM & DM 1 Pulse-Code Modulation (PCM) : In PCM each sample of the signal is quantized to one of the amplitude levels, where B is the number of bits used to represent each sample. The rate from
More informationKevin Buckley a i. communication. information source. modulator. encoder. channel. encoder. information. demodulator decoder. C k.
Kevin Buckley - -4 ECE877 Information Theory & Coding for Digital Communications Villanova University ECE Department Prof. Kevin M. Buckley Lecture Set Review of Digital Communications, Introduction to
More informationChapter 10 Applications in Communications
Chapter 10 Applications in Communications School of Information Science and Engineering, SDU. 1/ 47 Introduction Some methods for digitizing analog waveforms: Pulse-code modulation (PCM) Differential PCM
More informationAsymptotic Capacity Bounds for Magnetic Recording. Raman Venkataramani Seagate Technology (Joint work with Dieter Arnold)
Asymptotic Capacity Bounds for Magnetic Recording Raman Venkataramani Seagate Technology (Joint work with Dieter Arnold) Outline Problem Statement Signal and Noise Models for Magnetic Recording Capacity
More informationCHANNEL CAPACITY CALCULATIONS FOR M ARY N DIMENSIONAL SIGNAL SETS
THE UNIVERSITY OF SOUTH AUSTRALIA SCHOOL OF ELECTRONIC ENGINEERING CHANNEL CAPACITY CALCULATIONS FOR M ARY N DIMENSIONAL SIGNAL SETS Philip Edward McIllree, B.Eng. A thesis submitted in fulfilment of the
More information7.1 Sampling and Reconstruction
Haberlesme Sistemlerine Giris (ELE 361) 6 Agustos 2017 TOBB Ekonomi ve Teknoloji Universitesi, Guz 2017-18 Dr. A. Melda Yuksel Turgut & Tolga Girici Lecture Notes Chapter 7 Analog to Digital Conversion
More information2016 Spring: The Final Exam of Digital Communications
2016 Spring: The Final Exam of Digital Communications The total number of points is 131. 1. Image of Transmitter Transmitter L 1 θ v 1 As shown in the figure above, a car is receiving a signal from a remote
More information