Abstract: A method and apparatus are disclosed for use with multiple input, multiple output (MIMO) signal processing techniques, which reduce the amount of memory and memory bandwidth used to store and access filter coefficients by compressing a filter coefficient based at least in part on one or more neighboring filter coefficients for storage and decompressing the filter coefficients when retrieved. The decompressed filter coefficients can be used with a MIMO filtering technique, and/or can be used to compress or decompress additional coefficients.

Abstract: A lattice dividing unit determines lattice lines to divide parameters of all points of a picture at every division and supplies distortion correction parameters (distortion correction coordinates) on the lattice points to a distortion correction memory (not shown). A polynomial of degree n coefficient deriving unit expresses all distortion correction coordinates on each lattice line in the form of a function relative to positions on lattice lines and approximates the distortion correction coordinates by desired division polynomial of degree n. Further, a sample point deriving unit compresses distortion correction parameters based upon the division polynomial of degree n obtained from the polynomial of degree n coefficient deriving unit.

Abstract: A system and method for effectively storing compressed information in an electronic device includes a memory device coupled to the electronic device for storing the compressed information. A compression module sequentially performs a forward write procedure to store first components of the compressed information. The forward write procedure begins at a top location of the memory device. The compression module concurrently performs a reverse write procedure to store second components and third components of the compressed information sequentially in an interlaced configuration. The reverse write procedure begins at a bottom location of the memory device.

Abstract: An mage forming device and image forming method capable of performing selective data compression. Printing data transmitted from a host computer are stored in RAM and developed into image data by CPU. The CPU determines whether or not the greatest raster length in the image data of each page exceeds a reference value that represents the data transfer ability of the laser printer (and corresponds to the value of 80% of the largest printing width of the laser printer) on a page by pages. If the greatest raster length exceeds the reference value, the image data of the page are compressed by the CPU and stored in the RAM. If the greatest raster length do not exceed the value, the image data of the page are stored in the RAM without being compressed. Then, the image data stored in the RAM are sent to an ASIC on a raster by raster basis. Only compressed image data are decompressed and the decompressed data then are transferred to a laser unit. Non-compressed image data per se are transferred to the laser unit.

Abstract: A database system includes an enhanced technique for performing sorts in which removals of duplicate records are performed to compact the size of segments being sorted. To enhance a query plan, the duplicate record removal is performed as early in the query plan as possible. By removing duplicate records early in the query plan, the number of input/output (I/O) operations is reduced, resulting in more efficient usage of database system resources. In example implementations, two type of sorts are performed: a heap sort (to sort successive segments of an input file, with the sorting associated with concurrent removal of duplicate records to compact each segment so that a smaller number of I/O accesses is needed); and a merge sort (in which output files from prior sorting passes are merged and sorted, with the merge sort process also associated with the removal of duplicate records to further compact the data segments and reduce the number of I/O accesses).

Abstract: A computer-based method for scanning data using string filtering includes compressing a data string using a hashing algorithm to obtain a data-string signature, and then determining that the data-string signature matches a known data-string signatures stored in a lookup table if the signature is determined to have a match in the lookup table.

Abstract: A data processing system including an instruction cache 8 and an instruction decompression circuit 10 between the instruction cache 8 and a compressed instruction data memory 12. The instruction decompression circuit decompresses compressed instruction data CID recovered from the compressed instruction data memory and forms program instructions which are supplied to the instruction cache. The program instructions are compressed in blocks of program instructions with an associated mask value where the bit values within the mask indicate whether corresponding bit slices within the blocks of program instructions are to be represented by a default bit value or a separately specified by bit slice specifier values. This technique is particularly well suited to VLIW processors.

Abstract: A lattice dividing unit determines lattice lines to divide parameters of all points of a picture at every division and supplies distortion correction parameters (distortion correction coordinates) on the lattice points to a distortion correction memory. A polynomial of degree n coefficient deriving unit expresses all distortion correction coordinates on each lattice line in the form of a function relative to positions on lattice lines and approximates the distortion correction coordinates by desired division polynomial of degree n. Further, a sample point deriving unit compresses distortion correction parameters based upon the division polynomial of degree n obtained from the polynomial of degree n coefficient deriving unit. In the derived division polynomial of degree n, internal points which result from dividing both ends of the division polynomial of degree n by n is supplied to the distortion correction memory as new distortion correction parameters (approximated distortion correction coordinates).

