784 results about "Compress Algorithm" patented technology

An memory module including parallel data compression and decompression engines for improved performance. The memory module includes MemoryF / X Technology. To improve latency and reduce performance degradations normally associated with compression and decompression techniques, the MemoryF / X Technology encompasses multiple novel techniques such as: 1) parallel lossless compression / decompression; 2) selectable compression modes such as lossless, lossy or no compression; 3) priority compression mode; 4) data cache techniques; 5) variable compression block sizes; 6) compression reordering; and 7) unique address translation, attribute, and address caches. The parallel compression and decompression algorithm allows high-speed parallel compression and high-speed parallel decompression operation. The memory module-integrated data compression and decompression capabilities remove system bottlenecks and increase performance. This allows lower cost systems due to smaller data storage, reduced bandwidth requirements, reduced power and noise.

A malware scanner (8) operates to scan compressed computer files (16) by compressing the malware signatures (17) using the same compression algorithm as used for the compressed computer file and then comparing the compressed malware signatures (18) with the compressed computer file directly.

A table, such as a database table can be partitioned into blocks that are conveniently sized for storage and retrieval. The amount of storage space required and the speed of storing and retrieving blocks is proportional to the size of the blocks. Compressing the blocks leads to less required space and more speed. The columns in a table, and therefore the rows in a transposed block, tend to contain similar data. Compression algorithms can work more efficiently when sequential data items are similar. Therefore, transposing the blocks before compression or compressing them in a column-wise manner leads to better compression. Different compression algorithms can be used for each set of columnar data to yield even better compression.

An efficient method for compressing sampled analog signals in real time, without loss, or at a user-specified rate or distortion level, is described. The present invention is particularly effective for compressing and decompressing high-speed, bandlimited analog signals that are not appropriately or effectively compressed by prior art speech, audio, image, and video compression algorithms due to various limitations of such prior art compression solutions. The present invention's preprocessor apparatus measures one or more signal parameters and, under program control, appropriately modifies the preprocessor input signal to create one or more preprocessor output signals that are more effectively compressed by a follow-on compressor. In many instances, the follow-on compressor operates most effectively when its input signal is at baseband. The compressor creates a stream of compressed data tokens and compression control parameters that represent the original sampled input signal using fewer bits. The decompression subsystem uses a decompressor to decompress the stream of compressed data tokens and compression control parameters. After decompression, the decompressor output signal is processed by a post-processor, which reverses the operations of the preprocessor during compression, generating a postprocessed signal that exactly matches (during lossless compression) or approximates (during lossy compression) the original sampled input signal. Parallel processing implementations of both the compression and decompression subsystems are described that can operate at higher sampling rates when compared to the sampling rates of a single compression or decompression subsystem. In addition to providing the benefits of real-time compression and decompression to a new, general class of sampled data users who previously could not obtain benefits from compression, the present invention also enhances the performance of test and measurement equipment (oscilloscopes, signal generators, spectrum analyzers, logic analyzers, etc.), busses and networks carrying sampled data, and data converters (A / D and D / A converters).

A system for deduplicating data comprises a card operable to receive at least one data block and a processor on the card that generates a hash for each data block. The system further comprises a first module that determines a processing status for the hash and a second module that discards duplicate hashes and their data blocks and writes unique hashes and their data blocks to a computer readable medium. In one embodiment, the processor also compresses each data block using a compression algorithm.

Embodiment provide a surveillance camera adapted to be connected to an internet protocol network, the surveillance camera including at least one facial processor, at least one facial recognition algorithm embodied in suitable media, at least one facial recognition algorithm executable with digital format image data by at least one facial processor detecting faces, execution of at least one facial recognition algorithm producing unique facial image data, execution of at least one facial separation algorithm producing facial separation data, at least one facial processor in communication with at least one facial signature database to obtain reference data, execution of at least one facial signature algorithm comparing facial separation data and reference data to identify correlations, at least one compression algorithm producing compressed image data, and a network stack configured to transmit to the network unique facial image data for each detected face and compressed image data.

