Abstract: A framework and the associated method, schema and design for processing digital data, whether random or not, through encoding and decoding losslessly and correctly for purposes including the purposes of encryption/decryption or compression/decompression or both. There is no assumption of the digital information to be processed before processing. An universal coder is invented and now pigeonhole meets blackhole.

Abstract: A mechanism is provided for dispersed location-based data storage. A request is received to write a data file to a referrer memory region in a set of memory regions. For each data chunk of the data file, responsive to a comparison of a hash value for the data chunk to other hash values for other stored data chunks referenced in the referrer memory region indicating that the data chunk fails to exist in the referrer memory region, responsive to the data chunk existing in another memory region in the set of memory regions, responsive to the memory region failing to be one of the predetermined number N of owner memory regions associated with the referrer memory region, and responsive to the predetermined number N of owner memory regions failing to have been met, a reference to the data chunk is stored in the referrer memory region.

Abstract: Methods and systems are provided for decoding variable-length codes in a parallel process. A stream of variable-length code words is divided into fixed length words. A plurality of parallel sets of decoder circuits each receive, in parallel, a current fixed length word and a prior fixed length word. Each decoder circuit has a respective fixed leftover bit-count. Each decoder circuit generates a respective output that may include a decoded symbol and a new leftover bit-count. Each respective output is determined based on the respective current fixed length word, the respective prior fixed length word, and the respective fixed leftover bit-count. A set of selected decoder circuit outputs is generated for each set of the parallel sets of decoder circuits based on a set of first leftover bit-counts. One output from each set of selected decoder circuit outputs is selected as a final output based on a second prior leftover bit-count.

Abstract: A method for reducing a size of data required for recording a physical characteristic of an optical device is proposed. By performing variable-length coding on sub-pixel data pieces that respectively represent physical characteristics of multiple sub-pixels of the optical device based on a similarity in spatial trend of the physical characteristics of the sub-pixels, a plurality of pixel-index data pieces are generated, and a part of the sub-pixel data pieces can thus be removed to obtain reduced sub-pixel data pieces. The pixel-index data pieces and the reduced sub-pixel data pieces cooperatively replace the sub-pixel data pieces to serve as an index for finding the physical characteristics of the sub-pixels.

Abstract: [Problem] Encoding and decoding techniques capable of speeding up an error-correction decoding process utilizing channel polarization are provided. [Solution] In an encoding device, the information bit sequence is input on division for each designated bit length; error-correction encoding is performed on an information block of the designated bit length to generate L M-bit codes, each M-bit code having a predetermined bit length M; the L M-bit codes are converted into M L-bit blocks each having a predetermined bit length of L; the M L-bit blocks are Polar-converted to M L-bit codes, each L-bit code having a bit length of L, through channel polarization processing; and division of the information bit sequence is determined based on channel polarization information.

Abstract: A method is disclosed for storing data in a storage system, comprising: receiving a write request at the storage system; detecting whether the write request is associated with one of a deduplication tier or a non-deduplication tier of the storage system; when the write request is associated with the deduplication tier of the storage system, storing data associated with the write request in the first portion of the volume and updating a first mapping structure to map the first LBA to at least one first hash digest that is generated based on the data; and when the write request is associated with the non-deduplication tier of the storage system, storing data associated with the write request in the second portion of the volume and updating the first mapping structure to map the first LBA to a second hash digest that is generated based on a second LBA.

Abstract: An encoding apparatus includes an encoding unit that encodes voxel data representing a solid to be modeled, and among a plurality of prediction sections which predict a value of a voxel of interest based on values of one or more reference voxels around the voxel of interest, determines codes, based on a prediction section which makes a correct prediction about the value of the voxel of interest; a unit that acquires a modeling direction; and a control section that controls the encoding unit based on the modeling direction.

Abstract: An encoding system for encoding an event time series, the system including an inter-arrival time computing device configured to transform inter-arrival times between a plurality of input events into discrete time symbols and map the input events and the discrete time symbols using a dictionary to output a time gram representing a temporal dimension between a sequences of events.