Abstract: Analog data is compressed by processing certain data from data storage and interpolating data between data points which fall within an acceptable error range. Data points are compressed by modifying or eliminating data depending upon the slope relationship of a stored data point to artificial data points, which are representative of the range of accepted deviations from the original data point.

Abstract: Systems and methods for efficient storage of network management object identifiers are provided. Object identifiers such as SNMP MIB object identifiers are stored in a compressed form. In one embodiment, a single integer represents multiple elements of an object identifier where these elements are common to many identifiers. The redundancy inherent in a standard object identifier format is thereby greatly reduced. Large memory savings are provided in network management systems that employ many network management objects.

Abstract: A trace data compression system includes a data acquisition circuit which is configured to acquire address information for identifying an address for reading or writing operation of a microcomputer which performs predetermined processing, and data information as operand data stored in the address; an address information compression circuit which is configured to compress the address information having been acquired by the data acquisition circuit and output the address information as compressed; a data information compression circuit which is configured to compress the data information having been acquired by the data acquisition circuit and output the data information as compressed; a data output circuit which is configured to output variable length data containing the address information having been compressed and outputted by the address information compression circuit and the data information having been compressed and outputted by the data information compression circuit.

Abstract: A header compression/decompression apparatus that improves the throughput of an overall multilayer protocol stack at a network node. In this apparatus, an encoding section 106 compresses multilayer header information included in a protocol data unit on a multilayer protocol stack 101. A session context ID manager 112 generates a session context ID 401 which is formed by integrating information on compression of multilayer header information by the encoding section 106 and, for example, information for identifying a scheme for compressing multilayer header information.

Abstract: Systems and methods that facilitate dimensional transformations of data points are disclosed. In particular, the subject invention provides for a system and methodology that simplifies dimensional transformations while mitigating variations of a distance property between pairs of points. A set of n data points in d dimensional space is represented as an n×d input matrix, where d also corresponds to the number of attributes per data point. A transformed matrix represents the n data points in a lower dimensionality k after being mapped. The transformed matrix is an n×k matrix, where k is the number of attributes per data point and is less than d. The transformed matrix is obtained by multiplying the input matrix by a suitable projection matrix. The projection matrix is generated by randomly populating the entries of the matrix with binary or ternary values according to a probability distribution.

Abstract: A method for representation, interpolation and/or compression of data includes identifying a two-dimensional interpolation function s(z) based on a sampling function a(z). A Cauchy integral theorem is applicable for the interpolation function s(z). The interpolation function s(z) is used for the representation, interpolation and/or compression of the data.

Abstract: An image processing apparatus for decoding a compressed image data, the image data being divided to a plurality of tiles, each of which is a basic unit of process in encoding or decoding process, said apparatus comprising: a detector which detects an existence status of ROI within said compressed image data based on a frequency transform coefficient of said tile for every tile; a determiner which determines whether each tile is a ROI tile composed of only ROI, a non-ROI tile composed of only non-ROI, or a ROI boundary tile composed of ROI and non-ROI based on said existence status of ROI detected by said detector; a processor which shifts only frequency transform coefficient of said ROI within each tile to lower bit side for said ROI tile and said non-ROI tile determined by said determiner, and which shifts frequency transform coefficients of both ROI and non-ROI within each tile to lower bit side.

Abstract: Embodiments of methods, systems and/or devices for data coding are disclosed.

Abstract: In the digital filtering of an input signal (3), which has been produced by interpolation of a pilot signal (2), under certain circumstances numerous values originating from the past have to be stored. In order to reduce the storage space required for these and the associated power consumption, the values of the input signal (3), which are needed for computation of the values of an output signal (4), are compressed and stored in compressed form. More particularly here the values of the input signal (3) are divided into symbol periods, in which a coherent range of memory values, which are the only data-carrying values in the symbol period, occurs in each case. These values are stored together with the length of the symbol period, so that although each symbol period can be described completely, storage space is reduced.

