1 / 46

Week 7 Lecture 1+2

Week 7 Lecture 1+2. Digital Communications System Architecture + Signals basics. Old Communication : Analog. Next Slide. Next Slide. Today: we use “Digital”. Block Diagram on Digital Communication Systems. Review: Why Digital Comm ?. Continuous Info. Source. Quantizer. Source Encoder.

garretts
Download Presentation

Week 7 Lecture 1+2

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Week 7 Lecture 1+2 Digital Communications System Architecture + Signals basics

  2. Old Communication : Analog Next Slide

  3. Next Slide

  4. Today: we use “Digital” Block Diagram on Digital Communication Systems

  5. Review: Why Digital Comm?

  6. Continuous Info. Source Quantizer Source Encoder Sampler • The points may be considered as the input of a Digital Communication System where messages consist of sequences of "symbols" selected from an alphabet e.g. levels of a quantizer or telegraph letters, numbers and punctuations. • • The objective of a Source Encoder (or data compressor) is to represent the message-symbols arriving at point A2 by as few digits as possible. Thus, each level (symbol) at point is A2 mapped, by the Source Encoder, to a unique codeword of 1s and 0s and, at point B ,we get a sequence of binary digits.

  7. There are two ways to reduce the channel noise/interference effects: 1. to introduce deliberately some redundancy in the sequence at point B and this is what a Discrete Channel Encoder does. This redundancy aids the receiver in decoding the desired sequence by detecting and many times correcting errors introduced by the channel; 2. to increase Transmitter's power - point T often very expensive therefore better to trade transmitter's power for channel bandwidth.

  8. Digital Modulation Interleaver Discrete Channel Encoder Channel Encoder

  9. De-Modulator DeInterleaver Channel Decoder

  10. Receiver Source Decoder The source decoder processes the sequence received from the output of the channel decoder and, from the knowledge of the source encoding method used, attempts to reconstruct the signal of the information source.

  11. A SIMPLIFIED BLOCK STRUCTURE (Digital source) Note: For Digital source -- Quality is measured as the Bit Error Rate (BER)

  12. An Internet System (Digital source) based on Cellular Network in the core

  13. Digital Transmission of Analogue Signals (voice) Not BER (like in Digital Source case, previous case)

  14. It is clear from the previous discussion that signals (representing bits) propagate through the networks. Therefore the following sections are concerned with the main properties and parameters of communication signals.

  15. Communication Signals Frequency Domain (Spectrum): very important in Communications

  16. Classification of Signals according to their description

  17. Classification of Signals: according to their periodicity

  18. according to their signal energy

  19. according to their spectrum

  20. TD/FD: OPERATIONS

  21. More On Transformations

  22. WOODWARD's Notation • The evaluation of FT, that is • involves integrating the product of a function and a complex exponential - which can be difficult; so tables of useful transformations are frequently used (next 2 slides). • However, the use of tables is greatly simplified by employing Woodward's notation for certain commonly occurring situations. • main advantage of using Woodward's notation: allows periodic time/frequency functions to be handled with FT rather than Fourier Series

  23. FOURIER TRANSFORMS - TABLES

  24. FOURIER TRANSFORMS – TABLES (cont’d)

  25. IMPORTANT SPECTRUM SHAPES

  26. finite duration (i.e. Energy signals)

  27. Modulation principle

  28. Multiplication (TD)  Convolution (FD) In FD, it becomes Shift operations!

  29. Some frequently used signals

  30. Some frequently used signals

  31. Some frequently used signals

  32. we can generate any desired "rect" function by scaling and shifting; see for instance the following table effects of temporal scaling:

  33. Bandwidth of a signal Bandwidth: the range of the significant frequency components in a signal waveform Examples of message signals (baseband signals) and their bandwidth: • television signal bandwidth 5.5MHz • speech signal bandwidth 4KHz • audio signal bandwidth 8kHz to 20kHz Examples of transmitted signals (basepass signals) and their bandwidth: • to be discussed latter on •Note that there are various definitions of bandwidth, e.g. 3dB bandwidth, null-to-null bandwidth, Nyquist (minimum) bandwidth (next slide)

  34. Definitions: Signal Bandwidth

  35. REDUNDANCY The degree of similarity in a signal is provided by its Redundancy autocorrelation function. For instance the autocorrelation function of a signal

  36. SIMILARITY The degree of similarity between two signals is given by their cross-correlation function. For instance the cross-correlation function between two signals

  37. On Comm Noise • Usually people assume: Additive White Gaussian Noise (AWGN)

  38. Noise

More Related