Performance Analysis of Digital communication Systems - PowerPoint PPT Presentation

performance analysis of digital communication systems n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Performance Analysis of Digital communication Systems PowerPoint Presentation
Download Presentation
Performance Analysis of Digital communication Systems

play fullscreen
1 / 211
Performance Analysis of Digital communication Systems
289 Views
Download Presentation
lok
Download Presentation

Performance Analysis of Digital communication Systems

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

  1. Performance Analysis of Digital communication Systems DIGITAL COMMUNICATION

  2. Block Diagram Receiver Digital message Source Sink Transmitter Channel Functional model of digital communication system • : digital message. • :Transmitted signal. • : The channel noise. • : The received signal. • : An estimate of the transmitted digital message.

  3. Performance Measure (Figure of Merit): Waterfall shape • : i.e. The probability of error, it could be the Bit error Rate (BER) or Symbol Error Rate (SER). • : Energy per transmitted bit (Joule). • : Single sided PSD of White noise (Watt/Hz). • is dimensionless and equivalent to the

  4. P(0/0) “0” “0” Probability of Error: P(1/0) P(0/1) • : Probability of receiving “0” given that “0” was transmitted which is probability of correct. • : Probability of receiving “1” given that “1” was transmitted which is probability of correct. • : Probability of receiving “1” given that “0” was transmitted which is probability of error. • : Probability of receiving “0” given that “1” was transmitted which is probability of error. Rx Tx “1” “1” P(1/1) Binary Symmetric Channel

  5. Probability of Error (Cont.): • Probability of error ≡ Probability of Rx “0” given that “1” is Tx or vice versa •  Pe = P(0) P(1/0) + P(1) P(0/1) • P(0) probability of sending “0”. • P(1) probability of sending “1”. • If P(0)=P(1) equally likely (equally probable). • Since the channel is symmetric

  6. Channel Noise: • is a sample function of which is assume to be Wide-sense Stationary process (WSS) with zero mean and Power spectral density (PSD): . Also its distribution is assumed to be Gaussian. • is called Additive White Gaussian Noise (AWGN). • The cannel is called also AWGN channel. Receiver Digital message Source Sink Transmitter Channel

  7. Gaussian Distribution: • (PDF) • (CDF)

  8. G.D (Cont.) area • Where is the CDF for a zero mean, unity variance G.R.V. • Let Called the Q-function.

  9. Q-tables • e.g.: Q(2.2)=?

  10. G.D. (Cont.) Area 1 0.5

  11. G.D. (Cont.) • The complementary error function is defined as: • erfc-function and the Q-function are related by:

  12. Random Processes and LTI Systems: LTI system Output Input WSS

  13. R.P. & LTI Systems (Cont.) • In our assumption the noise is Gaussian with , and , so the output from an LTI system is Gaussian with . • Since which is the average power of .

  14. Thermal Noise in Communication Systems: • A natural noise source is thermal noise, who amplitude statistics are well modeled to be Gaussian with zero mean. • The autocorrelation and PSD are well modeled as: • Where k = 1.38 × 10−23 (joule/Kelvin) is Boltzmann’s constant, G is conductance of the resistor (mhos); T is temperature in degrees Kelvin; and is the statistical average of time intervals between collisions of free electrons in the resistor (on the order of sec).

  15. Thermal Noise (Cont.)

  16. White Noise: • The noise PSD is approximately flat over the frequency range of 0 to 10 GHz ⇒ let the spectrum be flat from 0 to ∞: • Where is a constant. • Noise that has a uniform spectrum over the entire frequency range is referred to as white noise. • The autocorrelation of white noise is: • Since for , any two different samples of white noise, no matter how close in time they are taken, are uncorrelated. • Since the noise samples of white noise are uncorrelated, if the noise is both white and Gaussian (for example, thermal noise) then the noise samples are also independent.

  17. Performance Analysis of Baseband System with Polar line Coding: p(t) Ap -p(t) “1” “0” Tp t t Tp To To - Ap “1” “1” “0” “1” s(t) Ap r(t) Tp To 2To 3To Decision Making Instants Ap+n<0 -Ap+n<0 Correct Decision Detection error - Ap 11011001

  18. Rx Tx Channel Threshold Detector Decision Making Device Sampler Optimum Threshold Let +A N: Noise amplitude at the sampling instant  R.V. -Ap N: Gaussian R.V. with zero mean and variance (n) # - Ap Ap /

  19. Cont.  P(error/1) = P(n < -Ap) = P(n > +Ap) = Q(Ap/) ) ) + ) Let  Unipolar ?Bipolar ?

  20. Pe can be minimized by maximizing (Ap/), this will be done by passing the digital signal through an optimum filter (called match filter). Filter h(t) Threshold Detector The filter will enhance the pulse amplitude & at the same time reduce the noise power () t t To tm=To 2To

  21. Cont. After adding the filter we maximize

  22. Cont.  Using Schwarz inequality: The equality holds if  Let  Equality if: ; If p(t) is real  =

  23. Cont. (Unitless) Where Epis the energy of p(t)  Match filter

  24. p(t) tm < To Non causal t t tm To To tm > To tm = To • Min. delay for • decision making t t tm To=tm To

  25.  tm = To The optimum value The width of is 2To & symmetrical about To because:  Multiplies both the signal and the noise • Does not affect  = 1 Which is the energy

  26. Cont.

  27. Alternative method to realize a match filter: Filter • But hopt(t) Threshold Detector

  28. Cont. (Correlator) Integrate and dump Which is the time cross-correlation function. Threshold Detector Correlation Receiver :Correlator

  29. Optimum linear receiver for a general binary system: Filter • Let us transmit “1” as and “0” as . h(t) Threshold Detector Decision Making device is the Optimum Threshold

  30. Cont. • Let Which is a sampled version of  is a G.R.V with zero mean & variance • Let since it is time independent. • is a G.R.V. with mean or depending on whether or “0” with variance .

  31. Cont. •  The Conditional PDFs of are:

  32. Cont. Conditional PDFs y Equally likely

  33. Cont. = =

  34. Cont.

  35. Cont. • : Which is the arithmetic mean.

  36. Cont. •  To minimize we have to maximize .

  37. Cont. • Using Schwarz inequality: where is an arbitrary constant.

  38. Cont. • For AWGN  • from Parseval’s theorem • , since

  39. Cont. • Where: • . • .

  40. Cont.

  41. Cont. • Hints:

  42. Receiver design Threshold Detector Threshold Detector + + - - 0 0

  43. Polar Signaling: • “1” • “0” • & • Since noise & signal are multiplied by the same ratio

  44. Polar(Cont.) • is the average energy per bit. • ,

  45. Polar(Cont.) • Average Transmitted power. 1 10 15 (dB)

  46. Unipolar (On-Off signaling) • 1” • “0” • ,

  47. Orthogonal Signals • Orthogonality: • , , • For baseband Binary: orthogonal signals are not better than Polar.

  48. Signal Space Analysis: Receiver Digital message Source Sink Transmitter Channel • Message source emits one symbol every • Symbol belongs to an alphabet of M symbols • With a priori probabilities

  49. Cont. • @ • @Rx:

  50. Cont.