Abstract: The present invention is a method, system, and computer program product for implementation of a capable, general purpose compression algorithm that can be engaged “on the fly”. This invention has particular practical application with time-series data, and more particularly, time-series data obtained form a spacecraft, or similar situations where cost, size and/or power limitations are prevalent, although it is not limited to such applications. It is also particularly applicable to the compression of serial data streams and works in one, two, or three dimensions. The original input data is approximated by Chebyshev polynomials, achieving very high compression ratios on serial data streams with minimal loss of scientific information.

Abstract: A cryptosystem based on a Jacobian of a hyperelliptic curve is being used. Various methods and apparatus are provided for generating a compressed data format that identifies one or more points on the Jacobian of the hyperelliptic curve, and for subsequently decompressing the compressed format data.

Abstract: Certain exemplary embodiments comprise a method for transforming a raw set of electrical power generation process data associated with a first physical storage space into a representation of the raw set. The representation of the raw set can be associated with a second physical storage space that is smaller than the first physical storage space. The method can comprise receiving a non-zero user-specified deviation metric relating to the raw set of electrical power generation process data. The method can comprise automatically calculating a deviation measure of at least three data points from the raw set, the at least three data points comprising an opposing pair of end points. The method can comprise automatically comparing the deviation measure to the deviation metric. The method can comprise automatically deleting all data points intermediate to the opposing pair of end points if the deviation measure does not exceed the deviation metric.

Abstract: A computer system having data registers for storing uncompressed data, a data queue for storing data to be compressed, a compressor for compressing data in the data queue, and a compression ratio monitor for determining the compression ratio of the compressed data. The computer system also includes a compression control register that holds control information, and a precision reducer for reducing the precision of the data prior to that data being stored in the data queue. The precision reducer responses to control information to reduce the precision of the data such that the resulting reduced precision data can be more efficiently compressed. The control information, and thus the operation of the precision reducer, depends on the compression ratio monitor.

Abstract: A Message Digest Hardware Accelerator (MDHA) 10 for implementing multiple cryptographic hash algorithms such as the Secure Hashing Algorithm 1 (SHA-1), the Message Digest 4 (MD4) algorithm and the Message Digest 5 (MD5) algorithm. A register file (12) is initialized to different data values. A function circuit (22) performs logical operations based on the selected algorithm and provides a data value to a summing circuit (30) that is summed with mode dependent constant values selected from registers (34 and 36), round and step dependent data words generated by a register array block (32) to calculate the hash value for a text message stored in registers (100–115).

Abstract: When a zero run, which violating G constraint of a run-length-limited (RLL) code, is detected from the data stored in a first input register 1111 and a second input register 1112, bits before and after the zero run is transferred to a temporary register 1150 via a bus for zero run removal 1130 to be combined to each other. Thus, by effectively using the mechanism of bus transfer, a circuit can be simplified, thereby realizing a small circuit.

Abstract: Channel coupling for an AC-3 encoder, using mixed precision computations and 16-bit coupling coefficient calculations for channels with 32-bit frequency coefficients.

Abstract: A location information conversion device which can ensure privacy protection of a search object. Upon receiving a request with a designated accuracy from an input/output section, a location information generating section acquires location information from a location measurement section and supplies the location information to an accuracy adjustment section, together with the designated accuracy. The accuracy adjustment section converts the location information into location information of an accuracy equal to or lower than the designated accuracy and returns the resulting location information to the location information generating section. The location information generating section sends the location information whose accuracy has been converted to the requesting party via an input/output section. This ensures protection of privacy, since the location information about a search object is converted into location information of an accuracy equal to or lower than the designated accuracy.

Abstract: A computing system has a graphics processor, a graphics memory, main memory, a bridge, and a central processing unit configured to process floating-point data of a first fixed size. An interconnect grid includes communication paths to link the graphics processor, the graphics memory, main memory, the bridge, and the central processing unit. A computing system component (e.g., the graphics processor or central processing unit) converts floating-point data to graphics floating-point data with a fixed size smaller than the fixed size of the floating-point data. The computing system passes the floating-point data and/or the graphics floating-point data over at least a portion of the interconnect grid. Alternately, the graphics processor may directly read and process previously compressed and stored graphics floating-point data.

