中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

6 records (took 0.024 seconds)

    Code compression process, system and computer program product therefor
    3.
    发明公开
    Code compression process, system and computer program product therefor 有权
    Verfahren，系统与计算机程序zur Kode-Kompression

    公开(公告)号：EP1378999A1

    公开(公告)日：2004-01-07

    申请号：EP02425440.1

    申请日：2002-07-03

    Applicant: STMicroelectronics S.r.l.

    Inventor： Pau, Danilo Pietro ,  Piccinelli, Emiliano Mario Angelo ,  Sannino, Roberto

    IPC: H03M7/30 ,  G06F9/45 ,  H03M7/40

    CPC classification number: H03M7/30 ,  H03M7/3082 ,  H03M7/40

    Abstract: Binary words are converted between a non-encoded format (OP) and a compressed encoded format (V), in which the binary words are, at least in part, represented by encoded bit sequences that are shorter than the respective binary word in the non-encoded format. The shortest encoded bit sequences are selected according to the statistical recurrence of the respective words in the non-encoded format, and associated to the binary words with higher recurrence are encoded bit sequences comprising bit numbers that are accordingly smaller. The correspondence between binary words in non-encoded format and the encoded bit sequences associated to them is established by means of indices of an encoding vocabulary. The conversion process comprises the operations of:

    arranging the indices according to an ordered sequence;
    organizing the sequence of indices into groups of vectors (GV);
    splitting each group of vectors into a given number of vectors (V); and
    encoding the vectors (V) independently from one another.

    Alternatively, for each group of vectors, at the end of the encoding process, calculation is carried out - the result being saved in a table, referred to as address-translation table (ATT) - of the starting address on 32 bits of the compressed block or of the differences, expressed in bytes, with respect to the last complete address appearing in said table (ATT).

    Abstract translation: 二进制字在非编码格式（OP）和压缩编码格式（V）之间转换，其中二进制字至少部分地由比非非编码格式（OP）中的相应二进制字短的编码比特序列表示 编码格式。 根据非编码格式的各个字的统计重复来选择最短的编码比特序列，并且与具有较高重复次数的二进制字相关联的编码比特序列是包括相应较小的比特数的编码比特序列。 非编码格式的二进制字与与其相关联的编码比特序列之间的对应关系通过编码词汇的索引建立。 转换过程包括以下操作：根据有序序列排列索引; 将指数序列组织成向量组（GV）; 将每组向量分解为给定数量的向量（V）; 并且彼此独立地编码矢量（V）。 或者，对于每个向量组，在编码处理结束时，执行计算 - 结果被保存在32（32）的起始地址的称为地址转换表（ATT）的表中 相对于出现在所述表（ATT）中的最后一个完整地址，压缩块的位或以字节表示的差的位。

    Fractal coding of data in the DCT domain
    6.
    发明公开
    Fractal coding of data in the DCT domain 审中-公开
    弗拉基米尔·冯·达滕在德米兰

    公开(公告)号：EP0986026A1

    公开(公告)日：2000-03-15

    申请号：EP98830522.3

    申请日：1998-09-07

    Applicant: STMicroelectronics S.r.l.

    Inventor： Pau, Danilo ,  Sannino, Roberto ,  Capasso, Andrea ,  Fragneto, Pasqualina

    IPC: G06T9/00

    CPC classification number: G06F17/147 ,  H04N19/119 ,  H04N19/122 ,  H04N19/14 ,  H04N19/176 ,  H04N19/436 ,  H04N19/99

    Abstract: A method of calculating the discrete cosine transform (DCT) of blocks of pixels of a picture includes the steps of defining first subdivision blocks called range blocks, having a fractional and scaleable size N/2 i *N/2 i , where i is an integer number, in respect to a maximum pre-defined size of N*N pixels of blocks of division of said picture, referred to as domain blocks, shiftable by intervals of N / 2 i pixels, and of calculating the DCT on 2 i range blocks of subdivision of a domain block of N*N pixels of said picture, in parallel.

    Abstract translation: 计算图像像素块的离散余弦变换（DCT）的方法包括以下步骤：定义具有分数和可缩放大小N / 2 * N / 2的称为范围块的第一细分块， 其中i是整数，关于所述图像的划分块的N * N个像素的最大预定大小，称为域块，可以以N / 2像素的间隔移位，并且计算 并行地对所述图像的N * N个像素的域块进行细分的二进制DCT上的DCT。

Patent Agency Ranking