摘要： This paper defines and statistically calculates asymptotic computation in mode decision as a function of the quantization parameters ( QPs ). Results reveal that computation savings are a monotonically increasing function of QP and that computation can be significantly reduced for large QP s. This study investigates and compares the computation cost in several mode decision algorithms with asymptotic computation. Experimental results reveal that most of investigated algorithms are only suitable for high bit-rate coding, except for the recently proposed zero-block decision algorithm that is similar to asymptotic computation. 其他題名： J Sign Process Syst 出版者： Boston: Springer US 出版日期： 2012-02 出處： Journal of signal processing systems, 2012-02, Vol.66 (2), p.121-127 資源來源： Springer Journals 版權： Springer Science+Business Media, LLC 2011 識別號： ISSN: 1939-8018 識別號： EISSN: 1939-8115 識別號： DOI: 10.1007/s11265-011-0585-y
