Adaptive Coding Patents (Class 341/51)
  • Patent number: 10318178
    Abstract: A method of accelerating copy operations is performed by a data storage appliance. The method includes (a) in response to receiving a copy command to copy from a source extent to a target extent, issuing a buffered read command to read from the source extent down a storage stack of the data storage appliance by a driver running on the data storage appliance, the source extent being part of a first logical disk backed by non-volatile storage of the data storage appliance and the target extent being part of a second logical disk backed by non-volatile storage of the data storage appliance, (b) in response to issuing, receiving at the driver an indication from the storage stack that the source extent is empty, and (c) in response to receiving, issuing a zero-fill command to fill the target extent with zeroes down the storage stack by the driver.
    Type: Grant
    Filed: April 28, 2017
    Date of Patent: June 11, 2019
    Assignee: EMC IP Holding Company LLC
    Inventors: Changyu Feng, Henry Austin Spang, IV, Jian Gao, Xinlei Xu, Xiongcheng Li, Yousheng Liu
  • Patent number: 10303402
    Abstract: A data storage device includes at least one data storage medium and a controller that is operably coupled to the at least one data storage medium. The controller receives the bit stream in a data storage device and performs a first level of compression on the received bit stream to obtain a symbol frame including a plurality of symbols. The controller encodes an initial portion of the plurality of symbols contained in the symbol frame by a fixed encoding scheme. The controller also collects statistics for the initial portion of the symbol frame. The controller then selects at least one data compression algorithm based on the collected statistics. The controller then performs compression encoding on a remaining portion of the symbol frame with the selected at least one data compression algorithm.
    Type: Grant
    Filed: August 2, 2016
    Date of Patent: May 28, 2019
    Assignee: SEAGATE TECHNOLOGY LLC
    Inventors: Hongmei Xie, Zhengang Chen, Bijan Eskandari-Gharnin, Erich F. Haratsch
  • Patent number: 10305509
    Abstract: Systems, apparatuses, and methods for compression of frequent data values across narrow links are disclosed. In one embodiment, a system includes a processor, a link interface unit, and a communication link. The link interface unit is configured to receive a data stream for transmission over the communication link, wherein the data stream is generated by the processor. The link interface unit determines if blocks of data of a first size from the data stream match one or more first data patterns and the link interface unit determines if blocks of data of a second size from the data stream match one or more second data patterns. The link interface unit sends, over the communication link, only blocks of data which do not match the first or second data patterns.
    Type: Grant
    Filed: October 16, 2017
    Date of Patent: May 28, 2019
    Assignee: Advanced Micro Devices, Inc.
    Inventors: Greggory D. Donley, Vydhyanathan Kalyanasundharam, Bryan P. Broussard
  • Patent number: 10290107
    Abstract: Aspects of the present disclosure involve a transform domain regression convolutional neural network for image segmentation. Example embodiments include a system comprising a machine-readable storage medium storing instructions and computer-implemented methods for classifying one or more pixels in an image. The method may include analyzing the image to estimate one or more transform domain coefficients using a multi-layered function such as a convolutional neural network. The method may further include generating a segmented image by applying a change of basis transformation to the estimated one or more transform domain coefficients.
    Type: Grant
    Filed: June 19, 2017
    Date of Patent: May 14, 2019
    Assignee: Cadence Design Systems, Inc.
    Inventors: Raúl Alejandro Casas, Samer Lutfi Hijazi, Rishi Kumar, Piyush Kaul, Xuehong Mao, Christopher Rowen, Himanshu Charaya
  • Patent number: 10282400
    Abstract: A method may include receiving an extensible markup language schema definition (XSD) including a first element having a first simple datatype and a second element having a second simple datatype different from the first simple datatype. A grammar may be generated based on the XSD. The grammar may be associated with encoding and decoding an extensible markup language (XML) document based on the XSD to and from efficient XML interchange (EXI) streams. The grammar may be associated with the first simple datatype and with the second simple datatype.
    Type: Grant
    Filed: March 5, 2015
    Date of Patent: May 7, 2019
    Assignee: FUJITSU LIMITED
    Inventor: Takuki Kamiya
  • Patent number: 10284226
    Abstract: A computing system includes a network interface, a processor, and a decompression circuit. In response to a compression request from the processor the decompression circuit compresses data to produce compressed data and transmits the compressed data through the network interface. In response to a decompression request from the processor for compressed data the decompression circuit retrieves the requested compressed data, speculatively detects codewords in each of a plurality of overlapping bit windows within the compressed data, selects valid codewords from some, but not all of the overlapping bit windows, decodes the selected valid codewords to generate decompressed data, and provides the decompressed data to the processor.
    Type: Grant
    Filed: July 9, 2018
    Date of Patent: May 7, 2019
    Assignee: Amazon Technologies, Inc.
    Inventors: Ron Diamant, Michael Baranchik, Ori Weber
  • Patent number: 10284864
    Abstract: A system for decoding a video bitstream includes receiving a frame of the video that includes at least one slice and at least one tile and where each of the at least one slice and the at least one tile are not all aligned with one another.
    Type: Grant
    Filed: May 23, 2017
    Date of Patent: May 7, 2019
    Assignee: Sharp Laboratories of America, Inc.
    Inventors: Seung-Hwan Kim, Christopher A. Segall, Jie Zhao
  • Patent number: 10268626
    Abstract: A data processing device includes a data selector circuit that divides a plurality of types of data into another plurality of types of data in accordance with a classification of the data, a plurality of compression circuits that respectively compress the plurality of types of data in parallel with each other in accordance with each of the plurality of types of data, and a data transmission circuit that transmits the plurality of types of compressed data to a terminal.
    Type: Grant
    Filed: January 31, 2018
    Date of Patent: April 23, 2019
    Assignee: RENESAS ELECTRONICS CORPORATION
    Inventors: Takahiko Sugimoto, Tomohiro Une, Hiroshi Ueda, Ryoji Hashimoto, Toshiyuki Kaya
  • Patent number: 10271057
    Abstract: The present invention relates to system, methods and computer programs for image/video encoding and compression suitable for various image/video types as indexed-color, grayscale and true color (red, green, blue (RGB) and cyan, magenta, yellow, black (CMYK image)) images/video of any bit depth. More particularly, the invention consists of dividing the image/video into plurality of partitions and encoding and compressing each image partition; image partition lines or video stream separately to provide plurality of compressed units. The invention is referring to regularities found in the structure of (grayscale and) color images: the regularities are found for the encoded stream(s) by the empiric way, analyzing statistical data of the encoded streams. It becomes possible to exploit the regularities (natural properties) of the image/video and make compression rate more efficient. Besides increasing lossless or lossy compression rate, they can be used for photo correction (for having more accurate images).
    Type: Grant
    Filed: November 4, 2014
    Date of Patent: April 23, 2019
    Inventor: Vahagn Nurijanyan
  • Patent number: 10268537
    Abstract: In at least one embodiment, a history data structure of a Lempel-Ziv compressor is preloaded with fixed predetermined history data typical of actual data of a workload of the Lempel-Ziv compressor. The Lempel-Ziv compressor then compresses each of multiple data pages in a sequence of data pages by reference to the fixed predetermined history data.
    Type: Grant
    Filed: May 26, 2016
    Date of Patent: April 23, 2019
    Assignee: International Business Machines Corporation
    Inventors: Tobias Blaettler, Thomas Mittelholzer, Nikolaos Papandreou, Thomas Parnell, Charalampos Pozidis
  • Patent number: 10264045
    Abstract: Embodiments of the present invention provide a method for searching for a data stream dividing point based on a server. In the embodiments of the present invention, a data stream dividing point is searched for by determining whether at least a part of data in a window of M windows meets a preset condition, and when the at least a part of data in the window does not meet the preset condition, a length of N*U is skipped, so as to obtain a next potential dividing point, thereby improving efficiency of searching for a data stream dividing point.
    Type: Grant
    Filed: March 28, 2018
    Date of Patent: April 16, 2019
    Assignee: HUAWEI TECHNOLOGIES CO., LTD.
    Inventors: Chuanshuai Yu, Chengwei Zhang, Linbo Xu
  • Patent number: 10248214
    Abstract: An embodiment provides a method, including: detecting, via a wearable information handling device, a user motion; processing, via the wearable information handling device, the user motion into user motion data; determining, using a processor, that the user motion data is handwriting input; and converting, using the processor, the user motion data into a digital handwriting input. Other aspects are described and claimed.
    Type: Grant
    Filed: November 27, 2013
    Date of Patent: April 2, 2019
    Assignee: Lenovo (Singapore) Pte. Ltd.
    Inventors: Jason Grimme, Rod D. Waltermann
  • Patent number: 10248622
    Abstract: Methods and system are disclosed that optimize attribute vectors to search for data. In one aspect, a reordering optimization model is executed to reorder the attribute vectors. The attribute vectors may include value identifiers associated with data. The attribute vectors are assigned priorities, sequence score corresponding to each attribute vector is computed and the attribute vectors are reordered based on the computed sequence score. The reordered attribute vectors are logically partitioned into attribute vector blocks by executing a partitioning optimization model. The attribute vector blocks may be generated upon executing the partitioning optimization model. The value identifiers in the attribute vector blocks may be rearranged to optimize the attribute vectors to search for data.
    Type: Grant
    Filed: March 30, 2015
    Date of Patent: April 2, 2019
    Assignee: SAP SE
    Inventor: Sudhir Verma
  • Patent number: 10229132
    Abstract: Data matches are calculated between input data and repository data via a digest based matching algorithm where in a first step digest matches, anchored at already verified matching positions in the input data and in the repository data, are extended to produce data matches. In a second step the remaining unmatched input digests are matched with repository digests and extended to produce further data matches.
    Type: Grant
    Filed: July 15, 2013
    Date of Patent: March 12, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventor: Lior Aronovich
  • Patent number: 10229426
    Abstract: A decoding device is implemented on an integrated circuit, for decoding a market data input stream received in a given data representation format. The decoding device comprises an engine built around a finite state machine, the engine being generated from at least one description file and configured to perform the following steps, in a current state of the finite state machine: i) dividing the market data input stream into a number of tokens and reading a set of tokens, ii) accumulating the set of read tokens in internal registers, iii) generating output commands from the tokens accumulated in the internal registers depending on a condition related to the tokens accumulated in the internal registers, and iv) selecting the next state of the Finite State Machine state based on a triggering condition.
    Type: Grant
    Filed: September 30, 2014
    Date of Patent: March 12, 2019
    Assignee: ENYX SA
    Inventor: Edward Kodde
  • Patent number: 10217047
    Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for training and deploying machine-learned communication over radio frequency (RF) channels. One of the methods includes: determining first information; using an encoder machine-learning network to process the first information and generate a first RF signal for transmission through a communication channel; determining a second RF signal that represents the first RF signal having been altered by transmission through the communication channel; using a decoder machine-learning network to process the second RF signal and generate second information as a reconstruction of the first information; calculating a measure of distance between the second information and the first information; and updating at least one of the encoder machine-learning network or the decoder machine-learning network based on the measure of distance between the second information and the first information.
    Type: Grant
    Filed: May 3, 2018
    Date of Patent: February 26, 2019
    Assignee: Virginia Tech Intellectual Properties, Inc.
    Inventor: Timothy James O'Shea
  • Patent number: 10212451
    Abstract: A method for RDO (Rate-Distortion Optimization) based on fit-curves contains at least the following steps: calculating a first fit-curve and a second fit-curve according to information regarding a first frame; carrying information regarding a second frame into the first and second fit-curves to calculate fit distortions and fit bit counts; calculating costs according to the fit distortions and the fit bit counts; determining the best block-division mode for the second frame according to the costs; and dividing the second frame into blocks according to the best block-division mode and encoding the second frame.
    Type: Grant
    Filed: June 7, 2016
    Date of Patent: February 19, 2019
    Assignee: VIA ALLIANCE SEMICONDUCTOR CO., LTD.
    Inventor: ChuanChuan Zhu
  • Patent number: 10209919
    Abstract: A storage system is able to perform an operation of remote copy from a first storage apparatus to a second storage apparatus. A first control unit transfers summary information of copy target data stored in the first storage apparatus from the first storage apparatus to the second storage apparatus. A second control unit checks the summary information against information stored in the second storage apparatus. The second control unit transfers the checked result from the second storage apparatus to the first storage apparatus. If the checked result indicates matching discrepancy, the first control unit transfers the copy target data to the second storage apparatus and completes the remote copy operation.
    Type: Grant
    Filed: April 5, 2016
    Date of Patent: February 19, 2019
    Assignee: FUJITSU LIMITED
    Inventor: Masanori Furuya
  • Patent number: 10210162
    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: March 29, 2010
    Date of Patent: February 19, 2019
    Assignee: Carbonite, Inc.
    Inventor: Mark Rees
  • Patent number: 10205980
    Abstract: A system or method for processing a variable bit rate representation of an image sequence can include segmenting a variable bit rate representation of an image sequence into a plurality of segments and creating a second representation of the image sequence where a block of information from a first segment of the plurality of segments is interlaced with blocks of information of a second segment of the plurality of segments. The second representation of the image sequence can include a fragment header indicating the block of information of the first segment of the plurality of segments interlaced with the blocks of information of the second segment of the plurality of segments.
    Type: Grant
    Filed: February 15, 2016
    Date of Patent: February 12, 2019
    Assignee: AT&T INTELLECTUAL PROPERTY I, L.P.
    Inventor: Pierre Costa
  • Patent number: 10191684
    Abstract: Technologies for flexibly compressing data include a computing device having an accelerator complex that is to receive a compression job request and schedule the compression job request for one or more hardware compression resources of the accelerator complex. The accelerator complex is further to perform the compression job request with the one or more hardware compression resources in response to scheduling the compression job request and to communicate uncompressed data and compressed data with an I/O subsystem of the computing device in response to performing the compression job request. Other embodiments are described and claimed.
    Type: Grant
    Filed: September 29, 2017
    Date of Patent: January 29, 2019
    Assignee: Intel Corporation
    Inventors: Vinodh Gopal, James D. Guilford, Kirk S. Yap, Daniel F. Cutter, Wajdi K. Feghali
  • Patent number: 10191657
    Abstract: The disclosed embodiments provide a system for detecting and managing memory inefficiency in a software program. During operation, the system obtains a first snapshot of a heap for a software program, wherein the first snapshot includes a first set of objects stored in the heap at a first time. Next, the system applies a compression technique to the first snapshot to obtain a first set of inefficiency metrics for the first set of objects, wherein each inefficiency metric in the first set of inefficiency metrics represents a memory inefficiency of an object in the heap at the first time. The system then outputs the first set of inefficiency metrics with additional attributes of the first set of objects to improve identification of the memory inefficiency in the software program.
    Type: Grant
    Filed: December 15, 2015
    Date of Patent: January 29, 2019
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: John W. Nicol, Cuong H. Tran, Haricharan K. Ramachandra, Badrinath K. Sridharan
  • Patent number: 10187252
    Abstract: In one embodiment, a device receives data regarding a plurality of heterogeneous computing environments. The received data comprises measured application metrics for applications executed in the computing environments and indications of processing capabilities of the computing environments. The device generates a training dataset by applying a machine learning-based classifier to the received data regarding the plurality of existing heterogeneous environments. The device trains a machine learning-based configuration engine using the training dataset. The device uses the configuration engine to generate configuration parameters for a particular heterogeneous computing environment based on one or more system requirements of the particular heterogeneous computing environment. The device provides the configuration parameters to the particular heterogeneous computing environment.
    Type: Grant
    Filed: December 27, 2016
    Date of Patent: January 22, 2019
    Assignee: Cisco Technology, Inc.
    Inventors: Charles Calvin Byers, Joseph Michael Clarke, Gonzalo Salgueiro
  • Patent number: 10178387
    Abstract: Computer processor hardware receives a first set of adjustment values. The first set of adjustment values specify adjustments to be made to a predicted rendition of a signal generated at a first level of quality to reconstruct a rendition of the signal at the first level of quality. The computer processor hardware processes the first set of adjustment values and derives a second set of adjustment values based on the first set of adjustment values and a rendition of the signal at a second level of quality. The second level of quality is lower than the first level of quality.
    Type: Grant
    Filed: October 18, 2016
    Date of Patent: January 8, 2019
    Assignee: V-NOVA INTERNATIONAL LIMITED
    Inventors: Luca Rossato, Guido Meardi
  • Patent number: 10162934
    Abstract: A computer-implemented method for data-deduplication of genome data that is in different file formats is described. Representative data from different genome file formats is conformed to a selected file format and compared. Duplicate files are identified and duplicate files are released, with at least one file copy being retained.
    Type: Grant
    Filed: November 30, 2015
    Date of Patent: December 25, 2018
    Assignee: International Business Machines Corporation
    Inventors: Rika Nagahara, Yasushi Negishi, Takeshi Ogasawara
  • Patent number: 10158664
    Abstract: A system, method, and computer-readable medium for detecting malicious computer code are provided. A dataset may be accessed and converted to a binary dataset according to a predefined conversion algorithm. One or more cycles in the binary dataset may be identified. Statistical analysis may be performed on the identified one or more cycles. A determination that the set of dataset includes malicious software code may be made based on the performed statistical analysis.
    Type: Grant
    Filed: July 22, 2014
    Date of Patent: December 18, 2018
    Assignee: VERISIGN, INC.
    Inventor: Trevor Tonn
  • Patent number: 10158738
    Abstract: In accordance with the exemplary embodiments of the invention there is at least a method and apparatus to determine a shortest code length of at least one category of a publish-subscribe system such that a length requirement of prefix code system for the at least one category is not exceeded; and assign a prefix code of the shortest code length to each of the at least one category of the publish-subscribe system.
    Type: Grant
    Filed: December 22, 2014
    Date of Patent: December 18, 2018
    Assignee: HERE Global B.V.
    Inventors: Bo Xu, Matei Nicolae Stroila
  • Patent number: 10158859
    Abstract: A data compression apparatus is described which has an encoder configured to receive an input data item and to compress the data item into an encoding comprising a plurality of numerical values. The numerical values are grouped at least according to whether they relate to content of the input data item or style of the input data item. The encoder has been trained using a plurality of groups of training data items grouped according to the content and where training data items within individual ones of the groups vary with respect to the style. The encoder has been trained using a training objective which takes into account the groups.
    Type: Grant
    Filed: June 29, 2017
    Date of Patent: December 18, 2018
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Sebastian Nowozin, Ryota Tomioka, Diane Bouchacourt
  • Patent number: 10152677
    Abstract: A mechanism is provided in a stream computing platform for data stream change detection and model swapping. The mechanism builds a model for each input data stream in a stream computing platform. Each tuple of each given input data stream is tagged with a key corresponding to the given input data stream. The mechanism performs an operation on each input data stream using its corresponding model. The mechanism detects a misdirected input data stream, which is tagged with a key that does not correspond to the misdirected input data stream. The mechanism pauses the misdirected input data stream swaps a model corresponding to the misdirected input data stream with another model corresponding to another paused input data stream.
    Type: Grant
    Filed: June 18, 2015
    Date of Patent: December 11, 2018
    Assignee: International Business Machines Corporation
    Inventors: Alain E. Biem, Dattaram Bijavara Aswathanarayana Rao, Bharath K. Devaraju
  • Patent number: 10153779
    Abstract: Methods and apparatus are provided for content-aware compression of data using multiple prediction functions.
    Type: Grant
    Filed: April 25, 2017
    Date of Patent: December 11, 2018
    Assignee: EMC IP Holding Company LLC
    Inventors: Alex Laier Bordignon, Marcello Luiz Rodrigues de Campos, Angelo E. M. Ciarlini, Rômulo Teixeira de Abreu Pinho
  • Patent number: 10147046
    Abstract: A mechanism is provided in a stream computing platform for data stream change detection and model swapping. The mechanism builds a model for each input data stream in a stream computing platform. Each tuple of each given input data stream is tagged with a key corresponding to the given input data stream. The mechanism performs an operation on each input data stream using its corresponding model. The mechanism detects a misdirected input data stream, which is tagged with a key that does not correspond to the misdirected input data stream. The mechanism pauses the misdirected input data stream swaps a model corresponding to the misdirected input data stream with another model corresponding to another paused input data stream.
    Type: Grant
    Filed: October 30, 2014
    Date of Patent: December 4, 2018
    Assignee: International Business Machines Corporation
    Inventors: Alain E. Biem, Dattaram Bijavara Aswathanarayana Rao, Bharath K. Devaraju
  • Patent number: 10140621
    Abstract: An apparatus and method for predicting a brand name of a product are disclosed herein. A product identification number for the product is converted into a normalized global trade item number (GTIN). For each of a plurality of GTIN prefixes corresponding to the normalized GTIN, brand names and counts of each of the brand names using product information stored in a product catalog are identified. A probability distribution of the brand names is determined in accordance with the brand names and the counts of the brand names for the plurality of the GTIN prefixes. A predicted brand name for the product is identified from among the brand names for the plurality of the GTIN prefixes, the predicted brand name having a highest probability score in the probability distribution of the brand names.
    Type: Grant
    Filed: September 20, 2012
    Date of Patent: November 27, 2018
    Assignee: eBay Inc.
    Inventors: Arun Lakshminarayanan, Gurudatta Horantur Shivaswamy, Jean-David Ruvini
  • Patent number: 10120581
    Abstract: Aspects for generating compressed data streams with lookback pre-fetch instructions are disclosed. A data compression system is provided and configured to receive and compress an uncompressed data stream as part of a lookback-based compression scheme. The data compression system determines if a current data block was previously compressed. If so, the data compression system is configured to insert a lookback instruction corresponding to the current data block into the compressed data stream. Each lookback instruction includes a lookback buffer index that points to an entry in a lookback buffer where decompressed data corresponding to the data block will be stored during a separate decompression scheme. Once the data blocks have been compressed, the data compression system is configured to move a lookback buffer index of each lookback instruction in the compressed data stream into a lookback pre-fetch instruction located earlier than the corresponding lookback instruction in the compressed data stream.
    Type: Grant
    Filed: March 30, 2016
    Date of Patent: November 6, 2018
    Assignee: QUALCOMM Incorporated
    Inventors: Richard Senior, Amin Ansari, Vito Remo Bica, Jinxia Bai
  • Patent number: 10108633
    Abstract: Systems and techniques for losslessly reducing input data using a distributed system comprising multiple computers that maintain portions of a data structure that organizes prime data elements based on names of the prime data elements. During operation, a first computer can determine a first name for the element, and send the element to a second computer based on the first name. The second computer can losslessly reduce the element by determining a second name for the element, and using the second name to navigate through a portion of the data structure maintained at the second computer.
    Type: Grant
    Filed: December 23, 2015
    Date of Patent: October 23, 2018
    Assignee: Ascava, Inc.
    Inventor: Harshvardhan Sharangpani
  • Patent number: 10103747
    Abstract: A method for compressing a data structure generated for a computing system includes: generating a table comprising block values of a set of blocks in the data structure, where a block size of each block in the set of blocks is determined by an architecture of the computing system and the values are a threshold number of the most frequently occurring values; determining whether a first value of a block is stored in the table, where the block occurs; storing, in response to determining that the first value is stored in the table, a table index of the first value in a first data structure; storing, in a second data structure, a second value indicating whether the first value is stored in the table; generating a compressed data structure, where the compressed data structure comprises the table, first data structure and the second data structure.
    Type: Grant
    Filed: December 1, 2017
    Date of Patent: October 16, 2018
    Assignee: International Business Machines Corporation
    Inventors: Shakeeb A. Pasha.B.K., Sachin Gupta, Sunil Kumar
  • Patent number: 10097201
    Abstract: Methods and apparatus are described by for compressing data using LZ77 compression. Embodiments determine an initial run from input data. The initial run includes repeating data at a first location and has a first length. A hash chain is updated with a proper set of hashes from prefixes from the initial run. A first search engine determines a second run that includes the repeating data at a second location. The second run has a second length less than the first length. A first matching location is determined within the input data having the repeating data using the hash chain and the second run. The first matching location is the first location. The first matching location, the second location, and the second length are written to an output buffer. The output buffer includes a compressed version of the input data.
    Type: Grant
    Filed: November 30, 2017
    Date of Patent: October 9, 2018
    Assignee: Intel Corporation
    Inventors: Vinodh Gopal, Daniel F. Cutter
  • Patent number: 10096140
    Abstract: A method of rendering an image in a display apparatus includes acquiring information about a repeated shape that represents at least a part of one or more geometric shapes included in the image and repeatedly occurs in the one or more geometric shapes; acquiring rendering information representing a method of rendering the one or more geometric shapes based on the information about the repeated shape; and rendering the one or more geometric shapes based on the information about the repeated shape and the rendering information.
    Type: Grant
    Filed: September 15, 2015
    Date of Patent: October 9, 2018
    Assignee: SAMSUNG ELECTRONICS CO., LTD.
    Inventor: Francisco Santos
  • Patent number: 10097202
    Abstract: Embodiments of the present invention include a compression system including one or more compressibility inputs; a compression predictor configured to predict the compressibility of data based on the one or more compressibility inputs; a compressor configured to compress the data; and one or more compression inputs. At least one of the compression predictor or the compressor is configured to determine how to compress the data based on the one or more compression inputs. The one or more compressibility inputs comprise at least one of an object extension dictionary, an object signature dictionary, and an entropy estimation algorithm library. The one or more compression inputs comprise at least one of a quality of service profile, a device performance profile and a compression algorithm performance chart.
    Type: Grant
    Filed: August 28, 2017
    Date of Patent: October 9, 2018
    Assignee: Samsung Electronics Co., Ltd.
    Inventors: Yang Seok Ki, Yongsuk Lee, Jason Martineau
  • Patent number: 10089360
    Abstract: Embodiments of the present invention include a memory unit and a processor coupled to a memory unit. The processor is operable to group a plurality of subsets of data from an input data stream and compute a first hash value corresponding to a first grouped subset of data. Additionally, the processor is operable to detect a match between the first hash value and a second hash value stored in a hash table. Furthermore, the processor is also configured to monitor a hash value match frequency for the input data stream in which the processor is operable to increment a counter value responsive to a detection of the match and determine an entropy level for the input data stream based on the counter value relative to a frequent hash value match threshold.
    Type: Grant
    Filed: December 15, 2016
    Date of Patent: October 2, 2018
    Assignee: Western Digital Technologies, Inc.
    Inventors: Ashwin Narasimha, Ashish Singhai, Vijay Karamcheti, Krishanth Skandakumaran
  • Patent number: 10090964
    Abstract: A high-efficiency wireless local-area network (HEW) device including physical layer and medium access control layer circuitry is disclosed. The physical layer and medium access control layer circuitry may be configured to encode data with a binary convolutional code (BCC) to generate encoded data, and interleave the encoded data in accordance with one of a plurality of interleaver configurations for one of a predetermined number of data subcarriers to generate interleaved encoded data. The physical layer and medium access control layer circuitry may be further configured to map the interleaved encoded data with a quadrature amplitude modulation (QAM) greater than 256 QAM onto longer-duration orthogonal frequency division multiplexed (OFDM) symbols, and transmit the longer-duration OFDM symbols on channel resources in accordance with an orthogonal frequency division multiple access (OFDMA) technique.
    Type: Grant
    Filed: September 22, 2015
    Date of Patent: October 2, 2018
    Assignee: Intel IP Corporation
    Inventors: Thomas J. Kenney, Mohamed K. Hassanin, Shahrnaz Azizi
  • Patent number: 10084477
    Abstract: Adaptively compressing an input string (10) comprising a sequence of symbols in order to create a plurality of segment dictionaries Dm, with the steps of: generating a lookup map (110); generating a key value segment Sm,n; searching the lookup map for each symbol received in the input string (120, 130); upon detecting a symbol is not stored in the lookup map, adding the symbol by storing the symbol at a next sequential key index in the lookup map lookup map (135) and assigning a next sequential key value entry to the symbol and adding this key value to the key value segment Sm,n (150); upon detecting the symbol is stored in the lookup map, adding the corresponding key value assigned to this symbol to the next sequential entry of the key value segment Sm,n (150); wherein a new key value segment Sm,n+1 of the lookup map is generated if the number of different symbols equals the number of available key values k=2n for the opened/current key value segment Sm,n (141, 142), and where-in the lookup map is converted
    Type: Grant
    Filed: February 17, 2016
    Date of Patent: September 25, 2018
    Assignee: PARSTREAM GMBH
    Inventor: Norbert Heusser
  • Patent number: 10075266
    Abstract: A method, an apparatus, and a computer program product for wireless communication are provided. The apparatus generates a data transport block, divides the data transport block into a number of sub-blocks. The sub-blocks include at least a first sub-block and a second sub-block, where a size of the first sub-block is different than a size of the second sub-block. The apparatus may encode the number of sub-blocks using different code rates and/or different coding schemes. The apparatus may modulate the encoded sub-blocks using different modulation orders. The apparatus transmits the sub-blocks to a receiver.
    Type: Grant
    Filed: October 6, 2014
    Date of Patent: September 11, 2018
    Assignee: QUALCOMM Incorporated
    Inventors: Tao Luo, Peter Gaal, Wanshi Chen, Aleksandar Damnjanovic, Hao Xu, Michael Mao Wang
  • Patent number: 10070145
    Abstract: A method of dictionary coding using coding unit (CU) based processing or using string length coding by taking into account of color component aligned matched sample-strings are disclosed. In the dictionary coding using CU based processing, the pixels in each CU is converted to one-dimensional (1-D) pixel data according to an intra-block scanning pattern. A string search is then performed to determine a match condition regarding whether a current sample-string starting at a current position of the current 1-D packed pixel data matches a previously coded sample-string in the reference 1-D packed pixel data. For string length coding by taking into account of color component aligned matched sample-strings, a flag is signaled to indicate whether the string length of one previously coded sample-string is in a length group corresponding to color-component-aligned previously coded sample-strings.
    Type: Grant
    Filed: February 4, 2015
    Date of Patent: September 4, 2018
    Assignee: MediaTek Singapore Pte. Ltd.
    Inventors: Jing Ye, Shan Liu
  • Patent number: 10061514
    Abstract: System and method to encode and decode raw data. The method to encode includes receiving a block of uncoded data, decomposing the block of uncoded data into a plurality of data vectors, mapping each of the plurality of data vectors to a bit marker; and storing the bit marker in a memory to produce an encoded representation of the uncoded data. Encoding may further include decomposing the block of uncoded data into default data and non-default data, and mapping only the non-default data. In some embodiments, bit markers may include a seed value and replication rule, or a fractalized pattern.
    Type: Grant
    Filed: October 13, 2017
    Date of Patent: August 28, 2018
    Assignee: FORMULUS BLACK CORPORATION
    Inventor: Brian M. Ignomirello
  • Patent number: 10044370
    Abstract: A method for decompressing a compressed data structure generated for a computing system includes generating a first block from the compressed data structure value by: reading a first indicator from a first field of the compressed data structure; reading a first symbol from a second field of the compressed data structure; determining, using the first indicator, whether the first symbol is compressed; reading, in response to determining that the first symbol is compressed, a block value of the first block from a third field of the compressed data structure, where the block value is stored in the third field at an index indicated by the first symbol, and a block size of each block value of the third field is determined by an instruction set of the computing system. The method further includes generating an uncompressed data structure by storing the first block in an uncompressed data structure.
    Type: Grant
    Filed: December 1, 2017
    Date of Patent: August 7, 2018
    Assignee: International Business Machines Corporation
    Inventors: Shakeeb A. Pasha. B. K., Sachin Gupta, Sunil Kumar
  • Patent number: 10038899
    Abstract: A device generates a file that stores coded samples that contain coded pictures of the video data. The file also includes a sample entry that includes an element that indicates whether all sequence parameter sets (SPSs) that are activated when a stream to which the sample entry applies is decoded have syntax elements that indicate that temporal sub-layer up-switching to any higher temporal sub-layer can be performed at any sample associated with the SPSs. The same or different device determines, based on the element in the sample entry, that all SPSs that are activated when the stream to which the sample entry applies is decoded have syntax elements that indicate that temporal sub-layer up-switching to any higher temporal sub-layer can be performed at any sample associated with the SPSs.
    Type: Grant
    Filed: October 1, 2013
    Date of Patent: July 31, 2018
    Assignee: QUALCOMM Incorporated
    Inventor: Ye-Kui Wang
  • Patent number: 10033405
    Abstract: Data compression using a combination of content independent data compression and content dependent data compression. In one aspect, a system for compressing data comprises: a processor, and a plurality of data compression encoders wherein at least one data encoder utilizes asymmetric data compression. The processor is configured to determine one or more parameters, attributes, or values of the data within at least a portion of a data block containing either video or audio data, to select one or more data compression encoders from the plurality of data compression encoders based upon the determined one or more parameters, attributes, or values of the data and a throughput of a communications channel, and to perform data compression with the selected one or more data compression encoders on at least the portion of the data block.
    Type: Grant
    Filed: November 9, 2015
    Date of Patent: July 24, 2018
    Assignee: Realtime Data LLC
    Inventor: James J. Fallon
  • Patent number: 10019378
    Abstract: A non-transitory computer-readable storage medium may include instructions stored thereon. When executed by at least one processor, the instructions may be configured to cause a computing system to compress data by storing positions of strings that hash to a same hash value in a ring buffer, and retrieving the ring buffer in a single memory operation to determine a longest matching string that hashes to the same hash value.
    Type: Grant
    Filed: October 9, 2014
    Date of Patent: July 10, 2018
    Assignee: GOOGLE LLC
    Inventors: Jyrki Antero Alakuijala, Zoltan Szabadka
  • Patent number: 10002081
    Abstract: A processor includes a memory hierarchy, buffer, and a decompressor. The decompressor includes circuitry to read elements to be decompressed according to a compression scheme, parse the elements to identify literals and matches, and, with the literals and matches, generate an intermediate token stream formatted for software-based copying of the literals and matches to produce decompressed data. The intermediate token stream is to include a format for multiple tokens that are to be written in parallel with each other, and another format for tokens that include a data dependency upon themselves.
    Type: Grant
    Filed: July 5, 2016
    Date of Patent: June 19, 2018
    Assignee: Intel Corporation
    Inventors: James D. Guilford, Vinodh Gopal, Kirk S. Yap
  • Patent number: 10003356
    Abstract: An encoder for encoding data to generate corresponding encoded data including information indicative of a frequency, probability or range of one or more symbols to be represented in the encoded data. The encoder can include in the encoded data additional information indicative of whether information indicative of a frequency, probability or range for at least one symbol amongst the one or more symbols is in the encoded data. The encoder can include in the encoded data the additional information of whether information indicative of a frequency, probability or range for at least one symbol amongst the one or more symbols in the encoded data expressed as single availability bit information. The encoder can represent inclusion of information indicative of the frequency, probability or range information by use of a single availability bit value “7”, and non-inclusion of information indicative of the frequency, probability or range information by use of a single availability bit value “0”.
    Type: Grant
    Filed: February 20, 2015
    Date of Patent: June 19, 2018
    Assignee: Gurulogic Microsystems Oy
    Inventors: Kai Willner, Ossi Kalevo