Abstract: Embodiments of the present invention include a memory unit and a processor coupled to a memory unit. The processor is operable to group a plurality of subsets of data from an input data stream and compute a first hash value corresponding to a first grouped subset of data. Additionally, the processor is operable to detect a match between the first hash value and a second hash value stored in a hash table. Furthermore, the processor is also configured to monitor a hash value match frequency for the input data stream in which the processor is operable to increment a counter value responsive to a detection of the match and determine an entropy level for the input data stream based on the counter value relative to a frequent hash value match threshold.

Abstract: A high-efficiency wireless local-area network (HEW) device including physical layer and medium access control layer circuitry is disclosed. The physical layer and medium access control layer circuitry may be configured to encode data with a binary convolutional code (BCC) to generate encoded data, and interleave the encoded data in accordance with one of a plurality of interleaver configurations for one of a predetermined number of data subcarriers to generate interleaved encoded data. The physical layer and medium access control layer circuitry may be further configured to map the interleaved encoded data with a quadrature amplitude modulation (QAM) greater than 256 QAM onto longer-duration orthogonal frequency division multiplexed (OFDM) symbols, and transmit the longer-duration OFDM symbols on channel resources in accordance with an orthogonal frequency division multiple access (OFDMA) technique.

Abstract: Adaptively compressing an input string (10) comprising a sequence of symbols in order to create a plurality of segment dictionaries Dm, with the steps of: generating a lookup map (110); generating a key value segment Sm,n; searching the lookup map for each symbol received in the input string (120, 130); upon detecting a symbol is not stored in the lookup map, adding the symbol by storing the symbol at a next sequential key index in the lookup map lookup map (135) and assigning a next sequential key value entry to the symbol and adding this key value to the key value segment Sm,n (150); upon detecting the symbol is stored in the lookup map, adding the corresponding key value assigned to this symbol to the next sequential entry of the key value segment Sm,n (150); wherein a new key value segment Sm,n+1 of the lookup map is generated if the number of different symbols equals the number of available key values k=2n for the opened/current key value segment Sm,n (141, 142), and where-in the lookup map is converted

Abstract: A method, an apparatus, and a computer program product for wireless communication are provided. The apparatus generates a data transport block, divides the data transport block into a number of sub-blocks. The sub-blocks include at least a first sub-block and a second sub-block, where a size of the first sub-block is different than a size of the second sub-block. The apparatus may encode the number of sub-blocks using different code rates and/or different coding schemes. The apparatus may modulate the encoded sub-blocks using different modulation orders. The apparatus transmits the sub-blocks to a receiver.

Abstract: A method of dictionary coding using coding unit (CU) based processing or using string length coding by taking into account of color component aligned matched sample-strings are disclosed. In the dictionary coding using CU based processing, the pixels in each CU is converted to one-dimensional (1-D) pixel data according to an intra-block scanning pattern. A string search is then performed to determine a match condition regarding whether a current sample-string starting at a current position of the current 1-D packed pixel data matches a previously coded sample-string in the reference 1-D packed pixel data. For string length coding by taking into account of color component aligned matched sample-strings, a flag is signaled to indicate whether the string length of one previously coded sample-string is in a length group corresponding to color-component-aligned previously coded sample-strings.

Abstract: System and method to encode and decode raw data. The method to encode includes receiving a block of uncoded data, decomposing the block of uncoded data into a plurality of data vectors, mapping each of the plurality of data vectors to a bit marker; and storing the bit marker in a memory to produce an encoded representation of the uncoded data. Encoding may further include decomposing the block of uncoded data into default data and non-default data, and mapping only the non-default data. In some embodiments, bit markers may include a seed value and replication rule, or a fractalized pattern.

Abstract: A method for decompressing a compressed data structure generated for a computing system includes generating a first block from the compressed data structure value by: reading a first indicator from a first field of the compressed data structure; reading a first symbol from a second field of the compressed data structure; determining, using the first indicator, whether the first symbol is compressed; reading, in response to determining that the first symbol is compressed, a block value of the first block from a third field of the compressed data structure, where the block value is stored in the third field at an index indicated by the first symbol, and a block size of each block value of the third field is determined by an instruction set of the computing system. The method further includes generating an uncompressed data structure by storing the first block in an uncompressed data structure.

