PROJECT 5: DESIGNING A VOICE MODEM. Instructor: Amir Asif

Size: px
Start display at page:

Download "PROJECT 5: DESIGNING A VOICE MODEM. Instructor: Amir Asif"

Transcription

1 PROJECT 5: DESIGNING A VOICE MODEM Instructor: Amir Asif CSE4214: Digital Communications (Fall 2012) Computer Science and Engineering, York University 1. PURPOSE In this laboratory project, you will design and built a prototype voice modem based on MATLAB. This project builds on Project 4 where a binary Pulse Shift Keying (BPSK) communication system was implemented. The system will be augmented by adding a convolutional encoder and its decoder to model a prototype voice modem. The focus of this project is on convolutional codes that were covered in this week s lecture. You will learn how a digitized speech signal is communicated over a noisy medium, explore how convolutional codes can detect and selfcorrect errors introduced during communication without any retransmission, and perform Monte Carlo simulations to compare the performance of a voice modem with convolutional codes versus one without the convolutional codes. By the end of this project, you will be able to 2. OBJECTIVES 1. Use a linear finite-state shift register to generate the convolution code for a given sequence of information. 2. Use the generator matrix approach as a computational implementation for the finite-state shift register to generate convolutional codes. 3. Implement the Viterbi implementation for decoding a convolution encoded information sequence. 4. Analyze the performance of a voice modem using convolutional code versus one without convolutional codes. You will quantify improvement in the performance of the voice modem with convolutional codes. 3. REFERENCE Review topics: Binary Pulse Shift Keying (BPSK), Convolutional Codes, Viterbi Algorithm, Trellis Diagram. References: Bernard Sklar, Digital Communications: Fundamentals and Applications, Prentice Hall Publisher, Second edition. Chapter 7: Channel Coding - Part INTRODUCTION In this project, we will build a prototype voice modem with the schematic representation shown in Fig. 1. Compared to the Phase Shift Keying (PSK) implementation that you designed in the last project, two additional blocks Convolutional Encoder and Convolutional Decoder are added to represent a voice modem. The focus of this project is on convolutional codes that were covered in this week s lecture. Recall that the convolutional codes represent one technique within the general class of channel codes (also called error-correction codes) that permit reliable communication of an information sequence over a channel that adds noise, introduces bit errors, or otherwise distorts the transmitted signal. As per the requirements of the voiceband modems, convolutional codes are typically used in low-latency applications such as real-time speech communication where a retransmit is not possible. Other applications of convolutional codes include deep-space communications and as constituent blocks in Turbo codes.

2 Information Source Convolutional Encoder Modulator s i (t) Input Sequence Codeword Sequence m = m 1,m 2,...,m i,... U = G(m) = U 1,U 2,...,U i,... with U i = u 1i,u 2i,...,u ji,...,u ni AWGN Channel Information Sink Convolutional Decoder Demodulator ŝ i (t) Detected Sequence Demodulated Codeword Sequence m = m 1, m 2,..., m i,... Z = Z 1,Z 2,...,Z i,... with Z i = z 1i,z 2i,...,z ji,...,z ni Figure 1: A digital communication system emphasizing channel encoding and modulation. We will run a Monte-Carlo simulation to characterize the performance of a binary communication system that uses convolutional encoding with pulse shift keying (PSK) modulation. Figure 1 illustrates the block diagram of such a digital communication system where the input message is denoted by the sequence m with each m i representing a binary digit (bit). The index i in m i is the time index, thus m 1 is transmitted before m 2 and so on with the remaining bits. The channel encoder encodes the input message m U = G(m) (1) producing the codeword U that is transmitted through an AWGN channel with power spectral density of N o. In this project, a (n, 1, K) binary convolutional encoder is used as the channel encoder. Therefore, a codeword of length n is produced for each input bit. More on the convolutional encoder later. The modulation and demodulation scheme used in the digital communication system modeled in figure 1, is the M-ary PSK. Recall that the general representation for the PSK waveforms is s i (t) = 2E T cos [ ω o t 2πi ], i = 1,...,M, 0 t T (2) M where ω o is the carrier frequency in radians/s and is assumed an integer multiple of 2π/T. The transmitted signal s i (t) has a constant envelope with a duration of T and energy E. In project 5, we implemented the PSK modulator and demodulator using Matlab. These functions are made available to you for this project. In the following section, we focus on the binary convolutional encoder and decoder. 5. LABORATORY PREPARATION A binary convolutional code is generated by passing the information sequence to be transmitted through a linear finite-state shift register. For a (n, 1, K) convolution code, the shift register consists of K stages and n linear modulo-2 function generators. The input data is shifted into and along the shift register a single bit at a time producing a n-tuples output for each shift. Consequently, the code rate for a (n, 1, K) convolutional encoder is 1/n. To illustrate the working of a convolutional encoder, consider the (3,1,3) convolutional encoder shown in figure 2 where the output U = [U i1,u i2,u i3 ] at instant i is obtained from the message bit m i at instant i and the previous (K 1) (which equals 2 for in our example) message bits m i 1 and m i 2. The operator is the modulo-2 arithmetic operator. Initially, the shift registers are assumed to be in the all zero state. Suppose the first input bit m 1 is a 1. At the next clock cycle, the initial content of the registers is moved towards the right by 1 bit and the message bit occupies the left most register. The registers are therefore set to states 1, 0, and 0, i.e., m i = 1,

