公开(公告)号：IT201900012609A1

公开(公告)日：2021-01-22

申请号：IT201900012609

申请日：2019-07-22

Applicant: ST MICROELECTRONICS SRL

Inventor： PLEBANI EMANUELE ,  FALCHETTO MIRKO ,  PAU DANILO PIETRO

IPC: G06F9/50

公开(公告)号：IT201700047044A1

公开(公告)日：2018-11-02

申请号：IT201700047044

申请日：2017-05-02

Applicant: ST MICROELECTRONICS SRL

Inventor： PAU DANILO PIETRO ,  PIASTRA MARCO ,  CARCANO LUCA

公开(公告)号：ITUB20153277A1

公开(公告)日：2017-02-28

申请号：ITUB20153277

申请日：2015-08-28

Applicant: ST MICROELECTRONICS SRL ,  UNIV BOLOGNA ALMA MATER STUDIORUM

Inventor： PAU DANILO PIETRO ,  PETRELLI ALIOSCIA ,  DI STEFANO LUIGI

IPC: G06F17/30

公开(公告)号：ITTO20120986A1

公开(公告)日：2014-05-15

申请号：ITTO20120986

申请日：2012-11-14

Applicant: ST MICROELECTRONICS SRL

Inventor： PAU DANILO PIETRO

公开(公告)号：DE60315407D1

公开(公告)日：2007-09-20

申请号：DE60315407

申请日：2003-02-06

Applicant: ST MICROELECTRONICS SRL

Inventor： GARDELLA PIERLUIGI MICHELE ,  BARONE MASSIMILIANO ,  ALFONSO DANIELE ,  PAU DANILO PIETRO ,  LAVIGNA DANIELE

IPC: G06T9/00

Abstract: A method for texture compressing images having a plurality of color components (R, G, B), includes the step of decomposing the images in sub-blocks each including only one color component. At least one first predictor is defined for each said sub-block and a respective set of prediction differences is computed for each sub-block. Then the prediction differences for each sub block are sorted, and a look-up prediction differences palette is set up by defining therefrom a look-up prediction error palette. A code is associated with each column of the error palette.

公开(公告)号：DE60208012D1

公开(公告)日：2006-01-19

申请号：DE60208012

申请日：2002-07-03

Applicant: ST MICROELECTRONICS SRL

Inventor： PAU DANILO PIETRO ,  PICCINELLI EMILIANO MARIO ANGE ,  SANNINO ROBERTO

IPC: G06F9/45 ,  H03M7/30 ,  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).