Abstract: A device generates a file that stores coded samples that contain coded pictures of the video data. The file also includes a sample entry that includes an element that indicates whether all sequence parameter sets (SPSs) that are activated when a stream to which the sample entry applies is decoded have syntax elements that indicate that temporal sub-layer up-switching to any higher temporal sub-layer can be performed at any sample associated with the SPSs. The same or different device determines, based on the element in the sample entry, that all SPSs that are activated when the stream to which the sample entry applies is decoded have syntax elements that indicate that temporal sub-layer up-switching to any higher temporal sub-layer can be performed at any sample associated with the SPSs.

Abstract: Data compression using a combination of content independent data compression and content dependent data compression. In one aspect, a system for compressing data comprises: a processor, and a plurality of data compression encoders wherein at least one data encoder utilizes asymmetric data compression. The processor is configured to determine one or more parameters, attributes, or values of the data within at least a portion of a data block containing either video or audio data, to select one or more data compression encoders from the plurality of data compression encoders based upon the determined one or more parameters, attributes, or values of the data and a throughput of a communications channel, and to perform data compression with the selected one or more data compression encoders on at least the portion of the data block.

Abstract: A non-transitory computer-readable storage medium may include instructions stored thereon. When executed by at least one processor, the instructions may be configured to cause a computing system to compress data by storing positions of strings that hash to a same hash value in a ring buffer, and retrieving the ring buffer in a single memory operation to determine a longest matching string that hashes to the same hash value.

Abstract: A processor includes a memory hierarchy, buffer, and a decompressor. The decompressor includes circuitry to read elements to be decompressed according to a compression scheme, parse the elements to identify literals and matches, and, with the literals and matches, generate an intermediate token stream formatted for software-based copying of the literals and matches to produce decompressed data. The intermediate token stream is to include a format for multiple tokens that are to be written in parallel with each other, and another format for tokens that include a data dependency upon themselves.

Abstract: An encoder for encoding data to generate corresponding encoded data including information indicative of a frequency, probability or range of one or more symbols to be represented in the encoded data. The encoder can include in the encoded data additional information indicative of whether information indicative of a frequency, probability or range for at least one symbol amongst the one or more symbols is in the encoded data. The encoder can include in the encoded data the additional information of whether information indicative of a frequency, probability or range for at least one symbol amongst the one or more symbols in the encoded data expressed as single availability bit information. The encoder can represent inclusion of information indicative of the frequency, probability or range information by use of a single availability bit value “7”, and non-inclusion of information indicative of the frequency, probability or range information by use of a single availability bit value “0”.

Abstract: Techniques and apparatus for performing an invariant-reference compression/decompression process are described. In one embodiment, for example an apparatus to generate invariant-reference compressed data may include at least one memory and logic, at least a portion of comprised in hardware coupled to the at least one memory, the logic to access input data comprising a plurality of literals and a plurality of repeating sequences, and perform an invariant-reference compression process to generate the invariant-reference compressed data, the invariant-reference compression process comprising determining a relative distance for each of the plurality of repeating sequences, the relative distance comprising a bit offset in the invariant-reference compressed data, and encoding each of the plurality of repeating sequences as a reference token in the invariant-reference compressed data, the reference token comprising the relative distance and a length. Other embodiments are described and claimed.

Abstract: The invention introduces a method for accelerating compression, performed in a compression accelerator, including: repeatedly executing a loop for determining the longest matched-length between a first string and a second string. Each iteration of the loop includes: obtaining n successive characters from the first string as a source string, wherein n is greater than 1; comparing each character of the source string with all characters of the second string, so as to generate n first-match-results corresponding to the n successive characters of the source string respectively; generating a second-match-result according to the n first-match-results; and determining whether a continuous match of the n successive characters is presented according to the second-match-result. If so, n is added to the matched length and the next iteration of the loop is continued to execute. Otherwise, a matched length is updated and output and the loop is exited.

