Introduction to Digital Communications System
Total Page:16
File Type:pdf, Size:1020Kb
Wireless Information Transmission System Lab. Introduction to Digital Communications System Institute of Communications Engineering National Sun Yat-sen University Recommended Books Digital Communications / Fourth Edition (textbook) -- John G. Proakis, McGraw Hill Communication Systems / 4th Edition -- Simon Haykin, John Wiley & Sons, Inc. Digital Communications – Fundamentals and Applications / 2nd Edition -- Bernard Sklar, Prentice Hall Principles of Communications / Fifth Edition -- Rodger E. Ziemer and William H. Tranter, John Wiley & Sons, Inc. Modern Digital and Analog Communication Systems -- B.P. Lathi, Holt, Rinehart and Winston, Inc. 2 Example of Communications System Local Loop Switch T1/E1 Facilities Mobile Switching Transmission Center Equipment regenerator Base Central Office A/D Conversion (Digitization) Station Local Loop SONET Switch T1/E1 Facilities M SDH U Transmission T1/E1 Facilities Equipment regenerator X Central Office A/D Conversion (Digitization) Local Loop Switch T1/E1 Facilities Transmission regenerator Equipment Mobile Central Office A/D Conversion Switching (Digitization) Center Public Switched Telephone Network (PSTN) Base Station 3 Basic Digital Communication Nomenclature Textual Message: information comprised of a sequence of characters. Binary Digit (Bit): the fundamental information unit for all digital systems. Symbol (mi where i=1,2,…M): for transmission of the bit stream; groups of k bits are combined to form new symbol from a finite set of M such symbols; M=2k. Digital Waveform: voltage or current waveform representing a digital symbol. Data Rate: Symbol transmission is associated with a symbol duration T. Data rate R=k/T [bps]. Baud Rate: number of symbols transmitted per second [baud]. 4 Nomenclature Examples 5 Messages, Characters, and Symbols 6 Typical Digital Communications System From Other Sources Information Bits Source Bits Channel Bits TX Source Channel Frequency Multiple Format Encryption Interleaving Multiplexing Modulation RF Encoding Encoding Spreading Access PA si (t) Digital Input C m i H Bit Digital A Synchronization N Stream Waveform N Digital E Output L mˆ i sˆi (t) RX Source Channel Frequency Multiple Format Decryption Deinterleaving Demultiplexing Demodulation RF Decoding Decoding Despreading Access IF Information Sink Source Bits Channel Bits Optional Essential To Other Destinations 7 Wireless Information Transmission System Lab. Format Institute of Communications Engineering National Sun Yat-sen University Typical Digital Communications System From Other Sources Information Bits Source Bits Channel Bits TX Source Channel Frequency Multiple Format Encryption Interleaving Multiplexing Modulation RF Encoding Encoding Spreading Access PA si (t) Digital Input C m i H Bit Digital A Synchronization N Stream Waveform N Digital E Output L mˆ i sˆi (t) RX Source Channel Frequency Multiple Format Decryption Deinterleaving Demultiplexing Demodulation RF Decoding Decoding Despreading Access IF Information Sink Source Bits Channel Bits Optional Essential To Other Destinations 9 Formatting and Baseband Transmission 10 Sampling Theorem 11 Sampling Theorem Sampling Theorem: A bandlimited signal having no spectral components above fm hertz can be determined uniquely by values sampled at uniform intervals of Ts seconds, where 1 T ≤ S or sampling rate f S ≥ 2 f m 2 fm In sample-and-hold operation, a switch and storage mechanism form a sequence of samples of the continuous input waveform. The output of the sampling process is called pulse amplitude modulation (PAM). 12 Sampling Theorem 1 ∞ X S ( f ) = X ( f )∗ X δ ( f ) = ∑ X ( f − nfS ) TS n=−∞ 13 Spectra for Various Sampling Rates 14 Natural Sampling 15 Pulse Code Modulation (PCM) PCM is the name given to the class of baseband signals obtained from the quantized PAM signals by encoding each quantized sample into a digital word. The source information is sampled and quantized to one of L levels; then each quantized sample is digitally encoded into an ℓ-bit (ℓ=log2L) codeword. 16 Example of Constructing PCM Sequence 17 Uniform and Non-uniform Quantization 18 Statistical Distribution of Single-Talker Speech Amplitudes 50% of the time, speech voltage is less than ¼ RMS. Only 15% of the time, voltage exceeds RMS. Typical voice signal dynamic range is 40 dB. 19 Problems with Linear Quantization Fact: Unacceptable S/N for small signals. Solution: Increasing quantization levels – price is too high. Applying nonlinear quantization – achieved by first distorting the original signal with a logarithmic compression characteristic and then using a uniform quantizer. At the receiver, an inverse compression characteristic, called expansion, is applied so that the overall transmission is not distorted. The processing pair is referred to as companding. 20 Implementation of Non-linear Quantizer 21 Companding Characteristics In North America: μ-law compression: loge[1+ µ( x / xmax)] y = ymax ⋅sgn x loge (1+ µ) where ⎧+1 for x ≥ 0 sgn x = ⎨ ⎩−1 for x < 0 In Europe: A-law compression: ⎧ A( x / xmax ) x 1 ⎪ ymax ⋅sgn x 0 < ≤ ⎪ 1+ log A x A y = ⎨ e max 1+ log [ A( x / x )] 1 x ⎪ y e max ⋅sgn x < ≤ 1 ⎪ max ⎩ 1+ log e A A xmax 22 Compression Characteristics Standard values of μ is 255 and A is 87.6. 23 Wireless Information Transmission System Lab. Source Coding Institute of Communications Engineering National Sun Yat-sen University Typical Digital Communications System From Other Sources Information Bits Source Bits Channel Bits TX Source Channel Frequency Multiple Format Encryption Interleaving Multiplexing Modulation RF Encoding Encoding Spreading Access PA si (t) Digital Input C m i H Bit Digital A Synchronization N Stream Waveform N Digital E Output L mˆ i sˆi (t) RX Source Channel Frequency Multiple Format Decryption Deinterleaving Demultiplexing Demodulation RF Decoding Decoding Despreading Access IF Information Sink Source Bits Channel Bits Optional Essential To Other Destinations 25 Source Coding Source coding deals with the task of forming efficient descriptions of information sources. For discrete sources, the ability to form reduced data rate descriptions is related to the information content and the statistical correlation among the source symbols. For analog sources, the ability to form reduced data rate descriptions, subject to a fixed fidelity criterion I related to the amplitude distribution and the temporal correlation of the source waveforms. 26 Huffman Coding The Huffman code is source code whose average word length approaches the fundamental limit set by the entropy of a discrete memoryless source. The Huffman code is optimum in the sense that no other uniquely decodable set of code-words has smaller average code-word length for a given discrete memoryless source. 27 Huffman Encoding Algorithm 1. The source symbols are listed in order of decreasing probability. The two source symbols of lowest probability are assigned a 0 and a 1. 2. These two source symbols are regarded as being combined into a new source symbol with probability equal to the sum of the two original probabilities. The probability of the new symbol is placed in the list in accordance with its value. 3. The procedure is repeated until we are left with a final list of source statistics of only two for which a 0 and a 1 are assigned. 4. The code for each (original) source symbol is found by working backward and tracing the sequence of 0s and 1s assigned to that symbol as well as its successors. 28 Example of Huffman Coding Symbol Probability Code Word S0 0.4 00 S1 0.2 10 S2 0.2 11 S3 0.1 010 S4 0.1 011 Symbol Stage 1 Stage 2 Stage 3 Stage 4 S0 0.4 0.4 0.4 0.6 0 S1 0.2 0.2 0.4 0 0.4 1 S2 0.2 0.2 0 0.2 0 1 S3 0.1 0.2 1 S4 0.1 1 29 Properties of Huffman Code Huffman encoding process is not unique. Code words for different Huffman encoding process can have different lengths. However, the average code-word length is the same. When a combined symbol is moved as high as possible, the resulting Huffman code has a significantly smaller variance than when it is moved as low as possible. Huffman code is a prefix code. A prefix code is defined as a code in which no code-word is the prefix of any other code-word. 30 Bit Compression Technologies for Voice Differential PCM (DPCM) Adaptive DPCM Delta Modulation (DM) Adaptive DM (ADM) . Speech Encoding 31 Differential PCM (DPCM) 32 Delta Modulation (DM) Delta modulation is a one-bit DPCM. Advantage: bit compression. Disadvantage: slope overload. 33 Speech Coding Objective Reduce the number of bits needed to be transmitted, therefore lowering the bandwidth required. 34 Speech Properties Voiced Sound Arises in generation of vowels and latter portion of some consonants. Displays long-term repetitive pattern corresponding to the duration of a pitch interval Pulse-like waveform. Unvoiced Sound Arises in pronunciation of certain consonants such as “s”, “f”, “p”, “j”, “x”, …, etc. Noise-like waveform. 35 Categories of Speech Encoding Waveform Encoding Treats voice as analog signal and does not use properties of speech: Source Model Coding or Vocoding Treats properties of speech to preserve word information Hybrid or parametric methods Combines waveform and vocoding 36 Linear Predictive Coder (LPC) 37 Multi-Pulse Linear Predictive Coder (MP-LPC) 38 Regular Pulse Excited Long Term Prediction Coder (RPE-LPT) 39 Code-Excited Linear Predictive (CELP) 40 Speech Coder Complexity 41 Speech Processing for GSM Composition of the 13 kbps signal: 36 bits for filter parameters every 20 ms. 9 bits for LTP every 5 ms. 47 bits for RPE every 5 ms. Thus, in a 20 ms (2080-bit block, or 260 sample) interval, we need a total of 36+9*20/5+47*20/5=260 bits. Data Rate = 260/(20 ms) = 13 kbps. 42 Speech Processing for IS-54 Composition of the 7.95 kbps signal: 43 bits for filter parameters every 20 ms. 7 bits for LTP every 5 ms.