ref: b8b3f1a46d756bef73cb4f3cd6990a01cbacaa25
parent: 38cb616fbfcc3b372bb14325c897af852b02a4c7
author: Deb Mukherjee <debargha@google.com>
date: Wed May 8 06:04:14 EDT 2013
Balancing coef-tree to reduce bool decodes This patch changes the coefficient tree to move the EOB to below the ZERO node in order to save number of bool decodes. The advantages of moving EOB one step down as opposed to two steps down in the other parallel patch are: 1. The coef modeling based on the One-node becomes independent of the tree structure above it, and 2. Fewer conext/counter increases are needed. The drawback is that the potential savings in bool decodes will be less, but assuming that 0s are much more predominant than 1's the potential savings is still likely to be substantial. Results on derf300: -0.237% Change-Id: Ie784be13dc98291306b338e8228703a4c2ea2242