To Or From Variable Length Codes Patents (Class 341/67)
  • Patent number: 10305512
    Abstract: An encoding method and apparatus is described. In an encoding method, when a first target sub-block in a target block is obtained, a hash operation is first performed on the first target sub-block. Then, a first hash table is queried for a corresponding hash value according to an operation result, and a corresponding location in a reference block is found according to the hash value obtained by means of query, that is, first reference data is found. The first piece of target data in the first target sub-block is matched with the first reference data, and second target data in the target block is matched with second reference data in the reference block. In this way, an approximate location is predetermined, so that a range in which matching needs to be performed is narrowed, a data compression time is reduced, and data compression efficiency is improved.
    Type: Grant
    Filed: March 16, 2018
    Date of Patent: May 28, 2019
    Assignee: HUAWEI TECHNOLOGIES, CO., LTD.
    Inventors: Kun Guan, Jinan Leng, Gongyi Wang, Shaohui Quan, Jianqiang Shen
  • Patent number: 10298963
    Abstract: A method and apparatus for sample adaptive offset without sign coding. The method includes selecting an edge offset type for at least a portion of an image, classifying at least one pixel of at least the portion of the image into edge shape category, calculating an offset of the pixel, determining the offset is larger or smaller than a predetermined threshold, changing a sign of the offset based on the threshold determination; and performing entropy coding accounting for the sign of the offset and the value of the offset.
    Type: Grant
    Filed: January 28, 2016
    Date of Patent: May 21, 2019
    Assignee: Texas Instruments Incorporated
    Inventors: Woo-Shik Kim, Do-Kyoung Kwon
  • Patent number: 10277921
    Abstract: Decoder techniques in accordance with embodiment of the present technology include partially decoding a compressed file on a serial based processing unit to find offsets of each of a plurality of entropy data blocks. The compressed file and offset for each of the plurality of entropy encoded data blocks are transferred to a parallel based processing unit. Thereafter, the compressed file is at least partially decoded on the parallel based processing unit using the offset for each of the plurality of entropy encoded data blocks.
    Type: Grant
    Filed: November 20, 2015
    Date of Patent: April 30, 2019
    Assignee: NVIDIA CORPORATION
    Inventors: Michal Krasnoborski, Michael Clair Houston, Michael Denis O'Connor, Steven Gregory Parker
  • Patent number: 10277256
    Abstract: Aspects of the disclosure provide a method for accelerating a decoding process. The method includes receiving first bit reliability values (BRVs) of a first codeword corresponding to a first bit sequence of an information block, receiving second BRVs of a second codeword corresponding to a second bit sequence of the information block, aggregating respective first BRVs and second BRVs into an aggregated. BRV for each static code bit of the second codeword, and decoding the second codeword to recover the second bit sequence of the information block using the aggregated BRVs of each static code bit of the second codeword.
    Type: Grant
    Filed: December 28, 2016
    Date of Patent: April 30, 2019
    Assignee: MEDIATEK INC.
    Inventor: Xiu-Sheng Li
  • Patent number: 10263637
    Abstract: Technologies for performing speculative decompression include a managed node to decode a variable size code at a present position in compressed data with a deterministic decoder and concurrently perform speculative decodes over a range of subsequent positions in the compressed data, determine the position of the next code, determine whether the position of the next code is within the range, and output, in response to a determination that the position of the next code is within the range, a symbol associated with the deterministically decoded code and another symbol associated with a speculatively decoded code at the position of the next code.
    Type: Grant
    Filed: December 26, 2017
    Date of Patent: April 16, 2019
    Assignee: Intel Corporation
    Inventors: Vinodh Gopal, James D. Guilford, Kirk S. Yap
  • Patent number: 10261788
    Abstract: A processor includes a plurality of packed data registers. The processor also includes a decode unit to decode a packed variable length code point length determination instruction. The instruction is to indicate a first source packed data that is to have a plurality of packed variable length code points that are each to represent a character. The instruction is also to indicate a destination storage location. The processor also has an execution unit coupled with the decode unit and the packed data registers. The execution unit, in response to the instruction, is to store a result packed data in the indicated destination storage location. The result packed data is to have a length for each of the plurality of the packed variable length code points. Other processors, methods, systems, and instructions are also disclosed.
    Type: Grant
    Filed: April 17, 2017
    Date of Patent: April 16, 2019
    Assignee: Intel Corporation
    Inventor: Shihjong Kuo
  • Patent number: 10255925
    Abstract: The present technology relates to an encoder and an encoding method, a decoder and a decoding method, and a program by which encoding efficiency is able to be improved by constraining an appearance probability of a predetermined quantization value of an encoding target to 0 when encoding with a combination of Huffman encoding and multidimensional encoding is performed.
    Type: Grant
    Filed: August 18, 2017
    Date of Patent: April 9, 2019
    Assignee: SONY CORPORATION
    Inventors: Shiro Suzuki, Yuuki Matsumura, Yasuhiro Toguri, Yuuji Maeda, Jun Matsumoto
  • Patent number: 10255547
    Abstract: In one embodiment of the present invention, a convolution engine configures a parallel processing pipeline to perform multi-convolution operations. More specifically, the convolution engine configures the parallel processing pipeline to independently generate and process individual image tiles. In operation, for each image tile, the pipeline calculates source locations included in an input image batch based on one or more start addresses and one or more offsets. Subsequently, the pipeline copies data from the source locations to the image tile. The pipeline then performs matrix multiplication operations between the image tile and a filter tile to generate a contribution of the image tile to an output matrix. To optimize the amount of memory used, the pipeline creates each image tile in shared memory as needed. Further, to optimize the throughput of the matrix multiplication operations, the values of the offsets are precomputed by a convolution preprocessor.
    Type: Grant
    Filed: November 25, 2015
    Date of Patent: April 9, 2019
    Assignee: NVIDIA CORPORATION
    Inventors: John Clifton Woolley, Jr., John Tran
  • Patent number: 10230393
    Abstract: A compression algorithm based on Huffman coding is disclosed that is adapted to be readily implemented using VLSI design. A data file may be processed to replace duplicate data with a copy commands including an offset and length, such as according to the LV algorithm. A Huffman code may then be generated for parts of the file. The Huffman code may be generated according to a novel method that generates Huffman code lengths for literals in a data file without first sorting the literal statistics. The Huffman code lengths may be constrained to be no longer than a maximum length and the Huffman code may be modified to provide an acceptable overflow probability and be in canonical order. Literals, offsets, and lengths may be separately encoded. The different values for these data sets may be assigned to a limited number of bins for purpose of generating usage statistics used for generating Huffman codes.
    Type: Grant
    Filed: August 30, 2017
    Date of Patent: March 12, 2019
    Assignee: Tidal Systems, Inc.
    Inventors: Yingquan Wu, Alexander Hubris
  • Patent number: 10209944
    Abstract: A first terminal device shares a first interface with a second terminal device. If the first terminal device obtains a notification message to trigger generation of a second interface, the first terminal device first determines whether the second interface belongs to a preset sharing-forbidden interface. If the second interface belongs to the preset sharing-forbidden interface, the first terminal device shares only the first interface with the second terminal device, or suspends interface sharing with the second terminal device.
    Type: Grant
    Filed: November 25, 2014
    Date of Patent: February 19, 2019
    Assignee: Huawei Technologies Co., Ltd.
    Inventors: Zhenwei Shan, Cunzhi Fan
  • Patent number: 10200546
    Abstract: Methods and apparatus are disclosed to identify media using hash keys. An example disclosed method includes generating a hash key based on first samples of media. In the disclosed example method, the first samples corresponds to a portion of the media sampled in a buffer of a computing device. The example method also includes applying a blurring function to the hash key to generate a blurred hash key. The example method also includes generating first confirmation data based on second samples of the media. The example method also includes storing the blurred hash key in association with the first confirmation data and first reference data in a memory separate from the buffer of the sampled media. In the example methods, the reference data identifies the portion of the media.
    Type: Grant
    Filed: September 25, 2015
    Date of Patent: February 5, 2019
    Assignee: The Nielsen Company (US), LLC
    Inventors: Daniel Nelson, Donald Miner
  • Patent number: 10142613
    Abstract: An image processing apparatus includes: a first cost calculating section configured to calculate similarity degrees between a first pixel in a first image and plural second pixels located in a horizontal-direction first range in a second image, and extract a second pixel with a highest similarity degree; a second cost calculating section configured to calculate a similarity degree between plural third pixels in a vertical-direction second range including the extracted second pixel and the first pixel and extract a third pixel with a highest similarity degree; an amount-of-difference buffer recording difference between a vertical-position of the extracted third pixel and the first pixel as an amount of difference; and a second position setting section configured to determine positions of the second pixels for which a similarity degree to the first pixel for which a disparity is calculated next is calculated.
    Type: Grant
    Filed: February 29, 2016
    Date of Patent: November 27, 2018
    Assignee: Kabushiki Kaisha Toshiba
    Inventor: Toru Sano
  • Patent number: 10140046
    Abstract: A processing system is provided that includes a memory for storing an input bit stream and a processing logic, operatively coupled to the memory, to generate a first score based on: a first set of matching data related to a match between a first bit subsequence and a candidate bit subsequence within the input bit stream, and a first distance of the candidate bit subsequence from the first set of matching data. A second score is generated based on a second set of matching data related to a match between a second bit subsequence and the candidate bit subsequence, and a second distance of the candidate bit subsequence from the second set of matching data. A code to replace the first or second bit subsequence in an output bit stream is identified. Selection of the one of the bit subsequences to replace is based on a comparison of the scores.
    Type: Grant
    Filed: July 28, 2017
    Date of Patent: November 27, 2018
    Assignee: Intel Corporation
    Inventors: James D. Guilford, Vinodh Gopal, Gilbert M. Wolrich, Daniel F. Cutter
  • Patent number: 10110896
    Abstract: An adaptive Motion JPEG encoding method is disclosed, including: acquiring a video sequence; encoding a current video frame of the video sequence into JPEG format based on a Huffman description table, generating encoded symbols corresponding to the current video frame and counting frequencies of occurrence of the encoded symbols corresponding to the current video frame; and updating the Huffman description table with Canonical Huffman encoding based on the frequencies of occurrence of the encoded symbols corresponding to the current video frame, the updated Huffman description table being used for encoding a next video frame adjacent to the current video frame of the video sequence into JPEG format. The adaptive Motion JPEG encoding method uses the correlation between the Huffman description tables of the adjacent frames to reduce the redundant information between the video frames. An adaptive Motion JPEG encoding system is also disclosed.
    Type: Grant
    Filed: January 29, 2016
    Date of Patent: October 23, 2018
    Assignee: Zhuhai Jieli Technology Co., Ltd.
    Inventors: Guibin Wang, Jiada Chen
  • Patent number: 10104381
    Abstract: A moving picture coding method includes partitioning a picture into blocks each of which includes pixels, selecting a scanning scheme from among plural scanning schemes, scanning the blocks according to the selected scanning scheme, and coding the blocks in an order in which the blocks are scanned. In the partitioning, the picture is partitioned into rows and columns of macroblocks each of which is partitioned into the blocks. The plural scanning schemes include a first scanning scheme for scanning the blocks in the marcroblock per row of blocks.
    Type: Grant
    Filed: August 10, 2015
    Date of Patent: October 16, 2018
    Assignee: SUN PATENT TRUST
    Inventors: Torsten Palfner, Thomas Wedi
  • Patent number: 10091175
    Abstract: A mobile device and an authentication server are configured to re-establish a security context that was previously established using an Authentication Key Agreement (AKA) procedure. The re-establishment advantageously uses re-use information saved from the preceding AKA procedure, including using synchronization information for each such re-establishment that occurs between AKA procedures. The synchronization information particularly identifies each instance of re-establishment and depends on a sequence number assigned to the preceding AKA procedure and on any previous instances of re-establishing the security context.
    Type: Grant
    Filed: March 1, 2016
    Date of Patent: October 2, 2018
    Assignee: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Karl Norrman, Rolf Blom, Mats Näslund
  • Patent number: 10063892
    Abstract: Residual vectors are compressed in a lossless compression scheme suitable for cloud DVR video content applications. Thus, a cloud DVR service provider can take many copies of the same file stored in the cloud and save storage space by compressing those copies while still maintaining their status as distinct copies, one per user. Vector quantization is used for compressing already-compressed video streams (e.g., MPEG streams). As vector quantization is a lossy compression scheme, the residual vector has to be stored to regenerate the original video stream at the decoding (playback) node. Entropy coding schemes like Arithmetic or Huffman coding can be used to compress the residual vectors. Additional strategies can be implemented to further optimize this residual compression. In some embodiments, the techniques operate to provide a 25-50% improvement in compression. Storage space is thus more efficiently used and video transmission may be faster in some cases.
    Type: Grant
    Filed: December 10, 2015
    Date of Patent: August 28, 2018
    Assignee: Adobe Systems Incorporated
    Inventors: Viswanathan Swaminathan, Saayan Mitra, Akshay Malhotra
  • Patent number: 10044369
    Abstract: Embodiments are directed towards efficient variable length encoding and decoding of numerical data sets using new interleaved start-step codes. The proposed codes minimize the space required to represent and store numerical values in data intensive applications. Efficient implementations are possible at higher processing speeds and reduced code size than current state-of-the-art codes. Encoding engines select one of a plurality of numerical values from an input stream. The encoding engines convert each numerical value into a codeword. Each codeword consists of a plurality of data bits interleaved with a group of control bits. The encoding engines provide each codeword to an encoded stream. Decoding engines select one of a plurality of codewords from an encoded stream. The decoding engines convert each codeword into a numerical value. The decoding engines provide each codeword to an output stream. Interleaved codes can add intrinsic value to Blockchain applications and the Internet of Things (IoT).
    Type: Grant
    Filed: March 16, 2018
    Date of Patent: August 7, 2018
    Assignee: Centri Technology, Inc.
    Inventors: Luis Gerardo Paris, Michael Patrick Mackey
  • Patent number: 10034194
    Abstract: An apparatus includes a processor a channel state information (CSI) module operative on the processor to evaluate channel state information for a multiplicity of transmission points and to allocate a selection of channel state information reference signals (CSI-RS) to an uplink sub-frame allotted for transmitting channel quality/precoding matrix index/rank indicator (CQI/PMI/RI) information to a transmission point. The apparatus may further include a wireless transceiver operative to transmit the selection of CSI-RS in the uplink sub-frame to the transmission point in a wireless network, and receive information from the transmission point in response to the CSI-RS and a digital display operative to present the information received from the transmission point.
    Type: Grant
    Filed: September 28, 2011
    Date of Patent: July 24, 2018
    Assignee: INTEL CORPORATION
    Inventors: Yuan Zhu, Alexei Davydov, Kamran Etemad, Qinghua Li, Xiaogang Chen, Jong-Kae Fwu
  • Patent number: 10027992
    Abstract: Residual vectors are compressed in a lossless compression scheme suitable for cloud DVR video content applications. Thus, a cloud DVR service provider can take many copies of the same file stored in the cloud and save storage space by compressing those copies while still maintaining their status as distinct copies, one per user. Vector quantization is used for compressing already-compressed video streams (e.g., MPEG streams). As vector quantization is a lossy compression scheme, the residual vector has to be stored to regenerate the original video stream at the decoding (playback) node. Entropy coding schemes like Arithmetic or Huffman coding can be used to compress the residual vectors. Additional strategies can be implemented to further optimize this residual compression. In some embodiments, the techniques operate to provide a 25-50% improvement in compression. Storage space is thus more efficiently used and video transmission may be faster in some cases.
    Type: Grant
    Filed: December 10, 2015
    Date of Patent: July 17, 2018
    Assignee: Adobe Systems Incorporated
    Inventors: Viswanathan Swaminathan, Saayan Mitra, Akshay Malhotra
  • Patent number: 9978380
    Abstract: An audio decoder for providing a decoded audio information includes a arithmetic decoder for providing a plurality of decoded spectral values on the basis of an arithmetically-encoded representation of the spectral values and a frequency-domain-to-time-domain converter for providing a time-domain audio representation using the decoded spectral values. The arithmetic decoder is configured to select a mapping rule describing a mapping of a code value onto a symbol code in dependence on a context state. The arithmetic decoder is configured to determine or modify the current context state in dependence on a plurality of previously-decoded spectral values. The arithmetic decoder is configured to detect a group of a plurality of previously-decoded spectral values, which fulfill, individually or taken together, a predetermined condition regarding their magnitudes, and to determine the current context state in dependence on a result of the detection. An audio encoder uses similar principles.
    Type: Grant
    Filed: November 18, 2013
    Date of Patent: May 22, 2018
    Assignee: Fraunhofer-Gesellschaft zur Foerderung der angewandten Forschung e.V.
    Inventors: Guillaume Fuchs, Vignesh Subbaraman, Nikolaus Rettelbach, Markus Multrus, Marc Gayer, Patrick Warmbold, Christian Griebel, Oliver Weiss
  • Patent number: 9955155
    Abstract: Disclosed herein is a method for coding image information, including: generating prediction information by predicting information on a current coding unit; and determining whether the information on the current coding unit is the same as the prediction information, wherein when the information on the current coding unit is the same as the prediction information, a flag indicating that the information on the current coding unit is the same as the prediction information is coded and transmitted, and when the information on the current coding unit is not the same as the prediction information, the flag indicating that the information on the current coding unit is not the same as the prediction information and the information on the current coding unit are coded and transmitted.
    Type: Grant
    Filed: December 30, 2011
    Date of Patent: April 24, 2018
    Assignees: ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE, University-Industry Cooperation Group of Kyung Hee University
    Inventors: Se Yoon Jeong, Hui Yong Kim, Sung Chang Lim, Jin Ho Lee, Ha Hyun Lee, Jong Ho Kim, Jin Soo Choi, Jin Woong Kim, Chie Teuk Ahn, Gwang Hoon Park, Kyung Yong Kim, Han Soo Lee, Tae Ryong Kim
  • Patent number: 9948953
    Abstract: Systems, apparatus, articles, and methods are described including operations for size based transform unit context derivation.
    Type: Grant
    Filed: June 30, 2015
    Date of Patent: April 17, 2018
    Assignee: Intel Corporation
    Inventors: Wenhao Zhang, Yi-Jen Chiu, Pieter Kapsenberg, Lidong Xu, Yu Han, Zhipin Apple Deng, Xiaoxia Cai
  • Patent number: 9948936
    Abstract: An image coding method includes: generating a predicted block; calculating a residual block; calculating quantized coefficients by performing transform and quantization on the residual block; calculating a coded residual block by performing inverse quantization and inverse transform on the quantized coefficients; generating a temporary coded block; determining whether or not an offset process is required, to generate first flag information indicating a result of the determination; executing the offset process on the temporary coded block when it is determined that the offset process is required; and performing variable-length coding on the quantized coefficients and the first flag information.
    Type: Grant
    Filed: October 5, 2017
    Date of Patent: April 17, 2018
    Assignee: SUN PATENT TRUST
    Inventors: Toru Matsunobu, Takahiro Nishi, Youji Shibahara, Hisao Sasai, Kyoko Tanikawa, Toshiyasu Sugio
  • Patent number: 9924186
    Abstract: Provided is a method that de-multiplexes a bit stream to extract intra prediction mode information and residual signals, restores an intra prediction mode of a current prediction unit using the intra prediction information and intra prediction modes of prediction units adjacent to the current prediction unit, generates reference pixels using one or more available reference pixel if there exist unavailable reference pixels of the prediction unit, adaptively filters the reference pixels based on the restored intra prediction mode, generates a prediction block using the restored intra prediction mode and the reference pixels, decodes the residual signal to generating a residual block, and generates a reconstructed block using the prediction block and the residual block. Accordingly, additional bits resulted from increase of a number of intra prediction mode are effectively reduced. Also, an image compression ratio can be improved by generating a prediction block similar to an original block.
    Type: Grant
    Filed: June 22, 2016
    Date of Patent: March 20, 2018
    Assignee: M&K HOLDINGS INC.
    Inventors: Soo Mi Oh, Moonock Yang
  • Patent number: 9864549
    Abstract: Systems and methods relating generally to data storage, and more particularly to systems and methods for encoding to modify the size of an information set.
    Type: Grant
    Filed: February 29, 2016
    Date of Patent: January 9, 2018
    Assignee: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.
    Inventors: Shaohua Yang, Han Fang, Wu Chang, Kelly Fitzpatrick
  • Patent number: 9859918
    Abstract: Technologies for performing speculative decompression include a managed node to decode a variable size code at a present position in compressed data with a deterministic decoder and concurrently perform speculative decodes over a range of subsequent positions in the compressed data, determine the position of the next code, determine whether the position of the next code is within the range, and output, in response to a determination that the position of the next code is within the range, a symbol associated with the deterministically decoded code and another symbol associated with a speculatively decoded code at the position of the next code.
    Type: Grant
    Filed: March 30, 2017
    Date of Patent: January 2, 2018
    Assignee: Intel Corporation
    Inventors: Vinodh Gopal, James D. Guilford, Kirk S. Yap
  • Patent number: 9842130
    Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.
    Type: Grant
    Filed: July 19, 2016
    Date of Patent: December 12, 2017
    Assignee: Robert T. and Virginia T. Jenkins as Trustees of the Jenkins Family Trust Dated Feb. 8, 2002
    Inventors: Karl Schiffmann, Mark Andrews, Jack J. LeTourneau
  • Patent number: 9832287
    Abstract: A method of decoding a dynamic Huffman encoded data stream comprising receiving, by a processor, one or more input bits of encoded data from among an encoded data stream, searching, by the processor, a ternary content addressable memory (TCAM) for one or more codewords, accessing, by the processor, a plurality of random access memories (RAMs) that comprise the TCAM and have a maximum number of entries that is less than or equal to one half of two to a power of a maximum number of bits to be searched, reading a value from a first level RAM and using the value to index to a second level RAM, and outputting, by the processor, a codeword length and a decoded codeword value from either the first or second level RAM.
    Type: Grant
    Filed: March 30, 2015
    Date of Patent: November 28, 2017
    Assignee: Comtech EF Data Corp.
    Inventors: Seth Sjoholm, Edward Ray Coulter
  • Patent number: 9819358
    Abstract: An encoder stage, and corresponding encoded bitstream and decoder. The encoder stage comprises: a variable length encoder for encoding an input signal; and a counter configured to dynamically detect an observed frequency at which different symbols are found to occur within each of a plurality of predetermined portions of the input signal, prior to the symbols of each respective portion being encoded by the variable length encoder. The variable length encoder is configured to encode the symbols of each portion using variable length coding performed in dependence on the observed frequencies detected within the respective portion of the input signal, to generate an encoded bitstream comprising the encoded symbols along with an additional element indicating information regarding the observed frequencies detected for each portion, and to output the encoded bitstream to at least one of a storage medium and a transmission medium for supply to a decoder.
    Type: Grant
    Filed: July 16, 2010
    Date of Patent: November 14, 2017
    Assignee: Skype
    Inventors: Renat Vafin, Lazar Bivolarsky, Mattias Nilsson, Soren Vang Andersen
  • Patent number: 9813717
    Abstract: An image coding method includes: generating a predicted block; calculating a residual block; calculating quantized coefficients by performing transform and quantization on the residual block; calculating a coded residual block by performing inverse quantization and inverse transform on the quantized coefficients; generating a temporary coded block; determining whether or not an offset process is required, to generate first flag information indicating a result of the determination; executing the offset process on the temporary coded block when it is determined that the offset process is required; and performing variable-length coding on the quantized coefficients and the first flag information.
    Type: Grant
    Filed: June 28, 2016
    Date of Patent: November 7, 2017
    Assignee: SUN PATENT TRUST
    Inventors: Toru Matsunobu, Takahiro Nishi, Youji Shibahara, Hisao Sasai, Kyoko Tanikawa, Toshiyasu Sugio
  • Patent number: 9807395
    Abstract: A method for decoding video includes receiving quantized coefficients representative of a block of video representative of a plurality of pixels. The quantized coefficients are dequantized based upon a function of a remainder. The dequantized coefficients are inverse transformed to determine a decoded residue.
    Type: Grant
    Filed: January 18, 2011
    Date of Patent: October 31, 2017
    Assignee: Dolby International AB
    Inventors: Louis Joseph Kerofsky, Kiran Misra, Christopher A. Segall
  • Patent number: 9798756
    Abstract: System, method and computer program products for probing a hash table by receiving a compressed input key, computing a hash value for the compressed input key and probing one or more buckets in a hash table for a match. Each bucket includes multiple chunks. For a bucket in the hash table, chunks are searched in that bucket by comparing in parallel the hash value with multiple slots in each chunk, such that if a value in a chunk equals the hash value of the compressed input key, then a match is declared and a vector is returned with a significant bit of a matching slot in the bucket set to a value. If a value stored in a chunk corresponds to an empty slot, then a mismatch is declared, and the vector is returned as the result with the significant bit of a matching empty slot set to the value.
    Type: Grant
    Filed: May 29, 2015
    Date of Patent: October 24, 2017
    Assignee: International Business Machines Corporation
    Inventors: Min-Soo Kim, Lin Qiao, Vijayshankar Raman, Eugene J. Shekita
  • Patent number: 9787323
    Abstract: To decompress encoded data, a Huffman code tree stored in a data header may need to be decompressed and rebuilt. A bit length histogram table is used in a hardware design to more efficiently decompress the Huffman code tree. The bit length histogram table relates each bit length used by the Canonical Huffman Code (CHC) symbols to a corresponding number of symbols in the encoding that have that bit length. Performing decompression using bit length histogram table allows part of the Huffman tree decompression to be performed in a single pass.
    Type: Grant
    Filed: March 30, 2017
    Date of Patent: October 10, 2017
    Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC
    Inventors: Robert W. Havlik, Michael J. Erickson, Amar Vattakandy, Derek E. Gladding
  • Patent number: 9781418
    Abstract: This disclosure relates to implementing an adaptive deadzone for one or more quantized coefficients in a quantized block. In particular, one or more candidate blocks with one or more coefficients and an end of block (EOB) indicator are generated. The one or more coefficients are a subset of the one or more quantized coefficients in the quantized block. A cost value for each of the one or more candidate blocks is calculated based at least in part on a rate value and a distortion value of the one or more coefficients in each of the one or more candidate blocks. Accordingly, a candidate block from the one or more candidate blocks with a lowest calculated cost value is selected as an output block.
    Type: Grant
    Filed: June 12, 2012
    Date of Patent: October 3, 2017
    Assignee: GOOGLE INC.
    Inventors: Juha Pekka Maaninen, Janne Salonen
  • Patent number: 9712458
    Abstract: In one embodiment, for each particular multicast flow of a plurality of multicast flows of packets a particular consolidation encoding of a plurality of consolidation encodings is selected based on the sparseness of bit positions within a bit string corresponding to designated receiving packet switching devices of the particular multicast flow. The packet switching device sends one or more packets corresponding to said particular packet, with each of these one or more packets including designated receiving packet switching devices of the particular multicast flow in the header of said particular packet according to the particular consolidation encoding. In one embodiment, different consolidation encodings of the plurality of consolidation encodings are used for at least two different multicast flows of the plurality of multicast flows of packets. In one embodiment, each of said receiving packet switching devices is Bit Index Explicit Replication (BIER) Bit-Forwarding Router (BFR).
    Type: Grant
    Filed: April 12, 2015
    Date of Patent: July 18, 2017
    Assignee: Cisco Technology, Inc.
    Inventors: Ijsbrand Wijnands, Gregory J. Shepherd, Neale David Raymond Ranns, Stewart Frederick Bryant
  • Patent number: 9690490
    Abstract: A method for writing data, a memory storage device and a memory control circuit unit are provided. The method includes receiving a write command and first data corresponding to the write command, obtaining initial data transmission information of the first data and determining whether the initial data transmission information conforms to a predetermined condition, compressing the first data to second data and writing the second data into a rewritable non-violate memory module if the initial data transmission information conforms to the predetermined condition, and writing the uncompressed first data into the rewritable non-violate memory module if the initial data transmission information does not conform to the predetermined condition.
    Type: Grant
    Filed: April 16, 2014
    Date of Patent: June 27, 2017
    Assignee: PHISON ELECTRONICS CORP.
    Inventors: Chih-Kang Yeh, Li-Chun Liang
  • Patent number: 9684623
    Abstract: An integrated circuit device is disclosed including core circuitry and interface circuitry. The core circuitry outputs in parallel a set of data bits, while the interface circuitry couples to the core circuitry. The interface circuitry receives in parallel a first number of data bits among the set of data bits from the core circuitry and outputs in parallel a second number of data bits. The ratio of the first number to the second number is a non-power-of-2 value.
    Type: Grant
    Filed: March 15, 2012
    Date of Patent: June 20, 2017
    Assignee: Rambus Inc.
    Inventor: Frederick A. Ware
  • Patent number: 9667987
    Abstract: An apparatus comprising a codec configured to predict an intra mode for a considered pixel block based on a plurality of coded intra modes for a plurality of adjacent pixel blocks to the considered pixel block, wherein the predicted intra mode and the coded intra modes correspond to a set of intra-frame modes that comprise a plurality of directional intra modes and at least two non-directional intra modes and that are assigned a plurality of corresponding group numbers and group index numbers, and wherein the intra mode is predicted based on the group numbers and group index numbers of the coded intra modes.
    Type: Grant
    Filed: March 9, 2012
    Date of Patent: May 30, 2017
    Assignee: Futurewei Technologies, Inc.
    Inventors: Lingzhi Liu, Guichun Li, Nam Ling, Jianhua Zheng, Chenxiong Zhang
  • Patent number: 9654280
    Abstract: A white-box cryptographic system is presented wherein at least one of its internal values is represented using an input dependent encoding. The system comprises a network of a plurality of basic blocks arranged for collectively performing a cryptographic operation. An encoder is arranged for encoding output data of a first one of the plurality of basic blocks into an encoder-output according to a selected one of a plurality of encoding schemes, said selection depending on an input-message to the system. A compensator is arranged for recoding intermediate data to compensate for the effect of the encoding according to a selected one of a plurality of recoding schemes. Using variable encodings instead of fixed encodings complicates reverse engineering the white-box cryptographic system.
    Type: Grant
    Filed: March 5, 2010
    Date of Patent: May 16, 2017
    Assignee: IRDETO B.V.
    Inventors: Wilhelmus Petrus Adrianus Johannus Michiels, Paulus Mathias Hubertus Mechtildis Antonius Gorissen
  • Patent number: 9633664
    Abstract: An audio decoder includes an arithmetic decoder for providing decoded spectral values on the basis of an arithmetically-encoded representation of the spectral values and a frequency-domain-to-time-domain converter for providing a time-domain audio representation using the decoded spectral values. The arithmetic decoder selects a mapping rule describing a mapping of a code value onto a symbol code in dependence on a context state described by a numeric current context value, and determines the numeric current context value in dependence on a plurality of previously-decoded spectral values. The arithmetic decoder modifies a number representation of a numeric previous context value, describing a context state associated with one or more previously decoded spectral values, in dependence on a context subregion value, to acquire a number representation of a numeric current context value describing a context state associated with one or more spectral values to be decoded. An audio encoder uses a similar concept.
    Type: Grant
    Filed: September 19, 2014
    Date of Patent: April 25, 2017
    Assignee: Fraunhofer-Gesellschaft zur Foerderung der angewandten Forschung e.V.
    Inventors: Vignesh Subbaraman, Guillaume Fuchs, Markus Multrus, Nikolaus Rettelbach, Oliver Weiss, Marc Gayer, Patrick Warmbold, Christian Griebel
  • Patent number: 9594695
    Abstract: A processing system is provided that includes a memory for storing an input bit stream and a processing logic, operatively coupled to the memory, to generate a first score based on: a first set of matching data related to a match between a first bit subsequence and a candidate bit subsequence within the input bit stream, and a first distance of the candidate bit subsequence from the first set of matching data. A second score is generated based on a second set of matching data related to a match between a second bit subsequence and the candidate bit subsequence, and a second distance of the candidate bit subsequence from the second set of matching data. A code to replace the first or second bit subsequence in an output bit stream is identified. Selection of the one of the bit subsequences to replace is based on a comparison of the scores.
    Type: Grant
    Filed: August 5, 2016
    Date of Patent: March 14, 2017
    Assignee: Intel Corporation
    Inventors: James D. Guilford, Vinodh Gopal, Gilbert M. Wolrich, Daniel F. Cutter
  • Patent number: 9577668
    Abstract: Apparatuses, systems, and computer program products that encode and/or decode information of a video stream, such as an MPEG-4 video stream, are disclosed. Some embodiments comprise an apparatus having a binarizer module to create a plurality of bins for a syntax element for information of the video stream, a context selection module to generate an index value and a most probable symbol (MPS) value for encoding the plurality of bins, and an arithmetic coding module to encode a first and a second bin of the plurality of bins based on a first probability value and a second probability value, respectively, wherein the first and second probability values are determined via the generated index value and MPS value. Examples of some embodiments are high definition personal video recorders, transcoders, computers, personal digital assistants, cellular telephones, portable video players, high definition digital versatile disc (HD-DVD) devices, and Blu-ray disc-read only memory (BD-ROM) devices.
    Type: Grant
    Filed: August 30, 2013
    Date of Patent: February 21, 2017
    Assignee: Intel Corporation
    Inventor: Musa Jahanghir
  • Patent number: 9571538
    Abstract: A computer-implemented method, computer program product, and computing system is provided for managing quality of experience for communication sessions. In an implementation, a method may include determining a change in an optimum video size for a streaming video. The method may also include determining one or more constraints of resizing associated with the change in the desired video size. The method may further include adaptively resizing the streaming video to a current desired video size when the one or more constraints of resizing exceed a threshold value.
    Type: Grant
    Filed: February 6, 2015
    Date of Patent: February 14, 2017
    Assignee: International Business Machines Corporation
    Inventors: Hitham Ahmed Assem Aly Salama, Alfredo del Campo del Corral, Carlos Martin-Nieto Gonzalez, Luis Pinto, Nirmala Venkatraman
  • Patent number: 9571535
    Abstract: A computer-implemented method, computer program product, and computing system is provided for managing quality of experience for communication sessions. In an implementation, a method may include determining a change in an optimum video size for a streaming video. The method may also include determining one or more constraints of resizing associated with the change in the desired video size. The method may further include adaptively resizing the streaming video to a current desired video size when the one or more constraints of resizing exceed a threshold value.
    Type: Grant
    Filed: June 12, 2014
    Date of Patent: February 14, 2017
    Assignee: International Business Machines Corporation
    Inventors: Hitham Ahmed Assem Aly Salama, Alfredo del Campo del Corral, Carlos Martin-Nieto Gonzalez, Luis Pinto, Nirmala Venkatraman
  • Patent number: 9538044
    Abstract: A computer-implemented method comprises receiving a data stream that includes a series of code words that encodes a respective series of pixel data according to a first entropy coding lookup table, and processing the data stream to determine if there is a match between a first code word and a consecutive second code word, and a code word entry in a second entropy coding lookup table. The method also includes, if there is a match, decoding the first code word and the second code word using the second entropy coding lookup table. Further, the method includes, if there is not a match, decoding the first code word using the first entropy coding lookup table.
    Type: Grant
    Filed: March 20, 2015
    Date of Patent: January 3, 2017
    Assignee: KYOCERA Document Solutions Inc.
    Inventors: Dongpei Su, Kenneth A. Schmidt, Thien-Phuc Nguyen Do, Sheng Li
  • Patent number: 9536275
    Abstract: A system and method uses the capabilities of a geometry shader unit within the multi-threaded graphics processor to implement algorithms with variable input and output.
    Type: Grant
    Filed: November 2, 2007
    Date of Patent: January 3, 2017
    Assignee: Nvidia Corporation
    Inventor: Franck R. Diard
  • Patent number: 9524725
    Abstract: Between a method in which an integer signal code is obtained by using an encoding method based on periodicity and a method in which an integer signal code is obtained using an encoding method which is not based on periodicity using an index indicating a degree of periodicity of a sample sequence in a frequency domain, processing of a first coder is executed only in a method for which the number of bits of the integer signal code is expected to be reduced, and a gain obtained through the processing of the first coder in the method for which the number of bits of the integer signal code is expected to be reduced is utilized in a method for which the number of bits of the integer signal code is not expected to be reduced.
    Type: Grant
    Filed: September 30, 2013
    Date of Patent: December 20, 2016
    Assignee: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
    Inventors: Takehiro Moriya, Yutaka Kamamoto, Noboru Harada
  • Patent number: 9525876
    Abstract: The amount of processing is reduced with high coding efficiency maintained. There is provided an arithmetic decoding device including syntax decoding means for decoding each of at least a first syntax element and a second syntax element indicating a transform coefficient using arithmetic decoding with a context or arithmetic decoding without a context. The syntax decoding means performs decoding that at least includes not decoding the first syntax element and decoding the second syntax element using the arithmetic decoding without a context, and decoding the first syntax element using the arithmetic decoding with a context and decoding the second syntax element using the arithmetic decoding without a context.
    Type: Grant
    Filed: October 31, 2012
    Date of Patent: December 20, 2016
    Assignee: Sharp Kabushiki Kaisha
    Inventors: Tomohiro Ikai, Yukinobu Yasugi, Tomoyuki Yamamoto, Takeshi Tsukuba
  • Patent number: 9525877
    Abstract: A method for decoding video includes receiving a frame of the video that includes at least one slice and at least one tile. Each of the at least one slice and the at least one tile are not all aligned with one another. Each of the at least one slice is characterized that it is decoded independently of the other the at least one slice. Each of the at least one tile is characterized that it is a rectangular region of the frame and having coding units for the decoding arranged in a raster scan order. The at least one tile of the frame are collectively arranged in a raster scan order of the frame.
    Type: Grant
    Filed: May 16, 2014
    Date of Patent: December 20, 2016
    Assignee: Sharp Kabushiki Kaisha
    Inventors: Kiran Misra, Christopher A. Segall