Abstract: A request for an entry of a dictionary having multiple dictionary blocks may be received, where the dictionary stores string values associated with corresponding value identifiers (IDs) for dictionary compression. One of the dictionary blocks may be selectively loaded into memory, and the dictionary block that has been loaded into memory may be searched. A value ID directory may be constructed in memory, where the value ID directory includes last value IDs for the dictionary blocks, and each of the last value IDs is mapped to an index of one of the dictionary blocks that includes a string value for that last value ID. A separator directory may also be constructed in memory, where the separator directory includes separators for the dictionary blocks, and each of the separators is mapped to an index of one of the dictionary blocks that includes a string value for that separator.

Abstract: The invention introduces a method for accelerating hash-based compression, performed in a compression accelerator, comprising: fetching a string to be compressed from a data buffer; storing instances corresponding to the string in an intermediary buffer; issuing a hash request to a hash matcher for each instance, issuing a data request to an LSM (longest string matcher) according to a first reply sent by the hash matcher, and updating a state, a match length and a match offset of the instance according to a second reply sent by the LSM; and outputting the result to a formatter according to the state, the match length and the match offset of each instance in the original order of the associated substrings that appeared in the string.

Abstract: An encoding device 100 encodes a plurality of input text files to a plurality of encoded files by using a static dictionary unit 121 and a dynamic dictionary unit 122. The dynamic dictionary unit 122 is generated in accordance with word appearance frequencies in the plurality of text files. The encoding device 100 generates a coupled encoded file that includes the plurality of encoded files, information on the dynamic dictionary unit 122, and position information that indicates positions of the respective plurality of encoded files.

Abstract: Embodiments of the present invention provide a method for searching for a data stream dividing point based on a server. In the embodiments of the present invention, a data stream dividing point is searched for by determining whether at least a part of data in a window of M windows meets a preset condition, and when the at least a part of data in the window does not meet the preset condition, a length of N*U is skipped, so as to obtain a next potential dividing point, thereby improving efficiency of searching for a data stream dividing point.

Abstract: Systems and methods for providing accelerated transmission of broadcast data, such as financial data and news feeds, over a communication channel using data compression and decompression to provide secure transmission and transparent multiplication of communication bandwidth, as well as reduce the latency associated with data transmission of conventional systems.

Abstract: Systems and methods for granular cache repair. An example processing system comprises a processing core communicatively coupled to a cache via a cache controller and a cache repair memory communicatively coupled to the cache controller. The cache controller is configured, responsive to receiving a read request referencing a physical address, to: retrieve cache data from a cache location identified by the physical address, retrieve, in parallel with retrieving the cache data, cache repair data from the cache repair memory, the cache repair data associated with the cache location, the cache repair data comprising at least one of: a bit repair value, a column repair value, and a raw repair value, and output the cache data multiplexed with the cache repair data.

Abstract: A context-based arithmetic encoding apparatus and method and a context-based arithmetic decoding apparatus and method are provided. The context-based arithmetic decoding apparatus may determine a context of a current N-tuple to be decoded, determine a Most Significant Bit (MSB) context corresponding to an MSB symbol of the current N-tuple, and determine a probability model using the context of the N-tuple and the MSB context. Subsequently, the context-based arithmetic decoding apparatus may perform a decoding on an MSB based on the determined probability model, and perform a decoding on a Least Significant Bit (LSB) based on a bit depth of the LSB derived from a process of decoding on an escape code.

Abstract: A method includes, in response to a first write command corresponding to first data and a first context which is identifiable with a first identifier and to a second write command corresponding to second data and a second context identifiable with a second identifier, determining whether the first identifier of the first context matches the second identifier of the second context. The method also includes, if the first identifier of the first context is determined to match the second identifier of the second context, forming a compression group of data including the first data and the second data, and generating compressed data corresponding to the compression group of data.

Abstract: In a storage system for backing up data of an external apparatus, the external apparatus and a storage apparatus collaboratively perform efficient de-duplication. A storage system stores data from the external apparatus in a unit of content, and includes a backup apparatus configured to execute backup processing to create backup data of the data from the external apparatus in the unit of content; and a storage apparatus coupled to the backup apparatus in a communication-enabled manner and configured to store the backup data received from the backup apparatus. A first backup processing part of the backup apparatus determines whether or not a content is already stored in the storage apparatus by using first redundancy determination information that is information for determining whether or not each of contents of the backup data is already stored in the storage apparatus.

