Hence the compute requirements now are on 2 b 1t b

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: f the subsegments (length T /b) since no more than one subsegment is ever stored at the same time Hence, memory cost becomes O(N (b + T /b)) still linear in T but factor b reduction. Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-34 (of 180) k-best without the penalty Island Summary Scratch Memory/Compute Memory: cost of each island (b of them) and cost of one of the subsegments (length T /b) since no more than one subsegment is ever stored at the same time Hence, memory cost becomes O(N (b + T /b)) still linear in T but factor b reduction. The compute requirements increase, since perform an additional (b − 1) forward passes each of which costs T /b. Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-34 (of 180) k-best without the penalty Island Summary Scratch Memory/Compute Memory: cost of each island (b of them) and cost of one of the subsegments (length T /b) since no more than one subsegment is ever stored at the same time Hence, memory cost becomes O(N (b + T /b)) st...
View Full Document

Ask a homework question - tutors are online