To Or From Variable Length Codes Patents (Class 341/67)
  • Patent number: 8497787
    Abstract: Systems and methods for decoding data using a hybrid decoder are provided. A data signal that includes a codeword is received. A signal quality indicator for the data signal is computed. One of a plurality of decoders is selected based on the computed signal quality indicator. Each of the plurality of decoders is configured to decode information based on a different decoding technique. The codeword included in the data signal is decoded using the selected one of the plurality of decoders.
    Type: Grant
    Filed: November 7, 2011
    Date of Patent: July 30, 2013
    Assignee: Marvell World Trade Ltd.
    Inventor: Xueshi Yang
  • Patent number: 8497788
    Abstract: Systems and methods for performing compression of data. A data buffer is separated into equal-sized segments of data. A frequency count is performed to determine how often each segment of data appears in the data buffer. Frequently occurring segments are encoded with unique compression codes, while all other infrequently occurring segments are encoded with a common compression code. The compressed data buffer includes the compression codes, which are all of the same bit-length, and the uncompressed segments. The compression codes and the uncompressed segments are stored in the compressed data buffer in the order in which the corresponding segments appear in the original data buffer.
    Type: Grant
    Filed: April 25, 2012
    Date of Patent: July 30, 2013
    Assignee: Pure Storage Inc.
    Inventors: Ethan Miller, John Colgrove, John Hayes
  • Publication number: 20130187798
    Abstract: In PIPE coding, where alphabet symbols are distributed among a plurality of specialized entropy en/decoders according to their probability distribution estimate, a categorizing stage is provided where source symbols to be encoded are sub-divided into a first substream which is subject to VLC coding, and a second substream which is subject to PIPE coding. By this measure, source symbols having an appropriate symbol probability distribution, i.e. a probability distribution suitable for being efficiently coded by means of VLC coding without the deficiencies outlined above in the introductory portion of the specification of the present application, may be categorized as VLC coded symbols whereas other symbols may be treated as PIPE coded symbols and subject to PIPE coding, the coding complexity of which is higher than VLC coding, but at a better compression efficiency.
    Type: Application
    Filed: March 8, 2013
    Publication date: July 25, 2013
    Applicant: Fraunhofer-Gesellschaft zur Foerderung der angewandten Forschung e.V.
    Inventor: Fraunhofer-Gesellschaft zur Foerderung der angewandten Forschung e.V.
  • Patent number: 8487789
    Abstract: Provided are a method and apparatus of a lossless encoding and decoding based on a context. According to an embodiment, by aligning and coding symbols of a MSB, a coding efficiency may be enhanced. According to an embodiment, by estimating initial scaling information using a symbol located proximate to a symbol of the MSB, the coding efficiency may be enhanced.
    Type: Grant
    Filed: July 15, 2011
    Date of Patent: July 16, 2013
    Assignee: Samsung Electronics Co., Ltd.
    Inventors: Ki Hyun Choo, Eun Mi Oh
  • Patent number: 8482441
    Abstract: A functional compression scheme involves determining a minimal entropy coloring of a characteristic graph of a random variable. Various scenarios are disclosed where the determination of the minimal entropy coloring of a characteristic graph is easy and tractable.
    Type: Grant
    Filed: June 1, 2012
    Date of Patent: July 9, 2013
    Assignee: Massachusetts Institute of Technology
    Inventors: Muriel M├ędard, Soheil Feizi-Khankandi
  • Publication number: 20130169453
    Abstract: Provided are a computer program product, system, and method for generating a code alphabet for use by a deployed program to determine codewords for words. A first code alphabet is generated having a first number of symbols that provide variable length codings of the words. The symbols in the first code alphabet are merged into a second number of groups of the symbols in the first code alphabet, where the second number is less than the first number. A second code alphabet is generated having the second number of symbols, wherein a second average codeword length of the codewords produced using the symbols in the second code alphabet is smaller than the codeword length (b) of the words, and wherein the second code alphabet comprises the code alphabet used by the deployed program.
    Type: Application
    Filed: January 3, 2012
    Publication date: July 4, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Roy D. Cideciyan, Glen A. Jaquette, Thomas Mittelholzer
  • Publication number: 20130170556
    Abstract: Disclosed herein are representative embodiments for performing entropy coding or decoding using a counter-based scheme. In one exemplary embodiment disclosed herein, a first codeword is received from compressed digital media data. The first codeword is decoded into a first digital media data value by referencing a codeword table that associates the first codeword with the first digital media data value and a second codeword with a second digital media data value. A counter for counting occurrences of the first digital media data value is incremented. The value of the first counter is compared with the value of a second counter that counts occurrences of a second digital media data value. If the value of the first counter and the value of the second counter are equal (or greater than or equal), the codeword table is updated to swap codewords between the first and second digital media values.
    Type: Application
    Filed: December 29, 2011
    Publication date: July 4, 2013
    Applicant: Microsoft Corporation
    Inventors: Bin Li, Jizheng Xu
  • Patent number: 8477051
    Abstract: A variable-length code decoding apparatus has a first-table storing part to store a first table, a second-table storing part to store a second table, a priority determining part to read out by priority a combination of zero information that is stored in the second table and corresponds a combination of variable-length codes having the largest number of codes, whereas if variable-length codes included in the input bitstream is not stored in the second table but stored in the first table, to read out zero information, and a decoding part to generate the decoded data based on the zero information or the combination of zero information read out by the priority determining part.
    Type: Grant
    Filed: March 19, 2012
    Date of Patent: July 2, 2013
    Assignee: Kabushiki Kaisha Toshiba
    Inventors: Kojiro Suzuki, Masashi Jobashi
  • Publication number: 20130162453
    Abstract: Provided are a computer program product, system, method, and data structure for using variable length code tables to compress an input data stream to a compressed output data stream. If a number of consecutive data units in the input data stream match the number of consecutive data units in a history buffer of previously received data units in the input data stream, a copy pointer symbol is generated indicating the copy pointer symbol referencing previously received data units in the history buffer and indicating a location of a start of the consecutive data units in the history buffer. A determination is made of an encoding of the number. Indication is made in the generated copy pointer symbol the determined encoding of the number and the copy pointer symbol is outputted in the compressed output data stream.
    Type: Application
    Filed: February 13, 2013
    Publication date: June 27, 2013
    Applicant: International Business Machines Corporation
    Inventor: International Business Machines Corporation
  • Patent number: 8472526
    Abstract: The simulation of film grain in a video image occurs by first creating a block (i.e., a matrix array) of transformed coefficients for a set of cut frequencies fHL, fVL, fHH and fVH associated with a desired grain pattern. (The cut frequencies fHL, fVL, fHH and fVH represent cut-off frequencies, in two dimensions, of a filter that characterizes the desired film grain pattern). The block of transformed coefficients undergoes an inverse transform to yield a bit-accurate film grain sample and the bit accurate sample undergoes scaling to enable blending with a video signal to simulate film grain in the signal.
    Type: Grant
    Filed: September 26, 2005
    Date of Patent: June 25, 2013
    Assignee: Thomson Licensing
    Inventors: Cristina Gomila, Joan Llach, Jeffrey Allen Cooper
  • Publication number: 20130147644
    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: Application
    Filed: July 23, 2012
    Publication date: June 13, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Kanak B. Agarwal, Harm P. Hofstee, Damir A. Jamsek, Andrew K. Martin
  • Publication number: 20130141256
    Abstract: Provided are a computer program product, system, method, and data structure for compressing an input data stream. A determination is made of consecutive data units in the input data stream that match consecutive data units in a history buffer. A copy pointer symbol indicates a copy pointer symbol referencing previously received data units in the history buffer. A determination is made of a relative displacement count in the history buffer at which the number of matching consecutive data units start. A determination is made of a range of relative displacement counts comprising one of a plurality of ranges of displacement counts including the determined relative displacement count. A determination is made of the encoding scheme associated with the determined range. An encoding of the relative displacement count is determined from the determined encoding scheme. The determined encoding of the relative displacement count is indicated in the copy pointer.
    Type: Application
    Filed: February 6, 2013
    Publication date: June 6, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventor: International Business Machines Corporation
  • Patent number: 8457419
    Abstract: A method of decoding data that is encoded with a set of prefix codes begins by receiving the data at a computing device, and then compiling native machine code from the prefix code set for execution by a processing unit of the computing device. The machine code implements a binary tree of prefix codes that corresponds to the prefix code set. The data is decoded by traversing the prefix code tree, which is effected by executing the machine code with the processing unit.
    Type: Grant
    Filed: April 13, 2007
    Date of Patent: June 4, 2013
    Assignee: Research In Motion Limited
    Inventors: Brian Lamb, Michael Carmody, Guixing Wu
  • Patent number: 8456333
    Abstract: A method of separating data blocks with stationary informational characteristics, including the steps of sequentially collecting statistics for small data blocks in an input data set, calculating the relative change in the estimated compression efficiency for a solid block currently being formed caused by merging its statistics with the statistics of a next small block, deciding whether the small block should be added to the solid block; for any block for which the decision is no, the block is used as the starting block of the next solid block to be formed. Auxiliary block data type detection is used to improve the method.
    Type: Grant
    Filed: October 24, 2011
    Date of Patent: June 4, 2013
    Assignee: Smith Micro Software, Inc.
    Inventors: Vladimir Semenyuk, Serge Volkoff
  • Patent number: 8456334
    Abstract: A variable-length code decoding apparatus has a first table storing part capable of converting the variable-length codes into first decoded data comprising successive zeros, a second table storing part capable of converting a variable-length code and for which corresponding decoded data comprises no zeros, a third table storing part capable of converting a variable-length code comprising a code length of N and for which corresponding decoded data comprises no zeros or capable of converting a combination of the variable-length codes, a bit shifting part configured to shift the input bitstream by a specific number of bits, a fourth table storing part capable of converting a variable-length code at a header of the bit-shifted input bitstream into fourth decoded data, a combining part configured to combine the second or the third decoded data and the fourth decoded data.
    Type: Grant
    Filed: December 19, 2011
    Date of Patent: June 4, 2013
    Assignee: Kabushiki Kaisha Toshiba
    Inventor: Akira Moriya
  • Publication number: 20130135124
    Abstract: A method, system, and computer program product for decoding a variable length code. A decoding module is configured to receive the variable length code. The variable length code is a plurality of bits. The decoding module is also configured to identify a number of times the lead bit is repeated consecutively at the beginning of the plurality of bits. The lead bit is predetermined to be one of a 1 or 0. The decoding module is also configured to identify a code word in a table of code words by using the number of times the lead bit is repeated.
    Type: Application
    Filed: November 30, 2011
    Publication date: May 30, 2013
    Applicant: INTEL MOBILE COMMUNICATIONS GMBH
    Inventor: Michael Soegtrop
  • Patent number: 8451148
    Abstract: Provided is an encoding apparatus including: a determination unit which determines bit allocation at the time of quantizing a data signal based on normalization information of the data signal so that a data length as a result of fixed length encoding of the quantized data signal becomes close to a second data length which is equal to or larger than a first data length allocated to a result of variable length encoding of the quantized data signal; a quantizer which quantizes the data signal based on the bit allocation; and an encoder which performs variable length encoding on the quantized data signal, wherein the determination unit updates the second data length so that a difference between a data length of the variable-length-encoded data signal and the first data length is within a predetermined range.
    Type: Grant
    Filed: June 6, 2011
    Date of Patent: May 28, 2013
    Assignee: Sony Corporation
    Inventor: Yuuji Maeda
  • Patent number: 8442136
    Abstract: A method of transmitting a control channel format indicator (CCFI), also known as PCFICH (Physical Control Format Indicator Channel), in case where the length of a coded CCFI is not an integer multiple of three, including mapping a plurality of two-bit CCFI into a codebook with each component codeword having three bits; generating a sequence of codewords selected from the codebook by repeating the selected component codeword for predetermined times; generating a codeword by concatenating the sequence of the selected component codewords with the original CCFI bits; and transmitting the codeword carrying information of CCFI. The method further includes a step of generating a permutation of each of the four codewords by assigning K repetitions of the three-bit component codeword to the number of K resource units respectively and mapping remaining K bits of each of the four codewords separately to the number of K resource units.
    Type: Grant
    Filed: December 2, 2011
    Date of Patent: May 14, 2013
    Assignee: Samsung Electronics Co., Ltd
    Inventors: Jianzhong Zhang, Joonyoung Cho, Zhouyue Pi, Farooq Khan
  • Patent number: 8442138
    Abstract: A method select a codebook for transmit beamforming. The method constructs an estimated channel matrix based on a codebook, selects a channel submatrix from the estimated channel matrix, calculates a selection matrix from the channel submatrix; and assigns a steering matrix based on the selection matrix. There may be multiple codebooks and the method may construct an estimated channel matrix, select a channel submatrix, and calculate a selection matrix for each of the codebooks, then select an optimal codebook. The steering matrix is assigned based on the optimal codebook. The steering matrix may be used in steering a transmitted packet. The method may also calculate a post-MIMO equalizer signal-to-noise ratio for a data stream, based on the estimated channel matrix and the selected codebook. A related system is also disclosed. Other embodiments are provided, and each of the embodiments described herein can be used alone or in combination with one another.
    Type: Grant
    Filed: March 7, 2008
    Date of Patent: May 14, 2013
    Assignee: Marvell World Trade Ltd.
    Inventors: Hongyuan Zhang, Rohit U. Nabar
  • Patent number: 8432302
    Abstract: The present invention provides a convolutional line coding method, including: constructing a sequence set, where the length of each sequence in the sequence set is n bits; selecting a balanced sequence in the sequence set, and obtaining source data of n?1 bits corresponding to the balanced sequence; performing Hamming distance detection for an unbalanced sequence in the sequence set to obtain source data of n?1 bits corresponding to the unbalanced sequence; sorting the balanced sequence and the unbalanced sequence according to an operation difference value, and generating a code table, where the source data of n?1 bits correspond to the sequence of n bits, and the code table is designed for line coding; and at time of encoding the source data of n?1 bits, obtaining a coding result of n bits according to a mapping relation in the code table.
    Type: Grant
    Filed: December 30, 2010
    Date of Patent: April 30, 2013
    Assignee: Huawei Technologies Co., Ltd.
    Inventors: Dongning Feng, Weiguang Liang, Dongyu Geng, Jing Li, Frank Effenberger, Sergio Benedetto, Guido Montorsi
  • Publication number: 20130099946
    Abstract: According to one embodiment, an apparatus 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. Embodiments of the present invention further include related methods and computer program products for decoding encoded data.
    Type: Application
    Filed: October 21, 2011
    Publication date: April 25, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Garth A. Dickie, Brian M. Hess
  • Publication number: 20130099947
    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: Application
    Filed: July 19, 2012
    Publication date: April 25, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Garth A. Dickie, Brian M. Hess
  • Patent number: 8427494
    Abstract: A VLC data transfer interface is presented that allows digital data to be packed and assembled according to a format selectable from a number of formats while the data is being transferred to a desired destination.
    Type: Grant
    Filed: January 30, 2004
    Date of Patent: April 23, 2013
    Assignee: Nvidia Corporation
    Inventors: Ram Prabhakar, Neal Meininger, Lefan Zhong, Cahide Kiris, Ed Ahn
  • Patent number: 8421653
    Abstract: An information processing apparatus for converting fixed-length codes into variable-length codes comprises: an input unit configured to obtain each of the fixed-length codes as an input code; a determination unit configured to determine a fixed length encoding method of the input code; a conversion unit configured to perform variable length encoding, by using a first variable length encoding method, on the input code encoded by a first fixed length encoding method, and perform variable length encoding, by using a second variable length encoding method, on the input code encoded by a second fixed length encoding method; and an output unit configured to output a variable-length code obtained by the conversion unit.
    Type: Grant
    Filed: January 14, 2011
    Date of Patent: April 16, 2013
    Assignee: Canon Kabushiki Kaisha
    Inventor: Jumpei Ashida
  • Patent number: 8421655
    Abstract: An entropy encoder block for use in a context adaptive encoder and an entropy decoder block for use in a context adaptive decoder are provided.
    Type: Grant
    Filed: April 22, 2011
    Date of Patent: April 16, 2013
    Assignees: Certicom Corp., Research In Motion Limited
    Inventors: Paul Daniel Imthurn, Wei Cheng Joseph Ku, Mark Michael
  • Patent number: 8416104
    Abstract: An entropy decoder and method for decoding code words with an indication of associated probability for each code word. The decoder may include an input buffer in communication with a branch node block, the branch node block in communication with a leaf node block. The input buffer operable to receive code words and the indication of associated probability. 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. The leaf node block may include one or more leaf node lookup tables and leaf node control logic.
    Type: Grant
    Filed: April 22, 2011
    Date of Patent: April 9, 2013
    Assignee: Certicom Corp.
    Inventors: Weicheng Joseph Ku, Paul Daniel Imthurn
  • Patent number: 8410959
    Abstract: A method and system for entropy coding can comprise, in response to detecting a first symbol combination comprising first run information indicating a first number of contiguous zero coefficients is greater than a cut-off-run value, assigning a first codeword to a first symbol combination, wherein the first codeword comprises an escape code from a first-level VLC table; and in response to a second symbol combination comprising second run information indicating a second number of contiguous zero coefficients is less than or equal to the cut-off-run value, assigning a second codeword to the second symbol combination, wherein the second codeword is from the first-level VLC table. The system and method can further comprise collecting coding statistics for a set of candidate symbol combinations and adjusting a mapping between codewords of the first-level VLC table and a subset of the set of candidate symbol combinations based on the coding statistics.
    Type: Grant
    Filed: December 28, 2010
    Date of Patent: April 2, 2013
    Assignee: QUALCOMM, Incorporated
    Inventors: Marta Karczewicz, Xianglin Wang
  • Patent number: 8406307
    Abstract: Techniques and tools for encoding and decoding data values that are hierarchically organized are presented. For example, an encoder encodes data as a set that has a hierarchy of subsets with set symbols. In the encoding, the encoder evaluates the data values of the set and selectively encodes a symbol combination code that indicates the set symbols of multiple subsets of the set. Then, for each of the multiple subsets considered as a new set, the encoder selectively repeats the evaluating, selective encoding and selective repetition for the new set. In corresponding decoding, a decoder decodes data encoded as a set that has a hierarchy of subsets with set symbols. In some implementations, the encoding and decoding are adaptive and use a symbol alphabet with nested elements.
    Type: Grant
    Filed: August 22, 2008
    Date of Patent: March 26, 2013
    Assignee: Microsoft Corporation
    Inventors: Chengjie Tu, Shankar Regunathan, Shijun Sun, Chih-Lung Lin
  • Patent number: 8386539
    Abstract: A variable length data storage device enables clearly and quickly determining where there are breaks in variable length data even when such data is stored without gaps in a stored data file. A variable length data storage step stores variable length items, each containing variable length data including at the beginning the length of such data, without gaps in a stored data file. A marker management item registration step registers marker management items, each containing a break marker and the storage location of the variable length data corresponding to the break marker, in a marker management file. A marker identifier management item registration step registers marker identifier management items, each including a marker identifier composed of a predetermined number of characters from the beginning of the text string used as the break marker and the storage location of the break marker, in a marker management memory area.
    Type: Grant
    Filed: March 21, 2012
    Date of Patent: February 26, 2013
    Assignee: Seiko Epson Corporation
    Inventor: Nobuhiko Nishimura
  • Patent number: 8378861
    Abstract: Arithmetic coding utilizes probability values associated with contexts and context indexed values. The probability values are stored within a random access memory 6 from where they are fetched to a cache memory 8 before being supplied to an arithmetic encoder and decoder 4. The context indexed values used are mapped to the plurality of contexts employed such that context indexed values used to process data values close by in a position within the stream of data values being processed have a greater statistical likelihood of sharing a group of contexts than context values used to process data values far away in position within the stream of data values. Thus, a group of contexts for which the probability values are fetched together into the cache memory 8 will have an increased statistical likelihood of being used together in close proximity in processing the stream of data values. This reduces the number of cache flush operations and cache line fill operations.
    Type: Grant
    Filed: November 29, 2010
    Date of Patent: February 19, 2013
    Assignee: ARM Limited
    Inventors: Anders Berkeman, Dominic Hugo Symes
  • Patent number: 8363725
    Abstract: Method and apparatus for variable length code (VLC) encoding is described. In some examples, a symbol of frequency transform values having a run and a level is VLC encoded. An address is generated, at a processor, for a lookup table (LUT) in a memory based on the run and the level, the LUT storing VLC entries for all possible combinations of run values ranging from minimum to maximum runs and level values ranging from minimum to maximum levels, each of the VLC entries including a flag indicative of an escape mode. A VLC entry is read from the LUT using the address. A VLC code and bit length are obtained from the VLC entry if the flag in the VLC entry is a first value. A fixed length VLC code is generated from an escape code, the run, and the level if the flag in the VLC entry is a second value.
    Type: Grant
    Filed: September 8, 2008
    Date of Patent: January 29, 2013
    Assignees: Sony Corporation, Sony Electronics Inc.
    Inventor: Kensuke Miyagi
  • Publication number: 20130021178
    Abstract: Provided are a computer program product, system, method, and data structure for using variable length code tables to compress an input data stream to a compressed output data stream. A determination is made as to whether a number of at least two consecutive data units in the input data stream match the number of consecutive data units in a history buffer of previously received data units in the input data stream. If so, a copy pointer symbol is generated including data indicating a copy pointer symbol referencing previously received data units in the history buffer and indicating the determined number of consecutive data units. A determination is made of a relative displacement count in the history buffer at which the number of matching consecutive data units start. A determination is made from a variable length code table an encoding of the relative displacement count in the history buffer.
    Type: Application
    Filed: July 21, 2011
    Publication date: January 24, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventor: Glen A. Jaquette
  • Publication number: 20130021179
    Abstract: Provided are a computer program product, system, method, and data structure for using variable length code tables to compress an input data stream to a compressed output data stream. If a number of consecutive data units in the input data stream match the number of consecutive data units in a history buffer of previously received data units in the input data stream, a copy pointer symbol is generated indicating the copy pointer symbol referencing previously received data units in the history buffer and indicating a location of a start of the consecutive data units in the history buffer. A determination is made from a variable length code table of an encoding of the number. Indication is made in the generated copy pointer symbol the determined encoding of the number and the copy pointer symbol is outputted in the compressed output data stream.
    Type: Application
    Filed: July 21, 2011
    Publication date: January 24, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventor: Glen A. Jaquette
  • Patent number: 8350734
    Abstract: This application relates to decoding signals that carry clock and data information. In particular, it relates to construction a time-varying histogram of inter-arrival times between pulse edges and using the histogram to identify whether a pulse edge encodes a single length interval, a double length interval or some longer length interval. Further details and embodiments of the technology disclosed are provided in the drawings, detailed description and claims.
    Type: Grant
    Filed: January 8, 2009
    Date of Patent: January 8, 2013
    Assignee: ESS Technology, Inc.
    Inventor: Andrew Martin Mallinson
  • Patent number: 8350735
    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: Grant
    Filed: May 19, 2010
    Date of Patent: January 8, 2013
    Assignee: Nokia Corporation
    Inventors: Antti Olli Hallapuro, Kemal Ugur
  • Patent number: 8351527
    Abstract: A method of transmitting a control channel format indicator (CCFI), also known as PCFICH (Physical Control Format Indicator Channel), in case where the length of a coded CCFI is not an integer multiple of three, including mapping a plurality of two-bit CCFI into a codebook with each component codeword having three bits; generating a sequence of codewords selected from the codebook by repeating the selected component codeword for predetermined times; generating a codeword by concatenating the sequence of the selected component codewords with the original CCFI bits; and transmitting the codeword carrying information of CCFI. The method further includes a step of generating a permutation of each of the four codewords by assigning K repetitions of the three-bit component codeword to the number of K resource units respectively and mapping remaining K bits of each of the four codewords separately to the number of K resource units.
    Type: Grant
    Filed: December 2, 2011
    Date of Patent: January 8, 2013
    Assignee: Samsung Electronics Co., Ltd.
    Inventors: Jianzhong Zhang, Joonyoung Cho, Zhouyue Pi, Farooq Khan
  • Publication number: 20130002458
    Abstract: A variable-length code decoding apparatus has a first table storing part capable of converting the variable-length codes into first decoded data comprising successive zeros, a second table storing part capable of converting a variable-length code and for which corresponding decoded data comprises no zeros, a third table storing part capable of converting a variable-length code comprising a code length of N and for which corresponding decoded data comprises no zeros or capable of converting a combination of the variable-length codes, a bit shifting part configured to shift the input bitstream by a specific number of bits, a fourth table storing part capable of converting a variable-length code at a header of the bit-shifted input bitstream into fourth decoded data, a combining part configured to combine the second or the third decoded data and the fourth decoded data.
    Type: Application
    Filed: December 19, 2011
    Publication date: January 3, 2013
    Applicant: Kabushiki Kaisha Toshiba
    Inventor: Akira Moriya
  • Publication number: 20120326899
    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: Application
    Filed: September 4, 2012
    Publication date: December 27, 2012
    Inventors: Hiroaki NAKATA, Fumitake Izuhara, Kazushi Akie, Takafumi Yuasa
  • Publication number: 20120319874
    Abstract: Provided is a method for generating codewords. The method comprises the following steps: receiving an information bit; generating a generating matrix in which a size of a column is identical with a length of the information bit, a size of a row is 24 rows, and values of symbols that are elements of the matrix are 0 or 1; modifying the generating matrix by dividing the generated generating matrix into an upper group and a lower group having an identical size and replacing rows so that the number of symbols having a value of 1 in the upper group is identical with the number of symbols having a value of 1 in the lower group; and obtaining inner products from the information bit and each row of the modified generating matrix and generating codewords from remainders obtained by dividing the inner products by 2.
    Type: Application
    Filed: February 24, 2011
    Publication date: December 20, 2012
    Inventors: Ji Woong Jang, Seung Hee Han, Han Gyu Cho
  • Publication number: 20120306669
    Abstract: A variable-length code decoding apparatus has a first-table storing part to store a first table, a second-table storing part to store a second table, a priority determining part to read out by priority a combination of zero information that is stored in the second table and corresponds a combination of variable-length codes having the largest number of codes, whereas if variable-length codes included in the input bitstream is not stored in the second table but stored in the first table, to read out zero information, and a decoding part to generate the decoded data based on the zero information or the combination of zero information read out by the priority determining part.
    Type: Application
    Filed: March 19, 2012
    Publication date: December 6, 2012
    Applicant: KABUSHIKI KAISHA TOSHIBA
    Inventors: Kojiro Suzuki, Masashi Jobashi
  • Patent number: 8327027
    Abstract: A specially programmed computer encodes repeating sequences of equidistant-spaced bit series that are identified in an input file. The position of each sequence is encoded relative to one or more instances of the previous sequence, including both the spacing between bits and the bit position of identified portions of each. For a certain class of input files, this encoding of repeating sequences significantly compresses the input file into the output file. A specially programmed computer decodes files that have been encoded in this manner.
    Type: Grant
    Filed: June 3, 2009
    Date of Patent: December 4, 2012
    Inventor: Bryan Smith
  • Patent number: 8325069
    Abstract: Systems, methods, and apparatus for a scalable processor architecture for variety of string processing application are described. In one such apparatus, n input first in, first out (FIFO) buffer stores an input stream. A plurality of memory banks store data from the input stream. A re-configurable controller processes the input stream. And an output FIFO buffer stores the processed input stream.
    Type: Grant
    Filed: December 22, 2009
    Date of Patent: December 4, 2012
    Assignee: Intel Corporation
    Inventors: Vinodh Gopal, Gilbert M. Wolrich, Christopher F. Clark, Wadji K. Feghali
  • Patent number: 8315709
    Abstract: Waveforms are digitally sampled and compressed for storage in memory. The compression of the data includes generating a truncated entropy encoding map and using the values within the map to obtain good compression. An encoder further sub-selects values to be encoded and values to remain unencoded to provide an overall compression of the data.
    Type: Grant
    Filed: March 26, 2007
    Date of Patent: November 20, 2012
    Assignee: Medtronic, Inc.
    Inventor: Eric D. Corndorf
  • Patent number: 8305244
    Abstract: A plurality of segments of the sequence are identified, wherein a segment of the plurality of segments includes at least one unsigned integer of the unsigned integer data, and wherein the plurality of segments are based in part on context within the sequence. The plurality of segments are coded, wherein each segment of the plurality of segments is coded using a different coding alphabet, wherein a coding alphabet is constrained at least by unsigned integers of a corresponding segment.
    Type: Grant
    Filed: April 16, 2007
    Date of Patent: November 6, 2012
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventor: Amir Said
  • Patent number: 8290286
    Abstract: The method includes the following units: a coefficient number detecting unit (109) for detecting the number of coefficients which has a value other than 0 for each block according to the generated coefficient, a coefficient number storing unit (110) for storing the number of coefficients detected, a coefficient number coding unit (111) for selecting a table for variable length coding based on the numbers of coefficients in the coded blocks located on the periphery of a current block to be coded with reference to the selected table for variable length coding so as to perform variable length coding for the number of coefficients.
    Type: Grant
    Filed: September 29, 2008
    Date of Patent: October 16, 2012
    Assignee: Panasonic Corporation
    Inventors: Kiyofumi Abe, Shinya Kadono, Satoshi Kondo, Makoto Hagai
  • Patent number: 8291150
    Abstract: A table device includes a match cell number output unit 25 for outputting a match cell number showing a cell PE which outputs a matching signal, and an address decoder 26 for specifying a node from among nodes in a search tree which construct a conversion table, the node corresponding to the match cell number. The table device acquires a data conversion value assigned to the above-mentioned node from a configuration memory 21, and, when the data conversion value is data showing a coded result or the like, outputs the data conversion value to outside the table device, whereas when the data conversion value is a branch code of the search tree, updates the cell PE to which a comparison instruction signal is furnished.
    Type: Grant
    Filed: May 9, 2007
    Date of Patent: October 16, 2012
    Assignee: Mitsubishi Electric Corporation
    Inventors: Tomomi El, Noriyuki Minegishi
  • Patent number: 8279095
    Abstract: A method for storing node information of a Huffman tree. The method creates an index of each node in the Huffman tree using a breadth first search (BFS) algorithm. The method further reads each node of the Huffman tree beginning from a root node according to a sequence of the index of each node, and stores node information of each node into an array of the Huffman tree.
    Type: Grant
    Filed: September 13, 2010
    Date of Patent: October 2, 2012
    Assignee: Hon Hai Precision Industry Co., Ltd.
    Inventors: Chung-I Lee, Chien-Fa Yeh, Chiu-Hua Lu, Cheng-Feng Tsai, Shan-Chuan Jeng, Yu-Feng Chien, Tsung-Hsin Yen
  • Patent number: 8265405
    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: May 26, 2011
    Date of Patent: September 11, 2012
    Assignee: NTT DoCoMo, Inc.
    Inventors: Kazuo Sugimoto, Satoru Adachi, Sadaatsu Kato, Minoru Etoh, Mitsuru Kobayashi, Hiroyuki Yamaguchi
  • Patent number: 8265403
    Abstract: The method includes the following units: a coefficient number detecting unit (109) for detecting the number of coefficients which has a value other than 0 for each block according to the generated coefficient, a coefficient number storing unit (110) for storing the number of coefficients detected, a coefficient number coding unit (111) for selecting a table for variable length coding based on the numbers of coefficients in the coded blocks located on the periphery of a current block to be coded with reference to the selected table for variable length coding so as to perform variable length coding for the number of coefficients.
    Type: Grant
    Filed: October 25, 2007
    Date of Patent: September 11, 2012
    Assignee: Panasonic Corporation
    Inventors: Kiyofumi Abe, Shinya Kadono, Satoshi Kondo, Makoto Hagai
  • Patent number: 8264386
    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: Grant
    Filed: December 6, 2010
    Date of Patent: September 11, 2012
    Assignee: Renesas Electronics Corporation
    Inventors: Hiroaki Nakata, Fumitaka Izuhara, Kazushi Akie, Takafumi Yuasa