Nokia Corporation

Petri Liuha

Aki Launiainen

David Guevorkian

Stamatis Vassiliadis

David Guevokian

Jari Antero Nikara

Jarmo Takala

Dan Crisu

Sorin Cotofana

Ville Lappalainen

Aki Juhana Launiainen

The present invention relates to a method for performing calculation operations using a pipelined calculation device comprising a group of at least two pipeline stages. The pipeline stages comprise at least one data interface for input of data and at least one data interface for output of data. In the method, data for performing calculation operations is input to the device. Selective data processing is performed in the calculation device, wherein between at least one input data interface and at least one output data interface a selection is performed to connect at least one input data interface to at least one output data interface for routing data between at least one input data interface and at least one output data interface and for processing data according to the selection. The invention further relates to a system and a device in which the method is utilized.

Method and system for performing calculation operations and a device

A method for performing calculation operations uses a pipelined calculation device comprising a group of at least two pipeline stages, at least one data interface for input of data, and at least one data interface for output of data. The pipeline stages include at least one data interface for input of data and at least one data interface for output of data. Data for performing a first and a second calculation operation is input to the device. In the first calculation operation, output data of at least one pipeline stage is stored into a memory. In the second calculation operation the stored data is used as input data to a pipeline stage. The invention further relates to a system and a device, in which the method is utilized.

A current video block of a frame to be encoded comprises a set of first data values, and at least one other video block of another frame comprises a set of second data values. Data value pairs are formed of data values from said set of first data values and equal number of corresponding data values from said set of second data values. A combined comparison value is formed by defining comparison values, each of which is defined by using data values of one data value pair of said data value pairs. Said data value pairs are divided into at least two sub-sets of data value pairs each sub-set comprising equal number of data value pairs. The calculation of the comparison values is interlaced such that the calculation of comparison values of one sub-set of data value pairs is initiated in a time after initiating and before completing the calculation of comparison values of another sub-set of data value pairs.

Method for performing motion estimation in video encoding, a video encoding system and a video encoding device

In a method for performing a multiplication operation between a first operand and a second operand the multiplication operation is divided into at least two suboperations. At least one of the suboperations is performed in a time-interlaced manner, wherein the at least one suboperation is further divided into partial suboperations so that each partial suboperation is initiated at a different time.

Method and system for performing a multiplication operation and a device

A method for performing video motion estimation in video encoding, in which a video signal consists of frames comprising blocks. In the method a combined comparison value is calculated between a current video block of a frame to be encoded and at least one other video block of another frame. The current video block of the frame to be encoded comprises a set of first data values, and the at least one other video block of another frame comprises a set of second data values. Data value pairs are formed of data values from the set of first data values and equal number of corresponding data values from the set of second data values. The combined comparison value is formed by defining comparison values, each of which is defined by using data values of one data value pair of the data value pairs. Further, at least one threshold value is defined, and it is determined whether the process for defining the combined comparison value can be terminated.

The invention relates to a method, a device, a system and a software program product for determining for a pixel a coverage mask reflecting an orientation and possibly a distance from the pixel center of an original edge vector. The pixel is to be employed for displaying at least a part of a geometric primitive on a display, and the original edge vector represents an oriented edge of the geometric primitive. The method comprises as a first step determining one of four quadrants of a Cartesian coordinate system to which the original edge vector belongs due to its orientation. The original edge vector is then transposed into a predetermined one of the four quadrants. Next, a stored coverage mask is fetched, which is associated at least indirectly to the transposed edge vector. Finally, the fetched coverage mask is transformed to the quadrant to which the original edge vector belongs.

Determining a coverage mask for a pixel

A method and associated decoder, system, device and storage means for decoding codewords of variable length from a bit stream, in which minimum and maximum lengths are defined for the codewords, wherein the bit stream is processed in parts, each part being subjected to a search for codewords, and where found codewords are decoded. At least partly overlapping fields are extracted from the bit stream part in such a way that the starting point of at least two fields is a possible starting point of a codeword in that part. In at least one field, the end of the codeword is searched, and the data related to the codeword is determined on the basis of the end point of the codeword. Data relating to at least one codeword is used to determine the occurrence of the codeword intended to be decoded in a field, and the found codeword is decoded.

Method and a system for variable-length decoding, and a device for the localization of codewords

A microprocessor structure for performing a discrete wavelet transform operation, said discrete wavelet transform operation comprising decomposition of an input signal comprising a vector of r&#xd7;kinput samples, r, k and m being non-zero positive integers, over a specified number of decomposition levels j, where j is an integer in the range 1 to J, starting from a first decomposition level and progressing to a final decomposition level, said microprocessor structure having a number of processing stages, each of said number of processing stages corresponding to a decomposition level j of the discrete wavelet transform operation and being implemented by a number of basic processing elements, the number of basic processing elements implemented in each of said processing stages decreasing by a factor of k from a decomposition level j to a decomposition level j+1.

Growing community of inventors

Tampere, Finland

Petri Liuha