Abstract: A system and method for reducing the volume of data necessary to represent an image by utilizing tiling and masking techniques is disclosed. Initially, an image described by raster content having an original number of bits per pixel is provided. The image is divided into tiles such that each of the tiles represents a portion of the image. Then, for each of the tiles, the following steps are performed: (a) the colors in the tile are identified; (b) the required number of masks are compared to a threshold number of masks to determine if data reduction by using masks is worthwhile; (c) if the required number of masks is less than the threshold number of masks, a representation of the tile is generated using fills and/or masks; and (d) if the required number of masks is greater than or equal to the maximum number of masks, a representation for the tile using the original format and number of bits per pixel or a smaller index is generated.

Abstract: Systems and methods are provided for reducing a set of data points into a subset of best fit data points. According to one aspect, a method of adjusting a series of N data points into best fit data points for a set of sample data points that form a data source is provided. According to this method, M segments are identified, wherein M equals N?1. Each segment has endpoints defined by adjacent subset data points. An iterative process is performed that includes determining a linear interpolation error for each of the M segments, selecting a target segment (STARGET) from the segments, and reducing the interpolation error for STARGET by moving one endpoint of STARGET by an increment corresponding to at least one sample data point in the series of sample data points to shorten STARGET. Other methods and systems are provided herein.

Abstract: A cryptosystem based on a Jacobian of a hyperelliptic curve is being used. Various methods and apparati are provided for generating a compressed data format that identifies one or more points—on the Jacobian of the hyperelliptic curve, and for subsequently decompressing the compressed format data.

Abstract: A method includes receiving an original string of bits where each of the bits represents one of two possible logic levels. The string of bits also carries information. A new string is formed, based on the original string, which contains all of the information of the original string by using fewer bits of one of the logic levels.

Abstract: A network controller for controlling a message over a communication network constantly monitors actually transmitted message from or to a particular user. If the controller determines a particular phrase is transmitted more than a predetermined number of times, the controller updates support data and transmits the data in a compressed format with support data. The network controller may send an updated support data in response to a request from a user equipment. In this way, the present invention reduces the amount of traffic over the network.

Abstract: The image processor of the present invention includes: an extracting means, an entropy decoding means, a combining means, and an inverse orthogonal transformation means. Coded data at respective stages in a certain block are extracted by the extracting means, and entropy-decoded by the entropy-decoding means, to obtain coefficient data at the respective stages in the block. The coefficient data at the respective stages are combined by the combining means to obtain coefficient data for the block. The coefficient data is subjected to inverse orthogonal transformation by the inverse orthogonal transformation means, to attain original image data for the block. The above series of processing are performed for all blocks, to attain an original image on the entire screen. The memory capacity required for combining the coefficient data at the respective stages may only be large enough to store coefficient data for one block.

Abstract: A method is disclosed for recovering image memory capacity, in relation to an image which has been encoded using a linear transform according to a layer progressive mode into L layers, L being an integer value greater than unity, the L layers being stored in an image memory having a limited capacity. The method comprises defining a Quality Reduction Factor (700), being a positive integer value, identifying at least one of the L layers corresponding to the Quality Reduction Factor, and discarding (702) said at least one of the L layers in progressive order in accordance with the Quality Reduction Factor, thereby recovering said memory capacity.

Abstract: Storing of data items in a memory (31) is provided wherein the data items are divided into successive data pieces of decreasing significance, and the data pieces are stored in respective parts of the memory (31), and when applying a data piece to the memory (31) in case all candidate memory parts are assigned to other data pieces: if the significance of the applied data piece is lower than a lowest significance of the other data pieces, discarding the applied data piece; if the significance of the applied data piece in one of the candidate memory parts at expense of a given other data piece which has a lower significance that the significance of the applied data piece, wherein the significance value of a data piece is based on a total or absolute distortion value of the data item. Advantageous use of the invention is made in applications using a device of fixed storage capacity for storing a flexible number of compressible data items, such as video, images, audio, speech.

Abstract: A process for converting signals in the form of digital data, such as various types of video/audio/data signals for example, between an original format, in which each data item includes a certain number of digits, and a compressed format, in which each data item includes a smaller number of digits. The process includes the operation of associating the data with a configuration including: a first field identifying the number of sub-blocks into which the said certain number of digits are subdivided, a second field that identifies, within the said sub-blocks, respective sections, each one including a given number of digits, and a third field that identifies, for each these sections, one of a plurality of applicable modes (average, compression, transmission “as is”, etc.) that can be adopted for converting the digits in the section between the original format and the compressed format.

