Adaptive Coding Patents (Class 341/51)
  • Patent number: 11113783
    Abstract: Examples described herein relate to a decompression engine that can request compressed data to be transferred over a memory bus. In some cases, the memory bus is a width that requires multiple data transfers to transfer the requested data. In a case that requested data is to be presented in-order to the decompression engine, a re-order buffer can be used to store entries of data. When a head-of-line entry is received, the entry can be provided to the decompression engine. When a last entry in a group of one or more entries is received, all entries in the group are presented in-order to the decompression engine. In some examples, a decompression engine can borrow memory resources allocated for use by another memory client to expand a size of re-order buffer available for use. For example, a memory client with excess capacity and a slowest growth rate can be chosen to borrow memory resources from.
    Type: Grant
    Filed: November 13, 2019
    Date of Patent: September 7, 2021
    Assignee: Intel Corporation
    Inventors: Abhishek R. Appu, Eric G. Liskay, Prasoonkumar Surti, Sudhakar Kamma, Karthik Vaidyanathan, Rajasekhar Pantangi, Altug Koker, Abhishek Rhisheekesan, Shashank Lakshminarayana, Priyanka Ladda, Karol A. Szerszen
  • Patent number: 11108406
    Abstract: In one embodiment, an apparatus includes: a compression circuit to compress data blocks of one or more traffic classes; and a control circuit coupled to the compression circuit, where the control circuit is to enable the compression circuit to concurrently compress data blocks of a first traffic class and not to compress data blocks of a second traffic class. Other embodiments are described and claimed.
    Type: Grant
    Filed: June 19, 2019
    Date of Patent: August 31, 2021
    Assignee: Intel Corporation
    Inventors: Simon N. Peffers, Vinodh Gopal, Kirk Yap
  • Patent number: 11093587
    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.
    Type: Grant
    Filed: September 30, 2019
    Date of Patent: August 17, 2021
    Assignee: VIRTUAL MARKETING, LLC
    Inventors: Matthew Steven Murphy, Jacob W. Beckley
  • Patent number: 11086904
    Abstract: Embodiments of the present disclosure provide a data query method and apparatus, which implement a technical effect that data meeting a precision requirement is queried according to a user's requirement of for data precision. The method includes: receiving a query instruction that includes a query condition and query precision; determining a data partition that meets the query condition; determining a data sub-partition corresponding to the query precision from the data partition; and querying data in the data sub-partition to obtain a query result.
    Type: Grant
    Filed: August 15, 2017
    Date of Patent: August 10, 2021
    Assignee: Huawei Technologies Co., Ltd.
    Inventors: Qiang Tong, Jian Li
  • Patent number: 11076159
    Abstract: A method for processing a vide signal according to the present invention comprises: determining a length of a current string, which is decoded on the basis of a sample string matching technique in a current block; determining a reference string on the basis of at least one between the length of the current string and a string vector for the current string; and predicting the current string using the reference string.
    Type: Grant
    Filed: December 6, 2019
    Date of Patent: July 27, 2021
    Assignee: KT CORPORATION
    Inventors: Bae Keun Lee, Joo Young Kim
  • Patent number: 11070228
    Abstract: A data compressor with a hash computing hardware configured to evaluate the hash value for the current hash key extracted from a source data string, obtain a hash line corresponding to the hash value from a hash table, and perform hash key comparison to find at least one matching hash key. The hash line includes a prefix address column that stores a prefix address. Each entry of the hash line is provided to store a hash key and an offset. The hash computing hardware evaluates an address of the at least one matching hash key by combining the prefix address and an offset of the at least one matching hash key, and the offset of the at least one matching hash key is obtained from an entry storing the at least one matching hash key.
    Type: Grant
    Filed: September 29, 2020
    Date of Patent: July 20, 2021
    Assignee: SHANGHAI ZHAOXIN SEMICONDUCTOR CO., LTD.
    Inventors: Lin Li, Zhiqiang Hui
  • Patent number: 11068436
    Abstract: Methods, devices and computer program products facilitate the storage, access and management of log files that are associated with particular client devices. The log files provide a record of user or client device activities that are periodically sent to a data backup center. A dedicated log file server facilitates the processing and storage of an increasingly large number of log files that are generated by new and existing client devices. A storage server pre-processes the received log files to facilitate the processing and storage of the log files by the log file server. This Abstract is provided for the sole purpose of complying with the Abstract requirement rules. This Abstract is submitted with the explicit understanding that it will not be used to interpret or to limit the scope or the meaning of the claims.
    Type: Grant
    Filed: January 7, 2019
    Date of Patent: July 20, 2021
    Assignee: CARBONITE, INC.
    Inventor: Mark Rees
  • Patent number: 11048679
    Abstract: Techniques herein map between key spaces to generate a balanced adaptive resolution histogram for dataset partitioning. In embodiments, a computer (C) creates a mapping that associates sparse keys (SKs) with distinct dense keys. C constructs a trie by processing each item of a dataset as follows. Based on the item, C obtains an SK. C navigates from a root NT (node of the trie) to a particular NT based on a sequence of dense digits (SDD). Each dense digit of the SDD is based on the mapping. Each NT identifies a dense prefix comprising dense digits. C assigns the item to a target node based on a threshold and count of items assigned to a subtree rooted at the particular node. C determines a range of SKs for each partition of the dataset, based on: an item count for a node or subtree, dense prefixes of NTs, and the mapping.
    Type: Grant
    Filed: October 31, 2017
    Date of Patent: June 29, 2021
    Assignee: Oracle International Corporation
    Inventors: Anantha Kiran Kandukuri, Sam Idicula
  • Patent number: 11042905
    Abstract: A method of delivering advertising items to a client at a portable device is provided. A client ID is sent to a host server. A downloaded advertising item is produced relative to a product or service from the host server. The downloaded advertising item is parsed and stored. In response to the parsing and storing, displaying the advertising item is displayed to the client at the mobile device.
    Type: Grant
    Filed: July 7, 2015
    Date of Patent: June 22, 2021
    Assignee: CELLFIRE LLC
    Inventors: Preston Tollinger, Brent Dusing
  • Patent number: 11042329
    Abstract: A computer-implemented method, a computer program product, and a computer system for reordering a sequence of files based on compression rates in data transfer. A host determines predicted compression rates of first files that are to be saved onto a first tape, based on a relationship between compression rates and file attributes of second files that have been saved on a second tape. The host reorders a sequence of the first files stored in host cache storage and generates a new sequence of transferring the first files from the host cache storage to the tape drive hosting the first tape, based on the predicted compression rates of the first files. The host transfers the first files to the tape drive hosting the first tape and writes the first files to the first tape, according to the new sequence.
    Type: Grant
    Filed: May 21, 2019
    Date of Patent: June 22, 2021
    Assignee: International Business Machines Corporation
    Inventors: Noriko Yamamoto, Tsuyoshi Miyamura, Hiroshi Itagaki, Tohru Hasegawa, Shinsuke Mitsuma
  • Patent number: 11036417
    Abstract: In one aspect, the present disclosure relates to a method of de-duplicating data in a solid state storage device. The method can include receiving a block of data to be written to a solid state storage device, wherein the block of data comprises header portion and a payload, wherein the header portion comprises context information; and determining whether the payload should be de-duplicated prior to storage, based on the context information stored within the header portion; if the payload is determined to be de-duplicated, de-duplicating the payload; and storing the de-duplicated payload to the solid state storage device.
    Type: Grant
    Filed: November 14, 2018
    Date of Patent: June 15, 2021
    Assignee: WESTERN DIGITAL TECHNOLOGIES, INC.
    Inventors: Mohammad R. Sadri, Siddharth Choudhuri
  • Patent number: 11038528
    Abstract: Techniques for genetic programming based compression determination are described herein. An aspect includes adding a first plurality of randomly generated compression algorithms to a first set of compression algorithms. Another aspect includes determining a respective mutated version of each of the first plurality of randomly generated compression algorithms. Another aspect includes adding the determined mutated versions to the first set of compression algorithms. Another aspect includes evaluating and ranking the first set of compression algorithms based on respective achieved degrees of compression.
    Type: Grant
    Filed: June 4, 2020
    Date of Patent: June 15, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Paul S. Wiggins, Don Eric Kallberg, Steven Sullivan, Marc Henri Coq, Luis manon
  • Patent number: 11031951
    Abstract: Embodiments of the invention are directed to a DEFLATE compression accelerator and to a method for verifying the correctness of the DEFLATE compression accelerator. The accelerator includes an input buffer and a Lempel-Ziv 77 (LZ77) compressor communicatively coupled to an output of the input buffer. A switch is communicatively coupled to the output of the input buffer and to the output of the LZ77 compressor. The switch is configured to bypass the LZ77 compressor during a compression test. The accelerator further includes a deflate Huffman encoder communicatively coupled to an output of the switch and an output buffer communicatively coupled to the deflate Huffman encoder. When the switch is not bypassed, the compressor can be modified to produce repeatable results.
    Type: Grant
    Filed: January 14, 2020
    Date of Patent: June 8, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Timothy Slegel, Mark Farrell, Bruce Giamei, Matthias Klein, Ashutosh Misra, Simon Weishaupt, Girish Gopala Kurup
  • Patent number: 11023452
    Abstract: A processor receives statistical information about a data set included in a column of a data table. The processor receives additional information about the data set that indicates a data format utilized by the data set and a type of information represented by the data set. The processor generates a data dictionary for compression of the data set based, at least in part, on the statistical information and the additional information. The data dictionary is created such that the data dictionary is capable of compressing data that is statistically predicted to be received at a future point.
    Type: Grant
    Filed: June 8, 2015
    Date of Patent: June 1, 2021
    Assignee: International Business Machines Corporation
    Inventors: Martin A. Oberhofer, Yannick Saillet, Jens Seifert
  • Patent number: 11017155
    Abstract: A system and method for a non-transient computer readable medium containing program instructions for causing a computer to perform a method for compressing data comprising the steps of receiving a data string for compression, the data string including a plurality of data elements, creating a template based on processing the data string, the template including common information across all data elements of the data string, creating one or more entries, wherein the one or more entries include information that is different to the template, and storing the template and the one or more entries.
    Type: Grant
    Filed: November 8, 2017
    Date of Patent: May 25, 2021
    Assignee: Authpaper Limited
    Inventor: Chak Man Li
  • Patent number: 11010107
    Abstract: A procedure and installation of the same for the control of image processing devices using only the data required; thus, avoiding saturation of the memories of the components involved and/or the communications bandwidth. The procedure and installation are simple and reliable such as not to require the involvement of an expert user or a service staff member. The procedure includes the standardization of the data identifiers for each image processing device via the identification of the identifier containing a value for each data point and checking that the scale of each data point is equivalent to a predetermined scale. The installation includes a standardization system for such purpose.
    Type: Grant
    Filed: March 30, 2017
    Date of Patent: May 18, 2021
    Inventor: Antonio Sanchez Navarro
  • Patent number: 11006127
    Abstract: An exemplary method for intelligent compression uses a foveated-compression approach. First, the location of a fixation point within an image frame is determined. Next, the image frame is sectored into two or more sectors such that one of the two or more sectors is designated as a fixation sector and the remaining sectors are designated as foveation sectors. A sector may be defined by one or more tiles within the image frame. The fixation sector includes the particular tile that contains the fixation point and is compressed according to a lossless compression algorithm. The foveation sectors are compressed according to lossy compression algorithms. As the locations of foveation sectors increase in angular distance from the location of the fixation sector, a compression factor may be increased.
    Type: Grant
    Filed: September 30, 2019
    Date of Patent: May 11, 2021
    Assignee: QUALCOMM Incorporated
    Inventors: Meghal Varia, Serag Gadelrab, Wesley James Holland, Joseph Cheung, Dam Backer, Tom Longo
  • Patent number: 11003456
    Abstract: Disclosed is a technique for providing one or more virtual machines or one or more software containers provided by cloud services to manage a horticultural operation. The techniques include transmitting, from the image dispatcher service, the image data to a first computing instance that executes a first subprocess of an image processing pipeline. Using the first subprocess of the image processing pipeline, partially processed image data is generated from the image data. The partially processed image data resulting from the first subprocess is then transmitted from the first computing instance to a second computing instance that executes a second subprocess of the image processing pipeline. Thereafter, a fully image processed image associated with the image data is produced via at least the second subprocess of the image processing pipeline.
    Type: Grant
    Filed: March 28, 2019
    Date of Patent: May 11, 2021
    Assignee: IUNU, INC.
    Inventor: Matthew Charles King
  • Patent number: 10996739
    Abstract: Techniques to provide for improved (i.e., reduced) power consumption in an exemplary neural network (NN) and/or Deep Neural Network (DNN) environment using data management. Improved power consumption in the NN/DNN may be achieved by reducing a number of bit flips needed to process operands associated with one or more storages. Reducing the number bit flips associated with the NN/DNN may be achieved by multiplying an operand associated with a first storage with a plurality of individual operands associated with a plurality of kernels of the NN/DNN. The operand associated with the first storage may be neuron input data and the plurality of individual operands associated with the second storage may be weight values for multiplication with the neuron input data. The plurality of kernels may be arranged or sorted and subsequently processed in a manner that improves power consumption in the NN/DNN.
    Type: Grant
    Filed: December 19, 2017
    Date of Patent: May 4, 2021
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Amol Ashok Ambardekar, Chad Balling McBride, George Petre, Kent D. Cedola, Larry Marvin Wall
  • Patent number: 10983229
    Abstract: A data processing system (10) for compressing gamma spectroscopy data includes a data input (18) for receiving data representing counts for each of a plurality of bins. The counts represent a set of binned gamma spectroscopy data. The data processing system (10) also includes a processor (20). The processor (20) is arranged to: read the counts in each bin; calculate a measure representative of the counts using the counts in one or more of the bins; choose, using the measure, which one of at least two compression schemes to use to compress the data representing the counts; and compress the data representing the counts according to the chosen compression scheme; and write the compressed data representing the counts to a data storage device (22).
    Type: Grant
    Filed: June 5, 2015
    Date of Patent: April 20, 2021
    Assignee: SOLETANCHE FREYSSINET S.A.S.
    Inventor: Michael Davies
  • Patent number: 10970089
    Abstract: Provided are a computer program product, system, and method for determining real-time changes to content entered into a user interface to generate results for the content. In response to determining that entry of first content in a user input field rendered in a user interface is completed, the first content is provided to a classification program to classify into a first machine classification to provide to a rules engine to determine a first machine determined proposition. The first machine determined proposition is rendered in the user interface. A determination is made of second content in the user input field from the user that differs from the first content. The second content is provided to the classification program to classify into a second machine classification to provide to the rules engine to determine a second machine determined proposition rendered in the user interface with the second content.
    Type: Grant
    Filed: June 28, 2018
    Date of Patent: April 6, 2021
    Assignee: Radiology Partners, Inc.
    Inventors: Nina Kottler, Thomas N. Tobias, Jason R. Mitsky, Joyce Liang, Kelly Denney, Kevin Croxall, Telford Berkey, Jai Salzwedel
  • Patent number: 10963450
    Abstract: In some implementations, a system can optimize offline map data updates. For example, a server device in the system can determine a metric for identifying map data objects based on attributes of the map data objects. The server device can then generate a quadtree that stores the map data objects in nodes of the quadtree based on the metric. When processing an update to the map data stored at the server device, the server device can generate update data describing the updates for each node in the quadtree based on a binary difference algorithm and/or a semantic difference algorithm. The server device can select the algorithm based on which algorithm results in the smallest compressed size of the update data.
    Type: Grant
    Filed: January 24, 2018
    Date of Patent: March 30, 2021
    Assignee: Apple Inc.
    Inventors: Alexander Radus, Jonathan P. McCabe, Joseph A. Dean, Matthew B. Ball, Sergey Gindin, Daniel Eggert
  • Patent number: 10965316
    Abstract: One embodiment provides a method comprising receiving an input data stream, partitioning the input data stream into a plurality of data blocks, and compressing the data blocks utilizing a plurality of processor sets. Each processor set is assigned a data block to compress. The processor sets compress in parallel to exploit inter-block parallelism. Each processor set comprises one or more processors that collaborate in compressing an assigned data block to exploit intra-block parallelism. The method further comprises writing a plurality of compressed data blocks resulting from the compressing to a storage device in encoded form.
    Type: Grant
    Filed: May 31, 2019
    Date of Patent: March 30, 2021
    Assignee: International Business Machines Corporation
    Inventors: Tim Kaldewey, Rene Mueller, Evangelia Sitaridi
  • Patent number: 10959242
    Abstract: A communications system 1 has: an eNB 20 having a feedback conditions control unit 22 that controls feedback conditions in accordance with call priority and a control unit 21 that controls communications with a mobile station 10 on the basis of feedback information that includes reception quality in the mobile station 10 and decoding results for a received call, said feedback conditions being for determining whether or not transmission of the feedback information is necessary; and the mobile station 10 having a priority setting unit 13 that sets a priority level for the mobile station itself, a reception quality measuring unit 11 that measures the reception quality of reference signals from the eNB 20, and a feedback requirement determination unit 12 that determines whether or not transmission of feedback information is required, on the basis of the feedback conditions.
    Type: Grant
    Filed: January 19, 2018
    Date of Patent: March 23, 2021
    Assignee: NEC CORPORATION
    Inventor: Kenji Koyanagi
  • Patent number: 10959088
    Abstract: A communication method (S) for communication between mobile units (10, 20), and in particular between vehicles, in which information transmitted between the mobile units (10, 20) is encoded on the transmitter side by means of an encoder (12-1, 22-1) and is decoded on the receiver side by means of a decoder (12-2, 22-2), and the mobile units (10, 20) are synchronized in communication (S3) with an external interface unit (30) outside the mobile units (10, 20) prior to communication (S5) with one another in that a codebook (Cj) defining or specifying an encoder (12-1, 22-1) and/or a decoder (12-2, 22-2) is determined (S2) by the external interface unit (30) and is communicated (S3) to the mobile units (10, 20).
    Type: Grant
    Filed: April 24, 2018
    Date of Patent: March 23, 2021
    Assignees: Technische Universität München, Bayerische Motoren Werke Aktiengesellschaft
    Inventors: Holger Boche, Christian Arendt
  • Patent number: 10944423
    Abstract: Embodiments of the invention are directed to a DEFLATE compression accelerator and to a method for verifying the correctness of the DEFLATE compression accelerator. The accelerator includes an input buffer and a Lempel-Ziv 77 (LZ77) compressor communicatively coupled to an output of the input buffer. A switch is communicatively coupled to the output of the input buffer and to the output of the LZ77 compressor. The switch is configured to bypass the LZ77 compressor during a compression test. The accelerator further includes a deflate Huffman encoder communicatively coupled to an output of the switch and an output buffer communicatively coupled to the deflate Huffman encoder. When the switch is not bypassed, the compressor can be modified to produce repeatable results.
    Type: Grant
    Filed: March 14, 2019
    Date of Patent: March 9, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Timothy Siegel, Mark Farrell, Bruce Giamei, Matthias Klein, Ashutosh Misra, Simon Weishaupt, Girish Gopala Kurup
  • Patent number: 10938409
    Abstract: Techniques for compressing binary input data streams and files by reducing entropy of the input data prior to compression. Entropy reduction is achieved by first getting a stream of single-digit decimal pseudo random numbers and calculating the frequency of occurrence of each decimal number in the even and odd positions of the pseudo random number stream. Subsets of the frequencies of occurrence of the decimal digits are selected to best match the frequency of occurrence of “0” and “1” in the odd and even positions of the binary input data stream. The decimal digits of the subsets of frequencies of occurrence are selectively set to “0” or “1” thereby creating a binary pseudo random number (i.e. mapping) stream, which is XORed with the binary input stream and compressed. Decompression uses the same pseudo random number stream using the mapping stream and the seed number used during compression.
    Type: Grant
    Filed: September 5, 2020
    Date of Patent: March 2, 2021
    Inventor: Panagiotis Andreadakis
  • Patent number: 10931794
    Abstract: A communication apparatus includes a memory, and a processor coupled to the memory and the processor configured to receive communication data, measure a usable communication band width for communication with a destination apparatus, determine a parameter relating to a reduction ratio for a data amount of the communication data, based on the measured communication band width, reduce the data amount of the communication data, based on the determined parameter, and transmit the communication data of the reduced data amount to the destination apparatus.
    Type: Grant
    Filed: March 18, 2019
    Date of Patent: February 23, 2021
    Assignee: FUJITSU LIMITED
    Inventor: Shinichi Sazawa
  • Patent number: 10929527
    Abstract: Logic may implement implicit integrity techniques to maintain integrity of data. Logic may perform operations on data stored in main memory, cache, flash, data storage, or any other memory. Logic may perform more than one pattern check to determine repetitions of entities within the data. Logic may determine entropy index values and/or Boolean values and/or may compare the results to threshold values to determine if a data unit is valid. Logic may merge a tag with the data unit without expanding the data unit to create an encoded data unit. Logic may decode and process the encoded data unit to determine the data unit and the tag. Logic may determine value histograms for two or more entities, determine a sum of repetitions of the two or more entities, and compare the sum to a threshold value. Logic may determine that a data unit is valid or is corrupted.
    Type: Grant
    Filed: December 20, 2017
    Date of Patent: February 23, 2021
    Assignee: INTEL CORPORATION
    Inventors: Michael Kounavis, David Durham, Sergej Deutsch, Saeedeh Komijani, Amitabh Das
  • Patent number: 10922139
    Abstract: Systems, methods, and computer program products are provided for load balancing for processing large data sets. The method includes identifying a number of segments and a transaction data set comprising transaction data for a plurality of transactions, the transaction data for each transaction of the plurality of transactions comprising a transaction value, determining an entropy of the transaction data set based on the transaction value of each transaction of the plurality of transactions, segmenting the transaction data set into the number of segments based on the entropy of the transaction data set and balancing respective entropies of each segment of the number of segments, and distributing processing tasks associated with each segment of the number of segments to at least one processor of a plurality of processors to process each transaction in each respective segment.
    Type: Grant
    Filed: October 11, 2018
    Date of Patent: February 16, 2021
    Assignee: Visa International Service Association
    Inventor: Paul Max Payton
  • Patent number: 10911065
    Abstract: A method of compressing data in a mass storage medium of a computer system running an operating system (OS), such as Windows®, is disclosed. The computer system comprises a central processing unit (CPU), random access memory (RAM), and a non-transitory mass storage medium. The method includes accepting an operator indication of a desired degree of data compression, selecting a predefined compression method corresponding to the operator indication and the version of the operating system in use, and designating a selected predefined set of files and directories stored on the mass storage medium as uncompressible.
    Type: Grant
    Filed: September 20, 2016
    Date of Patent: February 2, 2021
    Inventor: Sinan Karaca
  • Patent number: 10911066
    Abstract: The present disclosure describes methods and systems that provide for content based dynamic data compression. During a training stage a plurality of training sets are compressed using multiple data compression techniques, and each training data set is associated with a most effective compression technique. Statistical features can be extracted from each of the training data sets with consideration of the most effective compression techniques and are saved as a compression parameters file. During a working stage, individual data blocks within a telemetry data set are compressed using a data compression technique selected for the data block in light of the statistical feature presented in the compression parameters file, and the compressed data blocks are written to a compressed data set, along with encoding tags that identify the compression technique used on each data block. During a consumption stage, the compressed data blocks are decompressed using techniques identified by the encoding tags.
    Type: Grant
    Filed: June 2, 2020
    Date of Patent: February 2, 2021
    Assignee: Dell Products L.P.
    Inventors: Jun Sun, Lin Chen, Xiao Na Zhang
  • Patent number: 10901948
    Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for processing data are provided. Compressed data is received and a requested operation for uncompressed data is performed on the compressed data by determining an intermediate location in a compression hierarchy of compression nodes and applying the requested operation to the data at that intermediate location.
    Type: Grant
    Filed: March 4, 2016
    Date of Patent: January 26, 2021
    Assignee: International Business Machines Corporation
    Inventors: William B. Ackerman, Garth A. Dickie, Jeffrey M. Keller
  • Patent number: 10904177
    Abstract: According to one embodiment, a method for lossy data compression is provided. The method may also include determining a length and a plurality of bounding characters associated with each data item within the data message. The method may further include encoding each data item within the data message by replacing each data item with the determined length and the determined plurality of bounding characters. The method may also include transmitting the data message to a recipient.
    Type: Grant
    Filed: June 6, 2019
    Date of Patent: January 26, 2021
    Assignee: International Business Machines Corporation
    Inventors: Hamish C. Hunt, Nicholas K. Lincoln, Christopher J. Poole, Mark A. Woolley
  • Patent number: 10893273
    Abstract: A data encoding method includes encoding an array of data values as data sets and escape codes for values not encoded by the data sets, an escape code including a prefix portion and a non-unary coded suffix portion having a length, in bits, dependent upon a value encoded by the prefix portion according to a relationship such that, for at least some values encoded by the prefix portion, the length of the non-unary coded suffix portion is greater than the length, in bits, of the prefix portion.
    Type: Grant
    Filed: February 15, 2019
    Date of Patent: January 12, 2021
    Assignee: SONY CORPORATION
    Inventors: James Alexander Gamei, Karl James Sharman
  • Patent number: 10887430
    Abstract: Methods and apparatus are provided for processing communication traffic that includes a plurality of traffic units, each traffic unit having a header and a payload. In one embodiment, header compression is selectively applied to headers of traffic units from the communication traffic, and bit-level bulk data compression is selectively applied to the communication traffic. The bit-level bulk data compression involves accumulating blocks of bits, including headers and payloads of traffic units from the communication traffic, and operating on each block individually. In another embodiment, bit-level bulk data decompression is selectively applied to the communication traffic, and header decompression is selectively applied to headers of traffic units from the communication traffic. The bit-level bulk data decompression involves accumulating blocks of bits, including headers and payloads of traffic units from the communication traffic, and operating on each block individually.
    Type: Grant
    Filed: October 20, 2016
    Date of Patent: January 5, 2021
    Assignee: DRAGONWAVE-X, LLC
    Inventor: Erik Boch
  • Patent number: 10880561
    Abstract: An image processing method and an image processing device are provided. The method includes: retrieving a first and second blocks and compressing the first and second blocks into a first and second streams; in response to determining performing a dynamic memory allocation mechanism to the first and second blocks, respectively allocating a first and second private storage spaces to the first and second blocks, and allocating a shared storage space shared by the first and second blocks and divided into multiple segments; when the first private storage space is insufficient to store the first stream, using the first private storage space and a first part of the segments to cooperatively store the first stream; when the second private storage space is insufficient to store the second stream, using the second private storage space and a second part of the segments to cooperatively store the second stream.
    Type: Grant
    Filed: June 5, 2019
    Date of Patent: December 29, 2020
    Assignee: Shanghai Zhaoxin Semiconductor Co., Ltd.
    Inventors: Yongtao Zhao, Ruiyang Chen, Yuanfeng Wang, Wei Wang
  • Patent number: 10872060
    Abstract: A search apparatus encodes a plurality of elements, each of which is a unit of encoding, stored in a plurality of items, in a file that includes a plurality of records each including the plurality of items separated by delimiters, with use of an encoding dictionary indicating corresponding relationships between the elements and codes. Further, the search apparatus generates an index that associates the elements with positions of the respective elements in the file. Then, the search apparatus generates mask information indicating a range of a specific search target item among the plurality of items, in the file. The search apparatus searches for one or more element strings satisfying a search condition, from among search target elements that are indicated by the index as being within the range of the search target item indicated in the mask information, based on the search condition.
    Type: Grant
    Filed: September 27, 2017
    Date of Patent: December 22, 2020
    Assignee: FUJITSU LIMITED
    Inventors: Yukari Hakamata, Junki Hakamata, Masahiro Kataoka, Ryosuke Hyogo
  • Patent number: 10868565
    Abstract: A method of compressing data is described in which the compressed data is generated by either or both of a primary compression unit or a reserve compression unit in order that a target compression threshold is satisfied. If a compressed data block generated by the primary compression unit satisfies the compression threshold, that block is output. However, if the compressed data block generated by the primary compression unit is too large, such that the compression threshold is not satisfied, a compressed data block generated by the reserve compression unit using a lossy compression technique, is output.
    Type: Grant
    Filed: June 28, 2019
    Date of Patent: December 15, 2020
    Assignee: Imagination Technologies Limited
    Inventor: Simon Fenney
  • Patent number: 10866941
    Abstract: In a system in which a database process among processes of a computer is offloaded to one or more hardware circuits each having a memory, the computer divides a column store database made up of a plurality of records and a plurality of columns into a plurality of data segments. One or more columns among the plurality of columns are each one or more compression target columns. Each of the plurality of data segments includes: a column store database portion made up of one or more records among the plurality of records; and a compression dictionary which is a dictionary for decompressing one or more compression target column portions within the column store database portion. The size of the compression dictionary in each of the plurality of data segments is equal to or smaller than the size of the memory.
    Type: Grant
    Filed: March 7, 2016
    Date of Patent: December 15, 2020
    Assignee: Hitachi, Ltd.
    Inventor: Satoru Watanabe
  • Patent number: 10855815
    Abstract: A method of data nibble-histogram compression can include determining a first amount of space freed by compressing the input data using a first compression technique, determining a second amount of space freed by compressing the input data using a second, different compression technique, compressing the input data using the compression technique of the first and second compression techniques determined to free up more space to create compressed input data, and inserting into the compressed input data, security data including one of a message authentication control (MAC) and an inventory control tag (ICT).
    Type: Grant
    Filed: November 5, 2019
    Date of Patent: December 1, 2020
    Assignee: Intel Corporation
    Inventors: Michael Kounavis, David M. Durham, Karanvir Grewal, Wenjie Xiong, Sergej Deutsch
  • Patent number: 10840943
    Abstract: One embodiment provides a computer implemented method of data compression using a hardware accelerator. The method includes communicating, using a hardware accelerator, to a client device a set of instructions that compressed data be sent in LZ compressed format; receiving LZ compressed data at the hardware accelerator in LZ compressed format; decompressing the LZ compressed data using the hardware accelerator to create decompressed data; recompressing the decompressed data into GZ format, using the hardware accelerator, to create GZ compressed data; and sending the GZ compressed data to a storage device.
    Type: Grant
    Filed: October 15, 2019
    Date of Patent: November 17, 2020
    Assignee: EMC IP HOLDING COMPANY LLC
    Inventors: Rahul Ugale, Colin Zou
  • Patent number: 10838922
    Abstract: A compression method, system, and computer program product include creating compressed data via a first system from input data, sending information to a second system detailing a compression strategy for the compressed data, and learning, via the second system, from the information how to recreate the input to the first system using the compressed data.
    Type: Grant
    Filed: March 31, 2017
    Date of Patent: November 17, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Sharathchandra Umapathirao Pankanti, Erik Rueger, Rolf Schaefer
  • Patent number: 10841616
    Abstract: A method and apparatus for decoding a video sequence using a discrete sine transform (DST) type-VII transform core includes generating a set of tuples of transform core elements associated with an n-point DST-VII transform core. A first sum of a first subset of transform core elements of a first tuple is equal to a second sum of a second subset of remaining transform core elements of the first tuple. The n-point DST-VII transform core is generated based on generating the set of tuples of transform core elements. A transform on a block is performed using the n-point DST-VII transform core.
    Type: Grant
    Filed: August 23, 2019
    Date of Patent: November 17, 2020
    Assignee: TENCENT AMERICA LLC
    Inventors: Xin Zhao, Xiang Li, Shan Liu
  • Patent number: 10824599
    Abstract: An information processing apparatus includes a data storage, and a processor coupled to the data storage and that executes a process including dividing data including a plurality of blocks, performing, for each portion generated by dividing the data, first clustering of blocks included in each of the portions based on similarities between the blocks included in each of the portions, determining, among the plurality of blocks, blocks to be collectively compressed based on results of the first clustering performed for each of the portions, and collectively compressing data of the determined blocks before storing the data into the data storage.
    Type: Grant
    Filed: July 26, 2018
    Date of Patent: November 3, 2020
    Assignee: FUJITSU LIMITED
    Inventor: Hiroki Ohtsuji
  • Patent number: 10827039
    Abstract: In an embodiment, a method includes receiving, from a data source, time-series data of a time-series data stream produced by the data source. The method further includes identifying a target compression algorithm for the time-series data, wherein the target compression algorithm is linked to the data source in memory pursuant to a dynamically-variable assignment. The method also includes compressing the time-series data using the target compression algorithm and transmitting the compressed time-series data to a destination. Furthermore the method includes periodically optimizing the dynamically-variable assignment in real-time as the time-series data is received.
    Type: Grant
    Filed: October 19, 2015
    Date of Patent: November 3, 2020
    Assignee: QUEST SOFTWARE INC.
    Inventors: Shree A. Dandekar, Mark William Davis
  • Patent number: 10819369
    Abstract: Methods, devices and systems enhance compression and decompression of data blocks of data values by selecting the best suited compression method and device among two or a plurality of compression methods and devices, which are combined together and which said compression methods and devices compress effectively data values of particular data types; said best suited compression method and device is selected using as main selection criterion the dominating data type in a data block by predicting the data types within said data block.
    Type: Grant
    Filed: October 15, 2019
    Date of Patent: October 27, 2020
    Assignee: ZeroPoint Technologies AB
    Inventors: Angelos Arelakis, Per Stenström
  • Patent number: 10812453
    Abstract: Provided is a method for transmitting a packet in a communication system, comprising the steps of: identifying the packet according to a packet identification criterion; reallocating frames included in the identified packet and encrypting the packet in which the frames have been rearranged; and transmitting the encrypted packet.
    Type: Grant
    Filed: December 14, 2015
    Date of Patent: October 20, 2020
    Assignee: Korea Advanced Institute of Science and Technology
    Inventors: Myung Chul Kim, Kyung Min Go
  • Patent number: 10810171
    Abstract: In an example, data from a source location is merged into a target location containing existing data, in which the source location and the target location contain tuples of data. For each tuple in the source location, during a single operation, a determination is made as to whether there is a matched tuple in the target location that satisfies a predetermined condition. For each matched tuple that satisfies the predetermined condition, the matched tuple in the target location is updated with a count value that is equal to a count of the matched tuple in the source location and the target location. In addition, for each tuple that does not have a matched tuple that satisfies the predetermined condition, the unmatched tuple is inserted into the target location.
    Type: Grant
    Filed: January 8, 2018
    Date of Patent: October 20, 2020
    Assignee: MICRO FOCUS LLC
    Inventors: Hoa Binh Nga Tran, Andrew Allinson Lamb, Matthew Steven Fuller
  • Patent number: 10812630
    Abstract: A highly programmable device, referred to generally as a data processing unit, having multiple processing units for processing streams of information, such as network packets or storage packets, is described. The data processing unit includes one or more specialized hardware accelerators configured to perform acceleration for various data-processing functions. This disclosure describes a hardware-based programmable data compression accelerator for the data processing unit including a pipeline for performing string substitution. The disclosed string substitution pipeline, referred to herein as a “search block,” is configured to perform string search and replacement functions to compress an input data stream. In some examples, the search block is a part of a compression process performed by the data compression accelerator. The search block may support single and multi-thread processing, and multiple levels of compression effort.
    Type: Grant
    Filed: November 19, 2018
    Date of Patent: October 20, 2020
    Assignee: Fungible, Inc.
    Inventors: Edward David Beckman, Satyanarayana Lakshmipathi Billa, Rajan Goyal