Abstract: An approach is provided for managing data duplication in cloud computing. A method comprising, sending from a first device to a data center, data encrypted with a data encryption key for storing the encrypted data at the data center; encrypting the data encryption key according to an attribute-based encryption (ABE) scheme by using identity as an attribute in a deduplication policy for the data; issuing to a second device, a personalized secret attribute key which is derived from a public key of the second device according to the attribute-based encryption (ABE) scheme, wherein the personalized secret attribute key is to be used for decrypting the encrypted data encryption key at the second device, in combination with the policy.

Abstract: An image coding method for an image coding apparatus configured to divide an image into divisional blocks of a plurality of sizes and to perform coding on the image while controlling image quality according to a parameter value in units of divisional blocks includes acquiring a block size of a target block to be coded, acquiring a minimum block size used to control the parameter value, acquiring a state of division of the target block, acquiring the parameter value, determining whether the target block is divided according to the state of division of the target block, determining whether the block size of the target block is greater than or equal to the minimum block size, determining whether the block size of the target block is equal to the minimum block size, and coding the acquired parameter value.

Abstract: Various embodiments for preserving data redundancy in a data deduplication system in a computing environment are provided. A write command is received for writing a selected data segment to a physical storage location. A determination is made as to whether the write command includes an indicator including at least one of a bit and a flag, the indicator designating that the selected data segment must not be subject to a deduplication operation. An indicator is configured by providing a system call with an extended attribute indicating that the selected data segment must be written to physical memory notwithstanding the selected data segment matching data written to the physical memory earlier in time.

Abstract: A method for synchronizing records stored at a first data storage location with records stored at a second, remote data storage location utilizes bitwise fingerprints and bitwise operations to determine records that exist in a first data set but not a second data set. A method for synchronizing records stored at a first data storage location with records stored at a second, remote data storage location utilizes bitwise fingerprints, and bitwise operations, and dynamic temporal segmentation to compare the timeliness of records in the first and second data sets.

Abstract: Method and apparatus are disclosed for heterogeneous data storage management in cloud computing.

Abstract: A processor core including a hardware decode unit to decode vector instructions for decompressing a run length encoded (RLE) set of source data elements and an execution unit to execute the decoded instructions. The execution unit generates a first mask by comparing set of source data elements with a set of zeros and then counts the trailing zeros in the mask. A second mask is made based on the count of trailing zeros. The execution unit then copies the set of source data elements to a buffer using the second mask and then reads the number of RLE zeros from the set of source data elements. The buffer is shifted and copied to a result and the set of source data elements is shifted to the right. If more valid data elements are in the set of source data elements this is repeated until all valid data is processed.

Abstract: A method of smart coding mode switching includes receiving a first data including a primary copy and a partial copy. The method includes determining if switching a coding mode from channel aware mode to non-channel aware mode may be advantageous. The method further includes transmitting a request to another device for coding mode switch in response to determination result. The method includes receiving and decoding of a second data that includes a primary copy.

Abstract: In a pulse encoding and decoding method and a pulse codec, more than two tracks are jointly encoded, so that free codebook space in the situation of single track encoding can be combined during joint encoding to become code bits that may be saved. Furthermore, a pulse that is on each track and required to be encoded is combined according to positions, and the number of positions having pulses, distribution of the positions that have pulses on the track, and the number of pulses on each position that has a pulse are encoded separately, so as to avoid separate encoding performed on multiple pulses of a same position, thereby further saving code bits.

Abstract: An image coding method for an image coding apparatus configured to divide an image into divisional blocks of a plurality of sizes and to perform coding on the image while controlling image quality according to a parameter value in units of divisional blocks includes acquiring a block size of a target block to be coded, acquiring a minimum block size used to control the parameter value, acquiring a state of division of the target block, acquiring the parameter value, determining whether the target block is divided according to the state of division of the target block, determining whether the block size of the target block is greater than or equal to the minimum block size, determining whether the block size of the target block is equal to the minimum block size, and coding the acquired parameter value.