An integrated circuit for pre-processing, encoding, decoding, transcoding, indexing, blending, post-processing and display of media streams, in accordance with a variety of compression algorithms, DRM schemes and related industry standards and recommendations such as OCAP, ISMA, DLNA, MPAA etc. The integrated circuit comprises an input interface configured for receiving the media streams from content sources, a plurality of processing units, system CPU, and sophisticated switch and memory controller, electronically connected to the input interface and directly connected to each one of the processing units. The integrated circuit further comprises an output interface that is operatively connected to the switch and configured for outputting the simultaneously processed media streams.

Data compression and decompression methods for compressing and decompressing data based on an actual or expected throughput (bandwidth) of a system. In one embodiment, a controller tracks and monitors the throughput (data storage and retrieval) of a data compression system and generates control signals to enable / disable different compression algorithms when, e.g., a bottleneck occurs so as to increase the throughput and eliminate the bottleneck.

A method dramatically reduces the amount of data to be stored and transferred in a networked storage system. Preferably, the network storage system provides continued data protection through mirroring / replication, disk-to-disk backup, data archiving for future retrieval, and Information Lifecycle management (ILM). The idea is to leverage the parity computation that exists in RAID systems. By caching, transferring, and storing data parity or delta bytes of changes on a block as opposed to data block itself, substantial data reduction is possible without using sophisticated compression algorithms at the production side to minimize performance impacts upon production servers. Data can be computed using the parity / delta and previously existing data at mirror side, replication side, backup storage, or at retrieval time upon events such as failures or ILM operations.

A system and method are disclosed for parallel compression and decompression of a bitstream. For compression, the bitstream is separated into a plurality of components, and the components are encoded using a compression algorithm. Packets are then constructed from the encoded components. At least one packet is associated with each encoded component and comprises header information and encoded data. The packets are combined into a packetized encoded bitstream. For decompression, the packets are separated from the packetized encoded bitstream using the header information. The packets are then decoded in parallel using a decompression algorithm to recover the encoded data. The plurality of components are reconstructed from the recovered encoded data and combined to recover the bitstream.

A multi-mode texture compression algorithm is provided for effective compression and decompression texture data during graphics processing. Initially, a request is sent to memory for compressed texture data. Such compressed texture data is then received from the memory in response to the request. At least one of a plurality of compression algorithms associated with the compressed texture data is subsequently identified. Thereafter, the compressed texture data is decompressed in accordance with the identified compression algorithm.

A method and apparatus for transmitting a digitally encoded video image in real time via a data network wherein the video image is digitally encoded using a compression algorithm having a variable bit rate, e.g., JPEG2K, to provide an encoded data stream, the encoded data stream is fed into a buffer of known size, and the data is read from the buffer via a streamer with a controllable bit rate to provide a bit stream at a desired stream bit rate for transmission via the network. The bit rate of the encoded data stream from the encoder is monitored by a predictor and predicts a future bit rate of the encoded data stream; and, the bit rate of at least one of the encoder and the streamer is adjusted to provide the desired streaming bit rate.

A system and method is provided for performing code provenance review in a software due diligence system. In particular, performing code provenance review may include sub-dividing source code under review and third-party source into logical fragments using a language-independent text fracturing algorithm. For example, the fracturing algorithm may include a set of heuristic rules that account for variations in coding style to create logical fragments that are as large as possible without being independently copyrightable. Unique fingerprints may then be generated for the logical fragments using a fingerprint algorithm that features arithmetic computation. As such, potentially related source code may be identified if sub-dividing the source code under review and the third-party source code produces one or more logical fragments that have identical fingerprints.

Mechanisms are provided for performing efficient compression and deduplication of data segments. Compression algorithms are learning algorithms that perform better when data segments are large. Deduplication algorithms, however, perform better when data segments are small, as more duplicate small segments are likely to exist. As an optimizer is processing and storing data segments, the optimizer applies the same compression context to compress multiple individual deduplicated data segments as though they are one segment. By compressing deduplicated data segments together within the same context, data reduction can be improved for both deduplication and compression. Mechanisms are applied to compensate for possible performance degradation.

