22. At least one non-transitory computer-readable medium having stored thereon instructions that when executed cause a computing device to: receive image data comprising a syntax having a sequence of symbols to be entropy coded; and update 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: set a search range among a set of possible update probabilities comprising: set 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 set another end of the search range as the previous probability; select 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 update the previous probability by using the selected candidate probability.
22. At least one non-transitory computer-readable medium having stored thereon instructions that when executed cause a computing device to: receive image data comprising a syntax having a sequence of symbols to be entropy coded; and update 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: set a search range among a set of possible update probabilities comprising: set 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 set another end of the search range as the previous probability; select 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 update the previous probability by using the selected candidate probability. 23. The computer-readable medium of claim 22 wherein the motion estimation unit is arranged to: wherein the search range is determined by using a syntax counter that counts the number of 0s and number of 1s used to code a single bit of a syntax after the syntax has been binarized; the instructions cause the computing device to: generate the look-up table by associating one or more potential candidate probabilities with each update probability value of a plurality of the update probability values, wherein the update probability values form an index for the look-up table; wherein the search range is set by associating the previous probability and the first candidate probability with respective update probability values indexing the look-up table; the instructions cause the computing device to: generate the look up table by establishing a range of update probabilities as an index of the look-up table by using initial previous probabilities and corresponding initial first candidate probabilities; generate the look-up table by selecting the candidate probabilities for each update probability indexing the look-up table by selecting the probabilities from an initial range of probabilities for placement on the look-up table, wherein the selected candidate probabilities assigned to an update probability (1) each have different probability update costs relative to each other, and (2) have a probability value closest to the update candidate value that is an initial first candidate probability; limit the searching to a maximum of three candidate probabilities in addition to the first candidate probability and for each single bit of a syntax; select candidate probabilities based on, at least in part, comparing a new probability based value to a previous probability based value; select candidate probabilities, at least in part, depending on the results of one of: (1) determining the difference between the new probability based value and a candidate probability from the look up table selected by using the new probability based value as an index number to look up the candidate probability, and (2) determining the difference between (a) a change value based on, at least in part, the difference between the new probability and the previous probability, and (b) a candidate probability from the look up table selected by using the change value as an index number to look up the candidate probability; adjust an initial value of a probability candidate from the look up table depending on a comparison between the initial value and the previous probability based value, and setting the value of the probability candidate by using the difference in a calculation; and perform an early exit comprising using the first candidate probability for updating when a second probability candidate being the first probability candidate selected from the look-up table has a bit-costlarger than or equal to the bit-cost of the first probability candidate; wherein the bit-cost comprises the bit cost to perform the update or the bit-cost to indicate an update is to be performed or both, and in the bitstream.