To Or From Variable Length Codes Patents (Class 341/67)
  • Patent number: 9053525
    Abstract: Disclosed is an entropy coding method using an index mapping table, and an apparatus using the method. An imagedecoding method comprises: a step of mapping an inputted codeword to a code number with reference to an inverse codeword mapping table, and calculating the mapped code number in a table index; and a step of updating the inverse mapping table based on the accumulated number of occurrences of the code number, the number of sequential occurrences of the code number, neighbor block encoding/decoding information, and/or threshold value information for updating the inverse index mapping table. According to the present invention, an index mapping table is realigned based on a certain condition, thereby improving encoding/decoding efficiency.
    Type: Grant
    Filed: January 20, 2012
    Date of Patent: June 9, 2015
    Assignee: Electronics and Telecommunications Research Institute
    Inventors: Jong Ho Kim, Hui Yong Kim, Sung Chang Lim, Ha Hyun Lee, Jin Ho Lee, Se Yoon Jeong, Jin Soo Choi, Jin Woong Kim, Chie Teuk Ahn
  • 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: 20150130646
    Abstract: A computer implemented method, computer program product, and system for decompressing compressed data. The system (400) has an interface component (420) configured to access and read a compressed data set (310) encoded with a LZW based compression algorithm. The compressed data set (310) includes a sequence of elements including byte characters (B) and symbols (S1/S2), each symbol corresponding to an encoded subset of the data set, and each symbol having a first portion (S1) including a previous symbol or a byte character and having a second portion (S2) including a byte character. The system further has a decoder (410) configured to generate a decompressed data set (320) by applying a LZW based decompression algorithm to the compressed data set (310) The decoder (410) makes use of a reverse order stack (440) configured for intermediate storage of byte characters decoded by the decoder (410) from the compressed data set (310).
    Type: Application
    Filed: September 2, 2014
    Publication date: May 14, 2015
    Inventor: Jing HUANG
  • Patent number: 9007241
    Abstract: A method for encoding a reduced polar code is disclosed. The method generally includes steps (A) to (C). Step (A) may generate the intermediate codeword by polar code encoding input data. Step (B) may remove one or more bits from one of (i) a first part of the intermediate codeword and (ii) a second part of the intermediate codeword. Step (C) may generate an output codeword by concatenating the first part of the intermediate codeword with the second part of the intermediate codeword after the bits are removed.
    Type: Grant
    Filed: September 23, 2013
    Date of Patent: April 14, 2015
    Assignee: Seagate Technology LLC
    Inventors: AbdelHakim S. Alhussien, Erich F. Haratsch, Yue Li
  • 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
  • Publication number: 20150077277
    Abstract: A method for encoding a reduced polar code is disclosed. The method generally includes steps (A) to (C). Step (A) may generate the intermediate codeword by polar code encoding input data. Step (B) may remove one or more bits from one of (i) a first part of the intermediate codeword and (ii) a second part of the intermediate codeword. Step (C) may generate an output codeword by concatenating the first part of the intermediate codeword with the second part of the intermediate codeword after the bits are removed.
    Type: Application
    Filed: September 23, 2013
    Publication date: March 19, 2015
    Applicant: LSI Corporation
    Inventors: AbdelHakim S. Alhussien, Erich F. Haratsch, Yue Li
  • 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: 8977664
    Abstract: A method is disclosed for encoding and decoding integer values ranging over a known gamut of values used by a data system. By noting that a data system may store and/or transmit integer values over a predefined gamut having a minimum and a maximum limit, integer values at or near the maximum may be compressed to a greater degree than in conventional systems without any loss of data resolution.
    Type: Grant
    Filed: February 17, 2010
    Date of Patent: March 10, 2015
    Assignee: CA, Inc.
    Inventor: Steven Douglas Maurer
  • 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
  • Patent number: 8963747
    Abstract: According to an embodiment, a decoding apparatus includes a clipping unit and a decoding unit. The clipping unit is configured to clip pieces of encoded data each having a predetermined first code length from input data encoded with variable-length encoding. The predetermined first code length is greater than or equal to a maximum code length among a plurality of pieces of encoded data included in the input data. The decoding unit is configured to decode the clipped piece of encoded data by using variable-length decoding.
    Type: Grant
    Filed: December 10, 2013
    Date of Patent: February 24, 2015
    Assignee: Kabushiki Kaisha Toshiba
    Inventor: Atsushi Matsumura
  • Patent number: 8947271
    Abstract: A system, method and computer program product having optimal matching to a known or measured probability distribution encodes data without the use of an excessively large lookup table. An encoder constructed according to the present invention uses two or more different encoding methods in combination. In one embodiment, Huffman coding by table lookup is combined with computational generation, such as by using an exponential Golomb equation. The most commonly occurring elements are looked up in a small Huffman table, while the remaining elements are coded with the equation. In another embodiment, data is encoded using two or more equations. In yet another embodiment, data is encoded using multiple tables in conjunction with one or more equations.
    Type: Grant
    Filed: June 7, 2011
    Date of Patent: February 3, 2015
    Assignee: Soryn Technologies, LLC
    Inventors: William C. Lynch, Krasimir D. Kolarov, Steven E. Saunders
  • Patent number: 8947274
    Abstract: A data predicted value generating unit generates a predicted value (data predicted value) for original data intended to be encoded, based on a history of original data which is floating-point data. A data predicted value modifying unit adjusts a mantissa value of the data predicted value by aligning an exponent value of the data predicted value with an exponent value of the original data. A first residual generating unit generates a residual (first residual) between new original data and the data predicted value after being adjusted. A first residual predicted value generating unit generates a predicted value for the first residual (first residual predicted value), based on a history of first residuals. A second residual generating unit generates a residual (second residual) between the first residual and the first residual predicted value. A residual encoding unit generates encoded data by encoding the second residual.
    Type: Grant
    Filed: June 21, 2012
    Date of Patent: February 3, 2015
    Assignee: Mitsubishi Electric Corporation
    Inventor: Hideya Shibata
  • Patent number: 8947273
    Abstract: An encoder for encoding a sequence of symbols is described which has an assigner configured to assign a number of parameters to each symbol of the sequence of symbols based on information contained within previous symbols of the sequence of symbols; a plurality of entropy encoders each of which is configured to convert the symbols forwarded to the respective entropy encoder into a respective bitstream; and a selector configured to forward each symbol to a selected one of the plurality of entropy encoders, the selection depending on the number of parameters assigned to the respective symbol.
    Type: Grant
    Filed: March 31, 2014
    Date of Patent: February 3, 2015
    Assignee: Fraunhofer-Gesellschaft zur Foerderung der angewandten Forschung e.V.
    Inventors: Christian Bartnik, Benjamin Bross, Valeri George, Anastasia Henkel, Tobias Hinz, Heiner Kirchhoffer, Detlev Marpe, Tung Nguyen, Matthias Preiss, Thomas Schierl, Heiko Schwarz, Mischa Siekmann, Jan Stegemann, Thomas Wiegand
  • Patent number: 8947272
    Abstract: A method for decoding encoded data includes receiving data encoded by replacing each of a plurality of characters with bit strings. The method also includes recording, on the basis of definition information, at least one of the characters as corresponding to each of the bit lengths, and generating decode information based on the number of characters, wherein the decode information includes bit string information for sorting the bit strings in a bit length order that is a predetermined order associated with bit lengths. The method also includes, in response to receiving a particular bit length, generating character information in which the characters are sorted in the bit length order by inserting a character corresponding to the particular bit length into a position corresponding to the particular bit length in an array in which at least one of the bit lengths.
    Type: Grant
    Filed: November 6, 2012
    Date of Patent: February 3, 2015
    Assignee: International Business Machines Corporation
    Inventors: Kiyoshi Takemura, Nobuyoshi Tanaka, Makoto Ogawa, Tadayuki Okada
  • Patent number: 8941514
    Abstract: An image coding apparatus provides a run-length encoding unit RLE1 that subjects quantized coefficients obtained by quantizing frequency components of an image signal to a variable length coding process by using a run value Run that indicates the number of successive zero coefficients and a level value Lev that indicates a value of a non-zero coefficient following the zero coefficients. The run-length encoding unit RLE1 includes a reordering unit Lreodr for reordering level values Lev; a variable length coder LVLC for coding reordered level values ROLev by using a code table selected according to the value of a quantization parameter QP; a reordering unit Rreodr for reordering run values Run from high frequency component of the quantized coefficients to low frequency component; and a variable length coder RVLC for coding reordered run values RORun by using a code table selected according to the number of already-processed run values.
    Type: Grant
    Filed: November 4, 2013
    Date of Patent: January 27, 2015
    Assignee: Panasonic Intellectual Property Corporation of America
    Inventors: Shinya Kadono, Satoshi Kondo, Makoto Hagai, Kiyofumi Abe
  • Patent number: 8941515
    Abstract: According to one embodiment, a data processing system has an encoder and a decoder. The encoder is configured to variable-length encode input data to generate an encoded stream. The decoder is configured to decode the encoded stream to generate output data. The encoder has a variable length encoder, a code converter, and a buffer. The variable length encoder is configured to variable-length-encode the input data to generate first variable length codes. The code converter is configured to convert n first variable length codes into a second variable length code. The buffer is configured to buffer the second variable length code to generate the encoded stream.
    Type: Grant
    Filed: February 4, 2014
    Date of Patent: January 27, 2015
    Assignee: Kabushiki Kaisha Toshiba
    Inventor: Sho Kodama
  • Patent number: 8933825
    Abstract: Data compression using a combination, of content independent data compression and content dependent data compression. In one aspect, a method for compressing data comprises: determining whether or not a parameter or attribute of data within a data block is identified for the data block wherein the determining is not based solely on a descriptor that is indicative of the parameter or attribute of the data within the data block; and compressing the data block with at least one encoder associated with the parameter or attribute of the data within the data block to provide a compressed data block.
    Type: Grant
    Filed: April 11, 2014
    Date of Patent: January 13, 2015
    Assignee: Realtime Data LLC
    Inventor: James J. Fallon
  • Patent number: 8922414
    Abstract: A method and apparatus for symbol-space based compression of patterns are provided. The method comprises receiving an input sequence, the input sequence being of a first length and comprising a plurality of symbols; extracting all common patterns within the input sequence, wherein a common pattern includes at least two symbols; generating an output sequence responsive of the extraction of all common patterns, wherein the output sequence has a second length that is shorter than the first length; and storing in a memory the output sequence as a data layer, wherein the output sequence is provided as a new input sequence for a subsequent generation of a data layer.
    Type: Grant
    Filed: April 30, 2013
    Date of Patent: December 30, 2014
    Assignee: Cortica, Ltd.
    Inventors: Igal Raichelgauz, Karina Ordinaev, Yehoshua Y. Zeevi
  • Publication number: 20140375483
    Abstract: A method of decoding data includes: receiving an encoded data stream transmitted as a plurality of variable length symbols; dividing the data stream into a sequence of blocks, each block having a sequence of adjacent bit positions starting a first bit position and ending with a last bit position; pre-processing each block prior to fully decoding each block, wherein pre-processing includes, for each block, selecting a bit position in a current block and determining a starting position of a first symbol in an adjacent block based on the selected bit position, wherein determining is initially performed for the last bit position in the current block, and is repeated sequentially for each preceding bit position through and including the first bit position; and fully decoding each block by decoding a first block starting at the first bit position and decoding each adjacent block starting at the starting position.
    Type: Application
    Filed: July 19, 2013
    Publication date: December 25, 2014
    Applicant: International Business Machines Corporation
    Inventor: Andrew K. Martin
  • Publication number: 20140375482
    Abstract: A method of decoding data includes: receiving an encoded data stream transmitted as a plurality of variable length symbols; dividing the data stream into a sequence of blocks, each block having a sequence of adjacent bit positions starting a first bit position and ending with a last bit position; pre-processing each block prior to fully decoding each block, wherein pre-processing includes, for each block, selecting a bit position in a current block and determining a starting position of a first symbol in an adjacent block based on the selected bit position, wherein determining is initially performed for the last bit position in the current block, and is repeated sequentially for each preceding bit position through and including the first bit position; and fully decoding each block by decoding a first block starting at the first bit position and decoding each adjacent block starting at the starting position.
    Type: Application
    Filed: June 20, 2013
    Publication date: December 25, 2014
    Applicant: International Business Machines Corporation
    Inventor: Andrew K. Martin
  • Patent number: 8884792
    Abstract: Variable length code decoding device for decoding variable length code data, including: decoding process tables each including at least two kinds of formats consisting a first format storing identification information for designating a subsequent table to be referred to in a subsequent decoding process, and a second format that stores a decoded value obtained by repeating the decoding process and a significant bit length to be referred to with respect to variable length code data. The device utilizes first, second, third and fourth formats and relative addresses.
    Type: Grant
    Filed: September 4, 2012
    Date of Patent: November 11, 2014
    Assignee: Renesas Electronics Corporation
    Inventors: Hiroaki Nakata, Fumitaka Izuhara, Kazushi Akie, Takafumi Yuasa
  • Patent number: 8872677
    Abstract: A compression method applies a selection rule to input symbols and generates a reduced partial set of symbols. The partial set is checked against a dictionary-index for a match. A match identifies a range of matching symbols in a dictionary. The length of the matching range is iteratively increased by checking previous and next symbols in the input data and the dictionary until a matching range length meets a threshold limit or the length of the matching range cannot be increased further. Compressed data corresponding to the input symbols is provided where input symbols are copied over and symbols in a matched range of data are replaced with a representation of their corresponding start location and length in the dictionary.
    Type: Grant
    Filed: March 15, 2013
    Date of Patent: October 28, 2014
    Assignee: Dialogic Networks (Israel) Ltd.
    Inventors: Oleg Litvak, Amir Ilan
  • Patent number: 8873870
    Abstract: The present invention is directed to an image information encoding apparatus adapted for performing intra-image encoding based on resolution of color components and color space of an input image signal. An intra prediction unit serves to adaptively change block size in generating a prediction image based on a chroma format signal indicating whether resolution of color components is one of 4:2:0 format, 4:2:2 format, and 4:4:4 format, and a color space signal indicating whether color space is one of YCbCr, RGB, and XYZ. An inverse orthogonal transform unit and an inverse quantization unit serve to also change orthogonal transform technique and quantization technique in accordance with the chroma format signal and the color space signal. An encoding unit encodes the chroma format signal and the color space signal to generate a prediction image corresponding to the chroma format signal and the color space signal.
    Type: Grant
    Filed: February 1, 2011
    Date of Patent: October 28, 2014
    Assignee: Sony Corporation
    Inventors: Teruhiko Suzuki, Akira Sugiyama, Kyohei Koyabu
  • Patent number: 8873873
    Abstract: The present invention is directed to an image information decoding apparatus adapted for performing intra-image decoding based on resolution of color components and color space of an input image signal. An intra prediction unit serves to adaptively change block size in generating a prediction image based on a chroma format signal indicating whether resolution of color components is one of 4:2:0 format, 4:2:2 format, and 4:4:4 format, and a color space signal indicating whether color space is one of YCbCr, RGB, and XYZ. An inverse orthogonal transform unit and an inverse quantization unit serve to also change orthogonal transform technique and quantization technique in accordance with the chroma format signal and the color space signal. A decoding unit decodes the chroma format signal and the color space signal to generate a prediction image corresponding to the chroma format signal and the color space signal.
    Type: Grant
    Filed: February 1, 2011
    Date of Patent: October 28, 2014
    Assignee: Sony Corporation
    Inventors: Teruhiko Suzuki, Akira Sugiyama, Kyohei Koyabu
  • Patent number: 8866649
    Abstract: Method and system for partially cloning a data container with compression is provided. A storage operating system determines if a portion of a source data container that is to be cloned includes a plurality of compressed blocks that are compressed using a non-variable compression group size. The operating system clones the plurality compressed blocks with the non-variable compression group size and de-compresses a plurality of blocks of the data container that are not within the non-variable compression group size. The plurality of compressed blocks and the plurality of blocks that are not within the non-variable compression group size are then stored as a partially cloned copy of the source data container.
    Type: Grant
    Filed: September 14, 2011
    Date of Patent: October 21, 2014
    Assignee: Netapp, Inc.
    Inventors: Sandeep Yadav, Dnyaneshwar Pawar, Anand Natarajan
  • Patent number: 8866647
    Abstract: A recording medium stores an information processing program that causes a computer to execute storing a compression symbol map group having a bit string indicating for each character code, presence or absence of the character code in a file group, and a Huffman tree whose leaf corresponding to the character code has a pointer to a compression symbol map of the character code, the Huffman tree converting the character code into a compression symbol of the character code; compressing sequentially and according to the Huffman tree, a character code to be compressed and described in a file of the file group; detecting access to the leaf at the compressing; identifying by a pointer in the accessed leaf, a compression symbol map of the character code to be compressed; and updating a bit that indicates presence or absence of the character code to be compressed, in the identified compression symbol map.
    Type: Grant
    Filed: June 1, 2012
    Date of Patent: October 21, 2014
    Assignee: Fujitsu Limited
    Inventors: Masahiro Kataoka, Tatsuhiro Sato
  • Publication number: 20140292548
    Abstract: A system and method for low-power digital signal processing, for example, comprising adjusting a digital representation of an input signal.
    Type: Application
    Filed: April 2, 2014
    Publication date: October 2, 2014
    Applicant: MaxLinear, Inc.
    Inventors: Curtis Ling, Jining Duan
  • Patent number: 8847798
    Abstract: A method of data compression includes obtaining a data set comprising a sequence of data blocks comprising a predetermined number of data items, partitioning said data set into one or more groups each comprising a predetermined number of data blocks, and performing data compression on one or more groups of data blocks. Data compression is performed by associating a control data item with each of said blocks, generating a control vector comprising the control data items assigned to each of said blocks within a group, removing data blocks comprising entirely data items having said specified value, compressing data blocks comprising at least one data item having a value different from said specified value using a fixed-rate compression scheme, providing a compressed data stream comprising said compressed data blocks, and providing an associated control vector stream to enable control of said compressed data stream.
    Type: Grant
    Filed: December 17, 2012
    Date of Patent: September 30, 2014
    Assignee: Maxeler Technologies, Ltd.
    Inventors: Oliver Pell, Stephen Girdlestone, Henning Meyer
  • Publication number: 20140266818
    Abstract: Disclosed is a method to convert a Unicode character. The method includes intercepting a service call for a character conversion, determining if a character associated with the service call is a candidate for a first conversion service, if the character is a candidate for the first conversion service, converting the character using the first conversion service, if the character is not a candidate for the first conversion service, converting the character using a second conversion service, and returning the converted character.
    Type: Application
    Filed: June 11, 2013
    Publication date: September 18, 2014
    Inventor: Michel LAVIOLETTE
  • Patent number: 8823561
    Abstract: A de-mapping circuit for de-mapping input words of a first length into output words of a second length different from the first length. In one embodiment, the circuit includes a word register of the first length and temporary registers of the second length. The word register successively stores each of the inputs words in response to cycles of a clock. The temporary registers temporarily store the output words. Multiplexers configured by address signals select bits from stored input words and store the selected bits into the temporary registers to form temporarily stored output words.
    Type: Grant
    Filed: April 20, 2012
    Date of Patent: September 2, 2014
    Assignee: Lattice Semiconductor Corporation
    Inventors: Michael Hammer, David Pierce, Jin Zhang
  • Patent number: 8824569
    Abstract: Mechanisms are provided for decoding a variable length encoded data stream. A decoder of a data processing system receives an input line of data. The input line of data is a portion of the variable length encoded data stream. The decoder determines an amount of bit spill over of the input line of data onto a next input line of data. The decoder aligns the input line of data to begin at a symbol boundary based on the determined amount of bit spill over. The decoder tokenizes the aligned input line of data to generate a set of tokens. Each token corresponds to an encoded symbol in the aligned next input line of data. The decoder generates an output word of data based on the set of tokens. The output word of data corresponds to a word of data in the original set of data.
    Type: Grant
    Filed: December 7, 2011
    Date of Patent: September 2, 2014
    Assignee: International Business Machines Corporation
    Inventors: Kanak B. Agarwal, Harm P. Hofstee, Damir A. Jamsek, Andrew K. Martin
  • Patent number: 8823557
    Abstract: Aspects of the invention are provided for decoding a selected span of data within a compressed code stream. A selection of data within the compressed code stream from an arbitrary position is presented for decompression. The arbitrary position is the starting point in the compressed code stream for decompression, and a phrase within the compressed code stream containing the starting point is identified. From the arbitrary starting point, a back pointer may provide direction to the literal. The literal is extracted as a decoding of the compressed data associated with the starting point.
    Type: Grant
    Filed: May 10, 2013
    Date of Patent: September 2, 2014
    Assignee: International Business Machines Corporation
    Inventors: David D. Chambliss, Mihail C. Constantinescu, Joseph S. Glider, Dilip N. Simha
  • Patent number: 8811467
    Abstract: A finite sequence of code values is formed, and can be used for example in communications or remote sensing. A code value in said finite sequence of code values has a validity period specific to that code value. There are code values of different validity periods in said finite sequence of code values. Each of said validity periods is longer than or equal to a predetermined minimum baud length.
    Type: Grant
    Filed: June 28, 2010
    Date of Patent: August 19, 2014
    Assignee: Fracticode Ltd.
    Inventor: Juha Vierinen
  • Patent number: 8804852
    Abstract: Mechanisms are provided for decoding a variable length encoded data stream. A decoder of a data processing system receives an input line of data. The input line of data is a portion of the variable length encoded data stream. The decoder determines an amount of bit spill over of the input line of data onto a next input line of data. The decoder aligns the input line of data to begin at a symbol boundary based on the determined amount of bit spill over. The decoder tokenizes the aligned input line of data to generate a set of tokens. Each token corresponds to an encoded symbol in the aligned next input line of data. The decoder generates an output word of data based on the set of tokens. The output word of data corresponds to a word of data in the original set of data.
    Type: Grant
    Filed: July 23, 2012
    Date of Patent: August 12, 2014
    Assignee: International Business Machines Corporation
    Inventors: Kanak B. Agarwal, Harm P. Hofstee, Damir A. Jamsek, Andrew K. Martin
  • Patent number: 8804044
    Abstract: An apparatus to provide a fall-back procedure for a PRC imaging device is described. The apparatus includes a PRC controller, a system resource monitor, and a PRC setting calculator. The PRC controller outputs a stream of images at an adjustable temporal rate. The adjustable temporal rate is constrained within a range defined by a first predetermined rate and a second predetermined rate. The system resource monitor obtains a measurement of system resource utilization. The PRC setting calculator determines a setting for the PRC controller in response to the measurement of system resource utilization. Additionally, the PRC controller determines a value for the adjustable temporal rate in response to the setting.
    Type: Grant
    Filed: March 6, 2009
    Date of Patent: August 12, 2014
    Assignee: Entropic Communications, Inc.
    Inventors: Erwin Bellers, Johan G. W. M. Janssen
  • Patent number: 8806292
    Abstract: A hybrid mechanism whereby hardware acceleration is combined with software such that the compression rate achieved is significantly increased while maintaining the original compression ratio (e.g., using full DHT and not SHT or an approximation). The compression acceleration mechanism is applicable to a hardware accelerator tightly coupled with the general purpose processor. The compression task is divided and parallelized between hardware and software wherein each compression task is split into two acceleration requests: a first request that performs SHT encoding using hardware acceleration and provides post-LZ frequency statistics; and a second request that performs SHT decoding and DHT encoding using the DHT generated in software.
    Type: Grant
    Filed: December 15, 2011
    Date of Patent: August 12, 2014
    Assignee: International Business Machines Corporation
    Inventors: Giora Biran, Amit Golander, Kiyoshi Nishino, Nobuyoshi Tanaka
  • Publication number: 20140218220
    Abstract: Data compression using a combination, of content independent data compression and content dependent data compression. In one aspect, a method for compressing data comprises: determining whether or not a parameter or attribute of data within a data block is identified for the data block wherein the determining is not based solely on a descriptor that is indicative of the parameter or attribute of the data within the data block; and compressing the data block with at least one encoder associated with the parameter or attribute of the data within the data block to provide a compressed data block.
    Type: Application
    Filed: April 11, 2014
    Publication date: August 7, 2014
    Applicant: Realtime Data, LLC
    Inventor: James J. FALLON
  • Patent number: 8797193
    Abstract: A parallel test payload includes a bit sequence configured to be segmented into a plurality of sub-sequences having variable bit length carriers. Respective carriers are represented uniformly in each one of the plurality of sub-sequences.
    Type: Grant
    Filed: January 29, 2010
    Date of Patent: August 5, 2014
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Robert Alan Ulichney, Steven J. Simske, Matthew D. Gaubatz
  • Publication number: 20140210652
    Abstract: An encoder for encoding a sequence of symbols is described which has an assigner configured to assign a number of parameters to each symbol of the sequence of symbols based on information contained within previous symbols of the sequence of symbols; a plurality of entropy encoders each of which is configured to convert the symbols forwarded to the respective entropy encoder into a respective bitstream; and a selector configured to forward each symbol to a selected one of the plurality of entropy encoders, the selection depending on the number of parameters assigned to the respective symbol.
    Type: Application
    Filed: March 31, 2014
    Publication date: July 31, 2014
    Applicant: Fraunhofer-Gesellschaft zur Foerderung der angewandten Forschung e.V.
    Inventors: Christian BARTNIK, Benjamin BROSS, Valeri GEORGE, Anastasia HENKEL, Tobias HINZ, Heiner KIRCHHOFFER, Detlev MARPE, Tung NGUYEN, Matthias PREISS, Thomas SCHIERL, Heiko SCHWARZ, Mischa SIEKMANN, Jan STEGEMANN, Thomas WIEGAND
  • Patent number: 8786473
    Abstract: Systems and methods of storing previously transmitted data and using it to reduce bandwidth usage and accelerate future communications are described. By using algorithms to identify long compression history matches, a network device may improve compression efficiently and speed. A network device may also use application specific parsing to improve the length and number of compression history matches. Further, by sharing compression histories and compression history indexes across multiple devices, devices can utilize data previously transmitted to other devices to compress network traffic. Any combination of the systems and methods may be used to efficiently find long matches to stored data, synchronize the storage of previously sent data, and share previously sent data among one or more other devices.
    Type: Grant
    Filed: October 18, 2011
    Date of Patent: July 22, 2014
    Assignee: Citrix Systems, Inc.
    Inventors: Allen R. Samuels, Richard Jensen, Zubin Dittia, Dan S. Decasper, Michael Ovsiannikov, Robert D. Plamondon
  • Patent number: 8762602
    Abstract: An information handling system includes a multi-core processor that processes variable-length code (VLC) bitstream data. The bitstream data includes multiple codewords that the processor organizes into functionally common subsets. The processor includes a general purpose processor (GPU) and one or more special purpose processor (SPUs). An SPU of the processor may includes two SPU buffers. The processor first transfers bitstream data into GPU buffer memory and then populates the SPU buffers one after another with bitstream data. The SPU buffers may each include an overlap region that the SPU populates with the same bitstream data. The SPU parses the bitstream data in the SPU buffers in alternating fashion. The SPU may shift parsing from the one SPU buffer to the other SPU buffer when parsing reaches a subset boundary within an overlap region.
    Type: Grant
    Filed: July 22, 2008
    Date of Patent: June 24, 2014
    Assignee: International Business Machines Corporation
    Inventors: Kuan Feng, Huo Ding Li, Xing S H Liu, Rong Yan, Yu Yuan, Sheng Xu
  • Patent number: 8760326
    Abstract: A method for data transmission from a programming device to a control unit, the data being compressed by Huffman coding and transmitted with a Huffman coding tree for decoding from the programming device to the control unit, are decompressed and stored in the control unit, by performing, for a predetermined number of data words of N-bits, a first Huffman coding with a first coding tree; performing, for the remaining data words consisting of M-bits, a second Huffman coding with a second coding tree, N greater than M, the predetermined number of data words of N-bits and the remaining data words of M-bits consisting of more than two data words, generating coding trees for the N-bit and the M-bit data words, and transmitting them to the control unit, and providing all coded N-bit data words and N/M of successive M-bit data words with a preceding code bit.
    Type: Grant
    Filed: February 23, 2011
    Date of Patent: June 24, 2014
    Assignee: Knorr-Bremse Systeme fuer Nutzfahrzeuge GmbH
    Inventor: Uwe Fischer
  • Patent number: 8754792
    Abstract: A system and method combine an entropy coding algorithm like Huffman or arithmetic coding with a fixed length coding scheme and can improve the compression performance in a fixed rate compression scheme. The fixed length code assigns codes with a fixed length to symbols that have the highest probability of occurrence. Therefore, fixed length coding is used if all symbols in the sequence are from the set of symbols that have the highest probability values. Otherwise an entropy coding algorithm (e.g. Huffman coding) is used to encode quantized symbols.
    Type: Grant
    Filed: September 2, 2012
    Date of Patent: June 17, 2014
    Assignee: Sigma Designs, Inc.
    Inventor: Alireza Shoa Hassani Lashdan
  • Publication number: 20140159928
    Abstract: According to an embodiment, a decoding apparatus includes a clipping unit and a decoding unit. The clipping unit is configured to clip pieces of encoded data each having a predetermined first code length from input data encoded with variable-length encoding. The predetermined first code length is greater than or equal to a maximum code length among a plurality of pieces of encoded data included in the input data. The decoding unit is configured to decode the clipped piece of encoded data by using variable-length decoding.
    Type: Application
    Filed: December 10, 2013
    Publication date: June 12, 2014
    Applicant: KABUSHIKI KAISHA TOSHIBA
    Inventor: Atsushi MATSUMURA
  • Patent number: 8749409
    Abstract: An entropy decoding apparatus may include a data structure stored in memory. The data structure may include a decoding engine vector or context engine vector. The decoding engine vector many have a first set of bits representing a value corresponding to a state of a coding engine, a second set of bits representing an offset value, and a third set of bits representing the contents of an input stream buffer. The context vector may have a first set of bits representing an addresses of a context most probable state, a second set of bits representing a plurality of possible values corresponding to a least probable symbol state of a coding engine, a third set of bits representing an addresses of a context least probable state, a fourth set of bits representing a binary most probable symbol value, and a fifth set of bits representing a binary least probable symbol value.
    Type: Grant
    Filed: May 23, 2011
    Date of Patent: June 10, 2014
    Assignee: Sony Computer Entertainment Inc.
    Inventor: Xun Xu
  • Patent number: 8742958
    Abstract: The transmission of broadcast data, such as financial data and news feeds, is accelerated over a communication channel using data compression and decompression to provide secure transmission and transparent multiplication of communication bandwidth, as well as reduce the latency. Broadcast data may include packets having fields. Encoders associated with particular fields may be selected to compress those particular fields.
    Type: Grant
    Filed: September 24, 2013
    Date of Patent: June 3, 2014
    Assignee: Realtime Data LLC
    Inventors: James J. Fallon, Paul F. Pickel, Stephen J. McErlain, Carlton J. Melone, II
  • Publication number: 20140145641
    Abstract: A signal processing method for a single wire, includes receiving an input signal via the single wire, wherein the input signal includes a plurality of pulse signals; generating a plurality of bits corresponding to the plurality of pulse signals according to a plurality of widths of the plurality of pulse signals and forming a source code; and decoding the source code to generate a control code; wherein when a width of a first pulse signal of the plurality of pulse signals is smaller than a first duration, a first bit corresponding to the first pulse signal is a first bit value and when a width of a second pulse signal of the plurality of pulse signals is greater than a second duration, a second bit corresponding to the second pulse signal is a second bit value.
    Type: Application
    Filed: February 19, 2013
    Publication date: May 29, 2014
    Applicant: ANPEC ELECTRONICS CORPORATION
    Inventors: Chin-Hong Chen, San-Yi Li, Chieh-Wen Cheng
  • Patent number: 8739008
    Abstract: A method for determining a parity check matrix utilized in a flash memory system is disclosed. The parity check matrix comprises M×N blocks. The method includes generating a first set of candidate blocks as candidates of a first set of blocks of the M×N blocks; calculating a plurality of first estimated results corresponding to the first set of candidate blocks; determining content of a first block of the M×N blocks according to a best result of the first estimated results; generating a second set of candidate blocks as candidates of a second set of blocks of the M×N blocks; calculating a plurality of second estimated results corresponding to the second set of candidate blocks by considering the content of the first block; determining content a second block of the M×N blocks according to the second estimated results.
    Type: Grant
    Filed: February 22, 2012
    Date of Patent: May 27, 2014
    Assignee: Silicon Motion, Inc.
    Inventor: Zhen-U Liu
  • Patent number: 8724703
    Abstract: A method for motion estimation with respect to a sequence of images. Respective updates are generated based on predictor vectors. The updates are distributed over a plurality of tables, which are organized in a plurality of table sets. Only a single table of updates, of a respective selected table set, is applied to a given predictor vector to generate a limited set of candidate vectors only. For a subsequent predictor vector, a further single table of the plurality of tables out of the plurality of table sets is applied.
    Type: Grant
    Filed: March 28, 2007
    Date of Patent: May 13, 2014
    Assignee: Sony Deutschland GmbH
    Inventors: Joerg Tappermann, Yalcin Incesu
  • Patent number: RE45300
    Abstract: A variable-length coding apparatus which receives image data block by block, and generates coded data from syntax elements. A storage unit temporarily stores the image data, while, at the same time, a first syntax element calculating unit calculates a first syntax element from the image data. A first coding unit generates coded data of the first syntax element from a value of the first syntax element. A second syntax element is calculated from the image data by a second syntax element calculating unit that reads out the image data stored in the storage unit. A second coding unit generates coded data of the second syntax element on the basis of the values of the first and second syntax elements, and a packing unit connects the coded data of the first and second syntax elements.
    Type: Grant
    Filed: March 5, 2013
    Date of Patent: December 23, 2014
    Assignee: Canon Kabushiki Kaisha
    Inventor: Koichi Suzuki