1.
    发明专利
    未知

    公开(公告)号:DE2801988A1

    公开(公告)日:1978-09-07

    申请号:DE2801988

    申请日:1978-01-18

    Applicant: IBM

    Abstract: There is disclosed a method and means for compacting (encoding) and decompacting (decoding) binary bit strings which avoids the blocking of string elements required by Huffman coding and the ever increasing memory as is the case in simple enumerative coding. The method and means arithmetically encodes successive terms or symbols in a symbol string s=ai aj . . . , in which each new term ak in a source alphabet of N symbols gives rise to a new encoded string C(sak) and a new length indicator L(sak). The method and means comprises the steps of forming L(sak) from the recursion L(sak)=L(s)+l(ak), where l(ak) is a rational approximation of log2 1/p(ak), p(ak) being the a'priori probability of occurrence of ak, and l(ak) being so constrained that the Kraft inequality is satisfied: AND FORMING C(sak) from the recursion C(s)+[Pk-12L(sak)],where: AND WHERE Pk-1 is the cumulative probability of occurrence of an arbitrary ordering of all symbols.

Patent Agency Ranking