The ultimate goal of video source coding is bit-rate reduction for storage and transmission by exploring both statistical and subjective redundancies and to encode a “minimum set” of information using coding techniques. The performance of video compression techniques depends on the amount of reduction in complexity computation and efficiency contained in the image data as well as on the actual compression techniques used for M-coding. To achieve this, we combine the probability estimation based on the VP9 technique with approximation of Multiplication. Approximately that proposed algorithm is faster and better compression efficiency compared to the various coder in the CABAC entropy coding scheme.