Code compression techniques and decompression architectures for embedded systems are disclosed, providing good compression ratio while improving decompression time for VLIW instructions and reducing bus power consumption. The invention includes two fixed-to-variable (F2V) length code compression schemes based on a reduced arithmetic code compression algorithm combining arithmetic coding with probability models; a static probability model using static coding and semi-adaptive coding using a Markov model. Multi-bit decompression methods for the F2V techniques are presented, together with a parallel decompression scheme that tags and divides a compressed block into smaller sub-blocks. The Markov model provides better compression ratio, but the static model has a less complicated decompression unit design. The invention also includes two variable-to-fixed (V2F) length coding algorithms, one based on Tunstall coding and another on arithmetic coding. The V2F algorithms are also combined with a static model and a Markov model.

Data compression and decompression methods for compressing and decompressing data based on an actual or expected throughput (bandwidth) of a system. In one embodiment, a controller tracks and monitors the throughput (data storage and retrieval) of a data compression system and generates control signals to enable / disable different compression algorithms when, e.g., a bottleneck occurs so as to increase the throughput and eliminate the bottleneck.

An approach is described for the compression of input data, and particularly one which is suited for providing a lossless method for compressing random input data. Both a compression algorithm is described, as well as a decompression algorithm for restoring the original uncompressed data. The decompression algorithm allows for its parameters to be adjusted to suit one's needs as they relate, for example, to the ratio of compression as a function of the decompression speed.

System and method for decoding digital video data. The decoding system employs hardware accelerators that assist a core processor in performing selected decoding tasks. The hardware accelerators are configurable to support a plurality of existing and future encoding / decoding formats. The accelerators are configurable to support substantially any existing or future encoding / decoding formats that fall into the general class of DCT-based, entropy decoded, block-motion-compensated compression algorithms. The hardware accelerators illustratively comprise a programmable entropy decoder, an inverse quantization module, a inverse discrete cosine transform module, a pixel filter, a motion compensation module and a de-blocking filter. The hardware accelerators function in a decoding pipeline wherein at any given stage in the pipeline, while a given function is being performed on a given macroblock, the next macroblock in the data stream is being worked on by the previous function in the pipeline.

The present invention discloses a storage device with optimal compression management mechanism, mainly comprising a controller and at least a solid-state storage medium; where said controller at least has a system interface that may be connected to an external system end, a microprocessor processing system instructions, and a memory interface communicating with said solid-state storage medium; said controller detects and distinguishes the type of raw data to be stored, chooses the compression algorithm and associated parameters most suitable for the raw data, and then compresses the raw data into minimized data in the optimal compression ratio and writes the compressed data into said solid-state storage medium; in that way, the storage device may boost the storage capacity of said solid-state storage medium without increasing physical memory of said solid-state storage medium.

A method for spectrally compressing data sets enables the efficient analysis of very large multivariate images. The spectral compression algorithm uses a factored representation of the data that can be obtained from Principal Components Analysis or other factorization technique. Furthermore, a block algorithm can be used for performing common operations more efficiently. An image analysis can be performed on the factored representation of the data, using only the most significant factors. The spectral compression algorithm can be combined with a spatial compression algorithm to provide further computational efficiencies.

A computer-based method and system for performing header filtering of data is presented The method comprises compressing the header of a data packet to obtain a header signature and determining if the header signature matches a known header signature. If the header signature is determined to have a match, then the header signature is identified as a known header signature. A header signature may be generated using a multidimensional data compression algorithm. A compression algorithm comprises obtaining the data bits contained in each field of a typical header. Then, a header-field group that corresponds uniquely to each field is determined. Each field is replaced with the header-field group of the corresponding data bits of the field and concatenated to create a header signature.

The present invention relates generally to a system and a method for dynamically adjusting data compression parameters. The process of dynamic transfer of data parameters from the sender to the receiver has four steps: determining optimal compression parameters, compressing data that are on a sender side using the selected algorithm, transferring compressed data from the sender to the receiver and decompressing received data on the receiver's side. On the sender side, the transmitting computer stores multiple compression algorithms, and one of these algorithms is used to compress the data. A monitoring agent monitors the available processor resources, data type, and network conditions. The monitoring agent also determines when to dynamically adjust the level of compression and / or compression algorithm and sends a signal when it decides dynamically adjust the level of compression. A selector dynamically changes the compression algorithm.