3 m m i m i 1 m i 2 U i1 + U i2 + U i3 Figure 2: A (3,1,3) convolutional encoder. m i 1 = 0, and m i 2 = 0. The value of the three output bits U ij, for i = 1 and 1 j 3, are given by U i1 = m i, U i2 = m i m i 2, and U i3 = m i m i 1 m i 2. (3) Solving equations (3) for the codeword U 1 gives 111. Suppose now that the second bit is a 0. The registers are set to 0, 1, and 0 at the next clock cycle and the codeword U 2 is 001. By following this procedure, the codewords U i can be generated for the remaining message bits. Problem 1: Suppose that the registers in figure 2 are initially reset to 0. Find the output codeword sequence U if the input message sequence is given by m = followed by (K 1) zeros to flush the registers. Repeat if the registers are initially set to 1 and 1 s are used to flush the registers. In the remaining project, we will assume 0-initial and 0-flush conditions for the registers. This problem needs to be solved analytically. There are several alternative methods discussed in the Sklar text that can be used to describe a convolutional code. These include the state diagram, the tree diagram, and the trellis diagram. For implementing in Matlab, we will use an alternate approach of assigning a generator matrix G, just as we did for the block codes. The generator matrix G is defined in terms of n connection vectors, denoted by g 1, g 1,..., g n, one for each of the n-modulo-2 adders. Each vector has a dimension K and describes the connection of the encoding shift register to that of the modulo-2 adder. A 1 in the i th position of the vector indicates that the corresponding stage in the shift register is connected to the modulo-2 adder, and a 0 in a given position indicates that no connection exists. For the (3,1,3) convolutional encoder illustrated in figure 1, the connection vectors are given by g 1 = [ ], g 2 = [ ], and g 3 = [ ] (4) The generator matrix G of the convolutional code is then given by G = [ g T 1 g T 2 g T 3 ] (5) where subscript T denotes transposition. In order to calculate the output codewords U, the content of the registers at each iteration i is placed in a row vector s i, which is multiplied with the generator matrix G, i.e., U i = s i G. In our example of (3,1,3) convolutional code, the content of the register is for iteration i = 1. The codeword U 1 = [ ] The procedure is repeated for the remaining message bits. = [ ]. Problem 2: Repeat problem 1 using the generator matrix G. Compare the code rate of the algorithm to the theoretical bound (k/n). This problem needs to be solved analytically. There are many algorithms that can be used for decoding of convolutional codes. The Viterbi algorithm is probably the most widely used decoding method for convolutional codes. This algorithm is particularly interesting because it is a maximum likelihood decoding algorithm which upon receiving the channel output, searches through the

4 trellis diagram to find the path that is most likely to have generated the received sequence. Details on the Viterbi algorithm are given in section 7.3 of the Sklar text. Problem 3: Assume that the transmitted sequence for problem 2 with 0 initial state and 0 used to flush the registers, is corrupted with AWGN so that the received sequence is given by Using the Viterbi algorithm, find the maximum likelihood information sequence and the number of errors. This problem needs to be solved analytically. 6. LABORATORY EXPERIMENT There are different implementations of the Viterbi algorithm for detection of binary convolutional code. We will be using the following implementation which consists of six steps. 1. Parse the received sequence into m subsequences of length n. 2. Set the index l to 1 and initialize the state value to (K 1) bits 0-tuples. The zero state correspond to the initial state. Since at this time, we have not traversed any path in the Trellis diagram, we initialize the corresponding Hamming distance to 0. For decoding of the (3,1,3) convolutional code in our example of fig. 2, the initialization conditions are state = [0 0]; hdistance = [0]; dsequence = [] where we use the notation used in Matlab. The variable state denotes the states being used in the Trellis diagram, the variable hdistance denotes the Hamming distance metric corresponding to that state, while dsequence denotes the decoded sequence. As the algorithm iterates, we assume different values of these variables are saved along different rows. 3. For each of the states included in state, do the following: (a) Assuming 0 as the message bit, append the variables state, hdistance, and output. The Hamming distance is calculated by comparing the n-bit parsed received sequence with the expected code symbols generated as a result of state transitions. (b) Repeat the item (a) assuming 1 as the message bit. For binary code, you will observe that the dimensions of the three variables would be doubled. Note that this step moves you to the (l + 1) stage of the Trellis diagram. 4. If states are repeated in the variable state, delete the entries corresponding to the higher Hamming distance from each of the three variables state, hdistance, and output. This is the path-elimination step of the Viterbi algorithm. 5. If l = m, proceed with the next step; else, increment l by 1 and go to step The decoded sequence is the value of dsequence corresponding to the minimum Hamming distance in hdistance. The minimum value of hdistance gives the number of corrected errors. Based on the information provided above, attempt the following problems. Problem 4:Write a Matlab function myconvcode that generates (3,1,3) convolution code according to the encoder illustrated in fig. 2. Use 0-initial and 0-flush conditions for the registers. Check your output with the theoretical value that you calculated in problem 1. Problem 5: Write a Matlab function myviterbi that decodes the codeword sequence U generated by the (3,1,3) convolution encoder shown in fig. 2. Check the function by decoding your answer to problem 1. Also, validate the function by solving problem 3. In problems 6-10, we will run a Monte Carlo simulation for the binary communication system illustrated in figure 1. As you will note, several of the functions that you wrote in project 5 can be used in the following problems. Problem 6: Write a function myinput that simulates the transmission of 5000 bits using the random number

5 generator. To accomplish this task, we use Matlab function rand to generate 5000 random numbers in the range (0,1). This range is divided into two equal intervals, (0, 0.5) and (0.5, 1) where the subintervals correspond to bits 0 and 1 respectively. Save the sequence of transmitted symbols m i s as you will be required to compare the sequence with the detected sequence at the receiver. Problem 7: The symbols, m i s, are encoded using the (3,1,3) convolutional encoder that you designed in problem 4. Calculate the output of the convolutional encoder first in terms of bits and then in terms of 4-ary symbols (a 1, a 2, a 3, a 4 ) by parsing m i in sub-sequences of 2-bits. Problem 8: The symbols, a i s, are modulated using a 4-ary PSK defined in equation (2). The signal energy can be normalized to unity, i.e., E = 1 with the carrier frequency ω o = 6π/T and T = 1. Choose a sampling frequency of 1/30s. Plot the waveform for the first 5 symbols. Save the 4-ary sequence a i s since we will be comparing the sequence with the demodulated value at the output of the PSK demodulator. Problem 9: Add AWGN with a PSD N o = 2 to the waveform generated in problem 7. This represents the received waveform. Plot the waveform for the first 5 received symbols and compare with your plots obtained in problem 7. Problem 10: Using a 4-ary coherent detection scheme, demodulate and detect the sequence of alphabets a i s. Compare the detected sequence with the transmitted sequence of problem 7 and calculate the symbol-error rate P E. Problem 11: Convert the message stream obtained in problem 10 to a binary sequence and decode using the Viterbi algorithm implemented in the function myviterbi, your answer to problem 5. Calculate probability of bit error P B. Problem 12: Repeat problem 5 to 10 for different values of PSD N o = 4, 8, 12, and 16 four to five times each and calculate the average values for the probability of errors. Plot the symbol-error rate P E versus the E b /N o ratio for both PSK-modulated sequence without convolutional encoding and PSK-modulated sequence with convolutional coding. Plot and compare with the theoretical limits. For a fair comparison, remember to convert symbol error rate to bit error rate or vice versa. Record your observations and any salient features that you may have observed in the Monte-Carlo simulations.