Abstract: An image coding method for an image coding apparatus configured to divide an image into divisional blocks of a plurality of sizes and to perform coding on the image while controlling image quality according to a parameter value in units of divisional blocks includes acquiring a block size of a target block to be coded, acquiring a minimum block size used to control the parameter value, acquiring a state of division of the target block, acquiring the parameter value, determining whether the target block is divided according to the state of division of the target block, determining whether the block size of the target block is greater than or equal to the minimum block size, determining whether the block size of the target block is equal to the minimum block size, and coding the acquired parameter value.

Abstract: Methods and system are disclosed that compress a dataset and optimize the dataset for searching data. In one aspect, based on attributes associated with a unified dataset, the dataset including sensor node identifier data, sensor node timestamp data and sensor measurement data are determined. A suffix tree algorithm may be executed to determine data compression logic to compress the dataset including the sensor node identifier data and sensor node measurement data. A sensor node timestamp data compression model may be executed to compress the dataset associated with the sensor timestamp data. The compressed datasets including the sensor node identifier data, the sensor node timestamp data and the sensor measurement data may be stored in an in-memory data store.

Abstract: One or more embodiments of the present disclosure provide an apparatus used in source data compression, comprising a memory and a at least one processor. The memory is configured to store vertex attribute data and a set of instructions. The processor is coupled to the memory. The processor is configured to receive a source data stream that includes one or more values corresponding to the vertex attribute data. The processor is also configured to provide a dictionary for the one or more values in the source data stream, wherein the dictionary includes a plurality of index values corresponding to the one or more values in the source data stream. The processor is also configured to lace at least some of the one or more values in the source data stream with corresponding index values of the plurality of index values.

Abstract: A compression device for compressing image data generated by a computed tomography (CT) imaging system is described herein. The compression device is configured to compress the image data by implementing a method including receiving image data from the CT imaging system and requantizing the image data in a square root domain. The method further includes identifying a group of projections (GOP) in the image data, including a first projection and a plurality of subsequent projections, and performing spatial-delta encoding on the first projection and temporal-delta encoding on each of the plurality of subsequent projections. The method also includes identifying a signed value in the GOP, and converting the signed value to an unsigned value. The method further includes entropy coding the image data in the GOP, and packetizing the GOP for transmission or storage.

Abstract: Embodiments of an instruction, its operation, and executional support for the instruction are described. In some embodiments, a processor comprises decode circuitry to decode an instruction having fields for an opcode, a packed data source operand identifier, and a packed data destination operand identifier; and execution circuitry to execute the decoded instruction to convert a single precision floating point data element of a least significant packed data element position of the identified packed data source operand to a fixed-point representation, store the fixed-point representation as 32-bit integer and a 32-bit integer exponent in the two least significant packed data element positions of the identified packed data destination operand, and zero of all remaining packed data elements of the identified packed data destination operand.

Abstract: Embodiments of instructions and methods of execution of said instructions and resources to execute said instructions are detailed. For example, in an embodiment, a processor comprising: decode circuitry to decode an instruction having fields for an opcode, a packed data source operand identifier, and a packed data destination operand identifier; and execution circuitry to execute the decoded instruction to convert a data element from a least significant packed data element position of the identified packed data source operand from a fixed-point representation to a floating point representation, store the floating point representation into a 32-bit least significant packed data element position of the identified packed data destination operand, and zero all remaining packed data elements of the identified packed data destination operand is described.

Abstract: An apparatus for encoding a moving picture determines either an RGB format or a YUV format, in which intra prediction and inter prediction are executed based on a degree of deviation of information regarding each of R, G, and B components in moving picture data with the RGB format when a prediction selecting one component among three components in a color space format is designated in the input moving picture data with the RGB format, selects either color space format between the RGB format and the YUV format based on a determination result of the determination process, and executes orthogonal transform and quantization on the prediction error signal in the selected color space format and generating an encoded bit stream using a value subjected to the orthogonal transform and the quantization.

