Abstract: A video encoder and encoding method are provided. The encoder includes a frame-encoding unit that generates at least one quality layer from an input video frame; a coding-pass-selection unit that selects a coding pass with reference to a second coefficient of a lower layer adjacent to a current layer included in the at least one quality layer, the second coefficient corresponding to a first coefficient of the current layer; and a pass-coding unit that encodes the first coefficient without loss according to the selected coding pass.

Abstract: Methods and systems for improving performance of data decoding using apriori information about the data steam. In one aspect a decoder may determine the degree of lossiness inherent in the data or in the application of the data as a maximum resolution of data to be decoded and may thereby streamline entropy decoding of the data. For example, in DCT-based image data compression coupled with Huffman or other entropy encoding, apriori data may be analyzed to determine the maximum required resolution in bits of the DCT encoded data so as to simplify the entropy decoding. Other aspects optimize DCT decoding computation with faster approximations where the quantization values indicate a higher degree of lossiness or noise in the DCT encoded data. Apriori information may generally comprise values in the quantization table of a DCT encoded image and may be analyzed to determine the maximum symbol size and/or degree of lossiness.

Abstract: A data compression system and method for that is capable of detecting and eliminating repeated phrases of variable length within a window of virtually unlimited size.

Abstract: A transformation system for increasing the compressibility of digital images. In one embodiment, the pixels of a digital image are examined, one at a time. The color of the examined pixel is compared to that of its neighbors. If the difference in color from either of the neighboring pixels is below a threshold, the color of the neighbor that is closer to the color of the examined pixel is copied to the examined pixel. If neither of the neighbors is close enough in color, the color of the examined pixel is unchanged. The pixels are examined in a single pass. After each pixel has been examined, and possibly changed, the compressibility of the image using a dictionary-based technique, such as one of the Lempel-Ziv techniques, is typically improved.

Abstract: A method and apparatus embeds and extracts a watermark bit-sequence in a data stream of symbols compressed using dictionary-based compression scheme with variable length indices. The embedding transmits an index value from a set of m-bit index values used to compress symbols in the data stream, identifies divisions and unused bits in the set of m-bit index values, determines a watermark bit value as either a zero-bit value or a one-bit value, transmits the index value in a one-bit watermark value range when the watermark bit value is determined to be a one-bit value and transmits the index value in a zero-bit watermark value range when the watermark bit value is determined to be a zero-bit value. Extracting the watermark reverses these operations and classifies the indices as being in either the zero-bit watermark value range or the one-bit watermark value range until the watermark is recreated.

Abstract: Methods and systems provide approaches to start code emulation prevention at a granularity higher than the bit level. In various embodiments, start code emulation prevention can occur at locations other than data boundaries such as byte boundaries and the like. These embodiments can be used in connection with systems that do not always preserve data alignment boundaries in the data that is processed. In some systems, the described techniques can provide a basis from which decoder systems can recover in the event that data boundaries are lost.