Convolutional Coding Using Booth Algorithm For Application in Wireless Communication

Convolutional Coding Using Booth Algorithm For Application in Wireless Communication Available online at www.interscience.in Convolutional Coding Using Booth Algorithm For Application in Wireless Communication Sishir Kalita, Parismita Gogoi & Kandarpa Kumar Sarma Department of Electronics

More information

Lecture 9b Convolutional Coding/Decoding and Trellis Code modulation

Lecture 9b Convolutional Coding/Decoding and Trellis Code modulation Lecture 9b Convolutional Coding/Decoding and Trellis Code modulation Convolutional Coder Basics Coder State Diagram Encoder Trellis Coder Tree Viterbi Decoding For Simplicity assume Binary Sym.Channel

More information

Outline. Communications Engineering 1

Outline. Communications Engineering 1 Outline Introduction Signal, random variable, random process and spectra Analog modulation Analog to digital conversion Digital transmission through baseband channels Signal space representation Optimal

More information

6. FUNDAMENTALS OF CHANNEL CODER

6. FUNDAMENTALS OF CHANNEL CODER 82 6. FUNDAMENTALS OF CHANNEL CODER 6.1 INTRODUCTION The digital information can be transmitted over the channel using different signaling schemes. The type of the signal scheme chosen mainly depends on

More information

Chapter 3 Convolutional Codes and Trellis Coded Modulation

Chapter 3 Convolutional Codes and Trellis Coded Modulation Chapter 3 Convolutional Codes and Trellis Coded Modulation 3. Encoder Structure and Trellis Representation 3. Systematic Convolutional Codes 3.3 Viterbi Decoding Algorithm 3.4 BCJR Decoding Algorithm 3.5

More information

International Journal of Computer Trends and Technology (IJCTT) Volume 40 Number 2 - October2016

International Journal of Computer Trends and Technology (IJCTT) Volume 40 Number 2 - October2016 Signal Power Consumption in Digital Communication using Convolutional Code with Compared to Un-Coded Madan Lal Saini #1, Dr. Vivek Kumar Sharma *2 # Ph. D. Scholar, Jagannath University, Jaipur * Professor,

More information

Lab/Project Error Control Coding using LDPC Codes and HARQ

Lab/Project Error Control Coding using LDPC Codes and HARQ Linköping University Campus Norrköping Department of Science and Technology Erik Bergfeldt TNE066 Telecommunications Lab/Project Error Control Coding using LDPC Codes and HARQ Error control coding is an

More information

AN INTRODUCTION TO ERROR CORRECTING CODES Part 2

AN INTRODUCTION TO ERROR CORRECTING CODES Part 2 AN INTRODUCTION TO ERROR CORRECTING CODES Part Jack Keil Wolf ECE 54 C Spring BINARY CONVOLUTIONAL CODES A binary convolutional code is a set of infinite length binary sequences which satisfy a certain

More information

Thus there are three basic modulation techniques: 1) AMPLITUDE SHIFT KEYING 2) FREQUENCY SHIFT KEYING 3) PHASE SHIFT KEYING

Thus there are three basic modulation techniques: 1) AMPLITUDE SHIFT KEYING 2) FREQUENCY SHIFT KEYING 3) PHASE SHIFT KEYING CHAPTER 5 Syllabus 1) Digital modulation formats 2) Coherent binary modulation techniques 3) Coherent Quadrature modulation techniques 4) Non coherent binary modulation techniques. Digital modulation formats:

More information

COHERENT DEMODULATION OF CONTINUOUS PHASE BINARY FSK SIGNALS

COHERENT DEMODULATION OF CONTINUOUS PHASE BINARY FSK SIGNALS COHERENT DEMODULATION OF CONTINUOUS PHASE BINARY FSK SIGNALS M. G. PELCHAT, R. C. DAVIS, and M. B. LUNTZ Radiation Incorporated Melbourne, Florida 32901 Summary This paper gives achievable bounds for the

More information

FREDRIK TUFVESSON ELECTRICAL AND INFORMATION TECHNOLOGY

FREDRIK TUFVESSON ELECTRICAL AND INFORMATION TECHNOLOGY 1 Information Transmission Chapter 5, Block codes FREDRIK TUFVESSON ELECTRICAL AND INFORMATION TECHNOLOGY 2 Methods of channel coding For channel coding (error correction) we have two main classes of codes,

More information

Maximum Likelihood Sequence Detection (MLSD) and the utilization of the Viterbi Algorithm

Maximum Likelihood Sequence Detection (MLSD) and the utilization of the Viterbi Algorithm Maximum Likelihood Sequence Detection (MLSD) and the utilization of the Viterbi Algorithm Presented to Dr. Tareq Al-Naffouri By Mohamed Samir Mazloum Omar Diaa Shawky Abstract Signaling schemes with memory

More information

The figures and the logic used for the MATLAB are given below.

The figures and the logic used for the MATLAB are given below. MATLAB FIGURES & PROGRAM LOGIC: Transmitter: The figures and the logic used for the MATLAB are given below. Binary Data Sequence: For our project we assume that we have the digital binary data stream.

More information

Physical Layer: Modulation, FEC. Wireless Networks: Guevara Noubir. S2001, COM3525 Wireless Networks Lecture 3, 1

Physical Layer: Modulation, FEC. Wireless Networks: Guevara Noubir. S2001, COM3525 Wireless Networks Lecture 3, 1 Wireless Networks: Physical Layer: Modulation, FEC Guevara Noubir Noubir@ccsneuedu S, COM355 Wireless Networks Lecture 3, Lecture focus Modulation techniques Bit Error Rate Reducing the BER Forward Error

More information

UNIVERSITY OF CALIFORNIA College of Engineering Department of Electrical Engineering and Computer Sciences EECS 121 FINAL EXAM

UNIVERSITY OF CALIFORNIA College of Engineering Department of Electrical Engineering and Computer Sciences EECS 121 FINAL EXAM Name: UNIVERSIY OF CALIFORNIA College of Engineering Department of Electrical Engineering and Computer Sciences Professor David se EECS 121 FINAL EXAM 21 May 1997, 5:00-8:00 p.m. Please write answers on

More information

Implementation of Different Interleaving Techniques for Performance Evaluation of CDMA System

Implementation of Different Interleaving Techniques for Performance Evaluation of CDMA System Implementation of Different Interleaving Techniques for Performance Evaluation of CDMA System Anshu Aggarwal 1 and Vikas Mittal 2 1 Anshu Aggarwal is student of M.Tech. in the Department of Electronics

