会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Tree structured binary arithmetic coder
    • 树结构二进制算术编码器
    • US5694128A
    • 1997-12-02
    • US551055
    • 1995-10-31
    • Jong-Rak Kim
    • Jong-Rak Kim
    • G06F5/00H03M7/40H03M7/46H03M7/00
    • H03M7/4006
    • An N valued input symbol is encoded by using a tree structured binary arithmetic coder wherein N is an integer larger than 2.sup.M-1 but not greater than 2.sup.M with M being a non-negative integer. First, the input symbol is converted into M bits of binary symbols. Thereafter, a context for a kth bit of the binary symbols is selected among a kth groups of contexts, each of the contexts in a group representing a different probability model of a binary symbol. The kth group of contexts includes 2.sup.k-1 contexts therein and a larger value of k represents a lower bit of the binary symbols, k being an integer from 1 to M. A context corresponding to an Lth bit is selected among an Lth group of contexts based on one or more upper bits thereof, L being an integer ranging from 2 to M. Finally, each of the M bits of the binary symbols is encoded serially based on its corresponding context by using a binary arithmetic coding method.
    • 通过使用树结构二进制算术编码器对N值输入符号进行编码,其中N是大于2M-1但不大于2M的整数,其中M是非负整数。 首先,将输入符号转换成M位的二进制符号。 此后,在第k组上下文中选择第二位符号的第k位的上下文,组中的每个上下文表示二进制符号的不同概率模型。 第k组上下文包括2k-1个上下文,较大的k表示二进制符号的较低位,k是从1到M的整数。对应于第L位的上下文选自第L组上下文 基于其一个或多个高位,L是从2到M的整数。最后,通过使用二进制算术编码方法,基于其对应的上下文来对二进制符号的每个M位进行串行编码。