Abstract: A method for data reduction of items of sensor data information, a plurality of data frames being stored in a buffer memory, a data frame including a sensor data representative and an item of discard information of a discard counter, a plurality of items of sensor data information being assigned to a data frame in a comparison operation.

Abstract: Aspects of the disclosure provide a first-in-first-out (FIFO) circuit having a memory block and a logic circuit. The memory block includes an array of memory cells configured to be able to store N data entries in a FIFO order (N is a positive integer). The logic circuit is configured to compare input data with previously input data to detect a number of consecutive identical entries of input data, and suppress an operation of selected memory cells when the number is larger than N.

Abstract: Efficiently storing low priority data in high priority storage devices is described. A system receives a request from an application to store a data chunk received from the application. The system determines a priority of the application. The system executes a write command to store the data chunk to a high priority storage device. If the application is low priority and the identifier of the received data chunk is a duplicate of any of the identifiers of the data chunks that were previously stored in the high priority storage device, the system stores, into the high priority storage device, the received data chunk as a low priority reference to a data chunk that was previously stored in the high priority storage device.

Abstract: An image coding method for an image coding apparatus configured to divide an image into divisional blocks of a plurality of sizes and to perform coding on the image while controlling image quality according to a parameter value in units of divisional blocks includes acquiring a block size of a target block to be coded, acquiring a minimum block size used to control the parameter value, acquiring a state of division of the target block, acquiring the parameter value, determining whether the target block is divided according to the state of division of the target block, determining whether the block size of the target block is greater than or equal to the minimum block size, determining whether the block size of the target block is equal to the minimum block size, and coding the acquired parameter value.

Abstract: Disclosed is an improved approach for implementing de-duplication, by selecting data such that the de-duplication efficacy of the storage will be increased without arbitrarily increasing metadata size.

Abstract: A data processing device for executing a program is described. The program comprises one or more instruction groups and one or more predicates, each instruction group comprising one or more instructions. The data processing device comprises a processing unit and a trace unit connected to or integrated in the processing unit. The trace unit generates a predicate trace for tracing the values of the one or more predicates. The processing unit executes, in each of a series of execution periods, one of the instruction groups and updated the values of none, one, or more of the predicates in dependence on the respective instruction group. The trace unit appends the updated values of the none, one, or more predicates to the predicate trace and does not append any non-updated values of the predicates. A method of reporting predicate values and a data carrier are also disclosed.

Abstract: The present invention relates to a method for data access in a storage infrastructure. The storage infrastructure comprises a host system connected to at least a first storage system and a second storage system. The first storage system receives, from the host system, a write request for storing a data chunk, the write request is indicative of a first identifier of the data chunk. The first storage system calculates a hash value of the received data chunk using a hash function. The first storage system determines a first storage location in the first storage system of the data chunk and sends a write message including the hash value, the first identifier and the first storage location to the de-duplication module. The de-duplication module determines whether the hash value exists in the data structure.

Abstract: Various embodiments for preserving data redundancy in a data deduplication system in a computing environment are provided. In one embodiment, a method for such preservation is disclosed. An indicator is configured. The indicator is provided with a selected data segment to be written through the data deduplication system to designate that the selected data segment must not be subject to a deduplication operation, such that repetitive data can be written and stored on physical locations despite being identical.

Abstract: Various embodiments for preserving data redundancy in a data deduplication system in a computing environment are provided. An indicator is configured. The indicator is provided with a selected data segment to be written through the data deduplication system to designate that the selected data segment must not be subject to a deduplication operation, such that repetitive data can be written and stored on physical locations despite being identical.

Abstract: In accordance with embodiments disclosed herein, there is provided systems and methods for minimizing bandwidth to compress an output stream of an instruction tracing system. For example, the method may include identifying a current instruction in a trace of the IT module as a conditional branch (CB) instruction. The method includes executing one of generating a CB packet including a byte pattern with an indication of outcome of the CB instruction, or adding an indication of the outcome of the CB instruction to the byte pattern of an existing CB packet. The method includes generating a packet when a subsequent instruction in the trace is not the CB instruction. The packet is different from the CB packet. The method also includes adding the packet into a deferred queue when the packet is deferrable. The method further includes outputting the CB packet followed by the deferred packet into a packet log.

