1. A computer-implemented method of entropy coding for video coding comprising: receiving image data comprising a syntax having a sequence of symbols to be entropy coded; and updating a previous probability from a previous frame relative to a current frame being entropy encoded that a symbol will occur in one of the sequences comprising: setting a search range among a set of possible update probabilities comprising: setting a first candidate probability as one end of the search range by using a count of a syntax counter and without regard to bit-cost to update the previous probability, and; setting another end of the search range as the previous probability; selecting one of the candidate probabilities on a look-up table and within the search range to update the previous probability for coding of the symbol, and selecting based on, at least in part, the bit-cost associated with updating the previous probability with at least one of the candidate probabilities; and updating the previous probability by using the selected candidate probability.
1. A computer-implemented method of entropy coding for video coding comprising: receiving image data comprising a syntax having a sequence of symbols to be entropy coded; and updating a previous probability from a previous frame relative to a current frame being entropy encoded that a symbol will occur in one of the sequences comprising: setting a search range among a set of possible update probabilities comprising: setting a first candidate probability as one end of the search range by using a count of a syntax counter and without regard to bit-cost to update the previous probability, and; setting another end of the search range as the previous probability; selecting one of the candidate probabilities on a look-up table and within the search range to update the previous probability for coding of the symbol, and selecting based on, at least in part, the bit-cost associated with updating the previous probability with at least one of the candidate probabilities; and updating the previous probability by using the selected candidate probability. 8. The method of claim 1 comprising limiting the searching to a maximum of three candidate probabilities in addition to the first candidate probability and for each single bit of a syntax.