To Or From Bit Count Codes Patents (Class 341/63)
  • Patent number: 10282889
    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.
    Type: Grant
    Filed: February 14, 2017
    Date of Patent: May 7, 2019
    Assignee: Samsung Electronics Co., Ltd.
    Inventors: David C. Tannenbaum, Manshila Adlakha, Vikash Kumar, Abhinav Golas
  • Patent number: 10264263
    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.
    Type: Grant
    Filed: July 6, 2016
    Date of Patent: April 16, 2019
    Assignee: MORPHO DETECTION, LLC
    Inventor: Samit Kumar Basu
  • Patent number: 10223114
    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.
    Type: Grant
    Filed: September 29, 2017
    Date of Patent: March 5, 2019
    Assignee: Intel Corporation
    Inventors: Venkateswara Madduri, Elmoustapha Ould-Ahmed-Vall, Robert Valentine, Jesus Corbal, Mark Charney
  • Patent number: 10224954
    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.
    Type: Grant
    Filed: September 29, 2017
    Date of Patent: March 5, 2019
    Assignee: Intel Corporation
    Inventors: Venkateswara Madduri, Elmoustapha Ould-Ahmed-Vall, Robert Valentine, Jesus Corbal, Mark Charney
  • Patent number: 10200699
    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.
    Type: Grant
    Filed: November 1, 2016
    Date of Patent: February 5, 2019
    Assignee: FUJITSU LIMITED
    Inventor: Akihiro Yamori
  • Patent number: 10157649
    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.
    Type: Grant
    Filed: February 17, 2016
    Date of Patent: December 18, 2018
    Assignee: Marvell Israel (M.I.S.L) Ltd.
    Inventor: Ohad Zalcman
  • Patent number: 10156992
    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.
    Type: Grant
    Filed: January 15, 2016
    Date of Patent: December 18, 2018
    Assignee: ROBERT BOSCH GMBH
    Inventors: Dominik Geisler, Thomas Block
  • Patent number: 10146436
    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.
    Type: Grant
    Filed: June 29, 2016
    Date of Patent: December 4, 2018
    Assignee: EMC IP HOLDING COMPANY LLC
    Inventors: Assaf Natanzon, Arieh Don, Gabi Benhanokh
  • Patent number: 10110899
    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.
    Type: Grant
    Filed: January 23, 2018
    Date of Patent: October 23, 2018
    Assignee: Canon Kabushiki Kaisha
    Inventor: Masaaki Kobayashi
  • Patent number: 9933971
    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.
    Type: Grant
    Filed: December 30, 2015
    Date of Patent: April 3, 2018
    Assignee: Nutanix, Inc.
    Inventors: Baban K. Kenkre, Kannan Muthukkaruppan
  • Patent number: 9934035
    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.
    Type: Grant
    Filed: March 21, 2013
    Date of Patent: April 3, 2018
    Assignee: NXP USA, Inc.
    Inventors: Uri Dayan, Erez Arbel-Meirovich, Liron Artsi, Doron Schupper
  • Patent number: 9830101
    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.
    Type: Grant
    Filed: August 7, 2014
    Date of Patent: November 28, 2017
    Assignee: International Business Machines Corporation
    Inventors: Achim Christ, Nils Haustein, Dominic Mueller-Wicke, Daniel J. Winarski
  • Patent number: 9798734
    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.
    Type: Grant
    Filed: March 1, 2013
    Date of Patent: October 24, 2017
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Rahul M. Fiske, Carl E. Jones, Subhojit Roy
  • Patent number: 9779103
    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.
    Type: Grant
    Filed: April 23, 2012
    Date of Patent: October 3, 2017
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Rahul M. Fiske, Carl Evan Jones, Subhojit Roy
  • Patent number: 9753832
    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.
    Type: Grant
    Filed: June 28, 2013
    Date of Patent: September 5, 2017
    Assignee: Intel Corporation
    Inventors: Ilya Wagner, Matthew C. Merten, Frank Binns, Christine E. Wang, Mayank Bomb, Tong Li, Thilo Schmitt, M D A. Rahman
  • Patent number: 9712828
    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.
    Type: Grant
    Filed: July 23, 2015
    Date of Patent: July 18, 2017
    Assignee: INDIAN STATISTICAL INSTITUTE
    Inventors: Bhaskar Dey, Malay Kumar Kundu
  • Patent number: 9697226
    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.
    Type: Grant
    Filed: August 14, 2013
    Date of Patent: July 4, 2017
    Assignee: Sanmina Corporation
    Inventor: Chris Youngworth
  • Patent number: 9684668
    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.
    Type: Grant
    Filed: September 15, 2011
    Date of Patent: June 20, 2017
    Assignee: Veritas Technologies
    Inventor: Fanglu Guo
  • Patent number: 9671974
    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.
    Type: Grant
    Filed: September 10, 2012
    Date of Patent: June 6, 2017
    Assignee: NEC CORPORATION
    Inventors: Michal Kaczmarczyk, Marcin Barczynski, Wojciech Kilian, Cezary Dubnicki
  • Patent number: 9665304
    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.
    Type: Grant
    Filed: September 3, 2012
    Date of Patent: May 30, 2017
    Assignee: NEC CORPORATION
    Inventors: Konrad Iwanicki, Kamil Nowosad
  • Patent number: 9614546
    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.
    Type: Grant
    Filed: August 24, 2015
    Date of Patent: April 4, 2017
    Assignee: ARMOYA YUKSEK TEKNOLOJI ARASTIRMALARI ELEKTRONIK SANAYI VE TICARET ANONIM SIRKETI
    Inventor: Tuncay Uludag
  • Patent number: 9615108
    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.
    Type: Grant
    Filed: June 29, 2010
    Date of Patent: April 4, 2017
    Assignee: THOMSON LICENSING
    Inventors: Joel Sole, Liwei Guo, Peng Yin, Yunfei Zheng, Xiaoan Lu, Qian Xu
  • Patent number: 9600398
    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.
    Type: Grant
    Filed: October 29, 2014
    Date of Patent: March 21, 2017
    Assignee: Synopsys, Inc.
    Inventors: Bindesh Patel, I-Liang Lin, Ming-Hui Hsieh, Jien-Shen Tsai
  • Patent number: 9577666
    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.
    Type: Grant
    Filed: June 13, 2016
    Date of Patent: February 21, 2017
    Assignee: FUJITSU LIMITED
    Inventors: Masahiro Kataoka, Ryo Matsumura, Takafumi Ohta
  • Patent number: 9575757
    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.
    Type: Grant
    Filed: December 30, 2011
    Date of Patent: February 21, 2017
    Assignee: Intel Corporation
    Inventors: Elmoustapha Ould-Ahmed-Vall, Suleyman Sair, Kshitij A. Doshi, Charles R. Yount, Bret L. Toll
  • Patent number: 9542413
    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.
    Type: Grant
    Filed: October 6, 2011
    Date of Patent: January 10, 2017
    Assignee: Hitachi, Ltd.
    Inventors: Susumu Serita, Yasuhiro Fujii
  • Patent number: 9467060
    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.
    Type: Grant
    Filed: April 3, 2013
    Date of Patent: October 11, 2016
    Assignee: NXP B.V.
    Inventor: Hendrik Boezen
  • Patent number: 9438538
    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.
    Type: Grant
    Filed: September 18, 2015
    Date of Patent: September 6, 2016
    Assignee: Silver Peak Systems, Inc.
    Inventors: David Anthony Hughes, John Burns, Zhigang Yin
  • Patent number: 9438270
    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.
    Type: Grant
    Filed: November 2, 2015
    Date of Patent: September 6, 2016
    Assignee: Cortica, Ltd.
    Inventors: Igal Raichelgauz, Karina Odinaev, Yehoshua Y. Zeevi
  • Patent number: 9384206
    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.
    Type: Grant
    Filed: December 26, 2013
    Date of Patent: July 5, 2016
    Assignee: EMC Corporation
    Inventors: Jean-Pierre Bono, Dennis T. Duprey, Xiangping Chen, Philippe Armangau, Monica Chaudhary, Mark K. Ku
  • Patent number: 9378743
    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).
    Type: Grant
    Filed: April 5, 2012
    Date of Patent: June 28, 2016
    Assignees: Dolby Laboratories Licensing Corp., Dolby International AB
    Inventors: Jeffrey C. Riedmiller, Farhad Farahani, Michael Schug, Regunathan Radhakrishnan, Mark S. Vinton
  • Patent number: 9372854
    Abstract: Systems and methods of load balancing backup jobs in a virtualized storage system having a plurality of physical nodes are disclosed. An example of a method includes receiving a backup job from a client for data on a plurality of virtualized storage nodes presented to the client as a single object. The method also includes identifying at least one property of the backup job. The method also includes directing incoming data for the backup job to a particular one of the plurality of virtualized storage nodes, selection of the particular one of the plurality of virtualized storage nodes based on the at least one property of the backup job.
    Type: Grant
    Filed: November 8, 2010
    Date of Patent: June 21, 2016
    Assignee: Hewlett Packard Enterprise Development LP
    Inventors: Stephen Gold, Jeffrey DiCorpo
  • Patent number: 9372809
    Abstract: A system and method for efficiently storing data both on-site and off-site in a cloud storage system. Data read and write requests are received by a cloud data storage system. The cloud storage system has at least three data storage layers. A first high-speed layer, a second efficient storage layer, and a third off-site storage layer. The first high-speed layer stores data in raw data blocks. The second efficient storage layer divides data blocks from the first layer into data slices and eliminates duplicate data slices. The third layer stores data slices at an off-site location.
    Type: Grant
    Filed: January 6, 2011
    Date of Patent: June 21, 2016
    Assignee: STORSIMPLE, INC.
    Inventors: Richard Testardi, Maurilio Cometto, Kuriakose George Kulangare
  • Patent number: 9349381
    Abstract: The present invention discloses a method and a device for pulse encoding, and a method and a device for pulse decoding. The method for pulse encoding includes: calculating an index value of an input pulse; selecting an adjustment threshold value according to the number of pulses, and comparing the index value of the pulse with the adjustment threshold value; if the index value is smaller than the adjustment threshold value, adopting the first number of encoding bits to encode the index value, if the index value is not smaller than the adjustment threshold value, adopting the second number of encoding bits to encode the index value plus an offset value, where the first number is smaller than the second number, the first number and the second number are both positive integers, and the offset value is greater than or equal to the adjustment threshold value.
    Type: Grant
    Filed: April 14, 2014
    Date of Patent: May 24, 2016
    Assignee: HUAWEI TECHNOLOGIES CO., LTD
    Inventors: Fuwei Ma, Dejun Zhang, Minjie Xie, Qing Zhang
  • Patent number: 9298385
    Abstract: A method for ensuring compliance of service levels corresponding to file-system operations in a deduplicated, tiered storage system comprising storage devices of varying performance levels, each of the performance levels being associated with at least one service level, includes performing a deduplication remapping operation so that a data item corresponding to a higher service level, is stored as an original on a higher performance storage tier while duplicates of the data item corresponding to a lower service level exist in lower performance storage tier at least in part as pointers to the data item on the higher performance storage tier.
    Type: Grant
    Filed: April 12, 2013
    Date of Patent: March 29, 2016
    Assignee: International Business Machines Corporation
    Inventors: Duane M. Baldwin, Sasikanth Eda, Deepak R. Ghuge, John T. Olson, Sandeep R. Patil
  • Patent number: 9268785
    Abstract: Various embodiments for preserving data redundancy of identical data in a data deduplication system in a computing environment are provided. In one embodiment, a method for such preservation is disclosed. A selected range of virtual addresses of a virtual storage device in the computing environment is designated as not subject to a deduplication operation. Other system and computer program product embodiments are disclosed and provide related advantages.
    Type: Grant
    Filed: March 13, 2013
    Date of Patent: February 23, 2016
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Rahul M. Fiske, Carl E. Jones, Subhojit Roy
  • Patent number: 9262428
    Abstract: Various embodiments for preserving data redundancy of identical data in a data deduplication system in a computing environment are provided. A selected range of virtual addresses of a virtual storage device in the computing environment is designated as not subject to a deduplication operation. Other system and computer program product embodiments are disclosed and provide related advantages.
    Type: Grant
    Filed: April 23, 2012
    Date of Patent: February 16, 2016
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Rahul M. Fiske, Carl Evan Jones, Subhojit Roy
  • Patent number: 9256612
    Abstract: A computer-implemented method for managing references in deduplicating data systems may include (1) identifying a first instance of a data segment stored within a deduplicating data system that reduces redundant data storage by storing at least two data objects such that each of the two data objects references the first instance of the data segment, (2) identifying an additional data object to be stored by the deduplicating data system that includes the data segment, (3) determining whether a reference limit associated with the first instance of the data segment has been reached, and (4) storing, based at least in part on determining that the reference limit associated with the first instance of the data segment has been reached, a second instance of the data segment within the deduplicating data system. Various other methods, systems, and computer-readable media are also disclosed.
    Type: Grant
    Filed: June 11, 2013
    Date of Patent: February 9, 2016
    Assignee: Symantec Corporation
    Inventors: Neel Bhatt, Stephan Gipp
  • Patent number: 9170757
    Abstract: A method of operating a memory system to compress data efficiently is described. The user data and the associated metadata are separated so that user data having repeating data patterns of greater length than a single user data structure may be assembled for storage. The user metadata and the repeating pattern metadata are stored in non-volatile memory such that the repeating pattern metadata can be used to reconstruct the repeating pattern of individual user data blocks. The reconstructed user data blocks are combined with user metadata, if any, and returned to the user in response to a read request.
    Type: Grant
    Filed: June 6, 2013
    Date of Patent: October 27, 2015
    Assignee: VIOLON MEMORY INC.
    Inventors: Elias Shihadeh, Anil Mandapuram
  • Patent number: 9160364
    Abstract: Systems, methods, and other embodiments associated with an iterative decoder logic. In one embodiment, the iterative decoder logic is configured to decode data. The iterative decoder logic includes a detector configured to generate code words from the data and identify short code words. A short code word has a length less than a length of a full code word. The iterative decoder logic also includes a decoder having a shortening support module and a decoder core. The shortening support module appends at least one dummy value to at least one short code word to convert the at least one short code word to a full code word. The decoder core decodes the converted full code word to generate a decoded converted full code word. The decoder transmits the decoded converted full code word without the at least one dummy variable.
    Type: Grant
    Filed: August 8, 2013
    Date of Patent: October 13, 2015
    Assignee: MARVELL INTERNATIONAL LTD.
    Inventors: Shu Li, Panu Chaichanavong, Jun Gao
  • Patent number: 9098887
    Abstract: An image compression method includes at least the following steps: receiving a plurality of pixels of a frame, wherein pixel data of each pixel has a plurality of color channel data corresponding to a plurality of different color channels, respectively; encoding the pixel data of each pixel and generating bit-streams corresponding to the plurality of color channel data of the pixel, wherein the bit-streams corresponding to the plurality of color channel data of the pixel are separated; packing bit-streams of a same color channel data of different pixels into color channel bit-stream segments, wherein each of the bit-stream segments has a same predetermined size; and concatenating color channel bit-stream segments of the different color channels into a final bit-stream. Alternatively, color channel bit-stream segments of the same pixel are concatenated into a concatenated bit-stream portion, and concatenated bit-stream portions of different pixels are concatenated into a final bit-stream.
    Type: Grant
    Filed: October 8, 2013
    Date of Patent: August 4, 2015
    Assignee: MEDIATEK INC.
    Inventors: Tung-Hsing Wu, Kun-Bin Lee, Han-Liang Chou, Ting-An Lin, Chi-Cheng Ju
  • Patent number: 9098863
    Abstract: Analytics data for a network-based site may be compressed according to recurring time periods. An analytics service may obtain analytics data for network-based sites to compress into a compressed analytics data stream. To compress the analytics data, the analytic service may identify a particular time period corresponding to each analytic data value and may add the analytic data value to the compressed analytics data stream as either a baseline object for the particular time period or a difference object relative to an existing baseline object for the particular time period. These objects may be interleaved according to a time-based ordering of multiple different recurring time periods. An analytic service may send the compressed analytics data stream to an analytics client. The analytics client may decompress a portion of the compressed analytics trend without decompressing the remaining portions of the compressed analytics data stream.
    Type: Grant
    Filed: September 27, 2012
    Date of Patent: August 4, 2015
    Assignee: Adobe Systems Incorporated
    Inventor: David L. Cardon
  • Patent number: 9094041
    Abstract: A first encoding unit encodes, within the compression target data, each part with a sequence of the same value into the number of consecutive runs of the value. A decomposing unit decomposes the number of consecutive runs of the same value into an addition of integers belonging to a predetermined integer group. A calculating unit calculates the probability of occurrence of each integer obtained by the decomposition. A second encoding unit encodes each integer by assigning shorter codes to integers with higher probabilities of occurrence.
    Type: Grant
    Filed: September 19, 2014
    Date of Patent: July 28, 2015
    Assignee: FUJITSU LIMITED
    Inventors: Masahiro Kataoka, Takahiro Murata, Takafumi Ohta
  • Patent number: 9069707
    Abstract: In general, in one aspect, a method for managing data in a data storage system includes receiving identifiers corresponding to different respective entries of a map stored in the data storage system, with a particular identifier corresponding to a particular entry of the map, the particular entry including a computed value corresponding to a particular portion of data stored in the data storage system and metadata indicating a location where the particular portion of data is stored in the data storage system, selecting, according to a first selection criterion, at least some of the identifiers for storage in a first portion of an index, and selecting, according to a second selection criterion, at least some of the identifiers for storage in a second portion of the index.
    Type: Grant
    Filed: November 3, 2011
    Date of Patent: June 30, 2015
    Assignee: Permabit Technology Corp.
    Inventors: Michael Fortson, Jonathan Coburn, Michael Sclafani, Thomas Jaskiewicz, Assar Westerlund, Hooman Vassef
  • Patent number: 9063868
    Abstract: A virtual computer system having a plurality of virtual computers includes an area assignment unit operable to, when a virtual computer attempts to perform writing to a basic area which is assigned to and shared by the plurality of virtual computers, change an assignment to the virtual computer from the basic area to a copy area to which the basic area is copied and the writing is performed. Additionally an area freeing unit is operable to, when a content of the basic area matches a content of at least one copy area, change area assignment to one or more virtual computers, to which have been assigned one or more other areas than one area among the areas whose contents match each other, to the one area, and free the one or more other areas.
    Type: Grant
    Filed: December 13, 2010
    Date of Patent: June 23, 2015
    Assignee: PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA
    Inventor: Masahiko Saito
  • Patent number: 8982162
    Abstract: A display device displays a gray scale by applying a voltage to a display element for each of a plurality of subfields. The display device includes a predetermined code storage unit that stores a predetermined code, in which indication values designating the voltage are arranged, a compression code storage unit that stores a compression code, which includes a first portion designating a number of the indication values and a second portion designating an identifier of the predetermined code, and a developing unit that generates a driving code according to a continuous code, in which indication values designating a first voltage are arranged by the number of the indication values designated by the first portion of the compression code, and a predetermined code corresponding to the identifier designated by the second portion of the compression code.
    Type: Grant
    Filed: February 17, 2010
    Date of Patent: March 17, 2015
    Assignee: Seiko Epson Corporation
    Inventor: Nariya Takahashi
  • Patent number: 8914705
    Abstract: A plurality of random bit sequences is generated. Each of the random bit sequences is different and is based at least in part on an input bit sequence. A plurality of metrics corresponding to the plurality of random bit sequences is generated. The plurality of metrics is associated with one or more transition run lengths. One of the random bit sequences is selected based at least in part on the metrics. An output bit sequence is generated that includes the selected random bit sequence and an index associated with demodulating the selected random bit sequence.
    Type: Grant
    Filed: October 31, 2012
    Date of Patent: December 16, 2014
    Assignee: SK hynix memory solutions inc.
    Inventors: Lingqi Zeng, Yu Kou
  • Patent number: 8823560
    Abstract: An encoder is provided for encoding input data (D1) to generate corresponding encoded output data (D2). The encoder includes a data processing arrangement for generating a run-length encoded (RLE) representation of the input data (D1). Moreover, the encoder is operable to split the run-length encoded (RLE) representation into a plurality of parts (A, B), wherein at least one part is associated with original symbols and at least another part is associated with counters representative of occurrence of the original symbols. Furthermore, the encoder is operable to encode the plurality of parts (A, B) separately to generate the encoded output data (D2). There is also provided a corresponding decoder for decoding the encoded data (D2) to generate corresponding decoded output data (D3). Additionally, there is provided a coder including the aforesaid encoder and decoder.
    Type: Grant
    Filed: March 1, 2013
    Date of Patent: September 2, 2014
    Assignee: Gurulogic Microsystems Oy
    Inventors: Tuomas Karkkainen, Ossi Mikael Kalevo
  • Patent number: 8614841
    Abstract: In an image-reader, the first counter is configured to count a first count value based on a first clock. The second counter is configured to count a second count value based on a second clock. The first reading unit is configured to read a first surface of a document sheet based on the first count value. The second reading unit is configured to read a second surface of the document sheet based on the second count value. The second surface is opposite surface of the first surface. When the first count value reaches a prescribed first value, both the first counter value and the second count value are reset.
    Type: Grant
    Filed: March 29, 2011
    Date of Patent: December 24, 2013
    Assignee: Brother Kogyo Kabushiki Kaisha
    Inventor: Hideyuki Kusunoki
  • Patent number: 8615617
    Abstract: A data compression architecture comprises a shift register structure comprising first and second parallel paths, each comprising several shift register elements for storing previously received data characters. Each shift register element in the first path is paired with a respective shift register element in the second path. An input shift register stores input data characters in pairs during successive clock cycles. Logic circuitry compares the input data characters with each of the previously received data characters stored in the pairs of shift register elements to detect a match during one or more clock cycles. The logic circuitry determines a length of a sequence of received input data characters by determining a number of clock cycles during which a match is detected in a particular pair of shift register elements, and applies a correction factor based on a type of match detected at a beginning and end of the sequence.
    Type: Grant
    Filed: May 2, 2011
    Date of Patent: December 24, 2013
    Assignee: Altera Corporation
    Inventor: Martin Langhammer