Abstract: Example embodiments of the present invention relate to a method, a system, and a computer program product for compressing data in a data storage system. The method includes performing writes to the data storage system according to a first compression algorithm and determining to perform write commands according to a second compression algorithm. Subsequent writes may be performed to the data storage system according to the second compression algorithm.

Abstract: Methods and systems are provided for the compression and decompression of data. The compression and decompression of data may include partitioning the data into chunks, analyzing the individual chunks to determine the best compression and decompression encoders to utilize for the next data chunk of a data file. In compressing and decompressing using the mentioned technique, the data is delivered to the requesting client in an efficient and speedy manner.

Abstract: A method, at a host device (10), of managing memory (28) of a display control device (16), the memory (28) being used for storing display data sent from the host device (10) to the display control device (16) for display. The method involves maintaining a map (18) at the host device (10) corresponding to the memory (28) at the display control device, the map (18) indicating locations corresponding to addresses of the memory (28) at which data is stored or not. The map (18) is used to determine a size of a portion of the display data, and a location on the map (18) where the portion of display data would fit into the memory. An address in the memory (28) corresponding to the determined location on the map (18), together with the portion of display data, is then sent to the display control device (16), and the location on the map (18) corresponding to the address in the memory (28) is updated to indicate that the address has data stored in it.

Abstract: Systems, methods, and apparatuses for installing a software product using timestamp validation and system identification validation are disclosed. An example method to lock a software product in a software wrapper includes determining a unique hard drive serial number of a user device to which the software product is to be installed and generating a hash number of the unique hard drive serial number. The example method also includes determining a campaign identifier of the software product from a secure variable within the software product and generating a date-time code based on a current date and time. The method further includes assembling the date-time code and the campaign identifier into an unlock code, encrypting the unlock code using the hash number as a passphrase key to create an encrypted unlock code, and applying the encrypted unlock code to an end of a filename of an installer using a command line parameter.

Abstract: A method and system for fuzzy full text search is disclosed. The system includes an inverted index where tokens are organized in a Next Valid Character (NVC) tree. Each path through the tree defines a token. The document lists for the tokens are stored at leaf nodes. When performing a fuzzy full text search, the system uses an edit distance greater than zero. After receiving search tokens, the system traverses the NVC tree to generate document error lists. The system then compares the error lists to identify relevant document identifiers and provides a result set.

Abstract: For producing secondary segmentations of data into blocks and corresponding digests for input data in a data deduplication system using a processor device in a computing environment, digests are calculated for an input data chunk using a primary segmentation into blocks. Secondary segmentations are produced for each of the data mismatches based on reference data, and used to calculate further data matches. The primary segmentation and the corresponding primary digests are stored for the input data chunk.

Abstract: Devices, systems and methods are provided where a request may be transmitted based on a first encoding scheme, and a response to the request may be transmitted based on a second encoding scheme different from the first encoding scheme. The second encoding scheme may comprise an edge-based pulse width modulation encoding scheme.

Abstract: Embodiments of the present invention provide a method for searching for a data stream dividing point based on a server. In the embodiments of the present invention, a data stream dividing point is searched for by determining whether at least a part of data in a window of M windows meets a preset condition, and when the at least a part of data in the window does not meet the preset condition, a length of N*U is skipped, so as to obtain a next potential dividing point, thereby improving efficiency of searching for a data stream dividing point.

Abstract: A method and an apparatus are described for coding information, the method comprising obtaining a list of integers to be encoded; determining a hyper-pyramid having a dimension adapted to encode the list of integers, the hyper-pyramid having a plurality of vertices whose number is determined by the degree of the hyper-pyramid, which is equal to the sum of the integers of the list of integers and by the dimension of the hyper-pyramid which is equal to the number of integers of the list of integers minus one; indexing the list of integers in the hyper-pyramid using an indexing system; and providing an indication of the indexing of the list of integers in the hyper-pyramid.

Abstract: A compression algorithm based on Huffman coding is disclosed that is adapted to be readily implemented using VLSI design. A data file may be processed to replace duplicate data with a copy commands including an offset and length, such as according to the LV algorithm. A Huffman code may then be generated for parts of the file. The Huffman code may be generated according to a novel method that generates Huffman code lengths for literals in a data file without first sorting the literal statistics. The Huffman code lengths may be constrained to be no longer than a maximum length and the Huffman code may be modified to provide an acceptable overflow probability and be in canonical order. Literals, offsets, and lengths may be separately encoded. The different values for these data sets may be assigned to a limited number of bins for purpose of generating usage statistics used for generating Huffman codes.

