Kevin buckley 2007 9 example 6 cpm consider the cpm

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: 000000001111111111 11111111110000000000 00000000001111111111 1111111111 00000000001111111111 11111111111111111111 00000000000000000000 10 42 42 11111111111111111111 00000000000000000000 11111111111111111111 00000000000000000000 1 0 1 0 1 0 1 0 11111111111111111111 00000000000000000000 1 0 1 0 1 0 1 0 14 Figure 3: Illustration of the Viterbi algorithm for PRS MLSE. Kevin Buckley - 2007 9 Example 6 - CPM: Consider the CPM modulation scheme described in Example 2 5 from Lecture 4. That is, L = 2, h = 3 and M = 2 with symbols In = ±1. The cost at stage n is on the form r (nT ) − 2E 2 cos[2πfc t + θn + 2π (In q (0) + In−1 q (T ))] T 3 1 8 2 . (19) 2 Let fc T = 3 , E = T , q (0) = 2 and q (T ) = 3 . The cost is then 8 2 1 1 4 r (nT ) − cos[ 3πn + θn + π ( In + In−1 )] [ 6 2 . (20) Assume that the initial state if S0 = {θ1 , I0 } = {0, 1}. Determine the MLSE estimate I1 , I2 , I3 , I4 given data {r1 , r2 , r3 , r4 } = Kevin Buckley - 2007 10 For the DPSK, PRS and CPM MLSE problems discussed in this subsection, Viterbi pruning is opti...
View Full Document

This document was uploaded on 10/12/2009.

Ask a homework question - tutors are online