Abstract: A computer system having a main memory for storing data in a compressed format and a processor cache for storing decompressed data, a method for converting the data of said main memory from compressed to uncompressed state, comprising the steps of reducing used portions of said main memory to a target value; disabling a compressor used for compressing the uncompressed data; decompressing said compressed data of said main memory; moving said decompressed data to physical addresses equal to real addresses; and releasing the memory occupied by a compressed memory director and data structures used in the above steps.

Abstract: A seismic data acquisition unit includes a data acquisition and digital circuit which receives an analog seismic signal and digitizes the signal. The digitized seismic data uses data telemetry and a repeater device to receive the compressed data and transmit the compressed data to a seismic central control unit. The data decompressor takes the data from the data compressor and decompresses the data. The decompressed data is then compared with the original digitized data to determine the amount of noise resulting from the compression process. The compression noise is compared to the ambient noise, and if the compression noise exceeds a predefined criterion, then the compression ratio in the data compressor is adjusted for a lower degree of compression. The process is repeated until the amount of compression noise, relative to ambient noise, is satisfactory.

Abstract: A real time data compression method examines whether a present read-in data point is in a predicted tolerable error range. If yes, the previous data point is deemed as redundant and is ignored and after which a new data point is read in for comparing again. When a predetermined amount of data points is continuously ignored, it means the data is steady and only the final data point of these ignored ones is recorded. Otherwise, when data is varied greatly during a period, only the total amount of these varying data points and their value are recorded so the memory capacity for storing the compressed data is saved. Furthermore, the compressed data is stored in a form of a data structure in which the compressed data are expressed by multiple blocks. The block form allows increase of the efficiency of the searching process of the compressed data.

Abstract: A hardware context vector codec/generator which can be used in the block coder of a discrete wavelet transform (DWT) codec. The context vector codec/generator consists mostly of three columns of context vector registers where the context vectors move in parallel from column to column while the bits in the context vectors are modified by digital logic gates placed before each column. The digital logic gates are controlled by the results of the block coder scanning quantized wavelet coefficients. The preferred embodiment is used in a JPEG2000 codec.

Abstract: This invention provides methods and apparatus for protecting data transmitted using standard compression techniques such as Huffman coding. After input data is preprocessed (filtered, quantized, etc.), the data is encoded using a Huffman coder based on Huffman codes or code books which have been scrambled to change the order of the code books and/or codes from established standard Huffman code books and/or codes. When the transmitted information is received by a Huffman code receiver, the received data may be decoded using the scrambled Huffman code book/codes to obtain the data that was transmitted by the transmitter.

Abstract: A system and methods are shown for improved processing of motion compensated video. A software driver handles image data related to motion compensated video. The image data includes IDCT coefficients and motion compensation vector data. A unique identifier is attached to the image data, preserving the relationship between the IDCT coefficients and motion compensated vector data related to an image block. The software driver sends the IDCT coefficients to an IDCT component. The IDCT coefficients are processed and an interrupt is sent to the software driver including the unique identifier of the processed IDCT coefficients. The software driver sends the motion compensation vector data related to the unique identifier in the interrupt. A 3D pipe receives the motion compensation vector data and reads the corresponding processed IDCT data.

Abstract: A system and method for compressing trace data from an emulation system. Scan chains may receive trace data from configurable logic blocks inside one or more emulation chips, and the data received from the scan chains may be compressed. Where delta compression is used, the scan chains may also perform a delta detection function. Alternatively, delta detection may be performed using the outputs of the scan chains. In addition, event detectors may be implemented within or outside of the scan chains. Compression of the trace data may include receiving a plurality of data sets and performing compression along cross-sections of the combined data sets.

Abstract: An image processing apparatus which includes input device for inputting an image to printed, determining device for determining whether the input image includes predetermined information, output device for outputting a printed image of the input image using either a first type of processing or a second type of processing, wherein if the determining device determines the input image includes the predetermined information, the output device uses the first type of processing which outputs an irregular image of the input image and if the determining device determines the input image does not include the predetermined information, the output device uses the second type of processing which outputs an image of the input image.

