1.
    发明专利
    未知

    公开(公告)号:DE3750390D1

    公开(公告)日:1994-09-22

    申请号:DE3750390

    申请日:1987-10-02

    Applicant: IBM

    Abstract: Method and means are disclosed for detecting any single errors introduced into an arithmetic data compression code string as a result of coding, transmission, or decoding through testing according to a modulo-n function, n being an odd number not equal to +1 or -1, an arithmetic compression coded data stream C'(s) generated by n-scaling an arithmetically recursive function that produces a non-scaled arithmetically data compressed code stream C(s) as a number in the semi-open coding range [0,1).

    3.
    发明专利
    未知

    公开(公告)号:DE3750390T2

    公开(公告)日:1995-03-30

    申请号:DE3750390

    申请日:1987-10-02

    Applicant: IBM

    Abstract: Method and means are disclosed for detecting any single errors introduced into an arithmetic data compression code string as a result of coding, transmission, or decoding through testing according to a modulo-n function, n being an odd number not equal to +1 or -1, an arithmetic compression coded data stream C'(s) generated by n-scaling an arithmetically recursive function that produces a non-scaled arithmetically data compressed code stream C(s) as a number in the semi-open coding range [0,1).

    4.
    发明专利
    未知

    公开(公告)号:DE2640414A1

    公开(公告)日:1977-04-07

    申请号:DE2640414

    申请日:1976-09-08

    Applicant: IBM

    Abstract: An apparatus is disclosed for compressing a p x q image array of two-valued (black/white) sample points. The image array points are serially applied to the apparatus in consecutive raster scan lines. In response, the apparatus simultaneously forms two matrices respectively representing a high order p x q predictive error array and a p x q array of location events (such as the raster leading edges of all objects in the image). Improved compression is achieved by selecting between the more compression efficient of two methods for encoding the position of errors in the prediction error array. These alternative methods are conventional run-length coding and a novel form of reference encoding, used selectively but to significant advantage. Thus, a run-length compression codeword is formed from the count C of non-errors between consecutive errors (in response to the occurrence of each error in the jth bit position of the ith scan line of the predictive error array) upon either C T and there being no occurrence of a line difference encoding for the error (where i, j, C and T have positive integers). A line difference codeword with difference value v is generated upon the joint event of C>T and either the single or multiple occurrence of location events in the ith-1 scan line of the location event array within the bit position range of B

Patent Agency Ranking