To Or From Variable Length Codes Patents (Class 341/67)
  • Patent number: 7994949
    Abstract: A character data set is compressed with a compression algorithm module of a computer system to generate one or more streams of encoded values. The compression module is configured to compress the character data set with an entropy encoder to generate one or more streams of encoded values with UTF-8 or UTF-16. A code points mapper assigns the encoded values to code points in a Unicode format. A UTF encoder encodes the streams of assigned encoded values.
    Type: Grant
    Filed: November 30, 2009
    Date of Patent: August 9, 2011
    Assignee: Red Hat, Inc.
    Inventor: James Paul Schneider
  • Patent number: 7994948
    Abstract: Provided is a table generation method of decoding a variable-length code. The table generation method includes receiving a variable-length code table and a search width N, generating a K-ary tree from the variable-length code table and the search width N, and generating an N-bit code table from the K-ary tree.
    Type: Grant
    Filed: May 29, 2009
    Date of Patent: August 9, 2011
    Assignee: Electronics and Telecommunications Research Institute
    Inventors: Seung Hyun Cho, Moo Kyoung Chung, Kyung Su Kim, Jae Jin Lee, Jun Young Lee, Seong Mo Park, Nak Woong Eum
  • Publication number: 20110176646
    Abstract: An input bit stream is received and zone statistics such as zones count, zones center bit positions, and zones lengths are determined, where a zone is a set of non-transitioning bits in the input bit stream. Beginning and ending bit positions for each zone are determined simultaneously, and each beginning bit position is associated with an ending bit position. Zone statistics are calculated using the determined beginning and appropriate ending bit positions.
    Type: Application
    Filed: January 18, 2010
    Publication date: July 21, 2011
    Applicant: FREESCALE SEMICONDUCTOR, INC.
    Inventors: Ankit PAL, Girraj K. Agrawal, Asif Iqbal
  • Publication number: 20110169670
    Abstract: Apparatus having corresponding methods and tangible computer-readable media comprise: an input module to receive a bitstream representing data words encoded according to a variable-length code; a peek module to select a peek block comprising a predetermined number of consecutive bits in the bitstream; and a decoder to provide a plurality of the data words based on the peek block.
    Type: Application
    Filed: August 18, 2009
    Publication date: July 14, 2011
    Inventors: Dayin Gou, Shuguang Gong
  • Patent number: 7978103
    Abstract: To provide a code amount estimating device which can perform, at high speed and with high precision, estimation of code amount obtained after arithmetic coding. The code amount estimating device includes a context index calculation unit which calculates a context index of a binary symbol included in binary data, and an estimate code amount calculation unit which calculates an estimate code amount for the binary data based on symbol occurrence probability information stored in association with the calculated context index and on a held probability interval range. The estimate code amount calculation unit estimates the code amount for the binary data according to code amount information indicating an association between (i) a combination of a binary symbol string including one or more binary symbols, symbol occurrence probability information, and a probability interval range and (ii) an estimate code amount for the binary symbol string.
    Type: Grant
    Filed: March 16, 2010
    Date of Patent: July 12, 2011
    Assignee: Panasonic Corporation
    Inventors: Yukinaga Seki, Takuma Chiba, Kenjiro Tsuda, Tatsuro Juri
  • Patent number: 7970223
    Abstract: A variable-length encoder that feeds a Coded Block Pattern (CBP) as an input symbol to variable-length code output part. Coded symbol memory supplies CBPs in neighboring blocks as coding map table reference information to coding map table provider. Coding map table provider determines a coding map table used in coding of the CBP, based on these CBPs in the neighboring blocks, and provides a coding map table H4 to variable-length code output part. Variable-length coding table provider feeds a variable-length coding table to variable-length code output part. Then the coding target CBP is subjected to variable-length coding, and the resultant is outputted as coded data. This allows information source coding of coding symbols to be performed efficiently according to the coding condition and the property of image.
    Type: Grant
    Filed: September 11, 2009
    Date of Patent: June 28, 2011
    Assignee: NTT DoCoMo, Inc.
    Inventors: Kazuo Sugimoto, Satoru Adachi, Sadaatsu Kato, Minoru Etoh, Mitsuru Kobayashi, Hiroyuki Yamaguchi
  • Publication number: 20110150351
    Abstract: Parallelization of decoding of a data stream encoded with a variable length code includes determining one or more markers, each of which indicates a position within the encoded data stream. The determined markers are included into the encoded data stream together with the encoded data. At the decoder side, the markers are parsed from the encoded data stream and based on the extracted markers. The encoded data is separated into partitions, which are decoded separately and in parallel.
    Type: Application
    Filed: February 9, 2010
    Publication date: June 23, 2011
    Applicant: STMICROELECTRONICS Pvt. Ltd.
    Inventors: Surinder Pal SINGH, Aneesh Bhasin, Kaushik Saha
  • Publication number: 20110150097
    Abstract: The invention relates to a method for encoding of a bit amount of a data section and to a corresponding decoding method. Furthermore, the invention relates to encoding, decoding, transmission and/or storage of audio and/or video data wherein said method for encoding of a bit amount of a data section and/or said corresponding decoding method are used in processing of the audio and/or video data. Said method for encoding of a bit amount of a data section comprises the steps of encoding said bit amount indicating integer as a first number of equally valued bits followed by a stop bit of different value wherein said first number equals said bit amount increased by a threshold value. Using said method, quotients of values larger than a threshold can be encoded using unary as well as binary code wherein quotients of values smaller than the threshold can be encoded in unary code.
    Type: Application
    Filed: June 25, 2009
    Publication date: June 23, 2011
    Inventor: Johannes Boehm
  • Patent number: 7965206
    Abstract: An apparatus and a method of lossless coding and decoding are provided. The apparatus to perform lossless coding may selectively perform an arithmetic coding scheme or a Huffman coding scheme with respect to a symbol. The apparatus to perform lossless coding may generate a bitstream including a first coding bit, generated according to the Huffman coding scheme. Such bitstream may include a reserved bit for the arithmetic coding scheme.
    Type: Grant
    Filed: April 30, 2009
    Date of Patent: June 21, 2011
    Assignee: SAMSUNG Electronics Co., Ltd.
    Inventors: Ki Hyun Choo, Konstantin Osipov, Boris Kudryashov
  • Patent number: 7965207
    Abstract: Large integers may be stored according to byte-stable variable-length encoding systems and methods, eliminating the need to store many leading-zero bits in large integers. Such a byte-stable variable-length integer encoding scheme may represent identical sequences of numbers in a consistent byte pattern within a byte stream, preserving the redundancy of the data and allowing for improved compression rates.
    Type: Grant
    Filed: October 2, 2009
    Date of Patent: June 21, 2011
    Assignee: SEOmoz, Inc.
    Inventor: Benjamin Cappel Hendrickson
  • Patent number: 7956774
    Abstract: An image coding apparatus provides a run-length encoding unit RLE1 that subjects quantized coefficients which are 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 that is 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 that is selected according to the number of already-processed run values.
    Type: Grant
    Filed: February 19, 2010
    Date of Patent: June 7, 2011
    Assignee: Panasonic Corporation
    Inventors: Shinya Kadono, Satoshi Kondo, Makoto Hagai, Kiyofumi Abe
  • Patent number: 7956785
    Abstract: The present invention relates to a digital to analog converter, to a return-to-zero digital to analog converter with improved wideband characteristics by enabling a return-to-zero output without separate clock and controller, and a converting method thereof. Since the return-to-zero digital to analog converter and the converting method thereof are capable of outputting an RZ output without directly providing a clock signal to an analog circuit by configuring a switch for generating a zero point signal and a differential pipeline for providing a differential signal to control the switch according to input digital data using a differential structure, the converter can provide wideband characteristics and high dynamic performance.
    Type: Grant
    Filed: December 28, 2009
    Date of Patent: June 7, 2011
    Assignee: Chung-Ang University Industry-Academy Cooperation Foundation
    Inventors: Kwang-Hyun Baek, Hong Chang Yeoh, Jae-Hun Jung, Yun-Hwan Jung, Joon Hyun Baek
  • Patent number: 7956773
    Abstract: Provided is a bit stream processor using a reduced table lookup. The bit stream processor includes a bit stream exclusive register in a general purpose register in order to process data of a variable length effectively. Additionally, the bit stream processor an instruction of a table lookup method to which a prefix method is applied and a bit stream exclusive instruction in order to reduce an entire memory size.
    Type: Grant
    Filed: June 10, 2009
    Date of Patent: June 7, 2011
    Assignees: Electronics and Telecommunications Research Institute, Kwangwoon University Industry-Academic Collaboration Foundation
    Inventors: Se-Wan Heo, Seong-Won Lee, Jung-Hee Suk, Tae-Moon Roh, Jong-Dae Kim
  • Patent number: 7948406
    Abstract: A method for encoding a sequence of integers includes identifying a contiguous sub-sequence in the sequence of integers wherein the sub-sequence includes interrelated integers having a same prefix when being variable length encoded and an independent last integer. A code for the contiguous sub-sequence is formed using a code for an indication of the number of interrelated integers in the contiguous subsequence, a code of a prefix indication, and the suffixes of variable length codes of the integers in the contiguous sub-sequence. In doing so, a single prefix is sufficient instead of n individual prefixes.
    Type: Grant
    Filed: April 21, 2009
    Date of Patent: May 24, 2011
    Assignee: Thomson Licensing
    Inventors: Qu Qing Chen, Zhi Bo Chen, Jun Teng
  • Publication number: 20110102208
    Abstract: Provided is an encoding apparatus including an encoding unit that converts, based on a first conversion rule group according to which a total value for a base-K symbol sequence is X and a second conversion rule group according to which the total value for the base-K symbol sequence is ?X among conversion rule groups for converting an L-bit bit sequence into the base-K symbol sequence (K>2) of N/2 symbol, an M-bit (M?2*L) bit sequence into the base-K symbol sequence of N symbols. When converting the M-bit bit sequence into the base-K symbol sequence of N symbols, the encoding unit converts a first-half N/2 symbol based on the first conversion rule group and converts a second-half N/2 symbol based on the second conversion rule group.
    Type: Application
    Filed: October 21, 2010
    Publication date: May 5, 2011
    Applicant: Sony Corporation
    Inventor: Toru Terashima
  • Patent number: 7936290
    Abstract: A data compressor for compressing a data signal and a corresponding data decompressor are disclosed. The data compressor comprises: compression circuitry for compressing said data signal using a plurality of variable length compression codes; a digital code select signal generator for generating a digital code select signal from an indicator signal indicative of a preferred compression distribution, a frequency of said digital code select signal being higher than a frequency of said indicator signal and an average value of said digital code select signal corresponding to an average value of said indicator signal; said compression circuitry being responsive to said digital code select signal to select between one of said plurality of compression codes in dependence upon a current value of said digital code select signal and to compress said data signal using said selected compression code.
    Type: Grant
    Filed: November 2, 2009
    Date of Patent: May 3, 2011
    Assignee: ARM Limited
    Inventors: Martinus Cornelis Wezelenburg, Jeremy Piers Davies
  • Publication number: 20110084859
    Abstract: A data modulation apparatus includes: insertion means for inserting information bits into data at a predetermined interval; conversion means for converting the data into which the information bits are inserted into an RLL code based on a modulation table that has a variable-length conversion rule; setting means for setting a control section that is used for calculating a value of the information bit; and determination means for determining the value of the information bit inserted into the control section that is different from a calculation target by calculating the code of the control section.
    Type: Application
    Filed: September 21, 2010
    Publication date: April 14, 2011
    Applicant: Sony Corporation
    Inventor: Toshiyuki NAKAGAWA
  • Publication number: 20110084858
    Abstract: An encoding apparatus includes a unit that calculates a plurality of normalized values by dividing input values in an input signal by either a normalization coefficient that is closest to a maximum value of absolute values of the input values or a normalization coefficient that is closest to the maximum value from among normalization coefficients that are larger than the maximum value; a unit that generates a plurality of quantized values by quantizing the plurality of normalized values; a unit that stores a code table in which the smaller the probability of occurrence of the plurality of quantized values, the longer the code length of a variable-length code allocated to the plurality of quantized values; and a unit that outputs, when the plurality of quantized values are all zero, a variable-length code allocated to a combination of a plurality of quantized values in accordance with the code table.
    Type: Application
    Filed: August 30, 2010
    Publication date: April 14, 2011
    Inventors: Shiro SUZUKI, Yuuki Matsumura, Yasuhiro Toguri, Yuuji Maeda
  • Publication number: 20110085537
    Abstract: Techniques for encoding a phase adjustment for a feedback signal in a closed-loop transmit diversity system. In an aspect, codewords for the phase adjustments are chosen according to a variable-length prefix code. The prefix code aspect allows the codewords to be transmitted in sequence on the feedback channel without being separated by “commas” or demarcation symbols. The variable-length aspect provides a variety of coarse and fine phase adjustment quantization step sizes to accommodate multiple different channel scenarios. In an aspect, the length of the codewords may be further optimized according to the Huffman encoding algorithm.
    Type: Application
    Filed: October 8, 2009
    Publication date: April 14, 2011
    Applicant: QUALCOMM Incorporated
    Inventors: Ming-Chang Tsai, Ann Tsuey Jiuan Wu, Hailiang Cai
  • Patent number: 7924180
    Abstract: A decoder for decoding an input bit stream into a plurality of symbols is provided. The decoder includes an extractor, a length generator, a base selector, and a processing unit. The extractor receives the input bit stream and extracts a code with a predetermined codeword length therefrom. The length generator receives the extracted code and determines a first codeword length corresponding to a symbol according to the extracted code and a base table. The base selector determines a codeword base corresponding to the first codeword length according to the base table. The processing unit generates the symbol corresponding to the extracted code according to the codeword base, an offset table and the first codeword length.
    Type: Grant
    Filed: November 19, 2009
    Date of Patent: April 12, 2011
    Assignee: Mediatek Inc.
    Inventor: Yung-Chang Chang
  • Patent number: 7924179
    Abstract: To provide a decoding device that compactly stores prefix related information therein compatible to variable-length codes used in various systems. The decoding device includes a register file in which a prefix common portion and a word length of the prefix common portion, prefix individual portions and word lengths of the prefix individual portions, word lengths of suffixes, and an input bit sequence are stored, a bit matching unit that determines a prefix included in the input bit sequence from prefixes generated from the prefix common portion and the prefix individual portions, a codeword computation unit that computes the word length of a codeword included in the input bit sequence using the respective word lengths of the prefix common portion, a prefix individual portion, and a suffix corresponding to the determined prefix, and an index computation unit that computes an index in a symbol table using the respective word lengths of the corresponding suffix and the codeword.
    Type: Grant
    Filed: March 15, 2007
    Date of Patent: April 12, 2011
    Assignee: NEC Corporation
    Inventor: Takahiro Kumura
  • Patent number: 7924843
    Abstract: Methods, apparatus and computer readable code for compression, encoding and decoding of units of data such as packets are disclosed. In some embodiments, methods, apparatus and computer readable code for transmitting and/or receiving the data packets (for example, transmitting from a sending location to a receiving location where packets are received) are provided. For at least some packets, a dictionary is determined from a respective group of packets, including a first set of historical packets and excluding a second set of historical packet. Each target packet is encoded and/or compressed and/or decoded using the respective dictionary. Optionally, the respective group of packet includes the actual target packet to be encoded and/or compressed and/or decoded.
    Type: Grant
    Filed: November 24, 2009
    Date of Patent: April 12, 2011
    Assignee: Ramot at Tel Aviv University Ltd.
    Inventors: Yossi Matias, Raanan Refua
  • Patent number: 7926007
    Abstract: A writing apparatus includes a unit storing writing data, a unit which acquires pattern information on patterns defined in the data, a unit which generates a table where each pattern information corresponds to a number of times each pattern information is used, for each predetermined region, a unit which generates a Huffman tree, based on the table, a unit which generates another table where each pattern information corresponds to a variable length binary code generated by encoding each pattern information such that the larger the number of times each pattern information is used, the smaller a value of the code, based on the tree, a unit which produces converted data, which is defined by the data, in the region into a predetermined format using the code, based on the other table, and a unit which writes the patterns defined, onto a workpiece, based on the converted data in the region.
    Type: Grant
    Filed: January 27, 2009
    Date of Patent: April 12, 2011
    Assignee: NuFlare Technology, Inc.
    Inventor: Hayato Shibata
  • Publication number: 20110080308
    Abstract: A variable length code decoding device for decoding variable length code data, including: a table memory that stores a plurality of decoding process tables having a reference relationship therein; and a decoding control unit that sequentially selects the decoding process tables according to the decoded data to control a process of decoding the variable length code data, wherein when referring to the decoding process table to perform an initial decoding of the variable length code data, the initial decoding process is conducted by a longer bit length to be clipped from the variable length code data for referring to the decoding process table than the bit length used when referring to the other portions of the decoding process table.
    Type: Application
    Filed: December 6, 2010
    Publication date: April 7, 2011
    Inventors: Hiroaki NAKATA, Fumitaka Izuhara, Kazushi Akie, Takafumi Yuasa
  • Patent number: 7920629
    Abstract: Transform coefficients of sample blocks of a macroblock of a video picture are encoded by adaptively encoding a combination, the number of non-zero coefficients before the trailing one coefficients and the number of trailing one coefficients. The transform coefficients may be further encoded by adaptively encoding one or more of the signs of the trailing one coefficients, the level measures of the interposed in the non-zero coefficients. Adaptive encoding of the number and trailing one coefficients may be performed in view of one or more neighboring sample blocks, whereas adaptive encoding of level measure may be performed in view of quantization parameters of a macroblock and previously encoded level measures. Decoding may be performed in an inverse manner.
    Type: Grant
    Filed: August 25, 2006
    Date of Patent: April 5, 2011
    Assignee: RealNetworks, Inc.
    Inventors: Gisle Bjontegaard, Karl O. Lillevold
  • Patent number: 7916047
    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, compression history indexes and caches 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 16, 2008
    Date of Patent: March 29, 2011
    Assignee: Citrix Systems, Inc.
    Inventors: Allen Samuels, Richard Jensen, Zubin Dittia, Dan Decasper, Michael Ovsiannikov, Robert Plamondon
  • Patent number: 7907071
    Abstract: This invention converts Packbit-encoded data into new Packbit-encoded data which allows to have a throughput=M. a extraction unit separates inputted encoded data into length information and data information, and outputs them to a conversion unit. The conversion unit has a count unit which cumulatively counts the number of output data after decoding indicated by the separated length information. The conversion unit divides length information of interest into first length information and second length information as needed, outputs the first length information, and sets the second length information as an initial count target to be counted by the count unit, so that the counted number N of output data reaches the throughput=M. The conversion unit combines the generated length information and the separated data information, and outputs new Packbit-encoded data.
    Type: Grant
    Filed: April 9, 2009
    Date of Patent: March 15, 2011
    Assignee: Canon Kabushiki Kaisha
    Inventor: Naotsugu Itoh
  • Patent number: 7903891
    Abstract: Variable-length encoder 16 feeds a CBP as an input symbol H1 to variable-length code output part 30. Coded symbol memory 31 supplies CBPs in neighboring blocks as coding map table reference information H2 to coding map table provider 32. Coding map table provider 32 determines a coding map table used in coding of the CBP, based on these CBPs in the neighboring blocks, and provides a coding map table H4 to variable-length code output part 30. Variable-length coding table provider 33 feeds a variable-length coding table H5 to variable-length code output part 30. Then the coding target CBP is subjected to variable-length coding, and the resultant is outputted as coded data D9. This allows information source coding of coding symbols to be performed efficiently according to the coding condition and the property of image.
    Type: Grant
    Filed: May 25, 2007
    Date of Patent: March 8, 2011
    Assignee: NTT DoCoMo, Inc.
    Inventors: Kazuo Sugimoto, Satoru Adachi, Sadaatsu Kato, Minoru Etoh, Mitsuru Kobayashi, Hiroyuki Yamaguchi
  • Patent number: 7903741
    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: November 15, 2005
    Date of Patent: March 8, 2011
    Assignee: Canon Kabushiki Kaisha
    Inventor: Koichi Suzuki
  • Patent number: 7898444
    Abstract: A decoding method comprising the following steps is provided. The mth lookup index for a new lookup table is obtained according to the number of leading 1's in the bit stream. The nth base Huffman code in a simplified Huffman table is obtained according to the mth lookup index. The (n+1) most significant bits (MSB) are obtained from the bit stream according to the nth base Huffman code. A difference is generated according to the (n+1) MSBs in the bit stream and the nth base Huffman code. Whether the difference is less than 0 is checked. If yes, a symbol index is generated according to the difference and the nth base symbol index, and a symbol is obtained according to the symbol index. If no, n is decreased or increased by 1 according to the method being used, and the data in the simplified Huffman table is compared continually.
    Type: Grant
    Filed: October 8, 2009
    Date of Patent: March 1, 2011
    Assignee: Industrial Technology Research Institute
    Inventors: Wen-Shan Wang, Po-Wen Cheng
  • Patent number: 7893851
    Abstract: Disclosed is an apparatus in which there are provided a first storage unit for storing signals to which indexes are given in order to distinguish each of a plurality of signals that are to be coded; a first index computing unit for computing first indexes of non-zero signals among the signals stored in the first storage unit; a second index computing unit for computing second indexes from a base index and the first indexes; a second index storage position search unit for searching for a storage position in a second storage unit in which the second indexes are to be stored based on values of the indexes stored in the second storage unit; a second index preserving unit for preserving the second index in the second storage unit based on a storage position searched for by the second index storage position search unit; and a control unit for giving the base index to the second index computing unit and for controlling operation of the first index computing unit, the second index computing unit the second index stor
    Type: Grant
    Filed: November 27, 2007
    Date of Patent: February 22, 2011
    Assignee: NEC Corporation
    Inventor: Takahiro Kumura
  • Patent number: 7894532
    Abstract: A variable-length encoding apparatus receives image data on a block basis, generates a plurality of syntax elements from the image data, and outputs an encoded stream by performing variable-length encoding of the syntax elements. This apparatus includes a block memory unit group including at least two block memory units which store image data on a block basis, generates at least one syntax element by reading out transformation coefficients from the block memory units, independently variable-length-encodes each of syntax elements and outputs variable-length codewords, includes a variable-length code memory unit group including at least two variable-length code memory units which independently store the variable-length codewords as codeword streams, and generates one encoded stream from the respective codeword streams supplied from the variable-length code memory unit group.
    Type: Grant
    Filed: November 29, 2005
    Date of Patent: February 22, 2011
    Assignee: Canon Kabushiki Kaisha
    Inventor: Katsumi Otsuka
  • Patent number: 7889103
    Abstract: To reduce the complexity of the encoding/decoding of pulse positions and/or pulse magnitudes associated with complex combinatorial computations, a method and structure for encoding and decoding of pulse position and/or pulse magnitudes requires fewer computations of these combinatorial functions. Adaptive switching between coding or encoding is performed in accordance with the estimated density of the plurality of occupied positions.
    Type: Grant
    Filed: March 13, 2008
    Date of Patent: February 15, 2011
    Assignee: Motorola Mobility, Inc.
    Inventors: Udar Mittal, James P. Ashley
  • Patent number: 7884742
    Abstract: A system for compressing digital data by representing a portion of it predictionally and transformationally as a block of transform coefficients, then quantizing that block selectively into a set of encoding symbols based on an indication whether the transform coefficients represent the portion as having a particular characteristic, and then by encoding the set of encoding symbols into a data bit stream. In particular, frequency may be used as the characteristic of the digital data in many applications.
    Type: Grant
    Filed: June 8, 2006
    Date of Patent: February 8, 2011
    Assignee: Nvidia Corporation
    Inventors: Rohit Puri, Parthasarathy Sriram
  • Patent number: 7872598
    Abstract: Techniques for decompressing a compressed input by determining, according to an ordering of allowable codewords, an offset for a variable length codeword detected in the input; accessing a record at the determined offset in a data structure having one record for each of the allowable codewords, each record including a portion for at least one of a literal value and a length value and a portion for a type value indicative of whether the record is for a literal or a length; and determining a decompressed output based at least in part on the accessed record.
    Type: Grant
    Filed: December 10, 2008
    Date of Patent: January 18, 2011
    Assignee: Intel Corporation
    Inventors: Selcuk Baktir, Vinodh Gopal, Gilbert Wolrich, Prashant Paliwal, Wajdi Feghali
  • Patent number: 7864082
    Abstract: A variable length code decoding device for decoding variable length code data, including: a table memory that stores a plurality of decoding process tables having a reference relationship therein; and a decoding control unit that is given a start address and an initial reference bit length of the table memory; and sequentially selects the decoding process tables according to the decoded data to control a process of decoding the variable length code data, wherein when referring to the decoding process table to perform an initial decoding of the variable length code data, the initial decoding process is conducted by a longer bit length to be clipped from the variable length code data for referring to the decoding process table than the bit length used when referring to the other portions of the decoding process table.
    Type: Grant
    Filed: May 18, 2009
    Date of Patent: January 4, 2011
    Assignee: Renesas Electronics Corporation
    Inventors: Hiroaki Nakata, Fumitaka Izuhara, Kazushi Akie, Takafumi Yuasa
  • Patent number: 7864081
    Abstract: An embodiment of the present inventions is a method for encoding/decoding data of variable length format and is used to omit unnecessary pieces of data for the purpose of improving processing performance, reducing the size of data on communication paths and efficiently using limited physical memory. As examples of such variable length encoding, BER compression and UTF-8 encoding of UNICODE text, etc., are cited. While the amount of data can be reduced through encoding, before the data is actually used, it is necessary to restore (decode) it to the original data, which requires a great deal of processing time. One aspect of the present invention is improving decoding by reducing the processing time required to decode the encoded data.
    Type: Grant
    Filed: June 9, 2008
    Date of Patent: January 4, 2011
    Assignee: International Business Machines Corporation
    Inventors: Hiroshi Inoue, Hideaki Komatsu, Moriyoshi Ohara
  • Patent number: 7864087
    Abstract: A method for coding a message of a plurality of m-state symbols into a coded message of n-state symbols wherein n>m is disclosed. A method to make the distribution of states of n-state symbols a uniform distribution is also disclosed. A coding rule is initiated based on a distribution of states of m-state symbols. A method of coding the coding rule by transposition is also provided. In one embodiment a coded message of n-state symbols has symbols that each have a unique state. A system for executing the coding and decoding methods is also disclosed.
    Type: Grant
    Filed: December 21, 2009
    Date of Patent: January 4, 2011
    Assignee: Ternarylogic LLC
    Inventor: Peter Lablans
  • Patent number: 7853090
    Abstract: An image representation format for representing a digital image including image information stored as a bitstream representing sequential image blocks, each block comprising one or more components, each component comprising one or more data units and each data unit being represented as a Huffman-coded stream of coefficients of basis functions, wherein a zeroth order coefficient is represented as a difference to the previous zeroth order coefficient of the corresponding component, and a block information table, which comprises: indicators to the first coefficient of a specified order of each image block in the bitstream, information indicating the number of bits in the bitstream between adjacent coefficients of the specified order of the image block, and the zeroth order coefficient of at least the first data unit of each component, the zeroth order coefficient being represented in a non-differential form.
    Type: Grant
    Filed: December 15, 2008
    Date of Patent: December 14, 2010
    Assignee: Scalado AB
    Inventors: Sami Niemi, Karl-Anders Johansson, Johan Stén
  • Patent number: 7847711
    Abstract: Methods and apparatus, including computer program products, for generating a data stream encoded by means of a Variable Length Coding scheme. Code words for a data stream including a plurality of code words are encoded in accordance with a Variable Length Coding scheme. A separation marker is inserted between encoded data blocks in the data stream.
    Type: Grant
    Filed: December 22, 2009
    Date of Patent: December 7, 2010
    Assignee: Scalado AB
    Inventors: Sami Niemi, Johan Sten
  • Patent number: 7845571
    Abstract: Briefly, in accordance with one embodiment, a method of data compression is disclosed.
    Type: Grant
    Filed: June 19, 2006
    Date of Patent: December 7, 2010
    Inventor: Donald M. Monro
  • Publication number: 20100303354
    Abstract: A method for encoding or compressing probability distributions is disclosed. A first mapping of probability distribution of samples to the types from the predefined set of types is generated. A second mapping of the types in the predefined set of types to lexicographic indexes from the index space is generated. A probability distribution is quantized as a type from the predefined set of types. The type is then mapped to a lexicographic index from the index space that spans the predefined set of types. A code for the lexicographic index is then transmitted and/or stored as part of a feature descriptor.
    Type: Application
    Filed: May 28, 2010
    Publication date: December 2, 2010
    Applicant: QUALCOMM Incorporated
    Inventor: Yuriy Reznik
  • Publication number: 20100295712
    Abstract: The disclosure relates to variable length encoding and decoding. A symbol is variable length encoded by selecting a variable length code word table from a set of variable length code word tables based on a value of a variable; selecting a code word from the selected variable length code word table on the basis of said symbol; and updating the value of said variable by comparing the correspondence between said symbol and said variable. If the comparison indicates that the value of the variable is smaller than the symbol, the value of said variable is incremented; else if the comparison indicates that the value of the variable is greater than the symbol, the value of said variable is decremented; else the value of the variable is not amended.
    Type: Application
    Filed: May 19, 2010
    Publication date: November 25, 2010
    Applicant: NOKIA CORPORATION
    Inventors: Antti Olli Hallapuro, Kemal Ugur
  • Publication number: 20100289674
    Abstract: A variable-length code decoding apparatus that decodes a bitstream includes: a storage unit that stores a variable-length code table; a bitstream cutout unit that outputs a bit string of a fixed length; a reference unit that outputs decoded data and a code length with reference to the storage unit; a determination unit that determines whether a bit string of the fixed length is accumulated; a determination unit that determines whether a bit string of a length that is shorter than the fixed length is accumulated; and a selection unit that selects one of the determination results from the determination units. The bitstream cutout unit sets a starting bit based on the selected determination result, and the selection unit switches the selection of the determination results from the determination units.
    Type: Application
    Filed: July 27, 2010
    Publication date: November 18, 2010
    Applicant: PANASONIC CORPORATION
    Inventors: Yuya SHIGENOBU, Motokazu OZAWA, Nobuo HIGAKI, Takeshi FURUTA, Takahiro KAGEYAMA, Masaki MINAMI
  • Publication number: 20100290533
    Abstract: A block encode circuit (800) including a scanner (820) operable to scan a block having data values spaced apart in the block by run-lengths to produce a succession of pairs of values of Level and Run representing each data value and run-length, and wherein the Level values include one or more AC values succeeded by a DC value in the succession, and a Run-Level encoder (830) responsive to said scanner (820) to encode the values of Level and Run in a same AC to DC order as in the succession of pairs of values from said scanner (820) to deliver an encoded output. Other encoders, decoders, codecs and systems and processes for their operation and manufacture are disclosed.
    Type: Application
    Filed: May 10, 2010
    Publication date: November 18, 2010
    Applicant: TEXAS INSTRUMENTS INCORPORATED
    Inventor: Yusuke Minagawa
  • Patent number: 7834783
    Abstract: Converting a mask constraint into a bitset constraint. For example, a method of converting a mask constraint into a bitset constraint may include determining an intermediate bitset based on a variable-bit component of the mask constraint; and generating the bitset constraint based on the intermediate bitset and on a fixed-bit component of the mask constraint. Other embodiments are described and claimed.
    Type: Grant
    Filed: August 26, 2008
    Date of Patent: November 16, 2010
    Assignee: International Business Machines Corporation
    Inventors: Allon Adir, Ehud Aharoni, Oded Margalit
  • Patent number: 7834782
    Abstract: A CABAC-type encoding device for encoding an initial flow of binary digital information for generating an output flow for forming video images after decoding, includes: elements for analyzing successive sequences of bits of the initial binary flow, bit-by-bit, and for deducing, for each bit, an interval representing the occurrence probability associated with the bit, the interval being defined by the size thereof and the lower boundary thereof; elements for analyzing the interval and ensuring a renormalization thereof. The elements for ensuring the renormalization include: a reference table containing, for each possible value of the lower boundary and the size, sequences of bits to be inserted into the output flow, and the number of unknown bits waiting to be inserted for this specific renormalization step; and elements for determining the address of the data, in this reference table.
    Type: Grant
    Filed: December 15, 2006
    Date of Patent: November 16, 2010
    Assignee: Assistance Technique et Etude de Materiels Electroniques-ATEME
    Inventor: Stephane Bacri
  • Patent number: 7831101
    Abstract: The invention relates to a method for determining where a next data unit of a bit stream of an image starts. The method comprises analyzing a first part of a bit stream entry, the bit stream entry being included in a data unit, determining from said analysis of the first part of the bit stream entry the number of bits used by the bit stream entry, skipping the number of bits determined to be used by the bit stream entry, and determining if an end of block symbol has been reached, if an end of block symbol has not been reached then a new bit stream entry starting at the end of the previous is analyzed.
    Type: Grant
    Filed: December 15, 2008
    Date of Patent: November 9, 2010
    Assignee: Scalado AB
    Inventors: Sami Niemi, Karl-Anders Johansson, Johan Stén
  • Patent number: 7830281
    Abstract: Disclosed herein is a variable-length code decoding apparatus including: a code buffer that holds a variable-length code in which the same bit value continues for a given number of bits from the most significant bit; code word detectors each of which reads the variable-length code from the code buffer to detect whether the variable-length code matches a specified code word; a decoded code word determination block that determines a code word decoded; and a configuration information holding section that holds configuration information containing the specified code words and code lengths of the specified code words as arranged in an ascending order of code length.
    Type: Grant
    Filed: April 2, 2009
    Date of Patent: November 9, 2010
    Assignee: Sony Corporation
    Inventor: Hiroaki Sakaguchi
  • Publication number: 20100277352
    Abstract: A communication system using two computers. The first computer takes a textual string in the open, and, using a varying length representation, associates each character within the textual string to a varying length digital representation. The resulting digital string is then broken into prescribed lengths and the resulting character string is communicated to a second computer. The second computer breaks the character string into the underlying bit map and converts back to the textual string in the open using the varying length representation.
    Type: Application
    Filed: May 1, 2009
    Publication date: November 4, 2010
    Inventor: Mark Ellery Ogram