Abstract: A method for bi-directional motion compensation is provided. The method comprises: adding the predicted error twice, the first predictor, and one to obtain a first calculation result; wherein if the first calculation result is larger than a maximum positive value storable in the register, either the maximum positive value or a value of the maximum positive value minus one is stored in the register, otherwise the first calculation result is stored in the register; adding the value stored in the register and the second predictor to obtain a second calculation result; wherein if the second calculation result is larger than the maximum positive value storable in the register, either the maximum positive value or the value of the maximum positive value minus one is stored in the register, if the second calculation result is smaller than zero, a zero is stored in the register, otherwise the second calculation result is stored in the register; right-shifting the value one bit to obtain the pixel data.

Abstract: Methods, apparatus, and computer readable medium for compressing connected component objects (300) of bi-level images. The compression apparatus (204) can take various forms including apparatus for coding a stroke of an object (300) or for coding the entirety of the object (300), including plural strokes. The compression apparatus (204) typically includes a referencing module (205) for identifying at least one reference node (310), a coding module (206) for successively coding pixel runs (311-314) such that at least one run (311) is coded relative to the reference node (310) and other runs (312-314) are coded relative to previously coded runs, and a closing module (207) for terminating the process. Certain forms of the apparatus operate in a horizontal or a vertical mode only, never operate in horizontal mode during two consecutive coding operations, code each run using two code-words, and/or utilize modified Huffman coding techniques.

Abstract: An apparatus and method for compressing and compressing text based messages. A TCCB layer 114, 115 is added to a mobile device 100 and P-CSCF 102. At the sending device, the TCCB compression method is invoked to remove all redundant header information contained in a message to be transmitted. When the TCCB compression method detects that a header's contents are the same as previously sent or received for a particular sequence, the TCCB method blanks the header contents. At the receiving device, when the TCCB layer receives a message with blank header contents, the TCCB decompression method is invoked to reconstruct the header from its cache 115, 127.

Abstract: A method of compressing media content in which a first predetermined portion of a media content is compressed using a first data-based compression algorithm and inserted into a first portion of a data frame. A second predetermined portion of the media content is compressed using a second data-based compression algorithm and is inserted into a second portion of the data frame. The second predetermined portion of the media content is different from the first predetermined portion of the media content, and the second data-based compression algorithm is different from the first data-based compression algorithm. At least one of the first and second data-based compression algorithms is a private data-based compression algorithm. A plurality of data frames are generated and are made available for distribution, for example, by transmission over a computer network, such as the Internet.

Abstract: A real time data compression method examines whether a present read-in data point is in a predicted tolerable error range. If yes, the previous data point is deemed as redundant and is ignored and after which a new data point is read in for comparing again. When a predetermined amount of data points is continuously ignored, it means the data is steady and only the final data point of these ignored ones is recorded. Otherwise, when data is varied greatly during a period, only the total amount of these varying data points and their value are recorded so the memory capacity for storing the compressed data is saved. Furthermore, the compressed data is stored in a form of a data structure in which the compressed data are expressed by multiple blocks. The block form allows increase of the efficiency of the searching process of the compressed data.

Abstract: An access-history indicating method sequentially records a history of access by a user to a resource object such as a file or a WWW page. In the method, an access history icon that visually represents access-history information is generated and is displayed in the vicinity of the corresponding icon on a desktop screen or in the vicinity of an anchor of a WWW page. The access history icon has an image in which events of accessing the corresponding resource object are displayed on a time base. The image may be displayed by separating the type of access into modification and reference. The user can obtain a visual and intuitive understanding about a history of access to each file and a history of updating each file. The obtained information can be used as an important key for selecting among files and WWW pages.

Abstract: The present invention is a method, system, and computer program product for implementation of a capable, general purpose compression algorithm that can be engaged “on the fly”. This invention has particular practical application with time-series data, and more particularly, time-series data obtained form a spacecraft, or similar situations where cost, size and/or power limitations are prevalent, although it is not limited to such applications. It is also particularly applicable to the compression of serial data streams and works in one, two, or three dimensions. The original input data is approximated by Chebyshev polynomials, achieving very high compression ratios on serial data streams with minimal loss of scientific information.