Lect5

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Kevin Buckley - 2007 1 ECE 8770 Topics in Digital Communications - Sp. 2007 Lecture 5 2 Symbol Detection and Sequence Estimation In Subsection 2.3 we introduced MLSE in general terms, and considered it as applied for memoryless (“noninteracting symbol ”) modulation schemes, DPSK, PRS and CPM. In Section 3 of the Course we will again consider MLSE for InterSymbol Interference (ISI) channels. Here we introduce the Viterbi algorithm as a computationally efficient approach to solving a certain class of ML and MAP sequence estimation problems. We first introduce it in general terms, and then apply it to DPSK, PRS and CPM examples. 2.4.1 Sequence Estimation for Hidden Markov Models (HMM’s) Markov Random Processes: Consider a continuous-time random process X (t). We know from an introductory discussion on random processes that the complete statistical characterization of X (t) – the set of all joint PDF’s of all possible combinations of samples all possible numbers of samples of X (t) – is in...
View Full Document

This document was uploaded on 10/12/2009.

Ask a homework question - tutors are online