More information

Comparison Between Serial and Parallel Concatenated Channel Coding Schemes Using Continuous Phase Modulation over AWGN and Fading Channels

Comparison Between Serial and Parallel Concatenated Channel Coding Schemes Using Continuous Phase Modulation over AWGN and Fading Channels Comparison Between Serial and Parallel Concatenated Channel Coding Schemes Using Continuous Phase Modulation over AWGN and Fading Channels Abstract Manjeet Singh (ms308@eng.cam.ac.uk) - presenter Ian J.

More information

Digital Communications I: Modulation and Coding Course. Term Catharina Logothetis Lecture 12

Digital Communications I: Modulation and Coding Course. Term Catharina Logothetis Lecture 12 Digital Communications I: Modulation and Coding Course Term 3-8 Catharina Logothetis Lecture Last time, we talked about: How decoding is performed for Convolutional codes? What is a Maximum likelihood

More information

IMPERIAL COLLEGE of SCIENCE, TECHNOLOGY and MEDICINE, DEPARTMENT of ELECTRICAL and ELECTRONIC ENGINEERING.

IMPERIAL COLLEGE of SCIENCE, TECHNOLOGY and MEDICINE, DEPARTMENT of ELECTRICAL and ELECTRONIC ENGINEERING. IMPERIAL COLLEGE of SCIENCE, TECHNOLOGY and MEDICINE, DEPARTMENT of ELECTRICAL and ELECTRONIC ENGINEERING. COMPACT LECTURE NOTES on COMMUNICATION THEORY. Prof. Athanassios Manikas, version Spring 22 Digital

More information

Simulink Modeling of Convolutional Encoders

Simulink Modeling of Convolutional Encoders Simulink Modeling of Convolutional Encoders * Ahiara Wilson C and ** Iroegbu Chbuisi, *Department of Computer Engineering, Michael Okpara University of Agriculture, Umudike, Abia State, Nigeria **Department

More information

ISSN: International Journal of Innovative Research in Science, Engineering and Technology

ISSN: International Journal of Innovative Research in Science, Engineering and Technology ISSN: 39-8753 Volume 3, Issue 7, July 4 Graphical User Interface for Simulating Convolutional Coding with Viterbi Decoding in Digital Communication Systems using Matlab Ezeofor C. J., Ndinechi M.C. Lecturer,

More information

Theory of Telecommunications Networks

Theory of Telecommunications Networks Theory of Telecommunications Networks Anton Čižmár Ján Papaj Department of electronics and multimedia telecommunications CONTENTS Preface... 5 1 Introduction... 6 1.1 Mathematical models for communication

More information

EE 435/535: Error Correcting Codes Project 1, Fall 2009: Extended Hamming Code. 1 Introduction. 2 Extended Hamming Code: Encoding. 1.

EE 435/535: Error Correcting Codes Project 1, Fall 2009: Extended Hamming Code. 1 Introduction. 2 Extended Hamming Code: Encoding. 1. EE 435/535: Error Correcting Codes Project 1, Fall 2009: Extended Hamming Code Project #1 is due on Tuesday, October 6, 2009, in class. You may turn the project report in early. Late projects are accepted

More information

EFFECTIVE CHANNEL CODING OF SERIALLY CONCATENATED ENCODERS AND CPM OVER AWGN AND RICIAN CHANNELS

EFFECTIVE CHANNEL CODING OF SERIALLY CONCATENATED ENCODERS AND CPM OVER AWGN AND RICIAN CHANNELS EFFECTIVE CHANNEL CODING OF SERIALLY CONCATENATED ENCODERS AND CPM OVER AWGN AND RICIAN CHANNELS Manjeet Singh (ms308@eng.cam.ac.uk) Ian J. Wassell (ijw24@eng.cam.ac.uk) Laboratory for Communications Engineering

More information

a) Abasebanddigitalcommunicationsystemhasthetransmitterfilterg(t) thatisshowninthe figure, and a matched filter at the receiver.

a) Abasebanddigitalcommunicationsystemhasthetransmitterfilterg(t) thatisshowninthe figure, and a matched filter at the receiver. DIGITAL COMMUNICATIONS PART A (Time: 60 minutes. Points 4/0) Last Name(s):........................................................ First (Middle) Name:.................................................

More information

Swedish College of Engineering and Technology Rahim Yar Khan

Swedish College of Engineering and Technology Rahim Yar Khan PRACTICAL WORK BOOK Telecommunication Systems and Applications (TL-424) Name: Roll No.: Batch: Semester: Department: Swedish College of Engineering and Technology Rahim Yar Khan Introduction Telecommunication

More information

QUESTION BANK SUBJECT: DIGITAL COMMUNICATION (15EC61)

QUESTION BANK SUBJECT: DIGITAL COMMUNICATION (15EC61) QUESTION BANK SUBJECT: DIGITAL COMMUNICATION (15EC61) Module 1 1. Explain Digital communication system with a neat block diagram. 2. What are the differences between digital and analog communication systems?

More information

Department of Electronics and Communication Engineering 1

Department of Electronics and Communication Engineering 1 UNIT I SAMPLING AND QUANTIZATION Pulse Modulation 1. Explain in detail the generation of PWM and PPM signals (16) (M/J 2011) 2. Explain in detail the concept of PWM and PAM (16) (N/D 2012) 3. What is the

More information

EE521 Analog and Digital Communications