Abstract: Technologies are generally described to identify foreground motion detection in compressed video data. In some examples, a foreground motion detection module may determine transform-coefficient-magnitude sums and motion-vector-magnitude sums associated with block coding units (BCUs) in compressed video data without decompressing the video data. The foreground motion detection module may also determine a background mean and a background co-variance associated with the compressed video data. To determine whether the BCU(s) contain foreground motion, the foreground motion detection module may determine a statistic based on the transform-coefficient-magnitude sums, the motion-vector magnitude sums, the background mean, and the background co-variance and compare the statistic to a threshold.

Abstract: A method of storing a file in a storage system that includes a plurality of memory-storage hosts includes: providing unique chunk identifiers for memory chunks included in the file; using a hash mapping to identify one or more storage locations for each chunk identifier, each storage location corresponding to a portion of a memory-storage host; and storing each memory chuck at the corresponding one or more storage locations identified by the hash mapping.

Abstract: A computer-implemented method for performing lookups on distributed deduplicated data systems may include (1) identifying a collection of deduplicated data stored within a plurality of nodes, (2) identifying a request to locate a deduplicated object of the collection within the plurality of nodes, (3) identifying a fingerprint of the deduplicated object, the fingerprint being generated using an algorithm that maps deduplicated objects onto a fingerprint space, (4) directing the request, based on a partitioning scheme that divides the fingerprint space among the plurality of nodes, to a first node within the plurality of nodes that is responsible for forwarding requests pertaining to a partition of the fingerprint space that includes the fingerprint, and (5) forwarding the request from the first node to a second node identified by the first node as corresponding to the fingerprint. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A storage system according to the present invention includes: a block detecting means for checking whether respective block data obtained by division are already stored in a storage device; and a data writing means for storing the respective block data obtained by division with duplicated storage eliminated into the storage device. The block detecting means detects a share rate representing a rate of a shared portion between a plurality of consecutive block data configuring a predetermined range in write target data among the block data obtained by division and a plurality of block data in a predetermined range already stored consecutively in the storage device. The data writing means, depending on the detected share rate, newly stores the block data obtained by division, into the storage device.

Abstract: A storage system of the present invention includes: a data writing means for storing actual data configuring storage data into a storage device and, for every update of the content of the storage data, newly storing; and a data specifying means for specifying the latest storage data among the same storage data stored in the storage device. The data writing means is configured to store actual data configuring storage data in association with update information whose value increases by 1 for every update. The data specifying means is configured to check whether update information whose value is 2i (i represents an integer of 0 or more) exists in the storage device in increasing order of the value of i, and specify the largest value of the existing update information among values between the largest value of 2i that corresponding update information exists and 2i+1.

Abstract: A data compression and decompression algorithm performing the function of data compression and decompression by using the steps of: dividing a main data stream into sub data streams, calculating frequency of occurrence of sub data streams in the main data stream, repeating the process of calculating frequency of occurrence by changing the number of digits in sub data stream and by changing the starting digit position in main data stream, assigning codes to sub data streams based on their frequency occurrence values, calculating group dimension index for each group, selecting the group with the lowest group dimension index and placing codes of the group with the lowest group dimension index in a multi dimensional space wherein vector placement is utilized to eliminate the need to use digits that are common to neighboring codes therefore providing an additional compression.

Abstract: There is provided an apparatus. The apparatus includes an encoder (100) for encoding picture data for at least a block. The encoder (100) applies a probability update process to at least one of a non-coded symbol and a non-coded syntax associated with the block.

Abstract: Disclosed is a method of debugging a simulation system including design code representing a design of an electronic circuit and test program code configured to exercise the design code. The method includes using an interactive debugging tool to execute an interactive simulation of the test program code and the design code, and, during the interactive simulation, displaying, using the interactive debugging tool, information of a simulation results file storing a plurality of signal values generated by executing the test program code and the design code during a previously executed simulation.

