Given a length t segment we need to do rt forward

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: + 2 log3 (T /3) frames, which has only logarithmic growth in T. This is where we get the O(logb (T )) memory. In general, the memory that we need is + k (b − 1) = + logb (T / )(b − 1) (9.34) = + b logb (T / ) − logb (T / ) (9.35) (9.36) = O( + b logb (T )) frames. Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-43 (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). 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. 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 mess...
View Full Document

This document was uploaded on 04/05/2014.

Ask a homework question - tutors are online