Medicaps Institute of Technology & Management Submitted by :- Prasanna Panse Priyanka Shukla Savita Deshmukh Guided by :- Mr. Anshul Shrotriya Assistant.

Slides:



Advertisements
Similar presentations
Noise-Predictive Turbo Equalization for Partial Response Channels Sharon Aviran, Paul H. Siegel and Jack K. Wolf Department of Electrical and Computer.
Advertisements

Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Decoding of Convolutional Codes  Let C m be the set of allowable code sequences of length m.  Not all sequences in {0,1}m are allowable code sequences!
Digital Communication
1 Helsinki University of Technology,Communications Laboratory, Timo O. Korhonen Data Communication, Lecture6 Digital Baseband Transmission.
1. INTRODUCTION In order to transmit digital information over * bandpass channels, we have to transfer the information to a carrier wave of.appropriate.
Maximum Likelihood Sequence Detection (MLSD) and the Viterbi Algorithm
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
EEE377 Lecture Notes1 EEE436 DIGITAL COMMUNICATION Coding En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex, UK) Room 2.14.
Sep 06, 2005CS477: Analog and Digital Communications1 Introduction Analog and Digital Communications Autumn
Elements of a Digital Communication System
Multiple-input multiple-output (MIMO) communication systems
Figure 6.1. A convolutional encoder. Figure 6.2. Structure of a systematic convolutional encoder of rate.
1 Dr. Uri Mahlab. INTRODUCTION In order to transmit digital information over * bandpass channels, we have to transfer the information to a carrier wave.
Synchronization in Software Radio (Timing Recovery) Presented by: Shima kheradmand.
Digital communications I: Modulation and Coding Course Period Catharina Logothetis Lecture 6.
Digital Communications I: Modulation and Coding Course Spring Jeffrey N. Denenberg Lecture 3b: Detection and Signal Spaces.
EE 3220: Digital Communication Dr Hassan Yousif 1 Dr. Hassan Yousif Ahmed Department of Electrical Engineering College of Engineering at Wadi Aldwasser.
EE 3220: Digital Communication Dr Hassan Yousif 1 Dr. Hassan Yousif Ahmed Department of Electrical Engineering College of Engineering at Wadi Aldwasser.
Digital Communications I: Modulation and Coding Course Spring Jeffrey N. Denenberg Lecture 4: BandPass Modulation/Demodulation.
Digital Communications I: Modulation and Coding Course
Digital communication - vector approach Dr. Uri Mahlab 1 Digital Communication Vector Space concept.
Matched Filters By: Andy Wang.
1 Digital Communication Systems Lecture-3, Prof. Dr. Habibullah Jamal Under Graduate, Spring 2008.
Digital Transmission through the AWGN Channel ECE460 Spring, 2012.
Carrier-Amplitude modulation In baseband digital PAM: (2d - the Euclidean distance between two adjacent points)
Modulation, Demodulation and Coding Course
ECED 4504 Digital Transmission Theory
S Advanced Digital Communication (4 cr)
Digital Communication I: Modulation and Coding Course
Dept. of EE, NDHU 1 Chapter Three Baseband Demodulation/Detection.
Digital Transmission through the AWGN Channel ECE460 Spring, 2012.
S Digital Communication Systems The Viterbi algorithm, optimum coherent bandpass modulation.
Baseband Demodulation/Detection
1 Dr. Uri Mahlab. 1.א1.א תוכן עניינים : Introduction of Binary Digital Modulation Schemes 2-10 Probability of error Transfer function of the optimum.
1 Chapter 1 Introduction to spread-spectrum communications Part I.
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 12.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Coding Theory. 2 Communication System Channel encoder Source encoder Modulator Demodulator Channel Voice Image Data CRC encoder Interleaver Deinterleaver.
Performance of Digital Communications System
CHAPTER 5 SIGNAL SPACE ANALYSIS
EE 3220: Digital Communication
1 CONTEXT DEPENDENT CLASSIFICATION  Remember: Bayes rule  Here: The class to which a feature vector belongs depends on:  Its own value  The values.
EE 3220: Digital Communication
Digital Communications Chapeter 3. Baseband Demodulation/Detection Signal Processing Lab.
1 Channel Coding (III) Channel Decoding. ECED of 15 Topics today u Viterbi decoding –trellis diagram –surviving path –ending the decoding u Soft.
Last time, we talked about:
ECE 4710: Lecture #31 1 System Performance  Chapter 7: Performance of Communication Systems Corrupted by Noise  Important Practical Considerations: 
Timo O. Korhonen, HUT Communication Laboratory 1 Convolutional encoding u Convolutional codes are applied in applications that require good performance.
Constellation Diagram
DIGITAL CARRIER MODULATION SCHEMES Dr.Uri Mahlab 1 Dr. Uri Mahlab.
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 9.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Baseband Receiver Receiver Design: Demodulation Matched Filter Correlator Receiver Detection Max. Likelihood Detector Probability of Error.
EE 3220: Digital Communication Dr. Hassan Yousif Ahmed Department of Electrical Engineering College of Engineering at Wadi Aldwasser Slman bin Abdulaziz.
Performance of Digital Communications System
Digital Communications I: Modulation and Coding Course Spring Jeffrey N. Denenberg Lecture 3c: Signal Detection in AWGN.
1 Code design: Computer search Low rate: Represent code by its generator matrix Find one representative for each equivalence class of codes Permutation.
Institute for Experimental Mathematics Ellernstrasse Essen - Germany DATA COMMUNICATION introduction A.J. Han Vinck May 10, 2003.
INTERSYMBOL INTERFERENCE (ISI)
The Viterbi Decoding Algorithm
Lecture 1.30 Structure of the optimal receiver deterministic signals.
Advanced Wireless Networks
Pulse Code Modulation (PCM)
Equalization in a wideband TDMA system
I. Previously on IET.
S Digital Communication Systems
Pulse Code Modulation (PCM)
Bandpass Modulation and Demodulation
Presentation transcript:

Medicaps Institute of Technology & Management Submitted by :- Prasanna Panse Priyanka Shukla Savita Deshmukh Guided by :- Mr. Anshul Shrotriya Assistant Professor Department of Electronics and Communication OPTIMUM RECEIVERS FOR CHANNELS WITH ISI AND AWGN

INTRODUCTION In order to transmit digital information over bandpass channels, we have to transfer information to a carrier wave of appropriate frequency.

OPTIMUM RECEIVER The performance of the receiver is usually measured in terms of the probability of error and the receiver is said to be optimum if it yields the minimum probability of error.

OPTIMUM RECEIVER FOR AN AWGN CHANNEL WITH ISI Matched Filter h(t) SamplerMLSE Clock t=KT Output data Received Signal R1(t)

Maximum Likelihood Sequence Estimation When the signal has no memory, the symbol-by-symbol detector described in the preceding section is optimum in the sense of minimizing the probability of a symbol error. When the transmitted signal has memory, i.e., the signals transmitted in successive symbol intervals are interdependent. MLSE criterion is equivalent to the problem of estimating the state of a discrete time finite state machine. The finite state machine in this case is the equivalent discrete time channel.

To develop the maximum-likelihood sequence detection algorithm, let us consider, as an example, the NRZI signal. Its memory is characterized by the trellis shown in the following figure: The signal transmitted in each signal interval is binary PAM.

Since the channel noise is assumed to be white and Gaussian and f(t= iT), f(t =jT) for i≠j are orthogonal. Hence, the noise sequence n1, n2, …, nk is also white. Then, given the received sequence r1,r2,…,rk at the output,,the detector determines the sequence s(m)={s1(m),s2(m),..,sK (m)}. Such a detector is called the maximum-likelihood (ML) sequence detector. For the NRZI example, which employs binary modulation, the total number of sequence is 2K, where K is the number of outputs obtained from the demodulator. However, this is not the case. We may reduce the number of the sequences in the trellis search by using the Viterbi algorithm to eliminate sequences as new data is received from the demodulator.

Viterbi Algorithm The Viterbi algorithm is a sequence trellis search algorithm for performing ML sequence detection. Basic concept – Generate the code trellis at the decoder. The decoder penetrates through the code trellis level by level in search for the transmitted code sequence. At each level of the trellis, the decoder computes and compares the metrics of all the partial paths entering a node. The decoder stores the partial path with the larger metric and eliminates all the other partial paths.

The corresponding trellis is shown in the following figure : At time t=T, we receive r1=s1+n1 from the demodulator, and at t=2T, we receive r2=s2+n2.

For the two paths entering node S(0), we compute the two Euclidean distance metrics. The Viterbi algorithm compares these two metrics and discards the path having the larger metrics. The other path with the lower metric is saved. Similarly, for two paths entering node S1 at t=2T, we compute the two Euclidean distance metrics by using the output r1 and r2 from the demodulator. The two metrics are compared and the signal path with the larger metric is eliminated. Thus, at t=2T, we are left with two survivor paths, one at node S0 and the other at node S1, and their corresponding metrics.

Discrete time model for a channel with ISI ISI is a form of distortion of a signal in which one symbol interferes with subsequent symbols. This is an unwanted phenomenon as effect as noise, It making the communication less reliable. The transmitter sends discrete time symbols at a rate of 1/T per second and the sampled output of match filter at the receiver is also discrete time signal with samples rate 1/T per second.

Major difficulty with discrete model occurs in the evaluation of performance of equalization techniques. The major difficulty is caused by correlation in the noise sequence V(k) at the out put of match filter. More convenient to deal with the white noise sequence when calculating error rate performance.

Thank you