Abstract: Current methods of embedding hidden data in an image inevitably distort the original image by noise. This distortion cannot generally be removed completely because of quantization, bit-replacement, or truncation at the grayscales 0 and 255. The distortion, though often small, may make the original image unacceptable for medical applications, or for military and law enforcement applications where an image must be inspected under unusual viewing conditions (e.g., after filtering or extreme zoom). The present invention provides high-capacity embedding of data that is lossless (or distortion-free) because, after embedded information is extracted from a cover image, we revert to an exact copy of the original image before the embedding took place. This new technique is a powerful tool for a variety of tasks, including lossless robust watermarking, lossless authentication with fragile watermarks, and steganalysis. The technique is applicable to raw, uncompressed formats (e.g., BMP, PCX, PGM, RAS, etc.

Abstract: After an image compressed by a compressing portion is stored in a page memory, it is decoded by a decoding portion. A sub-scanning enlargement portion carries out sub-scanning direction enlargement processing upon the image decoded by the decoding portion and a printer prints out the enlarged image. At this time, the printer generates a printer synchronous signal each time when it scans an image formation object surface. A control portion provides the page memory, the decoding portion and the magnification changing portion with control signals so as to synchronize reading out of the image from the page memory, the decoding of the decoding portion and enlargement processing of the sub-scanning enlargement portion.

Abstract: For the entropy coding of image data after subjected to orthogonal transforation and quantization, a plurality of entropy coding units are provided in parallel. The plurality of entropy coding units can be operated efficiently and the entropy coding can be executed at high speed.

Abstract: A method for generating a first plurality of output data values and the matrix factors used to generate an approximation to an image processing transform is disclosed. The first plurality of output data values are generated by transforming a plurality of input data values using a computer and applying a modified transform stored in a modified transformation matrix to the plurality of input data values. The plurality of input data values are stored in a generated matrix, and at least one data value in this matrix is rearranged using a permutation operation and modified by applying a linear combination of the unmodified values to the at least one data value. The modified transform is an approximation to a known transform stored in a transformation matrix that is used to generate a second plurality of output data values, the first plurality of output values approximating the second plurality of output data values.

Abstract: A compression and decompression system in which a reversible wavelet filter are used to generates coefficients from input data, such as image data. The reversible wavelet filter is an efficient transform implemented with integer arithmetic that has exact reconstruction. The present invention uses the reversible wavelet filter in a lossless system (or lossy system) in which an embedded codestream is generated from the coefficients produced by the filter. An entropy coder performs entropy coding on the embedded codestream to produce the compressed data stream.

Abstract: A method of processing an encoded digital signal comprising a set of data obtained by encoding a set of original data representing physical quantities, and a set of information representing the original data and parameters used during the encoding. The method includes receiving an initial request for obtaining a selected part of the digital signal,determining at least one quantity of data representing the selected part of the digital signal as a function of the set of information and of the initial request, and providing at least one value of this determined quantity of data.

Abstract: Methods, apparatus and computer readable medium are described that compress and/or decompress a digital image in a lossless or a lossy manner. In some embodiments, a display controller may compress a digital image by generating a symbol for each pel of the digital image. In particular, the symbol may represent a pel via a match vector and a channel error vector. The match vector may indicate which quantized channels of the pel matched quantized channels of a previous pel. Further, the channel error vector may comprise a lossless or lossy channel for each quantized channel of the pel that did not match a corresponding quantized channel of the previous pel. The channel error may also comprise a lossless or lossy channel error for each quantized channel of the pel that matched a corresponding quantized channel of the previous pel.

Abstract: In a quantization step information encoding unit, an average value of the quantization step information is found in an approximate shape extraction unit (20), first of all, from one set of a given number of unitary quantization units to another. In an approximate shape encoding unit (21), the approximate shape information is vector-quantized. In a residual signal computing unit (22), the residual signals between the quantization step information and the quantized approximate shape vector are computed. In a residual signal encoding unit (23), the residual signals are variable length encoded, and the so encoded residual signals and the vector quantized approximate shape information are output.

Abstract: Method and apparatus for compressing data representing a set of symbols such that each symbol of the set can be separately accessed and decompressed. Each symbol of the set of symbols is encoded in the form of a two-part code wherein a first part of the code is common for all encoded symbols and a second part of the code encodes the data representing a symbol. An identifier is given for each symbol for permitting each encoded symbol to be separately accessed and decompressed. The invention is particularly useful for storing large fonts such as a Chinese or Japanese character set.

Abstract: A method and an apparatus to encode a series of quantized coefficients of a transform of a block of image data. The transform is such that 0 is the most likely coefficient amplitude and 1 is the next most likely coefficient amplitude. The method includes forming symbols (called events) from the series of quantized transform coefficients. An event is a run of none or more zero-valued coefficients followed by a run of one of a predefined set of sequences, each sequence in the set being either a single coefficient of amplitude greater than one, or a sequence of 1's and 0's starting with a coefficient of amplitude 1. The method includes forming a codeword for each formed event. Relatively short codewords are formed to represent events that are relatively more likely to occur, and relatively long codewords are formed to represent events that are relatively less likely to occur.

Abstract: Various techniques and tools for encoding and decoding (e.g., in a video encoder/decoder) binary information (e.g., skipped macroblock information) are described. In some embodiments, the binary information is arranged in a bit plane, and the bit plane is coded at the picture/frame layer. The encoder and decoder process the binary information and, in some embodiments, switch coding modes. For example, the encoder and decoder use normal, row-skip, column-skip, or differential modes, or other and/or additional modes. In some embodiments, the encoder and decoder define a skipped macroblock as a predicted macroblock whose motion is equal to its causally predicted motion and which has zero residual error. In some embodiments, the encoder and decoder use a raw coding mode to allow for low-latency applications.

Abstract: The present invention relates to regulating the quality and/or bitrate of content within mixed content video when the video is compressed subject to a bitrate constraint. For example, a screen capture encoder encodes palletized content within a frame of screen capture video. Subject to an overall bitrate constraint, the encoder then allocates bits for continuous tone content within the frame. By controlling the allocation of bits used to encode the continuous tone content, the encoder regulates bitrate for the continuous tone content. This in turn can allow the encoder to regulate spatial quality and/or overall temporal quality for the video. In one scenario, for screen capture video encoded to a (relatively) constant overall bitrate, the screen capture encoder reduces the bitrate (and quality) of the continuous tone content, instead spending bits to increase the overall frame rate of the video.

Abstract: A system and method for representing and maintaining redundant data sets utilizing system DNA transmission and transcription techniques comprising a system of symbolic exchange used for data transmission whose lexicon is based on the provision of unique and consistent identifiers (or symbols) for transmitted data utilizing “sticky byte” factoring. A protocol is provided for determining which entries (comprising unique identifier to corresponding data pairs) in a local lexicon (or “Primordial Data Pool”) are contained in a remote lexicon and can, therefore, be used in a transmission in lieu of the data itself. A mechanism is further provided through which the local lexicon can add newly presented unique identifier to corresponding data pairs to one or more remote lexicons.

Abstract: An integrated memory controller (IMC) including MemoryF/X Technology which includes data compression and decompression engines for improved performance. The memory controller (IMC) of the present invention preferably selectively uses a combination of lossless, lossy, and no compression modes. Data transfers to and from the integrated memory controller of the present invention can thus be in a plurality of formats, these being compressed or normal (non-compressed), compressed lossy or lossless, or compressed with a combination of lossy and lossless. The invention also indicates preferred methods for specific compression and decompression of particular data formats such as digital video, 3D textures and image data using a combination of novel lossy and lossless compression algorithms in block or span addressable formats.

Abstract: Embodiments of the invention present implementations for multiple access source coding (MASC). One embodiment presents an implementation directed at the lossless side-information case of MASC. Another embodiment gives an implementation of the general case MASC. One embodiment is a near-lossless implementation of MASC. In a two dimensional example, the invention provides a way to decode data pairs (x,y) from encoded individual data streams x and y. The present invention provides a solution that partitions the source code into optimal partitions and then finds a matched code that is optimal for the given partition. Embodiments of the present invention use Optimal Shannon, Huffman and Arithmetic Codes for the matched codes. Another embodiment of the present invention gives a method of finding near-lossless multiple access source coding.

Abstract: A method for improving lossless image compression by using multiple lossless image compression techniques and adapting the best one to each image. An RGB compressor receives an image file and splits the image into rectangular block types. Different digital image and/or sub-image (block) types are optimally compressed using a compression techniques particularly well-suited for the particular kind of image or block.

Abstract: A dictionary based accelerated method of lossless compression and encryption of data with a small statistical redundancy. The sequence of the least distances obtained between every input numerical sample and the samples of the several dictionaries, produced by random number generators, and statistical compression is further applied. The process is accelerated utilizing a packed content addressable memory (CAM) for dictionary and input samples. CAM is scanned for a marking bit indicating a presence of a dictionary sample to find the least distance. CAM is packed and loaded with successful ranges of the amplitudes of both dictionary and input samples to reduce an address space and to accelerate the process of compression further. The least distances are founded for an unique alphabet of the input sequence, and the results are merged with an original input to accelerate the process of compression further.

Abstract: An apparatus and method for compressing/decompressing an image in a mobile communication terminal. The apparatus and method compresses or decompresses image data by setting up an optimal threshold. The image compression apparatus and method includes setting initial data of a graphic image to comparison data, determining whether the same data as the comparison data is repeated after the comparison data, determining whether the comparison data is greater than a predetermined threshold, if the same data as the comparison data is not repeated after the comparison data, and storing the comparison data without storing the number of times the comparison data is repeated, if the comparison data is greater than the predetermined threshold.

Abstract: Embodiments of the present invention are directed to a remote desktop communication protocol that includes spatial and temporal compression techniques. Multimedia presentation data is generated at a server from a source. A compression facility modifies the presentation data by both spatially and temporally compressing the presentation data to transmittable data. In some embodiments, a check is performed to ensure that the least amount of data is selected prior to sending the transmittable data to a remote client. The remote client receives the transmittable data and re-constructs the original multimedia presentation data. In some embodiments that use lossy compression, the reconstruction may not exactly re-construct the original multimedia presentation data. Once re-created, the remote client presents the presentation data at the remote client. The presentation data could be audio, video, or other data or a combination of them.

Abstract: A signal having units of two or more bits is compressed into a compressed signal by splitting a unit of two or more bits into an MSB part, which includes the most significant bit of the unit of two or more bits, and an LSB part which does not include the most significant bit of the unit of two or more bits. The MSB part is compressed in a lossless fashion. The LSB part is scalability compressed. The compressed MSB and LSB parts are combined to form the compressed signal.

Abstract: A data compression system and method for that is capable of detecting and eliminating repeated phrases of variable length within a window of virtually unlimited size.

Abstract: The present invention provides a system that compresses and decompresses an image. The system includes a first codec a first stage codec for identifying runs of pixels of a defined value in a data stream of the image data beginning from the left and right margins of a line, such that information regarding the runs is assigned as a header and appended to the data stream. The compression device includes a second stage codec for scanning over remaining data in the data stream and compressing all but the header by utilizing a Huffman encoding scheme to reduce amount of data stored in the data stream, wherein the Huffman encoding scheme interleaves Huffman code values with unencrypted data while maintaining long word boundaries for the unencrypted data. The second codec also performs the operation of decompressing a compressed image.

Abstract: An image file, which typically represents a palette-based image that has been encoded using a first predefined run-length based encoding method, is decoded to produce an image data array. The image data array is divided into blocks; either all the blocks or a majority of the blocks have a predefined fixed size. At least some of the blocks of the image are processed to produce a corresponding re-encoded block. In particular, each such block is processed by applying a plurality of distinct encodings to the block to produce an equal plurality of distinct re-encoded block versions. One of the plurality of distinct re-encoded block versions is selected in accordance with predefined selection criteria for use as the re-encoded block. Each re-encoded block is stored in a distinct data structure, such as a file.

Abstract: The present invention operates as an expert system to automatically determine an optimal method for reducing the size of an electronic file containing at least one embedded image by determining optimal methods for compressing each image. Further, in one embodiment, linked images are also compressed. User control of relevant parameters such as image compression options, retention or removal of unnecessary data associated with embedded or linked images, and downsampling images to better match the output resolution of specific output devices is provided in further embodiments. Further, to prevent cumulative degradation of images through repeated lossy compression, images that have already been compressed or optimized are preferably flagged so that they are not compressed more than once.

Abstract: A data compression method and system replaces pairs of symbols in a string of symbols by a single new symbol. A method for selecting the pairs of symbols to be replaced employs a modified greedy algorithm. The method selects a next best pair of symbols for replacement by considering pairs that have a potential for usurping a current best candidate pair of symbols, due to their frequency of occurrence. A minimum savings threshold is evaluated to further avoid exhaustive searches of all possible pairs of symbols.

Abstract: A method and system of lossless compression of integer data using a novel backward-adaptive technique. The adaptive Run-Length and Golomb/Rice (RLGR) encoder and decoder (codec) and method switches between a Golomb/Rice (G/R) encoder mode only and using the G/R encoder combined with a Run-Length encoder. The backward-adaptive technique includes novel adaptation rules that adjust the encoder parameters after each encoded symbol. An encoder mode parameter and a G/R parameter are adapted. The encoding mode parameter controls whether the adaptive RLGR encoder and method uses Run-Length encoding and, if so, it is used. The G/R parameter is used in both modes to encode every input value (in the G/R only mode) or to encode the number or value after an incomplete run of zeros (in the RLGR mode). The adaptive RLGR codec and method also includes a decoder that can be precisely implemented based on the inverse of the encoder rules.

Abstract: A system, method and algorithm for performing statistical analysis on an input data source to determine an optimal token size resulting in an increased ratio value is described. Changes to the values of the tokens prior to compression may result in an overall compression increase even if the data source has been previously compressed. Specific techniques for modifying the tokens include varying the base size, rearrangement of the tokens, and modifications by matrix multiplication. After modification of the tokens, compression of the data using one or more lossless compression methods may be performed. The technique may be repeated by using the output of previous compression processes as input to additional entropy and compression optimization.

Abstract: A system and method facilitating progressively transforming and coding digital pictures is provided. The present invention via employment of a multi-resolution lapped transform provides for progressive rendering as well as mitigation of blocking artifacts and ringing artifacts as compared to many conventional compression systems. The invention includes a color space mapper, a multi-resolution lapped transform, a quantizer, a scanner and an entropy encoder. The multi-resolution lapped transform outputs transform coefficients, for example, first transform coefficients and second transform coefficients. A multi-resolution representation can be obtained utilizing second transform coefficients of the multi-resolution lapped transform. The color space mapper maps an input image to a color space representation of the input image. The color space representation of the input image is then provided to the multi-resolution lapped transform.

Abstract: A method estimates bit rates for sets of coding parameters, based on characteristics of a channel, and an end-to-end distortion is estimated based on signal statistics of the video. A particular set of coding parameters that satisfies an available bit rate of the channel and that minimizes the end-to-end distortion of the video is selected. Motion compensated multiple descriptions of the video are encoded according to the selected set of coding parameters.

Abstract: A method and system for processing a plurality of multi-bit configuration words for configuring a programmable logic device. One or more of bits of the multi-bit configuration words are identified as “Don't Care” configuration bits that do not affect the functionality of the programmable logic device. These “Don't Care” configuration bits may or may not be related to the specific configuration of the programmable logic device. A lossy compression operation is performed on the multi-bit configuration words thereby creating a compressed data set. The identified “Don't Care” configuration bits are used during the compression operation. For example, the compression operation may include (1) maintaining a compression buffer of previously compressed configuration words, and (2) comparing configuration words to be compressed with the configuration words in the compression buffer, wherein the “Don't Care” configuration bits are deemed to result in matches during the comparison.

Abstract: A method for serving an image from a server to a client, e.g., a computer having a browser or other graphics viewing engine. The user of the client first specifies a set of one or more bitmap characteristics for an image transfer, with at least one of the bitmap characteristics including a number of bits per pixel. Preferably, this specification is accomplished using an applet or other piece of code that is downloaded to the client from the server. Later, when the server receives a client request that includes data identifying a specified bitmap characteristic, a server processing routine (e.g., a servlet) generates a version of the image that conforms to the specified bitmap characteristic. This version is then delivered back to the client in response to the original request. In this way, the user of the client machine can control the particular characteristics of the image files that are delivered to his or her machine.

Abstract: A system and method facilitating progressively transforming and coding digital pictures is provided. The present invention via employment of a multi-resolution lapped transform provides for progressive rendering as well as mitigation of blocking artifacts and ringing artifacts as compared to many conventional compression systems. The invention includes a color space mapper, a multi-resolution lapped transform, a quantizer, a scanner and an entropy encoder. The multi-resolution lapped transform outputs transform coefficients, for example, first transform coefficients and second transform coefficients. A multi-resolution representation can be obtained utilizing second transform coefficients of the multi-resolution lapped transform. The color space mapper maps an input image to a color space representation of the input image. The color space representation of the input image is then provided to the multi-resolution lapped transform.

Abstract: A plurality of patterns such as half-tone patterns, solid patterns, edge patterns, and verbatim data are losslessly represented in a compressed raster data stream. A pattern selection module selects among the various patterns to provide the best combination of lossless representations according to particular criteria such as storage compactness. Half-tone patterns are compressed by exploiting the characteristics of the half-tone threshold screen used to generate the half-tone image. A half-tone pattern codebook is produced by half-tone screening a calibration image. A packet formatting module packs multiple pattern identifiers and lossless representations into a packet which may be transmitted compactly. Upon receipt, a packet deformatting module unpacks the pattern identifiers and lossless representations from the packet. After deformatting, a pattern decoding module uses the pattern identifier to activate appropriate pattern generation modules.

Abstract: A compression and decompression system in which a reversible wavelet filter are used to generates coefficients from input data, such as image data. The reversible wavelet filter is an efficient transform implemented with integer arithmetic that has exact reconstruction. The present invention uses the reversible wavelet filter in a lossless system (or lossy system) in which an embedded codestream is generated from the coefficients produced by the filter. An entropy coder performs entropy coding on the embedded codestream to produce the compressed data stream.

Abstract: Information including parameters for JBIG-encoding is managed page-by-page, and image information is JBIG-encoded with the information managed page-by-page, after which the encoded data is stored in an image memory. The encoded data stored is then decoded with the information managed page-by-page. The number of encoding lines on pages to be JBIG-encoded and the number of scanning lines on images scanned page-by-page by a scanner are centrally managed as a common parameter.

Abstract: An apparatus and method for performing bitplane coding with reordering, that may be used in a Fine Granularity Scalability (FGS) system. The apparatus and method reorder coefficients each time after a bitplane is coded. By reordering, the apparatus and method separate the coefficients into two groups. When coding a bitplane, bits in the first group are copied into the bitstream, while the bits in the second group are subject to common run-length, VLC, or arithmetic coding. The apparatus and method may also be used with or in a conventional SNR, temporal and/or spatially scalable architectures, for example, as utilized within an MPEG-4 framework.

Abstract: A method and apparatus for performing compression and/or decompression is described. In one embodiment, the present invention comprises a system having a buffer, a wavelet transform unit, and a coder. The wavelet transform unit has an input coupled to the buffer to perform a wavelet transform on pixels stored therein and to generate coefficients at an output. The coder is coupled to the wavelet transform unit to code the transformed pixels received from the buffer.

Abstract: A transformation system for increasing the compressibility of digital images. In one embodiment, the pixels of a digital image are examined, one at a time. The color of the examined pixel is compared to that of its neighbors. If the difference in color from either of the neighboring pixels is below a threshold, the color of the neighbor that is closer to the color of the examined pixel is copied to the examined pixel. If neither of the neighbors is close enough in color, the color of the examined pixel is unchanged. The pixels are examined in a single pass. After each pixel has been examined, and possibly changed, the compressibility of the image using a dictionary-based technique, such as one of the Lempel-Ziv techniques, is typically improved.

Abstract: The image coding device comprises data adding means for adding specific data to input image data at the end of image data, and arithmetic coding unit not issuing remaining output code of code register after coding of final input data. In this constitution, increase of circuit scale can be suppressed and decline of operation clock can be prevented.

Abstract: Current methods of embedding hidden data in an image inevitably distort the original image by noise. This distortion cannot generally be removed completely because of quantization, bit-replacement, or truncation at the grayscales 0 and 255. The distortion, though often small, may make the original image unacceptable for medical applications, or for military and law enforcement applications where an image must be inspected under unusual viewing conditions (e.g., after filtering or extreme zoom). The present invention provides high-capacity embedding of data that is lossless (or distortion-free) because, after embedded information is extracted from a cover image, we revert to an exact copy of the original image before the embedding took place. This new technique is a powerful tool for a variety of tasks, including lossless robust watermarking, lossless authentication with fragile watermarks, and steganalysis. The technique is applicable to raw, uncompressed formats (e.g., BMP, PCX, PGM, RAS, etc.

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: An image pickup apparatus having a simpler hardware configuration and capable of operating by a smaller power consumption.

Abstract: A method and system of lossless compression of integer data using a novel backward-adaptive technique. The adaptive Run-Length and Golomb/Rice (RLGR) encoder and decoder (codec) and method switches between a Golomb/Rice (G/R) encoder mode only and using the G/R encoder combined with a Run-Length encoder. The backward-adaptive technique includes novel adaptation rules that adjust the encoder parameters after each encoded symbol. An encoder mode parameter and a G/R parameter are adapted. The encoding mode parameter controls whether the adaptive RLGR encoder and method uses Run-Length encoding and, if so, it is used. The G/R parameter is used in both modes to encode every input value (in the G/R only mode) or to encode the number or value after an incomplete run of zeros (in the RLGR mode). The adaptive RLGR codec and method also includes a decoder that can be precisely implemented based on the inverse of the encoder rules.