Abstract: A method includes: setting a first and a second storage regions; first creating a first compression code of a compression target data in a file using a identifier indicating the data in the first storage region when a predetermined first consistency between the compression target data and the data in the first storage region is detected; comparing the compression target data with data in the second storage region when the predetermined first consistency between the compression target data and the data in the first storage region is not detected, the compression target data being moved to the second storage region after the comparing; and storing the compression target data into the first storage region associated with a identifier indicating the data in the first storage region when a predetermined second consistency between the compression target data and the data in the second storage region is detected.

Abstract: A processor core including a hardware decode unit to decode vector instructions for decompressing a run length encoded (RLE) set of source data elements and an execution unit to execute the decoded instructions. The execution unit generates a first mask by comparing set of source data elements with a set of zeros and then counts the trailing zeros in the mask. A second mask is made based on the count of trailing zeros. The execution unit then copies the set of source data elements to a buffer using the second mask and then reads the number of RLE zeros from the set of source data elements. The buffer is shifted and copied to a result and the set of source data elements is shifted to the right. If more valid data elements are in the set of source data elements this is repeated until all valid data is processed.

Abstract: Method of dividing data to be stored in storage device into data fragments; recording the data by using configurations of divided data fragments; judging whether identical data fragments exist in data fragments; when it is judged that identical data fragments exist, storing one of the identical data fragments in storage area of the storage device, and generating and recording data-fragment attribute information indicating an attribute unique to the data fragment stored; upon receipt of request to read data stored in the storage area of the storage device, acquiring the configurations of the data fragments forming the read-target data, reading the corresponding data fragments from the storage area of the storage device, and restoring the data; acquiring and coupling the recorded data fragments to generate concatenation target data targeted for judgment on whether chunk concatenation is possible or not, and detecting whether the concatenation target data has a repeated data pattern.

Abstract: Systems and methods of use relate to a circuit that is designed to detect the state of two control signals, wherein one control signal indicates an ON state for the gate driver and the other control signal indicates an OFF state for the gate driver. The circuit responds to each of the control signals by controlling the gate driver so that it drives an output either high or low. The circuit can also be configured to control the gate driver so that it to drives the output (either high or low) when neither control signal is present.

Abstract: A method and system for symbol-space based pattern compression is provided. The method includes identifying a plurality of combinations of symbols in an input sequence, each identified combination of symbols appearing in the input sequence above a predefined threshold, the input sequence having a first length; generating an output sequence having a second length by replacing each identified combination of symbols with a unique symbol, wherein each unique symbol is not a previously used symbol, wherein the second length is shorter than the first length; and storing the output sequence as a data layer.

Abstract: A system for matching data using flow based packet data storage includes a communications interface and a processor. A communications interface receives a packet between a source and a destination. The processor identifies a flow between the source and the destination based on the packet. The processor determines whether some of packet data of the packet indicates a potential match to data in storage using hashes. The processor then stores the data from the most likely data match and second most likely data match without a packet header in a block of memory in the storage based on the flow.

Abstract: A method is used in managing data deduplication in storage systems. Characteristics of first and second data objects are evaluated based on a set of deduplication policies. The first and second data objects are selected for deduplication. Based on the evaluation, deduplication performed on the first and second data objects is affected.

Abstract: In a class of embodiments, an audio encoding system (typically, a perceptual encoding system that is configured to generate a single (“unified”) bitstream that is compatible with (i.e., decodable by) a first decoder configured to decode audio data encoded in accordance with a first encoding protocol (e.g., the multichannel Dolby Digital Plus, or DD+, protocol) and a second decoder configured to decode audio data encoded in accordance with a second encoding protocol (e.g., the stereo AAC, HE AAC v1, or HE AAC v2 protocol). The unified bitstream can include both encoded data (e.g., bursts of data) decodable by the first decoder (and ignored by the second decoder) and encoded data (e.g., other bursts of data) decodable by the second decoder (and ignored by the first decoder).