To Or From Huffman Codes Patents (Class 341/65)
  • Patent number: 10368093
    Abstract: A method of compressing digital image data is provided that includes selecting an entropy code for encoding a line of pixels in the digital image data, wherein the entropy code is selected from a plurality of variable length entropy codes, using spatial prediction to compute a pixel predictor and a pixel residual for a pixel in the line of pixels, and selectively encoding the pixel residual using one of the entropy code or run mode encoding.
    Type: Grant
    Filed: November 21, 2016
    Date of Patent: July 30, 2019
    Assignee: TEXAS INSTRUMENTS INCORPORATED
    Inventors: Ying Chen, Madhukar Budagavi, Minhua Zhou
  • Patent number: 10355712
    Abstract: A storage device may program data differently for different memory areas of a memory. In some embodiments, the storage device may use different codebooks for different memory areas. In other embodiments, the storage device may modify bit orders differently for different memory areas. What codebook the storage device uses or what bit order modification the storage device performs for a particular memory area may depend on the bad storage locations specific to that memory area. Where different codebooks are used, optimal codebooks may be selected from a library, or codebooks may be modified based on the bad storage locations of the memory areas.
    Type: Grant
    Filed: March 31, 2017
    Date of Patent: July 16, 2019
    Assignee: SanDisk Technologies LLC
    Inventors: Rami Rom, Idan Goldenberg, Alexander Bazarsky, Eran Sharon, Ran Zamir, Idan Alrod, Stella Achtenberg
  • Patent number: 10324727
    Abstract: A data processing apparatus executes a stream of instructions. Memory access circuitry accesses a memory in response to control signals associated with a memory access instruction that is executed in the stream of instructions. Branch prediction circuitry predicts the outcome of branch instructions in the stream of instructions based on a branch prediction table. Processing circuitry performs a determination of whether out-of-order execution of memory access instructions is to be performed based on memory prediction data, and selectively enables out-of-order execution of the memory access instructions in dependence on the determination. The memory prediction data is stored in the branch prediction table.
    Type: Grant
    Filed: August 17, 2016
    Date of Patent: June 18, 2019
    Assignee: ARM Limited
    Inventors: Curtis Glenn Dunham, Mitchell Bryan Hayenga
  • Patent number: 10289714
    Abstract: B-Tree data is serialized to existing data for all types of workloads. Each of an identified data range is encoded with frequency encoding, wherein a first value in a frequency encoded identified data range is a first value in original data and all subsequent values in the frequency encoded identified data range are equal to a difference between a corresponding value in an input file and a previous value in the input file.
    Type: Grant
    Filed: March 28, 2016
    Date of Patent: May 14, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Lilia Demidov, Nir Halowani, Yifat Kuttner, Ben Sasson
  • Patent number: 10277899
    Abstract: A system includes an image transmitting unit and an image receiving unit. The image transmitting unit has a compression unit for compressing, in accordance with a provided compression parameter, a pixel block in image data, and a first transmitting unit for transmitting the compressed data to an image receiving unit in the system. The image receiving unit has a receiving unit for receiving the compressed data, a decompression unit for decompressing the received compressed data, a determination unit for determining a compression parameter based on the result of the decompression, and a second transmitting unit for transmitting the determined compression parameter to the image transmitting unit. The compression unit compresses an untransmitted second pixel block in the image data to be compressed in accordance with the compression parameter transmitted from the second transmitting unit.
    Type: Grant
    Filed: June 23, 2017
    Date of Patent: April 30, 2019
    Assignee: Canon Kabushiki Kaisha
    Inventor: Hiroaki Endo
  • Patent number: 10249027
    Abstract: An imaging device and method for P-phase data compression are provided. The imaging device includes one or more circuits configured to receive a plurality of blocks of P-phase data values from an image sensor. A predictor value is determined for a first input block of the plurality of blocks of P-phase data values. A reconstructed first block of P-phase data values is generated, based on the P-phase data values of the first input block and the determined predictor value. The determined predictor value is then updated for a second block of P-phase data values based on the P-phase data values of the generated reconstructed first block. Compressed P-phase data values that correspond to the received plurality of blocks of P-phase data values are generated, based on the reconstructed first block and at least a reconstructed second block.
    Type: Grant
    Filed: September 22, 2016
    Date of Patent: April 2, 2019
    Assignee: SONY CORPORATION
    Inventors: Masaru Ikeda, Ali Tabatabai
  • Patent number: 10140033
    Abstract: A system, method and apparatus to provide searching capabilities of a given queue to all of requested search patterns in a non-volatile storage unit with compressed data without decompression thereof. In one embodiment the invention provides system, method and apparatus to execute one or more queued search request of one or more search pattern for one or more non-volatile storage units without decompression of non-volatile storage units compressed data in sequence or in parallel, in order or out of order from the queue. In another embodiment the system, method, and apparatus utilizes a software storage device driver scheduler to distribute the search queues to one or more non-volatile storage units in series or in parallel, in order or out of order, in standard or virtualized operating system capable environments.
    Type: Grant
    Filed: June 15, 2016
    Date of Patent: November 27, 2018
    Assignee: XITORE, INC.
    Inventors: Mike Hossein Amidi, Ali Ghiasi
  • Patent number: 10142626
    Abstract: Methods and systems for encoding video data are provided. Evolving standards for video encoding such as High Efficiency Video Coding (HEVC) standard require a significant increase in computational complexity for both inter and intra encoding. The method includes calculating an approximate cost of each of a first set of prediction modes. Then selecting a second set of prediction modes from the first set of prediction modes based on probability distributions associated with each of the modes in the first set of prediction modes, the second set having substantially fewer prediction modes than the first. A number of candidate prediction modes prior to rate distortion optimization (RDO) is reduced. Experimental results show that the proposed method provides substantial time reduction and negligible quality loss as compared to the HEVC reference.
    Type: Grant
    Filed: October 31, 2015
    Date of Patent: November 27, 2018
    Assignee: ECOLE DE TECHNOLOGIE SUPERIEURE
    Inventors: Mohammadreza Jamali, Stephane Coulombe, Francois Caron
  • Patent number: 10135461
    Abstract: Detailed herein are embodiments of systems, methods, and apparatuses for decompression using hardware and software. In hardware, an input buffer stores incoming input records from a compressed stream. A plurality of decoders decode at least one input record from the input buffer out output an intermediate record from the decoded data and a subset of the plurality of decoders to output a stream of literals. Finally, a reformat circuit formats an intermediate record into one of two types of tokens.
    Type: Grant
    Filed: September 25, 2015
    Date of Patent: November 20, 2018
    Assignee: Intel Corporation
    Inventors: Vinodh Gopal, James D. Guilford, Sean M. Gulley, Kirk S. Yap
  • Patent number: 10083209
    Abstract: Representative embodiments are disclosed for a rapid and highly parallel decompression of compressed executable and other files, such as executable files for operating systems and applications, having compressed blocks including run length encoded (“RLE”) data having data-dependent references. An exemplary embodiment includes a plurality of processors or processor cores to identify a start or end of each compressed block; to partially decompress, in parallel, a selected compressed block into independent data, dependent (RLE) data, and linked dependent (RLE) data; to sequence the independent data, dependent (RLE) data, and linked dependent (RLE) data from a plurality of partial decompressions of a plurality of compressed blocks, to obtain data specified by the dependent (RLE) data and linked dependent (RLE) data, and to insert the obtained data into a corresponding location in an uncompressed file.
    Type: Grant
    Filed: April 21, 2017
    Date of Patent: September 25, 2018
    Assignee: Cornami, Inc.
    Inventors: Paul L. Master, Frederick Curtis Furtek, Kim Knuttila, L. Brian McGann
  • Patent number: 10078521
    Abstract: Techniques are described herein for storing and processing codes included in dictionary-encoded data. In an embodiment, for each respective code of a plurality of codes in the dictionary-encoded data: a plurality of bits from a first portion of the respective code is contiguously stored. One or more bits from a second portion of the respective code is stored in one or more slices. Each respective slice of the one or more slices stores a bit from the one or more bits with a corresponding bit position in the respective code. In another embodiment, a bit-vector is generated based on at least one slice by loading each respective bit of the plurality of bits into different respective partitions in a register at a bit position corresponding to the at least one slice. A plurality of codes may be reconstructed by combining the bit-vector with one or more other bit-vectors.
    Type: Grant
    Filed: April 1, 2014
    Date of Patent: September 18, 2018
    Assignee: Oracle International Corporation
    Inventors: Shasank Kisan Chavan, Phumpong Watanaprakornkul, Amit Ganesh, Vineet Marwah
  • Patent number: 9967569
    Abstract: The disclosure provides a sample adaptive offset (SAO) encoder. The SAO encoder includes a statistics collection (SC) block and a rate distortion optimization (RDO) block coupled to the SC block. The SC block receives a set of deblocked pixels and a set of original pixels. The SC block categorizes each deblocked pixel of the set of deblocked pixels in at least one of a plurality of band and edge categories. The SC block estimates an error in each category as difference between a deblocked pixel of the set of deblocked pixels and corresponding original pixel of the set of original pixels. The RDO block determines a set of candidate offsets associated with each category and selects a candidate offset with a minimum RD cost. The minimum RD cost is used by a SAO type block and a decision block to generate final offsets for the SAO encoder.
    Type: Grant
    Filed: December 2, 2016
    Date of Patent: May 8, 2018
    Assignee: TEXAS INSTRUMENTS INCORPORATED
    Inventors: Hrushikesh Tukaram Garud, Mihir Narendra Mody, Soyeb Nagori
  • Patent number: 9928251
    Abstract: A generic categorization method may include receiving interaction data on a distributed computing system operating on a plurality of computing nodes. The distributed computing system may distribute the received interaction data across the plurality of nodes. On each node, categorization rules may be applied to the interaction data via parallel processing. The results, which may include a category associated with each interaction, may be written to a distributed storage system. A user interface may allow a user to define the categorization rules and schemas of interaction data.
    Type: Grant
    Filed: September 21, 2016
    Date of Patent: March 27, 2018
    Assignee: NICE LTD.
    Inventors: Roi Amir, Dan Sharon, Eyal Strassburg
  • Patent number: 9892277
    Abstract: A device and a method for encoding a data column are disclosed. A schema inquiry unit inquires into a schema of an original table which is a data table for performing encoding in a database in which a plurality of data tables are stored. A backup performing unit generates schema information of a backup table on the basis of the schema of the original table, generates a backup table by using the schema information of the backup table so as to copy data of the original table into the backup table, changes the original table by adding a backup column to the original table, and inactivates constraint conditions included in the changed original table so as to copy original columns included in the changed original table into the backup column. An encoding unit encodes data of an encoding target column, a column in which encoding is to be performed in the changed original table, and enters the data in each field of the original columns of the changed original table.
    Type: Grant
    Filed: September 30, 2014
    Date of Patent: February 13, 2018
    Assignee: Fasoo.com Co., Ltd.
    Inventors: Oh-Seung Kwon, Woo-Seok Kwon
  • Patent number: 9881625
    Abstract: In this invention, the design of the Huffman table can be done offline with a large input sequence database. The range of the quantization indices (or differential indices) for Huffman coding is identified. For each value of range, all the input signal which have the same range will be gathered and the probability distribution of each value of the quantization indices (or differential indices) within the range is calculated. For each value of range, one Huffman table is designed according to the probability. And in order to improve the bits efficiency of the Huffman coding, apparatus and methods to reduce the range of the quantization indices (or differential indices) are also introduced.
    Type: Grant
    Filed: March 12, 2012
    Date of Patent: January 30, 2018
    Assignee: PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA
    Inventors: Zongxian Liu, Kok Seng Chong, Masahiro Oshikiri
  • Patent number: 9876509
    Abstract: An example method to parallelize data decompression includes adjusting a first one of initial starting positions to determine a first adjusted starting position by decoding the bitstream starting at a training position in the bitstream, the decoding including traversing the bitstream from the training position as though first data located at the training position is a valid token; and merging, by executing an instruction with the processor, first decoded data generated by decoding a first segment of the compressed data bitstream starting from the first adjusted starting position with second decoded data generated by decoding a second segment of the compressed data bitstream, the decoding of the second segment starting from a second position in the compressed data bitstream and being performed in parallel with the decoding of the first segment, and the second segment preceding the first segment in the compressed data bitstream.
    Type: Grant
    Filed: October 27, 2016
    Date of Patent: January 23, 2018
    Assignee: Intel Corporation
    Inventors: Vinodh Gopal, James D. Guilford, Sudhir K. Satpathy, Sanu K. Mathew
  • Patent number: 9837102
    Abstract: Examples of the disclosure describe user environment aware single channel acoustic noise reduction. A noisy signal received by a computing device is transformed and feature vectors of the received noisy signal are determined. The computing device accesses classification data corresponding to a plurality of user environments. The classification data for each user environment has associated therewith a noise model. A comparison is performed between the determined feature vectors and the accessed classification data to identify a current user environment. A noise level, a speech level, and a speech presence probability from the transformed noisy signal are estimated and the noise signal is reduced based on the estimates. The resulting signal is outputted as an enhanced signal with a reduced or eliminated noise signal.
    Type: Grant
    Filed: July 2, 2014
    Date of Patent: December 5, 2017
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Syavosh Zad Issa, Youhong Lu, Rod G. Fleck, Hundraj S. Gopal
  • Patent number: 9825649
    Abstract: An apparatus including a Huffman decoder circuit is described. In a first embodiment, the Huffman decoder circuit includes a register file with simultaneous parallel load capability. The register file is to keep multiple copies of same decoded values in different entries of the register file. The different entries are to be addressed by respective addresses having a same leading edge encoded symbol. The parallel load capability is to simultaneously load a same decoded value for those register file addresses having a same leading edge encoded symbol. In a second embodiment, the Huffman decoder circuit includes a CAM circuit coupled to a register file, wherein respective match lines of the CAM circuit are coupled to respective entries of the register file. The CAM circuit is to keep encoded symbols. The register file is to keep decoded values of the encoded symbols.
    Type: Grant
    Filed: September 29, 2016
    Date of Patent: November 21, 2017
    Assignee: Intel Corporation
    Inventors: Sudhir K. Satpathy, Sanu K. Mathew, Vikram B. Suresh
  • Patent number: 9753679
    Abstract: A system comprising a processor and a memory comprising firmware is provided. The firmware is executable by the processor to cause the processor to operate a print mechanism in accordance with a first state associated with a capability of the print mechanism, change the first state associated with the capability to a second state in response to receiving first information from an external interface, and operate the print mechanism in accordance with the second state associated with the capability.
    Type: Grant
    Filed: July 8, 2014
    Date of Patent: September 5, 2017
    Assignee: Marvell International Technology Ltd
    Inventors: James D Bledsoe, Gregory F Carlson, Todd A McClelland, Patrick A McKinley
  • Patent number: 9706214
    Abstract: Efficient operations in image or video decoding. For example, a tool such as an image or video decoder receives and decodes encoded data for a picture in a bitstream. As part of the decoding, the tool adapts a multi-symbol lookup table to use in decoding of symbols then decodes the symbols using the multi-symbol lookup table, producing exactly correct results. The tool can also perform selectively truncated inverse frequency transforms. For a given block, the tool identifies upper horizontal and vertical frequencies among non-zero coefficients for the block and, based on the upper frequency values, selectively applies a simplified inverse frequency transform to transform coefficients for the block without hurting decoding quality. Using restart markers in the bitstream, the tool can organize multiple blocks of the picture as partitions. The tool decodes at least some of the partitions in parallel on a partition-by-partition basis using multiple processing cores.
    Type: Grant
    Filed: December 24, 2010
    Date of Patent: July 11, 2017
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Yongjun Wu, Shyam Sadhwani, Daniele Terdina
  • Patent number: 9698819
    Abstract: A method for generating Huffman codewords to encode a dataset includes selecting a Huffman tree type from a plurality of different Huffman tree types. Each of the Huffman tree types specifies a different range of codeword length in a Huffman tree. A Huffman tree of the selected type is produced by: determining a number of nodes available to be allocated as leaves in each level of the Huffman tree accounting for allocation of leaves in each level of the Huffman tree; allocating nodes to be leaves such that the number of nodes allocated in a given level of the Huffman tree is constrained to be no more than the number of nodes available to be allocated in the given level; and assigning the leaves to symbols of the dataset based an assignment strategy selected from a plurality of assignment strategies to produce symbol codeword information.
    Type: Grant
    Filed: December 23, 2016
    Date of Patent: July 4, 2017
    Assignee: AMAZON TECHNOLOGIES, INC.
    Inventors: Michael Baranchik, Ron Diamant, Muhannad Ghanem, Ori Weber
  • Patent number: 9680709
    Abstract: A method for determining the bandwidth of an incoming frame in a wireless local area network (WLAN), includes the following steps, executed at least by a processor, upon reception of a first plurality of samples representative of a first signal of the frame received at a primary WLAN channel, and of a second plurality of samples of the frame representative of a second signal of the frame received at a secondary WLAN channel: computing at least a correlation of a sample among the first plurality of samples with a sample among the second plurality of samples; if the correlation exceeds a threshold then setting a receiver mode to a first bandwidth otherwise setting a receiver mode to a second bandwidth. A device for setting the bandwidth of a receiver for a wireless local area network and a system integrating such device are also described.
    Type: Grant
    Filed: November 14, 2014
    Date of Patent: June 13, 2017
    Assignee: RIVIERAWAVES (RW)
    Inventors: Lisa Meilhac, Cedric Vandeburie
  • Patent number: 9645790
    Abstract: The present disclosure relates to an add and decode hardware logic circuit for adding two n bit inputs, A and B. A series of n logic stages are each configured to perform a first operation of propagating a result of a preceding stage on the condition that the sum of A[m] and B[m] is equal to 0, wherein 0<=m<n, perform a second operation of performing a bitwise left shift by 2m of the result of the preceding stage on the condition that the sum of A[m] and B[m] is equal to 1, or perform a third operation of performing a bitwise left shift by 2m+1 of the result of the preceding stage on the condition that the sum of A[m] and B[m] is equal to 2. An output at the last stage provides a decoded sum of the inputs A and B.
    Type: Grant
    Filed: November 11, 2014
    Date of Patent: May 9, 2017
    Assignee: Cavium, Inc.
    Inventors: Edward Beckman, Nitin Mohan
  • Patent number: 9621895
    Abstract: A video decoding apparatus includes a decoder to decode division information related to dividing a current block into subblocks, and reconstruct transform coefficients of each of the subblocks identified by the division information, and thereby generate transformed residual subblocks; an inverse transformer to inverse-transform each of the transformed residual subblocks, and thereby generate residual subblocks; a predictor to generate predicted subblocks by intra-predicting each of the subblocks; an adder to reconstruct the current block by adding the predicted subblocks to the residual subblocks corresponding thereto; and a first filter to perform deblocking-filtering on boundaries between the subblocks in a reconstructed picture including the reconstructed current block.
    Type: Grant
    Filed: April 21, 2015
    Date of Patent: April 11, 2017
    Assignee: SK TELECOM CO., LTD.
    Inventors: Sunyeon Kim, Jeongyeon Lim, Yunglyul Lee, Joohee Moon, Byeungwoo Jeon, Haekwang Kim, Jeonghoon Seo, Kioh Kim, Sungwook Hong
  • Patent number: 9582854
    Abstract: According to an example, an original image is divided into image blocks according to a preset size, at least one pixel is overlapped between adjacent image blocks, a target image block is obtained after performing reduction processing for each of the image blocks according to a reduction factor, coordinates of the target image block are obtained according to the reduction factor and coordinates of the image block; and the target image blocks are combined according to the coordinates of the target image blocks.
    Type: Grant
    Filed: June 9, 2014
    Date of Patent: February 28, 2017
    Assignee: TENCENT TECHNOLOGY (SHENZHEN) COMPANY LIMITED
    Inventor: Shengfu Tang
  • Patent number: 9569357
    Abstract: Systems, methods, and computer readable storage mediums for optimistically managing compressed data in a storage system. When possible, multiple input blocks are compressed into a buffer and stored in a single physical block on a storage device. The metadata of the multiple input blocks can be managed separately. A fingerprint of the compressed buffer can be generated and used as an index to the single physical block. Alternatively, fingerprints of the uncompressed input blocks can be generated, and reference counts can be maintained to track the number of input blocks which reference the compressed buffer.
    Type: Grant
    Filed: January 8, 2015
    Date of Patent: February 14, 2017
    Assignee: Pure Storage, Inc.
    Inventors: Ori Shalev, Ronald S. Karr, Wei Zhang
  • Patent number: 9559838
    Abstract: A method of cryptographic processing of data (X), in particular a method protected against fault injection attacks, and an associated device. The processing includes at least one transformation (100, 1001-1006) of an input data item (s) into a result data item (s?). In this case the method includes a step (E204) of verifying the transformation including the following steps: obtaining (E206) a first data item (DV(s?)) that is compressed by applying a compression operation (110, MDV, ADV) to the result data item (s?); obtaining (E208) a second compressed data item (DV(s)) that is compressed by applying the compression operation (110, MDV, ADV) to the input data item (s); determining (E210) a verification data item (DV(s)?) by applying the transformation (100, 1001-1006) to the second compressed data item (DV(s)) and; comparing (E212) the verification data item and the first compressed data item.
    Type: Grant
    Filed: July 30, 2010
    Date of Patent: January 31, 2017
    Assignee: OBERTHUR TECHNOLOGIES
    Inventors: Laurie Genelle, Christophe Giraud, Emmanuel Prouff
  • Patent number: 9542427
    Abstract: A computer-readable recording medium stores a program causing a computer to determine the size of an applied 2N-branch non-contact Huffman tree depending on where in a range the total number of types (X) of character information groups exists. The size of the 2N-branch non-contact Huffman tree has the maximum number of branches, 2N. The radicand N is an upper limit of the length of a compression code. Thus, when the size of the 2N-branch non-contact Huffman tree is determined, the radicand (N) may be determined depending on the total number of types (X) of character information groups. Specifically, when the total number of types (X) of character information groups is 2x?2<X?2x?1, if the maximum number of branches (2N) is at least 2x?1, a Huffman tree can be established. To minimize the size, N=x?1 may be adopted. Further, when the total number of types (X) of character information groups is 2x?1<X?2x, if the maximum number of branches (2N) is at least 2x, a Huffman tree can be established.
    Type: Grant
    Filed: August 14, 2013
    Date of Patent: January 10, 2017
    Assignee: FUJITSU LIMITED
    Inventor: Masahiro Kataoka
  • Patent number: 9516338
    Abstract: When a block (MB22) of which motion vector is referred to in the direct mode contains a plurality of motion vectors, 2 motion vectors MV23 and MV24, which are used for inter picture prediction of a current picture (P23) to be coded, are determined by scaling a value obtained from averaging the plurality of motion vectors or selecting one of the plurality of the motion vectors.
    Type: Grant
    Filed: December 15, 2015
    Date of Patent: December 6, 2016
    Assignee: PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA
    Inventors: Satoshi Kondo, Shinya Kadono, Makoto Hagai, Kiyofumi Abe
  • Patent number: 9491468
    Abstract: Provided is an apparatus for encoding an image that adaptively filters reference pixels according to an intra prediction mode and a size of a prediction block, and generates the prediction block according to the intra prediction mode. When the reference pixels for a second directional intra prediction mode are filtered, the reference pixels for a first directional intra prediction mode, that is closer to an intra prediction mode having a direction of 45° with reference to a horizontal mode than the second directional intra prediction mode is, are also filtered. The first and the second intra prediction modes exist between the horizontal mode and the intra prediction mode having the direction of 45° with reference to the horizontal mode. The plurality of sub-blocks and non-zero coefficients of each sub-block are scanned according to a scan pattern determined by the intra prediction mode of the prediction block.
    Type: Grant
    Filed: November 2, 2015
    Date of Patent: November 8, 2016
    Assignee: M&K HOLDINGS INC.
    Inventors: Soo Mi Oh, Moonock Yang
  • Patent number: 9489445
    Abstract: A generic categorization method may include receiving interaction data on a distributed computing system operating on a plurality of computing nodes. The distributed computing system may distribute the received interaction data across the plurality of nodes. On each node, categorization rules may be applied to the interaction data via parallel processing. The results, which may include a category associated with each interaction, may be written to a distributed storage system. A user interface may allow a user to define the categorization rules and schemas of interaction data.
    Type: Grant
    Filed: March 13, 2013
    Date of Patent: November 8, 2016
    Assignee: NICE SYSTEMS LTD.
    Inventors: Roi Amir, Dan Sharon, Eyal Strassburg
  • Patent number: 9484954
    Abstract: Methods and apparatus to parallelize data decompression are disclosed. A method selects the initial starting positions in a compressed data bitstream. A first one of the initial starting positions is adjusted to determine a first adjusted starting position by decoding the bitstream starting at a training position in the bitstream. The decoding includes traversing the bitstream from the training position as though first data located at the training position is a valid token. The first decoded data generated by decoding a first segment of the bitstream starting from the first adjusted starting position is output. The first decoded data is merged with second decoded data generated by decoding a second segment of the bitstream. The decoding of the second segment starting from a second position in the bitstream is performed in parallel with the decoding of the first segment. The second segment precedes the first segment in the bitstream.
    Type: Grant
    Filed: September 10, 2015
    Date of Patent: November 1, 2016
    Assignee: Intel Corporation
    Inventors: Vinodh Gopal, James D. Guilford, Sudhir K. Satpathy, Sanu K. Mathew
  • Patent number: 9344742
    Abstract: A method for encoding a frame having a plurality of blocks in a video stream using transform-domain intra prediction is disclosed. The method includes generating, using a two-dimensional transform, a set of transform coefficients for a current block; generating, using a one-dimensional transform, a set of transform coefficients for previously coded pixel values in the frame; determining, using the set of transform coefficients for the previously coded pixel values, a set of transform coefficients for a prediction block; determining a residual based on the difference between the set of transform coefficients for the current block and the set of coefficients for the prediction block; and encoding the residual.
    Type: Grant
    Filed: August 10, 2012
    Date of Patent: May 17, 2016
    Assignee: GOOGLE INC.
    Inventors: Yaowu Xu, Qunshan Gu
  • Patent number: 9336072
    Abstract: An operating system uses non-bit aligned test masks to encode compound logical tests within the test mask. Generally, a bit within the test mask will indicate whether the test mask is a bit-aligned test mask or a non-bit-aligned test mask. If the system detects that the test mask in a non-bit-aligned test mask, the system will traverse the test mask to extract bit-aligned sub-masks and perform multi-level logical tests with the bit-aligned sub-masks. Such a system is particularly useful when performing a compound AND-OR logical test involving mutually exclusive event group flags.
    Type: Grant
    Filed: February 9, 2015
    Date of Patent: May 10, 2016
    Inventor: Ralph Moore
  • Patent number: 9317934
    Abstract: Provided are a motion estimation method and a motion estimation apparatus. The motion estimation apparatus includes a first register storing information on whether to detect first detection positions, a second register storing information on distances and number information of valid distance information, a controller receiving a command, a shifter, in response to the shift-enable signal, shifting and outputting reference data in a detection region of a reference frame and outputting the received reference data as it is, a selector, in response to the selection signal, selecting and outputting a part of output data of the shifter or outputting the whole output data, a process element (PE) array receiving current data of a current frame, and a comparator generating operation results for respective block sizes using operation results of the plurality of the PEGs.
    Type: Grant
    Filed: October 19, 2012
    Date of Patent: April 19, 2016
    Assignee: AJOU UNIVERSITY INDUSTRY COOPERATION FOUNDATION
    Inventors: Myung Hoon Sunwoo, Ho Il Bang
  • Patent number: 9311320
    Abstract: Systems and methods for compressing a raw logical data object (201) for storage in a storage device operable with at least one storage protocol, creating, reading, writing, optimizatic in and restoring thereof. Compressing the raw logical data object (201) comprises creating in the storage device a compressed logical data object (203) comprising a header (204) and one or more allocated compressed sections with predefined size (205-1-205-2); compressing one or more sequentially obtained chunks of raw data (202-1-202-6) corresponding to the raw logical data object (201) thus giving rise to the compressed data chunks (207-1-207-6); and sequentially accommodating the processed data chunks into: said compressed sections (205-1-205-2) in accordance with an order said chunks received, wherein said compressed sections serve as atomic elements of compression/decompression operations during input/output transactions on the logical data object.
    Type: Grant
    Filed: July 21, 2011
    Date of Patent: April 12, 2016
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Chaim Koifman, Nadav Kedem, Avi Zohar, Jonathan Amit
  • Patent number: 9298420
    Abstract: A circuit for identifying one or more bit positions of instances of a selected bit value in an N-bit input bit string includes a plurality of adders that compute, in parallel, sums of bits in each of P input substrings comprising the input bit string. A plurality of zero position detectors detect, for each of the P input substrings for which a corresponding sum differs from a threshold sum, one or more bit positions of the selected bit value. Correction logic generates adjustment indications indicative of a number of detected instances of the selected bit value. A plurality of output substring adjusters that, based on the detected bit positions and the adjustment indications, collectively output one or more output vectors identifying a bit position of at least an Mth instance of the selected bit value in the input bit string.
    Type: Grant
    Filed: July 26, 2013
    Date of Patent: March 29, 2016
    Assignee: International Business Machines Corporation
    Inventors: Akif A. Ali, Aquilur Rahman, Salim A. Shah
  • Patent number: 9262427
    Abstract: Systems and methods for transforming a logical data object for storage in a storage device operable with at least one storage protocol, creating, reading, writing, optimization and restoring thereof. Transforming the logical data object comprises creating in the storage device a transformed logical data object comprising one or more allocated storage sections with a predefined size; transforming one or more sequentially obtained chunks of obtained data corresponding to the transforming logical data object; and sequentially storing the processed data chunks into said storage sections in accordance with a receive order of said chunks, wherein said storage sections serve as atomic elements of transformation/de-transformation operations during input/output transactions on the logical data object.
    Type: Grant
    Filed: April 13, 2012
    Date of Patent: February 16, 2016
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Chaim Koifman, Nadav Kedem, Avi Zohar
  • Patent number: 9252805
    Abstract: A main data input and a lookahead input are held in a holding register. Consecutive overlapping portions of the main data input and the lookahead input are provided to a plurality, M, of half-decoders, which include a subset of frequently-occurring code words of a Huffman code. When no code word not available in the half-decoders is encountered, the half-decoders decode, in parallel, in a single clock cycle, M of the frequently-occurring code words. When a code word not available in the half-decoders is encountered, input intended for a corresponding one of the half-decoders, which input includes the code word not available in the corresponding one of the half-decoders, is applied to an input of a full decoder implemented in ternary content-addressable memory. The full decoder includes all code words of the Huffman code.
    Type: Grant
    Filed: March 28, 2015
    Date of Patent: February 2, 2016
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Bulent Abali, Bartholomew Blaner
  • Patent number: 9225355
    Abstract: For boosting decompression in the presence of reoccurring Huffman trees, a previous Huffman tree is used to decompress a new data block if a match is identified between a compacted description of the Huffman tree and a recently used Huffman tree compaction.
    Type: Grant
    Filed: April 23, 2015
    Date of Patent: December 29, 2015
    Assignee: GlobalFoundries Inc.
    Inventors: Danny Harnik, Ety Khaitzin, Sergey Marenkov, Dmitry Sotnikov
  • Patent number: 9209823
    Abstract: A decoder level shifter device includes a first decoder level shifter and a second decoder level shifter. The first decoder level shifter has first to fourth input terminals, first and second output terminals, first and second enable terminals, first and second reset terminals. The first to fourth input terminals receive first to second input signals and their complementary signals, respectively. The second decoder level shifter has fifth to eighth input terminals, third to fourth output terminals, and third and fourth enable terminals. The fifth to eighth input terminals receive the first and second input signals and their complementary signals, respectively. The first, second, third, and fourth enable terminals are connected to the fourth, third, second, and first output terminals, respectively.
    Type: Grant
    Filed: April 10, 2015
    Date of Patent: December 8, 2015
    Assignee: FOCALTECH SYSTEMS CO., LTD.
    Inventor: Yen-Cheng Cheng
  • Patent number: 9104726
    Abstract: A method of searching for sets of data in a very large columnar database is described.
    Type: Grant
    Filed: February 5, 2013
    Date of Patent: August 11, 2015
    Assignee: Smartfocus Holdings Limited
    Inventor: Jean-Yves Simon
  • Patent number: 9059731
    Abstract: For boosting decompressionin the presence of reoccurring Huffman trees, a compacted description of a Huffman tree is compared to recently used Huffman tree compactions for identifying matches rather than reconstructing a Huffman tree from a header of a compressed block for each data block to avoid overhead of a Huffman tree reconstruction.
    Type: Grant
    Filed: October 21, 2013
    Date of Patent: June 16, 2015
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Danny Harnik, Ety Khaitzin, Sergey Marenkov, Dmitry Sotnikov
  • Patent number: 9041566
    Abstract: Various embodiments provide lossless compression of an enumeration space for genetic founder lines. In one embodiment, an input comprising a set of genetic founder lines and a maximum number of generations G is obtained. A set of genetic crossing templates of a height h is generated. A determination is made if at least a first genetic crossing template in the set of genetic crossing templates is redundant with respect to a second genetic crossing template in the set of genetic crossing templates. Based on the at least first genetic crossing template being redundant is redundant with respect to the second genetic crossing template, the at least first genetic crossing template is removed from the set of genetic crossing templates. This process of removing the at least first genetic crossing template from the set of genetic crossing templates the redundant creates an updated set of genetic crossing templates.
    Type: Grant
    Filed: August 30, 2013
    Date of Patent: May 26, 2015
    Assignee: International Business Machines Corporation
    Inventors: David C. Haws, Laxmi P. Parida
  • Publication number: 20150109153
    Abstract: A decompression engine may include an input configured to receive an input code comprises one or more bits from a bitstream of encoded data, a symbol decoder coupled with the input, where the symbol decoder is configured to calculate, based on the input code, a plurality of candidate addresses each corresponding to a code group. The symbol decoder may further include a group identifier module coupled with the symbol decoder, wherein the group identifier module is configured to identify one of the plurality of code groups corresponding to the input code, and a multiplexer coupled with the group identifier module, wherein the multiplexer is configured to select as a final address one of the plurality of candidate addresses corresponding to the identified code group.
    Type: Application
    Filed: October 18, 2013
    Publication date: April 23, 2015
    Applicant: Advanced Micro Devices, Inc.
    Inventors: Winthrop J. Wu, Martin Kiernicki, Creighton Eldridge
  • Publication number: 20150109154
    Abstract: For boosting decompression in the presence of reoccurring Huffman trees, a compacted description of a Huffman tree is compared to recently used Huffman tree compactions for identifying matches rather than reconstructing a Huffman tree from a header of a compressed block for each data block to avoid overhead of a Huffman tree reconstruction.
    Type: Application
    Filed: October 21, 2013
    Publication date: April 23, 2015
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Danny HARNIK, Ety KHAITZIN, Sergey MARENKOV, Dmitry SOTNIKOV
  • Patent number: 8988257
    Abstract: According to one embodiment, method for decoding encoded data comprises a hardware module including circuitry to process a data stream. The data stream includes one or more encoded symbols each including a code assigned to a corresponding symbol. A set of least frequently occurring symbols are assigned a common code to encode those symbols within the data stream. Data blocks are generated each containing a data stream portion. One or more encoded symbols within each data block are identified by comparing data block portions to maximum code values for corresponding code lengths to determine a code length for each data block portion. A starting location for the identified encoded symbols within each data block is determined based on the determined code lengths.
    Type: Grant
    Filed: July 19, 2012
    Date of Patent: March 24, 2015
    Assignee: International Business Machines Corporation
    Inventors: Garth A. Dickie, Brian M. Hess
  • Patent number: 8981970
    Abstract: A binary allocation in a hierarchical coding/decoding comprising a coding/decoding of a digital signal enhancement layer. The signal comprises a succession of L samples, each sample being represented by a mantissa and an exponent. The method comprises the allocation of a predetermined number Nb of enhancement bits to a part at least of the L samples of highest exponent values. In particular, the method comprises the steps: a) enumerating the exponents of the L samples each having a given value, b) calculating at least one aggregate of enumerations of exponents by decreasing values of exponent until the predetermined number Nb is approximated from above, for c) determining a threshold value of largest exponent iexp0 of sample for which no more enhancement bit is available, and allocating the Nb enhancement bits, according to chosen rules, to the samples whose exponent is greater than the aforesaid threshold value iexpo.
    Type: Grant
    Filed: October 19, 2012
    Date of Patent: March 17, 2015
    Assignee: Orange
    Inventor: Claude Lamblin
  • Patent number: 8976048
    Abstract: A method of decoding Huffman-encoded data may comprise receiving a symbol associated with the Huffman encoded data, selecting a target group for the symbol based on a bit length value associated with the symbol, associating the symbol with the target group, associating the symbol with a code, and incrementing a starting code for each of a plurality of groups associated with a starting code that is equal to or greater than the starting code of the target group.
    Type: Grant
    Filed: May 15, 2013
    Date of Patent: March 10, 2015
    Assignee: Adavanced Micro Devices, Inc.
    Inventor: Winthrop J. Wu
  • Patent number: 8970405
    Abstract: An entropy decoder and method for decoding code words with an indication of associated probability for each code word. The decoder can be operable to receive code words and the indication of associated probability. A branch node block can be in communication with a leaf node block. The branch node block comprising one or more branch node lookup tables and branch node control logic. The branch node control logic operable to process a code word in the input buffer using a selected table from the one or more branch node lookup tables to obtain leaf node information and a bit count of a code word size, the branch control logic further operable to refresh the input buffer to replace the bit count of the code word size and to make the leaf node information and the table selection available to the leaf node block.
    Type: Grant
    Filed: April 9, 2013
    Date of Patent: March 3, 2015
    Assignee: Certicom Corp.
    Inventors: Weicheng Joseph Ku, Paul Daniel Imthurn