38 then expand rt to get 939 rt t t

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: mber of forward messages needed for each subsegment is R(T /b). Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-44 (of 180) k-best without the penalty Island Summary Scratch Time Cost Multiple redundant forward messages but only one sweep of backwards messages (unfortunately, forward messages are often more expensive for DGMs). Given a length T segment, we need to do R(T ) forward messages in total. We must at least do T forward messages Must also do (b − 1) forward sweeps through each of the top-level subsegments of length T /b, and the number of forward messages needed for each subsegment is R(T /b). recurrence relationship: R(T ) = T + (b − 1) ∗ R(T /b). Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 (9.37) page 9-44 (of 180) k-best without the penalty Island Summary Scratch Time Cost - Solving the Recurrence To solve it, we can simplify by bounding R(T ) as follows R(T ) < T + b ∗ R(T /b) Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 (9.38) page 9-45 (of 180) k-best without the penalty Island Summary Scrat...
View Full Document

This document was uploaded on 04/05/2014.

Ask a homework question - tutors are online