A data storage subsystem having a plurality of data compression engines configured to compress data, each having a different compression algorithm. A data handling system is configured to select at least one sample of data; operate a plurality of the data compression engines to compress the selected sample(s); determine the compression ratios of the operated data compression engines with respect to the selected sample(s); and select the data compression engine having the greatest compression ratio with respect to the selected sample(s), to compress the data. Further, the data compression engines may be in tiers from low to high in accordance with expected latency to compress data and to uncompress compressed data; and a data compression engine is selected from a tier that is inverse to the present rate of access.

The present invention is directed towards systems and methods for generating a compressed data file providing access to one or more selected portions of data contained within the data file. The file is partitioned into one or more chunks, a given chunk comprising a separate unit of data representing a subset of data from the file. The one or more chunks are compressed through use of a compression algorithm, and the one or more chunks are combined to form a compressed file. Metadata is also generated that indicates a chunk offset of a given chunk, thereby allowing direct parallel access to one or more given chunks. Similarly, legacy applications may ignore the chunk structure in the compressed file and access the file according to techniques know in the art, thereby preserving backwards compatibility with such legacy applications.

A signal-processing apparatus comprises an instruction-parallel processor, a first data-parallel processor, a second data-parallel processor, and a motion detection unit, a de-blocking filtering unit and a variable-length coding / decoding unit which are dedicated hardware. With this structure, in signal processing of an image compression and decompression algorithm with a large processing amount, the load is distributed between software and hardware, so that the signal-processing apparatus can realize high processing capability and flexibility.

The invention discloses to a data processing method and system based on data transmission of mobile equipment. Data is compressed by using different compression algorithms according to data types of the data through data analysis, and information (such as data size, data change amount, used data compression algorithms) of the data which is transmitted at this time is marked at the head of the data; the head information of the data is firstly extracted by a client after the data transmitted by a server is received; the data is decompressed according to the extracted compression algorithms at the head of the data; and information (such as actual data size and data change amount) of the received data is compared with the information (such as data size and data change amount) which is marked at the head of the data in the decompression process, so as to judge whether the data transmission is abnormal or not. With the adoption of the processing, the size of a data packet to be transmitted can be greatly reduced and the transmission speed is improved. Furthermore, the data is convenient to decompress according to marking of the head of the data, so that the completeness and accuracy of the data transmission can be ensured.

In a technique for compressing data, a data storage server receives a set of data, which includes a first number of subsets. The storage server defines a number of compression groups for the set of data, each compression group including multiple entries, each entry containing a pointer to a different subset of the set of data. At least part of the set of data is then compressed into a smaller number of subsets. For each of the subsets which does not contain compressed data after the compression, a predetermined value is stored in the corresponding entry of the corresponding compression group, to indicate that corresponding data is compressed and represented elsewhere in the compression group. The predetermined value may also indicate which compression algorithm was used to compress the data.

A system and method is provided for performing code provenance review in a software due diligence system. In particular, performing code provenance review may include sub-dividing source code under review and third-party source into logical fragments using a language-independent text fracturing algorithm. For example, the fracturing algorithm may include a set of heuristic rules that account for variations in coding style to create logical fragments that are as large as possible without being independently copyrightable. Unique fingerprints may then be generated for the logical fragments using a fingerprint algorithm that features arithmetic computation. As such, potentially related source code may be identified if sub-dividing the source code under review and the third-party source code produces one or more logical fragments that have identical fingerprints.

The invention relates to a compression method and belongs to a method of data compression technology in the field of information technology. The method comprises the following steps: inputting large-batch bill images; sorting and sequencing the bill images; utilizing a dynamic image compression algorithm to compress the images; packing and encrypting the images; adopting a dynamic image decompression algorithm to decompress the images and reducing and taking each image picture out; and outputting the batch images after the sorting and reduction. Compared with JPEG 2000, the compression algorithm provided by the invention has the advantages that: the compression speed is improved by 4 times; the size of resulting file of the compression is one-tenth of that of the original image; and after the decompression, the discrimination rate of OCR is kept unchanged basically. Based on the property, the compression method can transmit a real-time image in the network by using only small bandwidth.

A system and method for program counter and data tracing is disclosed. The tracing mechanism of the present invention enables increased visibility into the hardware and software state of the processor core.