Abstract: A method for managing storage allocation includes adaptively determining, by a storage device processor, a region width across disk spaces for a group of storage devices that is inversely proportional to a number of nodes sharing a particular storage device. An adaptive storage device allocation region of the particular storage device is created based on the determined region width across the disk spaces for the group of storage devices.

Abstract: An information processing system includes a plurality of information processing apparatuses, and a control apparatus that collects data included in each of the plurality of information processing apparatuses. Each of the plurality of information processing apparatuses or the control apparatus determines a first number of first information processing apparatuses that compress the data or a second number of second information processing apparatuses that do not compress the data, the first information processing apparatuses and the second information processing apparatuses being included in the plurality of information processing apparatuses, based on a parameter involved in decompression processing by the control apparatus. The first number of first information processing apparatuses compress the data and transmit compressed data to the control apparatus, and the second number of second information processing apparatuses transmit non-compressed data to the control apparatus without compressing the data.

Abstract: An encoding device generates static-encoded data from input text data, utilizing a static dictionary that associates a character strings and static codes, respectively the static-encoded data including a plurality of static codes corresponding to a plurality of character strings that are registered in the static dictionary, generates dynamic-encoded data from the static-encoded data by encoding a character string or the static code that occurs more than once in the static-encodes data into a dynamic code, creates a dynamic dictionary associating character strings or static codes with corresponding dynamic codes, respectively and creates a Huffman tree and data of a leaf in the Huffman tree based on an occurrence frequency of the dynamic codes and the static codes in the input text data.

Abstract: To reduce noise or the like generated at a boundary of tiles introduced in a video coding method. In a motion vector detection unit, a first tile video signal and a second tile video signal included in one picture are supplied to a first detection unit and a second detection unit, and a reference image is supplied from a frame memory to the first detection unit and the second detection unit. The first detection unit performs processing, by inter prediction, on the video signal positioned on or in the vicinity of a tile boundary between a first tile and another tile among many video signals included in the first tile. In this processing, the first detection unit generates a motion vector so as to preferentially refer to the reference image included in another tile different from the first tile among the reference images read out from the frame memory.

Abstract: A method is disclosed for providing compressed video to a personal electronic device of a user using one of a plurality of different video compression protocols, and wherein the personal electronic device has a web browser. The method may involve using the personal electronic device to transmit a request for video content from a server via a remotely located controller. The controller may be used to serve up HTML5 client code to the browser. The browser may use the HTML5 client code to create a web socket connection with the server and to establish a web socket in the browser. The HTML5 client code, the web socket connection and the web socket may be used to receive the compressed video, and the HTML5 client code may be used to decompress the compressed video for display on the personal electronic device.

Abstract: A memory controller performs DMA operations on arbitrary sized elements unbounded by the word size of the host memory or processor, which performs operations based on an element that represents an atomic data unit such as a pixel. In this manner, a corresponding coding effort is not concerned with computing and locating word boundaries and accommodating unused bits of data conventionally used for accommodating word boundaries on pixel data for video rendering, for example. An element in memory corresponds to a rendered atomic data item, such as a pixel. The controller determines an element precision indicative of a size of the element, and identifies a unit of memory based on a memory location and a packed representation of a plurality of the elements relative to the memory location. The unit has a height and width, defining elements arranged in a grid, and an element position is based on coordinates.

Abstract: According to one embodiment of the present disclosure, an approach is provided in which a processor selects a page of data that is compressed by a first compression algorithm and stored in a memory block. The processor identifies a utilization amount of the compressed page of data and determines whether the utilization amount meets a utilization threshold. When the utilization amount fails to meet the utilization threshold, the processor uses a second compression algorithm to recompresses the page of data.

Abstract: According to one embodiment of the present disclosure, an approach is provided in which a processor selects a page of data that is compressed by a first compression algorithm and stored in a memory block. The processor identifies a utilization amount of the compressed page of data and determines whether the utilization amount meets a utilization threshold. When the utilization amount fails to meet the utilization threshold, the processor uses a second compression algorithm to recompresses the page of data.