EE521 Analog and Digital Communications EE521 Analog and Digital Communications Questions Problem 1: SystemView... 3 Part A (25%... 3... 3 Part B (25%... 3... 3 Voltage... 3 Integer...3 Digital...3 Part C (25%... 3... 4 Part D (25%... 4... 4

More information

Detection and Estimation of Signals in Noise. Dr. Robert Schober Department of Electrical and Computer Engineering University of British Columbia

Detection and Estimation of Signals in Noise. Dr. Robert Schober Department of Electrical and Computer Engineering University of British Columbia Detection and Estimation of Signals in Noise Dr. Robert Schober Department of Electrical and Computer Engineering University of British Columbia Vancouver, August 24, 2010 2 Contents 1 Basic Elements

More information

Course Specifications

Course Specifications Development Cluster Computer and Networking Engineering (CNE) Cluster Lead Developer Amir Asif Module Names Module 1: Baseband and Bandpass Communications (40 characters or less Module 2: Channel Coding

More information

RADIO SYSTEMS ETIN15. Channel Coding. Ove Edfors, Department of Electrical and Information Technology

RADIO SYSTEMS ETIN15. Channel Coding. Ove Edfors, Department of Electrical and Information Technology RADIO SYSTEMS ETIN15 Lecture no: 7 Channel Coding Ove Edfors, Department of Electrical and Information Technology Ove.Edfors@eit.lth.se 2016-04-18 Ove Edfors - ETIN15 1 Contents (CHANNEL CODING) Overview

More information

Performance of Reed-Solomon Codes in AWGN Channel

Performance of Reed-Solomon Codes in AWGN Channel International Journal of Electronics and Communication Engineering. ISSN 0974-2166 Volume 4, Number 3 (2011), pp. 259-266 International Research Publication House http://www.irphouse.com Performance of

More information

International Journal of Scientific & Engineering Research Volume 9, Issue 3, March ISSN

International Journal of Scientific & Engineering Research Volume 9, Issue 3, March ISSN International Journal of Scientific & Engineering Research Volume 9, Issue 3, March-2018 1605 FPGA Design and Implementation of Convolution Encoder and Viterbi Decoder Mr.J.Anuj Sai 1, Mr.P.Kiran Kumar

More information

Channel Coding RADIO SYSTEMS ETIN15. Lecture no: Ove Edfors, Department of Electrical and Information Technology

Channel Coding RADIO SYSTEMS ETIN15. Lecture no: Ove Edfors, Department of Electrical and Information Technology RADIO SYSTEMS ETIN15 Lecture no: 7 Channel Coding Ove Edfors, Department of Electrical and Information Technology Ove.Edfors@eit.lth.se 2012-04-23 Ove Edfors - ETIN15 1 Contents (CHANNEL CODING) Overview

More information

BER Analysis of BPSK for Block Codes and Convolution Codes Over AWGN Channel

BER Analysis of BPSK for Block Codes and Convolution Codes Over AWGN Channel International Journal of Pure and Applied Mathematics Volume 114 No. 11 2017, 221-230 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu BER Analysis

More information

ECE 6640 Digital Communications

ECE 6640 Digital Communications ECE 6640 Digital Communications Dr. Bradley J. Bazuin Assistant Professor Department of Electrical and Computer Engineering College of Engineering and Applied Sciences Chapter 8 8. Channel Coding: Part

More information

Using TCM Techniques to Decrease BER Without Bandwidth Compromise. Using TCM Techniques to Decrease BER Without Bandwidth Compromise. nutaq.

Using TCM Techniques to Decrease BER Without Bandwidth Compromise. Using TCM Techniques to Decrease BER Without Bandwidth Compromise. nutaq. Using TCM Techniques to Decrease BER Without Bandwidth Compromise 1 Using Trellis Coded Modulation Techniques to Decrease Bit Error Rate Without Bandwidth Compromise Written by Jean-Benoit Larouche INTRODUCTION

More information

Chapter 2 Direct-Sequence Systems

Chapter 2 Direct-Sequence Systems Chapter 2 Direct-Sequence Systems A spread-spectrum signal is one with an extra modulation that expands the signal bandwidth greatly beyond what is required by the underlying coded-data modulation. Spread-spectrum

More information

Computer Science 1001.py. Lecture 25 : Intro to Error Correction and Detection Codes

Computer Science 1001.py. Lecture 25 : Intro to Error Correction and Detection Codes Computer Science 1001.py Lecture 25 : Intro to Error Correction and Detection Codes Instructors: Daniel Deutch, Amiram Yehudai Teaching Assistants: Michal Kleinbort, Amir Rubinstein School of Computer

More information

Bit error rate simulation using 16 qam technique in matlab

Bit error rate simulation using 16 qam technique in matlab Volume :2, Issue :5, 59-64 May 2015 www.allsubjectjournal.com e-issn: 2349-4182 p-issn: 2349-5979 Impact Factor: 3.762 Ravi Kant Gupta M.Tech. Scholar, Department of Electronics & Communication, Bhagwant

More information

New DC-free Multilevel Line Codes With Spectral Nulls at Rational Submultiples of the Symbol Frequency

New DC-free Multilevel Line Codes With Spectral Nulls at Rational Submultiples of the Symbol Frequency New DC-free Multilevel Line Codes With Spectral Nulls at Rational Submultiples of the Symbol Frequency Khmaies Ouahada, Hendrik C. Ferreira and Theo G. Swart Department of Electrical and Electronic Engineering

More information

Analysis of Convolutional Encoder with Viterbi Decoder for Next Generation Broadband Wireless Access Systems

Analysis of Convolutional Encoder with Viterbi Decoder for Next Generation Broadband Wireless Access Systems International Journal of Engineering and Technical Research (IJETR) ISSN: 2321-0869, Volume-3, Issue-4, April 2015 Analysis of Convolutional Encoder with Viterbi Decoder for Next Generation Broadband Wireless

More information

Lecture 4: Wireless Physical Layer: Channel Coding. Mythili Vutukuru CS 653 Spring 2014 Jan 16, Thursday

Lecture 4: Wireless Physical Layer: Channel Coding. Mythili Vutukuru CS 653 Spring 2014 Jan 16, Thursday Lecture 4: Wireless Physical Layer: Channel Coding Mythili Vutukuru CS 653 Spring 2014 Jan 16, Thursday Channel Coding Modulated waveforms disrupted by signal propagation through wireless channel leads

More information

Digital Television Lecture 5

Digital Television Lecture 5 Digital Television Lecture 5 Forward Error Correction (FEC) Åbo Akademi University Domkyrkotorget 5 Åbo 8.4. Error Correction in Transmissions Need for error correction in transmissions Loss of data during

More information

SNR Estimation in Nakagami-m Fading With Diversity Combining and Its Application to Turbo Decoding

SNR Estimation in Nakagami-m Fading With Diversity Combining and Its Application to Turbo Decoding IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 50, NO. 11, NOVEMBER 2002 1719 SNR Estimation in Nakagami-m Fading With Diversity Combining Its Application to Turbo Decoding A. Ramesh, A. Chockalingam, Laurence

More information

EC6501 Digital Communication

EC6501 Digital Communication EC6501 Digital Communication UNIT -1 DIGITAL COMMUNICATION SYSTEMS Digital Communication system 1) Write the advantages and disadvantages of digital communication. [A/M 11] The advantages of digital communication

More information

ECE 6640 Digital Communications

ECE 6640 Digital Communications ECE 6640 Digital Communications Dr. Bradley J. Bazuin Assistant Professor Department of Electrical and Computer Engineering College of Engineering and Applied Sciences Chapter 8 8. Channel Coding: Part

More information

MODULATION METHODS EMPLOYED IN DIGITAL COMMUNICATION: An Analysis

MODULATION METHODS EMPLOYED IN DIGITAL COMMUNICATION: An Analysis International Journal of Electrical & Computer Sciences IJECS-IJENS Vol: 12 No: 03 85 MODULATION METHODS EMPLOYED IN DIGITAL COMMUNICATION: An Analysis Adeleke, Oluseye A. and Abolade, Robert O. Abstract

More information

Problem Sheet 1 Probability, random processes, and noise

Problem Sheet 1 Probability, random processes, and noise Problem Sheet 1 Probability, random processes, and noise 1. If F X (x) is the distribution function of a random variable X and x 1 x 2, show that F X (x 1 ) F X (x 2 ). 2. Use the definition of the cumulative

More information

Amplitude Frequency Phase

Amplitude Frequency Phase Chapter 4 (part 2) Digital Modulation Techniques Chapter 4 (part 2) Overview Digital Modulation techniques (part 2) Bandpass data transmission Amplitude Shift Keying (ASK) Phase Shift Keying (PSK) Frequency

More information

SCHEME OF COURSE WORK. Course Code : 13EC1114 L T P C : ELECTRONICS AND COMMUNICATION ENGINEERING

SCHEME OF COURSE WORK. Course Code : 13EC1114 L T P C : ELECTRONICS AND COMMUNICATION ENGINEERING SCHEME OF COURSE WORK Course Details: Course Title : DIGITAL COMMUNICATIONS Course Code : 13EC1114 L T P C 4 0 0 3 Program Specialization Semester Prerequisites Courses to which it is a prerequisite :

More information

Communications Theory and Engineering

Communications Theory and Engineering Communications Theory and Engineering Master's Degree in Electronic Engineering Sapienza University of Rome A.A. 2018-2019 Channel Coding The channel encoder Source bits Channel encoder Coded bits Pulse

More information

Synchronization of Hamming Codes

Synchronization of Hamming Codes SYCHROIZATIO OF HAMMIG CODES 1 Synchronization of Hamming Codes Aveek Dutta, Pinaki Mukherjee Department of Electronics & Telecommunications, Institute of Engineering and Management Abstract In this report

More information

Chapter 4. Part 2(a) Digital Modulation Techniques

Chapter 4. Part 2(a) Digital Modulation Techniques Chapter 4 Part 2(a) Digital Modulation Techniques Overview Digital Modulation techniques Bandpass data transmission Amplitude Shift Keying (ASK) Phase Shift Keying (PSK) Frequency Shift Keying (FSK) Quadrature

More information

Chapter 6 Passband Data Transmission

Chapter 6 Passband Data Transmission Chapter 6 Passband Data Transmission Passband Data Transmission concerns the Transmission of the Digital Data over the real Passband channel. 6.1 Introduction Categories of digital communications (ASK/PSK/FSK)

More information

Performance Evaluation of different α value for OFDM System

Performance Evaluation of different α value for OFDM System Performance Evaluation of different α value for OFDM System Dr. K.Elangovan Dept. of Computer Science & Engineering Bharathidasan University richirappalli Abstract: Orthogonal Frequency Division Multiplexing

More information

S Coding Methods (5 cr) P. Prerequisites. Literature (1) Contents

S Coding Methods (5 cr) P. Prerequisites. Literature (1) Contents S-72.3410 Introduction 1 S-72.3410 Introduction 3 S-72.3410 Coding Methods (5 cr) P Lectures: Mondays 9 12, room E110, and Wednesdays 9 12, hall S4 (on January 30th this lecture will be held in E111!)

More information

The BICM Capacity of Coherent Continuous-Phase Frequency Shift Keying

The BICM Capacity of Coherent Continuous-Phase Frequency Shift Keying The BICM Capacity of Coherent Continuous-Phase Frequency Shift Keying Rohit Iyer Seshadri, Shi Cheng and Matthew C. Valenti Lane Dept. of Computer Sci. and Electrical Eng. West Virginia University Morgantown,

More information

Basics of Error Correcting Codes

Basics of Error Correcting Codes Basics of Error Correcting Codes Drawing from the book Information Theory, Inference, and Learning Algorithms Downloadable or purchasable: http://www.inference.phy.cam.ac.uk/mackay/itila/book.html CSE

More information

Layered Space-Time Codes

Layered Space-Time Codes 6 Layered Space-Time Codes 6.1 Introduction Space-time trellis codes have a potential drawback that the maximum likelihood decoder complexity grows exponentially with the number of bits per symbol, thus

More information

Study of Turbo Coded OFDM over Fading Channel

Study of Turbo Coded OFDM over Fading Channel International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 3, Issue 2 (August 2012), PP. 54-58 Study of Turbo Coded OFDM over Fading Channel

More information

CSE4214 Digital Communications. Bandpass Modulation and Demodulation/Detection. Bandpass Modulation. Page 1

CSE4214 Digital Communications. Bandpass Modulation and Demodulation/Detection. Bandpass Modulation. Page 1 CSE414 Digital Communications Chapter 4 Bandpass Modulation and Demodulation/Detection Bandpass Modulation Page 1 1 Bandpass Modulation n Baseband transmission is conducted at low frequencies n Passband

More information

Error Correction with Hamming Codes

Error Correction with Hamming Codes Hamming Codes http://www2.rad.com/networks/1994/err_con/hamming.htm Error Correction with Hamming Codes Forward Error Correction (FEC), the ability of receiving station to correct a transmission error,

More information

AN IMPROVED NEURAL NETWORK-BASED DECODER SCHEME FOR SYSTEMATIC CONVOLUTIONAL CODE. A Thesis by. Andrew J. Zerngast

AN IMPROVED NEURAL NETWORK-BASED DECODER SCHEME FOR SYSTEMATIC CONVOLUTIONAL CODE. A Thesis by. Andrew J. Zerngast AN IMPROVED NEURAL NETWORK-BASED DECODER SCHEME FOR SYSTEMATIC CONVOLUTIONAL CODE A Thesis by Andrew J. Zerngast Bachelor of Science, Wichita State University, 2008 Submitted to the Department of Electrical

More information

Introduction to Error Control Coding

Introduction to Error Control Coding Introduction to Error Control Coding 1 Content 1. What Error Control Coding Is For 2. How Coding Can Be Achieved 3. Types of Coding 4. Types of Errors & Channels 5. Types of Codes 6. Types of Error Control

More information

ECE710 Space Time Coding For Wireless Communication HW3

ECE710 Space Time Coding For Wireless Communication HW3 THIS IS FOR LEFT PAGES 1 ECE710 Space Time Coding For Wireless Communication HW3 Zhirong Li Electrical & Computer Engineering Department University of Waterloo, Waterloo, ON, Canada z32li@engmail.uwaterloo.ca

More information

Department of Electronic Engineering FINAL YEAR PROJECT REPORT

Department of Electronic Engineering FINAL YEAR PROJECT REPORT Department of Electronic Engineering FINAL YEAR PROJECT REPORT BEngECE-2009/10-- Student Name: CHEUNG Yik Juen Student ID: Supervisor: Prof.

More information

Digital Modulators & Line Codes

Digital Modulators & Line Codes Digital Modulators & Line Codes Professor A. Manikas Imperial College London EE303 - Communication Systems An Overview of Fundamental Prof. A. Manikas (Imperial College) EE303: Dig. Mod. and Line Codes

More information

Master s Thesis Defense

Master s Thesis Defense Master s Thesis Defense Comparison of Noncoherent Detectors for SOQPSK and GMSK in Phase Noise Channels Afzal Syed August 17, 2007 Committee Dr. Erik Perrins (Chair) Dr. Glenn Prescott Dr. Daniel Deavours

More information

ERROR CONTROL CODING From Theory to Practice

ERROR CONTROL CODING From Theory to Practice ERROR CONTROL CODING From Theory to Practice Peter Sweeney University of Surrey, Guildford, UK JOHN WILEY & SONS, LTD Contents 1 The Principles of Coding in Digital Communications 1.1 Error Control Schemes

More information

ECE 5325/6325: Wireless Communication Systems Lecture Notes, Spring 2013

ECE 5325/6325: Wireless Communication Systems Lecture Notes, Spring 2013 ECE 5325/6325: Wireless Communication Systems Lecture Notes, Spring 2013 Lecture 18 Today: (1) da Silva Discussion, (2) Error Correction Coding, (3) Error Detection (CRC) HW 8 due Tue. HW 9 (on Lectures

More information

ECE 3500: Fundamentals of Signals and Systems (Fall 2014) Lab 4: Binary Phase-Shift Keying Modulation and Demodulation

ECE 3500: Fundamentals of Signals and Systems (Fall 2014) Lab 4: Binary Phase-Shift Keying Modulation and Demodulation ECE 3500: Fundamentals of Signals and Systems (Fall 2014) Lab 4: Binary Phase-Shift Keying Modulation and Demodulation Files necessary to complete this assignment: none Deliverables Due: Before your assigned

More information

Novel Encoding and Decoding Algorithm for Block Turbo Codes over Rayleigh Fading Channel

Novel Encoding and Decoding Algorithm for Block Turbo Codes over Rayleigh Fading Channel International Journal Of Computational Engineering Research (ijceronline.com) Vol. 3 Issue. 3 Novel Encoding and Decoding Algorithm for Block Turbo Codes over Rayleigh Fading Channel 1, M.Christhu Raju,,

More information

UNIVERSITY OF SOUTHAMPTON

UNIVERSITY OF SOUTHAMPTON UNIVERSITY OF SOUTHAMPTON ELEC6014W1 SEMESTER II EXAMINATIONS 2007/08 RADIO COMMUNICATION NETWORKS AND SYSTEMS Duration: 120 mins Answer THREE questions out of FIVE. University approved calculators may

More information

VARDHAMAN COLLEGE OF ENGINEERING (AUTONOMOUS) Affiliated to JNTUH, Hyderabad ASSIGNMENT QUESTION BANK

VARDHAMAN COLLEGE OF ENGINEERING (AUTONOMOUS) Affiliated to JNTUH, Hyderabad ASSIGNMENT QUESTION BANK VARDHAMAN COLLEGE OF ENGINEERING (AUTONOMOUS) Affiliated to JNTUH, Hyderabad ASSIGNMENT QUESTION BANK Name of the subject: Digital Communications B.Tech/M.Tech/MCA/MBA Subject Code: A1424 Semester: VI

More information

DIGITAL COMMINICATIONS

DIGITAL COMMINICATIONS Code No: R346 R Set No: III B.Tech. I Semester Regular and Supplementary Examinations, December - 23 DIGITAL COMMINICATIONS (Electronics and Communication Engineering) Time: 3 Hours Max Marks: 75 Answer

More information

2018/11/1 Thursday. YU Xiangyu

2018/11/1 Thursday. YU Xiangyu 2018/11/1 Thursday YU Xiangyu yuxy@scut.edu.cn Introduction ARQ FEC Parity Check Block Codes Cyclic Codes CRC (Cyclic Redundancy Check) Convolutional Codes Interleaving Turbo Codes LDPC Information to

More information

Error Protection: Detection and Correction

Error Protection: Detection and Correction Error Protection: Detection and Correction Communication channels are subject to noise. Noise distorts analog signals. Noise can cause digital signals to be received as different values. Bits can be flipped

More information

Improvement Of Block Product Turbo Coding By Using A New Concept Of Soft Hamming Decoder

Improvement Of Block Product Turbo Coding By Using A New Concept Of Soft Hamming Decoder European Scientific Journal June 26 edition vol.2, No.8 ISSN: 857 788 (Print) e - ISSN 857-743 Improvement Of Block Product Turbo Coding By Using A New Concept Of Soft Hamming Decoder Alaa Ghaith, PhD

More information

MATHEMATICS IN COMMUNICATIONS: INTRODUCTION TO CODING. A Public Lecture to the Uganda Mathematics Society

MATHEMATICS IN COMMUNICATIONS: INTRODUCTION TO CODING. A Public Lecture to the Uganda Mathematics Society Abstract MATHEMATICS IN COMMUNICATIONS: INTRODUCTION TO CODING A Public Lecture to the Uganda Mathematics Society F F Tusubira, PhD, MUIPE, MIEE, REng, CEng Mathematical theory and techniques play a vital

More information

Versuch 7: Implementing Viterbi Algorithm in DLX Assembler

Versuch 7: Implementing Viterbi Algorithm in DLX Assembler FB Elektrotechnik und Informationstechnik AG Entwurf mikroelektronischer Systeme Prof. Dr.-Ing. N. Wehn Vertieferlabor Mikroelektronik Modelling the DLX RISC Architecture in VHDL Versuch 7: Implementing

More information

Revision of Lecture Eleven

Revision of Lecture Eleven Revision of Lecture Eleven Previous lecture we have concentrated on carrier recovery for QAM, and modified early-late clock recovery for multilevel signalling as well as star 16QAM scheme Thus we have

More information

Forward Error Correction for experimental wireless ftp radio link over analog FM

Forward Error Correction for experimental wireless ftp radio link over analog FM Technical University of Crete Department of Computer and Electronic Engineering Forward Error Correction for experimental wireless ftp radio link over analog FM Supervisor: Committee: Nikolaos Sidiropoulos

More information

Statistical Communication Theory

Statistical Communication Theory Statistical Communication Theory Mark Reed 1 1 National ICT Australia, Australian National University 21st February 26 Topic Formal Description of course:this course provides a detailed study of fundamental

More information

code V(n,k) := words module

code V(n,k) := words module Basic Theory Distance Suppose that you knew that an English word was transmitted and you had received the word SHIP. If you suspected that some errors had occurred in transmission, it would be impossible

More information

Forward Error Correction Technique using Convolution Encoder & Viterbi Decoder

Forward Error Correction Technique using Convolution Encoder & Viterbi Decoder Forward Error Correction Technique using Convolution Encoder & Viterbi Decoder Awantika Vishwakarma 1, Pankaj Gulhane 2 Dept. of VLSI & Embeded System, Electronics & tele Communication, Disha Institute

More information

Serially Concatenated Coded Continuous Phase Modulation for Aeronautical Telemetry

Serially Concatenated Coded Continuous Phase Modulation for Aeronautical Telemetry Serially Concatenated Coded Continuous Phase Modulation for Aeronautical Telemetry c 2008 Kanagaraj Damodaran Submitted to the Department of Electrical Engineering & Computer Science and the Faculty of

More information

Digital to Digital Encoding

Digital to Digital Encoding MODULATION AND ENCODING Data must be transformed into signals to send them from one place to another Conversion Schemes Digital-to-Digital Analog-to-Digital Digital-to-Analog Analog-to-Analog Digital to

More information

Chapter 10 Error Detection and Correction

Chapter 10 Error Detection and Correction Chapter 10 Error Detection and Correction 10.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 10.2 Note Data can be corrupted during transmission. Some applications

More information

Integration of System Design and Standard Development in Digital Communication Education

Integration of System Design and Standard Development in Digital Communication Education Session F Integration of System Design and Standard Development in Digital Communication Education Xiaohua(Edward) Li State University of New York at Binghamton Abstract An innovative way is presented

More information

CONVOLUTIONAL CODED GENERALIZED DIRECT SEQUENCE SPREAD SPECTRUM

CONVOLUTIONAL CODED GENERALIZED DIRECT SEQUENCE SPREAD SPECTRUM CONVOLUTIONAL CODED GENERALIZED DIRECT SEQUENCE SPREAD SPECTRUM 1 VISHAL J. PATEL, 2 MITESH D. PATEL 1, PG Student, E.C. Department KIT&RC, Kalol, Gujarat, India 2, Associate Professor, E.C. Department

More information

ECE 3500: Fundamentals of Signals and Systems (Fall 2015) Lab 4: Binary Phase-Shift Keying Modulation and Demodulation

ECE 3500: Fundamentals of Signals and Systems (Fall 2015) Lab 4: Binary Phase-Shift Keying Modulation and Demodulation ECE 500: Fundamentals of Signals and Systems (Fall 2015) Lab 4: Binary Phase-Shift Keying Modulation and Demodulation Files necessary to complete this assignment: none Deliverables Due: Before Dec. 18th

More information

Performance and Complexity Tradeoffs of Space-Time Modulation and Coding Schemes

Performance and Complexity Tradeoffs of Space-Time Modulation and Coding Schemes Performance and Complexity Tradeoffs of Space-Time Modulation and Coding Schemes The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation

More information

Distortion Tolerant Source Code Using Viterbi Algorithm

Distortion Tolerant Source Code Using Viterbi Algorithm University of Arkansas, Fayetteville ScholarWorks@UARK Electrical Engineering Undergraduate Honors Theses Electrical Engineering 5-2013 Distortion Tolerant Source Code Using Viterbi Algorithm Christopher

More information

TCM-coded OFDM assisted by ANN in Wireless Channels

TCM-coded OFDM assisted by ANN in Wireless Channels 1 Aradhana Misra & 2 Kandarpa Kumar Sarma Dept. of Electronics and Communication Technology Gauhati University Guwahati-781014. Assam, India Email: aradhana66@yahoo.co.in, kandarpaks@gmail.com Abstract

More information

Lecture #2. EE 471C / EE 381K-17 Wireless Communication Lab. Professor Robert W. Heath Jr.

Lecture #2. EE 471C / EE 381K-17 Wireless Communication Lab. Professor Robert W. Heath Jr. Lecture #2 EE 471C / EE 381K-17 Wireless Communication Lab Professor Robert W. Heath Jr. Preview of today s lecture u Introduction to digital communication u Components of a digital communication system

More information

Department of Electronics & Communication Engineering LAB MANUAL SUBJECT: DIGITAL COMMUNICATION LABORATORY [ECE324] (Branch: ECE)

Department of Electronics & Communication Engineering LAB MANUAL SUBJECT: DIGITAL COMMUNICATION LABORATORY [ECE324] (Branch: ECE) Department of Electronics & Communication Engineering LAB MANUAL SUBJECT: DIGITAL COMMUNICATION LABORATORY [ECE324] B.Tech Year 3 rd, Semester - 5 th (Branch: ECE) Version: 01 st August 2018 The LNM Institute

More information

ECE 5325/6325: Wireless Communication Systems Lecture Notes, Spring 2013

ECE 5325/6325: Wireless Communication Systems Lecture Notes, Spring 2013 ECE 5325/6325: Wireless Communication Systems Lecture Notes, Spring 2013 Lecture 18 Today: (1) da Silva Discussion, (2) Error Correction Coding, (3) Error Detection (CRC) HW 8 due Tue. HW 9 (on Lectures

More information

Error-Correcting Codes

Error-Correcting Codes Error-Correcting Codes Information is stored and exchanged in the form of streams of characters from some alphabet. An alphabet is a finite set of symbols, such as the lower-case Roman alphabet {a,b,c,,z}.

More information