Abstract: A computer-implemented method for compressing a data set, the method comprising receiving a first data block of the data set, selecting automatically by a compression management module a compression module from a plurality of compression modules to apply to the first data block based on projected compression efficacy or resource utilization, and compressing the first data block with the selected compression module to generate a first compressed data block.

Abstract: A computer-implemented method for compressing a data set, the method comprising receiving a first data block of the data set, selecting automatically by a compression management module a compression module from a plurality of compression modules to apply to the first data block based on projected compression efficacy or resource utilization, and compressing the first data block with the selected compression module to generate a first compressed data block.

Abstract: To reduce noise or the like generated at a boundary of tiles introduced in a video coding method. In a motion vector detection unit, a first tile video signal and a second tile video signal included in one picture are supplied to a first detection unit and a second detection unit, and a reference image is supplied from a frame memory to the first detection unit and the second detection unit. The first detection unit performs processing, by inter prediction, on the video signal positioned on or in the vicinity of a tile boundary between a first tile and another tile among many video signals included in the first tile. In this processing, the first detection unit generates a motion vector so as to preferentially refer to the reference image included in another tile different from the first tile among the reference images read out from the frame memory.

Abstract: Devices, such as computer readable media, and methods, such as automated methods, for labeling and/or matching. Some of the devices and methods are particularly useful for anatomical labeling of human airway trees. Some of the devices and methods are particularly useful for matching branch-points of human airway trees from represented in two or more graphs.

Abstract: In one embodiment, an apparatus comprises a first compression engine to receive a first compressed data block from a second compression engine that is to generate the first compressed data block by compressing a first plurality of repeated instances of data that each have a length greater than or equal to a first length. The first compression engine is further to compress a second plurality of repeated instances of data of the first compressed data block that each have a length greater than or equal to a second length, the second length being shorter than the first length, wherein each compressed repeated instance of the first and second pluralities of repeated instances comprises a location and length of a data instance that is repeated. The apparatus further comprises a memory buffer to store the compressed first and second plurality of repeated instances of data.

Abstract: A mechanism is provided for high-throughput compression of data. Responsive to receiving an indication of a match of a current 4-byte sequence from an incoming data stream to stored hash values in a set of hash tables, numerous variables are set to initial values. Responsive to receiving a subsequent 4-byte sequence from the incoming data stream and determining that an active match variable is set to one, the subsequent 4-byte sequence is compared to data in a copy of the incoming data stream in memory at an active position with a predefined length offset. A constraint variable is set to a number of bytes for which the match is to be extended. Responsive to the constraint variable being below a predetermined number, a length, distance pair is output indicating a match to a previous pattern in the incoming data stream.

Abstract: The present disclosure is directed to systems and methods for providing fast and efficient data compression using a combination of content dependent, content estimation, and content independent data compression. In one aspect of the disclosure a method for compressing data comprises the steps of: analyzing a data block of an input data stream to identify a data type of the data block, the input data stream comprising a plurality of disparate data types; performing content dependent data compression on the data block, if the data type of the data block is identified; performing content estimation data compression if the content is estimable; and performing content independent data compression on the data block, if the data type of the data block is not identified or estimable. In another aspect of the present invention LZDR compression is applied to simultaneously perform one method of compression while computing statistics useful in estimating the optimal form of compression to be applied.

Abstract: Data storage is improved by combining content indexing and data reduction in text-containing files by using common word elimination. Raw data is processed by finding words in selected files, creating an index of found words, and replacing the words in the raw data with pointers to the corresponding words in the index. Each word appears only once in the index. Consequently, the index is relatively small and the procedure is completely reversible. In particular, the index is small relative to other methods because the data is transformed in place, and the transformed data and index are used together to capture the total information about the data.

Abstract: In various embodiments, disclosed are a system and method for authenticating activity associated with a child account as controlled or managed by a parent account. A child-account user can enter a username, or other form of access information, in a child-account device. The username can contain a predetermined identifier in response to which, upon detecting the presence of the predetermined identifier, a third-party website can carry out authentication functions including sending a message to an authentication platform that carries out additional authentication functions, provided that a parent-account device authorizes doing so.