To Or From Variable Length Codes Patents (Class 341/67)
  • Patent number: 9525877
    Abstract: A method for decoding video includes receiving a frame of the video that includes at least one slice and at least one tile. Each of the at least one slice and the at least one tile are not all aligned with one another. Each of the at least one slice is characterized that it is decoded independently of the other the at least one slice. Each of the at least one tile is characterized that it is a rectangular region of the frame and having coding units for the decoding arranged in a raster scan order. The at least one tile of the frame are collectively arranged in a raster scan order of the frame.
    Type: Grant
    Filed: May 16, 2014
    Date of Patent: December 20, 2016
    Assignee: Sharp Kabushiki Kaisha
    Inventors: Kiran Misra, Christopher A. Segall
  • Patent number: 9509335
    Abstract: A hardware data compressor for compressing an input block of characters. A first hardware engine that, for an initial fraction of the input block of characters produces character string replacement back pointers and indicates characters not replaced by the back pointers, and generates occurrence frequencies of symbols associated with the produced back pointers and the non-replaced characters. A second hardware engine constructs a Huffman code table using the frequencies generated for the initial fraction of the input block. The first hardware engine, for the remainder of the input block beyond the initial fraction, produces character string replacement back pointers and indicates characters not replaced by the back pointers. A third hardware engine, for the entire input block of characters, Huffman encodes the symbols associated with the back pointers and the non-replaced characters using the Huffman code table constructed using the frequencies generated for the initial fraction of the input block.
    Type: Grant
    Filed: October 14, 2015
    Date of Patent: November 29, 2016
    Assignee: VIA ALLIANCE SEMICONDUCTOR CO., LTD.
    Inventor: G. Glenn Henry
  • Patent number: 9509336
    Abstract: A hardware data compressor for compressing a block of characters. A first hardware engine finds a match of a string of characters at a current location in the block with an earlier occurrence in the block of the string of characters, determines a first size that is a total number of bits into which the matched string would be Huffman encoded as literals using a Huffman code table, calculates a back pointer from the current location to the earlier occurrence of the string, and determines a second size that is a number of bits into which the back pointer would be Huffman encoded using the Huffman code table. A second hardware engine Huffman encodes the matched string if the first size is less than the second size and otherwise Huffman encodes the back pointer.
    Type: Grant
    Filed: October 14, 2015
    Date of Patent: November 29, 2016
    Assignee: VIA ALLIANCE SEMICONDUCTOR CO., LTD.
    Inventor: G. Glenn Henry
  • Patent number: 9503168
    Abstract: A method including using a precoding code book for controlling transmissions from four antennas of a device, said code book including a plurality of entries, wherein said entries are such that a single layer is mapped to each selected antenna, said code book entries including different antenna pair combinations whereby one or two antenna pairs are selected for transmission.
    Type: Grant
    Filed: March 6, 2015
    Date of Patent: November 22, 2016
    Assignee: Nokia Siemens Networks Oy
    Inventors: Kari Juhani Hooli, Kari Pekka Pajukoski, Esa Tapani Tiirola
  • Patent number: 9497470
    Abstract: An image coding method includes: generating a predicted block; calculating a residual block; calculating quantized coefficients by performing transform and quantization on the residual block; calculating a coded residual block by performing inverse quantization and inverse transform on the quantized coefficients; generating a temporary coded block; determining whether or not an offset process is required, to generate first flag information indicating a result of the determination; executing the offset process on the temporary coded block when it is determined that the offset process is required; and performing variable-length coding on the quantized coefficients and the first flag information.
    Type: Grant
    Filed: July 30, 2013
    Date of Patent: November 15, 2016
    Assignee: SUN PATENT TRUST
    Inventors: Toru Matsunobu, Takahiro Nishi, Youji Shibahara, Hisao Sasai, Kyoko Tanikawa, Toshiyasu Sugio
  • Patent number: 9491491
    Abstract: A video coding device is configured to code coefficients of residual blocks of video data. When a coefficient of a transform unit of video data has a scan order value that is less than a threshold and when the coefficient is the last significant coefficient in a scan order in the transform unit, the video coding device may execute a function to determine a mapping between data for the coefficient and a codeword index value, and code the data for the coefficient using a codeword associated with the codeword index value. The video coding device may comprise a video encoder or a video decoder, in some examples.
    Type: Grant
    Filed: May 30, 2012
    Date of Patent: November 8, 2016
    Assignee: QUALCOMM Incorporated
    Inventors: Liwei Guo, Marta Karczewicz, Xianglin Wang
  • Patent number: 9426806
    Abstract: A method for wirelessly transmitting data using a plurality of transmission layers includes estimating a number of vector symbols to be allocated to transmission of user data codewords during a subframe and determining a number of bits in a plurality of user data codewords to be transmitted during the subframe. The method also includes calculating a number of control vector symbols to allocate to control information based at least in part on the estimated number of vector symbols and the determined number of bits. Additionally, the method includes mapping control codewords to the calculated number of control vector symbols and transmitting vector symbols carrying the user data codewords and the control codewords over the plurality of transmission layers during the subframe.
    Type: Grant
    Filed: June 5, 2015
    Date of Patent: August 23, 2016
    Assignee: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: David Hammarwall, George Jöngren
  • Patent number: 9419648
    Abstract: In one embodiment, a processing system is provided. The processing system includes a memory for storing an input bit stream and a processing logic coupled to the memory. The processing logic to identify, within the input bit stream, a first bit subsequence of an input bit sequence and a second bit subsequence of the input bit sequence. A first score reflecting the length of the first bit subsequence and the distance between the input bit sequence and the first bit subsequence and a second score reflecting the length of the second bit subsequence, within the input bit stream, and the distance between the input bit sequence and the second bit subsequence is determined. In view of the first score and the second score, one of the first bit subsequence or the second bit subsequence is selected. A code representing a selected bit subsequence is appended to an output bit sequence.
    Type: Grant
    Filed: September 18, 2015
    Date of Patent: August 16, 2016
    Assignee: Intel Corporation
    Inventors: James D. Guilford, Vinodh Gopal, Gilbert M. Wolrich, Daniel F. Cutter
  • Patent number: 9411841
    Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.
    Type: Grant
    Filed: February 18, 2015
    Date of Patent: August 9, 2016
    Assignee: Robert T. and Virginia T. Jenkins as Trustees of the Jenkins Family Trust Dated Feb. 8, 2002
    Inventors: Karl Schiffmann, Mark Andrews, Jack J. LeTourneau
  • Patent number: 9398304
    Abstract: An image coding method includes: generating a predicted block; calculating a residual block; calculating quantized coefficients by performing transform and quantization on the residual block; calculating a coded residual block by performing inverse quantization and inverse transform on the quantized coefficients; generating a temporary coded block; determining whether or not an offset process is required, to generate first flag information indicating a result of the determination; executing the offset process on the temporary coded block when it is determined that the offset process is required; and performing variable-length coding on the quantized coefficients and the first flag information.
    Type: Grant
    Filed: December 3, 2015
    Date of Patent: July 19, 2016
    Assignee: SUN PATENT TRUST
    Inventors: Toru Matsunobu, Takahiro Nishi, Youji Shibahara, Hisao Sasai, Kyoko Tanikawa, Toshiyasu Sugio
  • Patent number: 9397696
    Abstract: A non-transitory computer-readable recording medium stores a compression program that causes a computer to execute a process. The process includes: detecting a matched data that matches a processing target data with a longest length among pieces of data, the pieces of data being extracted from a data sequence that is a compression target; acquiring an appearance frequency of a code corresponding to character data contained in the matched data when a data length of the matched data is smaller than a predetermined length; acquiring an appearance frequency of a code corresponding to the matched data when the data length of the match data is equal to or larger than the predetermined length; and compressing the data sequence using a compression code generated based on the acquired appearance frequency of the code.
    Type: Grant
    Filed: July 15, 2015
    Date of Patent: July 19, 2016
    Assignee: FUJITSU LIMITED
    Inventor: Masahiro Kataoka
  • Patent number: 9386316
    Abstract: This disclosure describes techniques for adaptively coding video block header information based on previously encoded video blocks. A video encoder may adaptively select a coding table for use in encoding a syntax element of a current video block based on corresponding syntax elements of one or more previously encoded blocks. In one aspect, the video encoder may adaptively select the coding table for use in encoding a block type of the current block based on block types of one or more video blocks adjacent to the current video block, i.e., neighboring video blocks. The video encoder may also predict one or more other header syntax elements of the current block based on at least one of the previously encoded video blocks. If prediction is successful, the video encoder may encode a flag to indicate the success of prediction.
    Type: Grant
    Filed: July 8, 2008
    Date of Patent: July 5, 2016
    Assignee: QUALCOMM Incorporated
    Inventors: Yan Ye, Marta Karczewicz, Rahul Panchal
  • Patent number: 9369713
    Abstract: A video decoder includes an entropy decoding device that generates entropy decoded (EDC) data from an encoded video signal. A multi-format video decoding device includes a plurality of vector processor units that generate a decoded video signal from the EDC data. The plurality of vector processing units are programmed via VPU instructions formatted to include a vector instruction portion, a scalar instruction portion, and a branching instruction portion.
    Type: Grant
    Filed: April 10, 2014
    Date of Patent: June 14, 2016
    Assignee: VIXS SYSTEMS, INC.
    Inventors: Indra Laksono, Kai Yang, Hongri Wang, Dong Liu, Xu Gang Zhao, Eric Young, Edward Hong
  • Patent number: 9367495
    Abstract: A method and apparatus for interfacing integrated circuit chips is disclosed. In one embodiment, the interface includes a set of differential data lines over which a variable length register transaction can be conducted.
    Type: Grant
    Filed: September 30, 2008
    Date of Patent: June 14, 2016
    Assignee: Lattice Semiconductor Corporation
    Inventors: Mark G. Forbes, Chih-Yuan Hsieh
  • Patent number: 9338456
    Abstract: This disclosure describes techniques for coding transform coefficients for a block of video data. According to these techniques, a video coder (a video encoder or video decoder) stores a first VLC table array selection table in memory, and an indication of at least one difference between the first VLC table array selection table and a second VLC table array selection table. The video coder reconstructs at least one entry of the second VLC table array selection table based on the first VLC table array selection table using the stored indication of the difference between the first VLC table array selection table and a second VLC table array selection table. The video coder uses the reconstructed at least one entry of the second VLC table array selection table to code at least one block of video data.
    Type: Grant
    Filed: July 10, 2012
    Date of Patent: May 10, 2016
    Assignee: QUALCOMM Incorporated
    Inventors: Marta Karczewicz, Liwei Guo, Xianglin Wang
  • Patent number: 9336225
    Abstract: Embodiments provide methods and systems for encoding and decoding variable-length data, which may include methods for encoding and decoding search engine posting lists. Embodiments may include different encoding formats including group unary, packed unary, and/or packed binary formats. Some embodiments may utilize single instruction multiple data (SIMD) instructions that may perform a parallel shuffle operation on encoded data as part of the decoding processes. Some embodiments may utilize lookup tables to determine shuffle sequences and/or masks and/or shifts to be utilized in the decoding processes. Some embodiments may utilize hybrid formats.
    Type: Grant
    Filed: March 31, 2011
    Date of Patent: May 10, 2016
    Assignee: A9.com, Inc.
    Inventors: Daniel E. Rose, Alexander A. Stepanov, Anil Ramesh Gangolli, Paramjit S. Oberoi, Ryan Jacob Ernst
  • Patent number: 9319119
    Abstract: The present disclosure provides a method and apparatus for transmitting the beamforming matrix. The method includes calculating the maximum value mv(k) of the real part and imaginary part of the elements in subcarrier's beamforming matrix; carrying out a M bits quantization to mv(k) and obtaining the quantization amplitude Mv(k), calculating the linear part Mvlin(k) of Mv(k); carrying out a respectively Nb bits quantization to the real part and imaginary part of every element in V(k) by Mvlin(k), and obtaining the quantized beamforming matrix Vq(k); Nb is positive integer; transmitting said quantization amplitude Mv(k) and said quantized beamforming matrix Vq(k).
    Type: Grant
    Filed: March 23, 2012
    Date of Patent: April 19, 2016
    Assignee: BEIJING NUFRONT MOBILE MULTIMEDIA TECH. CO., LTD.
    Inventors: Dongshan Bao, Shenfa Liu
  • Patent number: 9319710
    Abstract: Video encoding and its corresponding decoding are disclosed. The video encoding incorporates: a predictor for predicting a pixel value of each pixel in a current block of the video to generate a predicted pixel value; a subtractor for calculating a difference between an original pixel value of the pixel in the current block and the predicted pixel value of the pixel in the current block to generate a residual signal; a transformer for transforming the residual signal into frequency coefficients; a quantizer for quantizing the transformed frequency coefficients; and an encoder for encoding the quantized frequency coefficients by using one of different variable length coding tables.
    Type: Grant
    Filed: June 26, 2009
    Date of Patent: April 19, 2016
    Assignee: SK TELECOM CO., LTD.
    Inventors: Hayoon Kim, Haekwang Kim, Byeungwoo Jeon, Yunglyul Lee, Joohee Moon, Jie Jia
  • Patent number: 9286698
    Abstract: A tile of pixels is encoded by variable length encoding blocks of pixels constituting different subsets of the tile to form sequences of symbols as encoded representations of the pixel values. A respective size indication is determined for each set of at least block. A size indication is representative of a compression ratio of a combined sequence corresponding to the at least one sequence of symbols obtained for the at least one block of the set. The combined sequences are arranged in a pixel value buffer in a buffer memory. The size indication determined for a given set is also stored in the pixel value buffer in the buffer memory to precede, according to a reading order of the pixel value buffer, the combined sequence of the given set.
    Type: Grant
    Filed: December 14, 2010
    Date of Patent: March 15, 2016
    Assignee: Telefonaktiebolaget L M Ericsson (publ)
    Inventors: Jacob Ström, Per Wennersten
  • Patent number: 9271012
    Abstract: A method of coding at least one image comprising the steps of splitting the image into a plurality of blocks, of grouping said blocks into a predetermined number of subsets of blocks, of coding each of said subsets of blocks in parallel, the blocks of a subset considered being coded according to a predetermined sequential order of traversal. The coding step comprises, for a current block of a subset considered, the sub-step of predictive coding of said current block with respect to at least one previously coded and decoded block, and the sub-step of entropy coding of said current block on the basis of at least one probability of appearance of a symbol.
    Type: Grant
    Filed: September 22, 2014
    Date of Patent: February 23, 2016
    Assignee: DOLBY INTERNATIONAL AB
    Inventors: Felix Henry, Stephane Pateux
  • Patent number: 9214955
    Abstract: A Boolean entropy decoder including a decoding module, a buffer and an updating module is provided. The decoder sequentially generates a first boolean value, a second boolean value and a third boolean value. The first and second boolean values are generated during a same cycle. The decoding module requires a first bit amount while generating a first value corresponding to the first boolean value, and requires a second bit amount while generating a second value corresponding to the second boolean value. The buffer temporarily stores a bit segment in the bitstream to be provided to the decoding module. The updating module fetches a new bit segment according to the first bit amount and the second bit amount and updates the buffer. The decoding module selectively updates a value corresponding to the third boolean value after the buffer is updated.
    Type: Grant
    Filed: December 23, 2011
    Date of Patent: December 15, 2015
    Assignee: MSTAR SEMICONDUCTOR, INC.
    Inventors: Ying-Chieh Tu, Jin-Mu Wu
  • Patent number: 9209877
    Abstract: The present disclosure discloses a method, a user equipment and a base station for determining a PMI. The method includes: receiving a reference signal set sent by a base station; based on the reference signal set, selecting a precoding matrix from a codebook, the codebook at least including a non-constant modulus precoding matrix, the non-constant modulus precoding matrix at least including a non-constant modulus column vector, amplitude values of at least two elements of the non-constant modulus column vector forming a symmetrical sequence; and sending a PMI to the base station, the PMI corresponding to the selected precoding matrix. According to the method, the user equipment and the base station for determining PMI, because the non-constant modulus precoding matrix included in the adopted codebook can adjust the shape of a beam, antennas may focus power on a hotspot region, and thus a load balance may be effectively realized.
    Type: Grant
    Filed: January 2, 2015
    Date of Patent: December 8, 2015
    Assignee: Huawei Technologies Co., Ltd.
    Inventors: Jianguo Wang, Yongxing Zhou
  • Patent number: 9197244
    Abstract: A method and apparatus for symbol-space based compression of patterns are provided. The method comprises generating an output sequence responsive of an input sequence, the input sequence being of a first length and includes a plurality of symbols, by extraction of all common patterns, wherein a common pattern includes at least two symbols and the output sequence is of a second length that is shorter than the first length; and storing in a memory the output sequence as a data layer.
    Type: Grant
    Filed: December 17, 2014
    Date of Patent: November 24, 2015
    Assignee: Cortica, Ltd.
    Inventors: Igal Raichelgauz, Karina Odinaev, Yehoshua Y. Zeevi
  • Patent number: 9195567
    Abstract: In an approach for generating a compiler listing using Debugging With Attributed Record Format (DWARF) debugging data, a processor receives DWARF debugging data associated with source code of a programming language. A processor extracts information from the DWARF debugging data, wherein the information comprises at least source code lines, variable declaration lines, and variable reference lines. A processor generates a compiler listing based on the information extracted from the DWARF debugging data, wherein the compiler listing includes at least a symbol table, and cross-reference information.
    Type: Grant
    Filed: May 16, 2014
    Date of Patent: November 24, 2015
    Assignee: International Business Machines Corporation
    Inventors: Jeremy P. Blackman, Bret W. Dixon, Adrian N. Simcock
  • Patent number: 9191666
    Abstract: A variable length coding method is comprised of: a coefficient value scanning step in which an RL sequence generation unit, a reordering unit, and a binarization unit scan coefficient values within a block in a predetermined scanning order starting at a higher-frequency component toward a lower-frequency component; and an arithmetic coding step in which an arithmetic coding unit and a table storage unit perform arithmetic coding on the absolute values of the coefficient values according to the scanning order used in the coefficient value scanning step, by switching between probability tables for use, wherein, in the arithmetic coding step, a probability table to be used is switched to another probability table in one direction, when the arithmetic-coded absolute values of the coefficient values include an absolute value exceeding a predetermined threshold value.
    Type: Grant
    Filed: July 7, 2014
    Date of Patent: November 17, 2015
    Assignee: GODO KAISHA IP BRIDGE 1
    Inventors: Satoshi Kondo, Shinya Kadono, Makoto Hagai, Kiyofumi Abe
  • Patent number: 9172965
    Abstract: Techniques and tools for encoding and decoding a block of frequency coefficients are presented. An encoder selects a scan order from multiple available scan orders and then applies the selected scan order to a two-dimensional matrix of transform coefficients, grouping non-zero values of the frequency coefficients together in a one-dimensional string. The encoder entropy encodes the one-dimensional string of coefficient values according to a multi-level nested set representation. In decoding, a decoder entropy decodes the one-dimensional string of coefficient values from the multi-level nested set representation. The decoder selects the scan order from among multiple available scan orders and then reorders the coefficients back into a two-dimensional matrix using the selected scan order.
    Type: Grant
    Filed: April 27, 2012
    Date of Patent: October 27, 2015
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Chengjie Tu, Shankar Regunathan, Shijun Sun, Chih-Lung Lin
  • Patent number: 9171313
    Abstract: The tracking of ad selections (such as ad clicks for example), and/or rich levels of ad performance may be facilitated by encoding one or more ad properties in a click URL of the ad. An intermediate URL server may be used to decode such ad properties when the ad is selected. Ad properties may include a rendering attribute of the ad; a geolocation to which the ad was served; information pertaining to advertiser charges, etc.
    Type: Grant
    Filed: March 25, 2011
    Date of Patent: October 27, 2015
    Assignee: Google Inc.
    Inventors: Chad Lester, Eric Veach
  • Patent number: 9171550
    Abstract: Disclosed are a context-based arithmetic encoding apparatus and method and a context-based arithmetic decoding apparatus and method. The context-based arithmetic decoding apparatus may determine a context of a current N-tuple to be decoded, determine a Most Significant Bit (MSB) context corresponding to an MSB symbol of the current N-tuple, and determine a probability model using the context of the N-tuple and the MSB context. Subsequently, the context-based arithmetic decoding apparatus may perform a decoding on an MSB based on the determined probability model, and perform a decoding on a Least Significant Bit (LSB) based on a bit depth of the LSB derived from a process of decoding on an escape code.
    Type: Grant
    Filed: June 17, 2010
    Date of Patent: October 27, 2015
    Assignee: SAMSUNG ELECTRONICS CO., LTD.
    Inventors: Ki Hyun Choo, Jung-Hoe Kim, Eun Mi Oh
  • Patent number: 9172963
    Abstract: In one example, a video decoder is configured to determine whether a component of a transform unit of a coding unit of video data includes at least one non-zero coefficient based on a codeword for the transform unit, determine whether the transform unit is split into sub-transform units based on the codeword, and decode the transform unit based on the determinations. In another example, a video encoder is configured to determine whether a component of a transform unit of a coding unit of video data includes at least one non-zero coefficient, determine whether the transform unit is split into sub-transform units, select a codeword from a variable length code table, wherein the variable length code table provides an indication that the codeword corresponds to the determinations, and provide the codeword for the transform unit.
    Type: Grant
    Filed: October 27, 2011
    Date of Patent: October 27, 2015
    Assignee: QUALCOMM Incorporated
    Inventors: Xianglin Wang, Marta Karczewicz, Wei-Jung Chien, Peisong Chen
  • Patent number: 9167245
    Abstract: A system is provided for creating binary codewords for transform coefficients used for relating transform units (TUs) divided into coding units (CUs) in a High Efficiency Video Coding (HEVC) system. The system provides binarization of the codewords and removes unnecessary operations to reduce system complexity and increase compression performance. The system generates transform coefficients that relate the TUs and begins by providing a parameter variable (cRiceParam) set to an initial value of zero. Significant transform coefficients are converted into binary codewords based on the current value of the parameter variable, and the parameter variable is then updated with a new current value after each transform coefficient has been converted. Updating can be provided with reference to table values or the values can be provided from combination logic.
    Type: Grant
    Filed: February 5, 2013
    Date of Patent: October 20, 2015
    Assignee: GOOGLE TECHNOLOGY HOLDINGS LLC
    Inventors: Jian Lou, Limin Wang
  • Patent number: 9161032
    Abstract: The use of a picture delimiter that is contained in a NAL unit type value that is reserved in the current AVC or SVC specification. The present invention provides the scalability information for the H.264/AVC base layer in such a manner that bitstreams remain decodable with H.264/AVC decoders. In addition, the picture delimiter of the present invention may contain many other syntax elements that can help in easier processing of bitstreams compared to the plain H.264/AVC bitstream syntax.
    Type: Grant
    Filed: May 29, 2014
    Date of Patent: October 13, 2015
    Assignee: Nokia Technologies Oy
    Inventors: Miska Hannuksela, Ye-Kui Wang
  • Patent number: 9160362
    Abstract: Lempel-Ziv (LZ)-based data compression employing implicit variable-length distance coding is disclosed. Distances in LZ-based data compression length and distance blocks are implicit variable-length encoded during data compression to avoid padding encoded distances with extra bits (e.g., trailing 0's) that require fewer bits for storage than the number of bits needed to store maximum distance length. This reduces distance bit lengths in compressed output data to further reduce data size. During data compression, a distance table is generated that contains entries each having an assigned base and a number of extra bits to be read in compressed data during data decompression. In this manner, during data decompression, the entries in the distance table can be consulted to determine the number of bits in the variable-encoded distance in the compressed data to be read since the encoded distances can be encoded in the compressed data in fewer bits and without bit padding.
    Type: Grant
    Filed: May 8, 2014
    Date of Patent: October 13, 2015
    Assignee: QUALCOMM Incorporated
    Inventors: Amin Ansari, Vito Remo Bica, Rodolfo Giacomo Beraha
  • Patent number: 9154157
    Abstract: Systems and methods to accelerate compression and decompression with a search unit implemented in the processor core. According to an embodiment, a search unit may be implemented to perform compression or decompression on an input stream of data. The search unit may use a look-up table to identify appropriate compression or decompression symbols. The look-up table may be populated with a table derived using the variable length coding symbols of a sequence of vertices to be compressed or extracted from a received data stream to be decompressed. A comparator and a finite state machine may be implemented in the search unit to facilitate traversal of the look-up table.
    Type: Grant
    Filed: September 27, 2012
    Date of Patent: October 6, 2015
    Assignee: Intel Corporation
    Inventors: Nadathur Rajagopalan Satish, Changkyu Kim, Jatin Chhugani
  • Patent number: 9130594
    Abstract: Continuously interleaved codewords are used in a communication system to provide error correction capability. In general, each codeword shares symbols with both preceding and subsequent codewords, when the codewords are arranged in an order, such that correction of symbols in any one codeword also corrects symbols in another codeword and correction of symbols in any codeword may allow, considering possible corrections of intermediate codewords, for further correction of any codeword in the order of codewords. In one embodiment received information may be arranged in subframes, with each subframe including terminal symbols of a plurality of codewords, each of the plurality of codewords including symbols in multiple subframes.
    Type: Grant
    Filed: October 28, 2014
    Date of Patent: September 8, 2015
    Assignee: Microsemi Communications, Inc.
    Inventor: Tim Coe
  • Patent number: 9131506
    Abstract: A system and methodology are presented for exploiting channel correlation in time and/or frequency to reduce CQI feedback in wireless communications systems. By compressing CQI feedback at the receiver to reduce redundancy in CQI feedback information that results from the channel correlation, the average feedback rate is reduced. Redundancy in time may be removed from the CQI feedback by monitoring variations of the CQI information in time at the receiver so that CQI information for a given CQI reporting instance is communicated to the transmitter only if it differs from the CQI information for the previous CQI reporting instance. CQI feedback is compressed by performing a discrete cosine transform (DCT) on the CQI data and then communicated to the transmitter through the feedback control channel where it is decoded into the original CQI information and used to generate signal processing information for various sub-carriers.
    Type: Grant
    Filed: April 22, 2013
    Date of Patent: September 8, 2015
    Assignee: Apple Inc.
    Inventor: Jayesh H. Kotecha
  • Patent number: 9131241
    Abstract: Adjustment of hardware acceleration level in a video decoder utilizing hardware acceleration is described. Errors are detected in a bitstream as it is decoded using different levels of error detection based on decoding characteristics. A statistical analysis is performed on the error values as they are detected. In one technique, if the bitstream is categorized as fitting a high error rate state in a bitstream model, then hardware acceleration is dropped. In another technique, error statistics based on run-lengths of good and bad bitstream units are kept, and compared to predetermined thresholds. If the thresholds are exceeded, the hardware acceleration level is dropped. The level is dropped in order to take advantage of superior error handing abilities of software-based decoding over hardware-accelerated decoding.
    Type: Grant
    Filed: November 25, 2008
    Date of Patent: September 8, 2015
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Gang Ji, Naveen Thumpudi, Shyam Sadhwani, Yongjun Wu
  • Patent number: 9116851
    Abstract: System and method embodiments are provided herein to enable VTL backup and retrieval over S3 storage technology. An embodiment method includes mapping a plurality of data blocks for VTL storage into a plurality of S3 objects for S3 storage, and storing the S3 objects at one or more locations for S3 storage over one or more networks, wherein the mapping enables stateless backup and restore of the data blocks. An embodiment network component includes a Small Computer System Interface configured to receive a plurality of data blocks form one or more servers, a data library storage including tape storage, disk storage, or both that is configured to store the data blocks, a blocks-to-objects mapping engine configured to map the data blocks into a plurality of S3 objects, and a S3 interface configured to transfer the S3 objects to one or more locations for S3 storage over one or more networks.
    Type: Grant
    Filed: December 28, 2012
    Date of Patent: August 25, 2015
    Assignee: Futurewei Technologies, Inc.
    Inventors: James Hughes, Thai Nguyen
  • Patent number: 9100042
    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: Grant
    Filed: June 20, 2013
    Date of Patent: August 4, 2015
    Assignee: International Business Machines Corporation
    Inventor: Andrew K. Martin
  • Patent number: 9094039
    Abstract: A decompression engine may include an input configured to receive an input code comprises one or more bits from a bitstream of encoded data, a symbol decoder coupled with the input, where the symbol decoder is configured to calculate, based on the input code, a plurality of candidate addresses each corresponding to a code group. The symbol decoder may further include a group identifier module coupled with the symbol decoder, wherein the group identifier module is configured to identify one of the plurality of code groups corresponding to the input code, and a multiplexer coupled with the group identifier module, wherein the multiplexer is configured to select as a final address one of the plurality of candidate addresses corresponding to the identified code group.
    Type: Grant
    Filed: October 18, 2013
    Date of Patent: July 28, 2015
    Assignee: Advanced Micro Devices, Inc.
    Inventors: Winthrop J Wu, Martin Kiernicki, Creighton Eldridge
  • Patent number: 9088297
    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: Grant
    Filed: July 19, 2013
    Date of Patent: July 21, 2015
    Assignee: International Business Machines Corporation
    Inventor: Andrew K. Martin
  • Patent number: 9088770
    Abstract: Systems, apparatus, articles, and methods are described including operations for size based transform unit context derivation.
    Type: Grant
    Filed: September 6, 2012
    Date of Patent: July 21, 2015
    Assignee: Intel Corporation
    Inventors: Wenhao Zhang, Yi-Jen Chiu, Pieter Kapsenberg, Lidong Xu, Yu Han, Zhipin Apple Deng, Xiaoxia Cai
  • Patent number: 9088798
    Abstract: Provided are an image encoding device that has high encoding efficiency, and an image decoding device. A mapping means maps pixel signals of an object to be encoded that are configured in prescribed color space to mapped pixel signals in which redundancy between the signals is reduced. The mapping coefficients are calculated from encoded pixel signals, thereby making encoding of mapping coefficients unnecessary. Furthermore, the mapping coefficients are calculated from pixel signals of an adjacent block comprising pixels similar to the pixels of the block to be encoded/decoded, thereby reducing redundancy significantly. The mapping is applied to the pixel signals of the block to be encoded/decoded and to an area of pixels to be referred to by prediction information, thereby enabling prediction to be applied to the mapped pixel signals, and, after executing transformation/quantization, encoding and inverse transformation/dequantization are executed. The mapped pixel signals are restored to the pixel signals.
    Type: Grant
    Filed: March 18, 2013
    Date of Patent: July 21, 2015
    Assignee: KDDI Corporation
    Inventors: Haruhisa Kato, Akio Yoneyama
  • Patent number: 9086871
    Abstract: A mechanism is provided for recirculating transactions within a pipeline while reordering outputs. A set of transactions associated with a block of data is received and each transaction in the set of transactions is processed via the pipeline. For each transaction processed via the pipeline, responsive to the transaction exiting the pipeline, a determination is made as to whether the transaction needs further processing. Responsive to the transaction needing further processing, the transaction is re-circulated via the pipeline forming a recirculated transaction.
    Type: Grant
    Filed: September 26, 2013
    Date of Patent: July 21, 2015
    Assignee: International Business Machines Corporation
    Inventors: Damir A. Jamsek, Andrew K. Martin
  • Patent number: 9083374
    Abstract: Decomposing a value range of the respective syntax elements into a sequence of n partitions with coding the components of z laying within the respective partitions separately with at least one by VLC coding and with at least one by PIPE or entropy coding is used to greatly increase the compression efficiency at a moderate coding overhead since the coding scheme used may be better adapted to the syntax element statistics. Accordingly, syntax elements are decomposed into a respective number n of source symbols si with i=1 . . . n, the respective number n of source symbols depending on as to which of a sequence of n partitions into which a value range of the respective syntax elements is sub-divided, a value z of the respective syntax elements falls into, so that a sum of values of the respective number of source symbols si yields z, and, if n>1, for all i=1 . . . n?1, the value of si corresponds to a range of the ith partition.
    Type: Grant
    Filed: July 12, 2013
    Date of Patent: July 14, 2015
    Assignee: GE Video Compression, LLC
    Inventors: Detlev Marpe, Tung Nguyen, Heiko Schwarz, Thomas Wiegand
  • Patent number: 9083326
    Abstract: A signal transmitting circuit is provided for cutting off or outputting at least one driving signal for driving a designated light source. The signal transmitting circuit includes an input differential signaling driver, an output differential amplifier, and a fixed-voltage-level-difference supply device. The input differential signaling driver is for receiving a display signal, and outputting an inverting signal and a non-inverting signal according to the display signal. The output differential amplifier is for receiving the inverting signal and non-inverting signal and outputting or cutting off the driving signal according to the voltage-level difference between the inverting signal and the non-inverting signal.
    Type: Grant
    Filed: September 23, 2011
    Date of Patent: July 14, 2015
    Assignee: Getac Technology Corporation
    Inventors: Chun-Hung Chen, Tzu-Chi Liu
  • Patent number: 9078001
    Abstract: A bitplane decoding system where the bitplane operations are broken up into an optimized plurality of sub-tasks. A pipeline structure is established for the execution of said sub-tasks on a plurality of processors or dedicated hardware logic blocks in a manner that allows efficient execution of the sub-tasks in parallel across two processors, resulting in a significant increase in performance.
    Type: Grant
    Filed: June 18, 2013
    Date of Patent: July 7, 2015
    Assignee: TEXAS INSTRUMENTS INCORPORATED
    Inventors: Mihir Narendra Mody, Dinesh Kothandapani
  • Patent number: 9075748
    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: October 9, 2013
    Date of Patent: July 7, 2015
    Assignee: International Business Machines Corporation
    Inventors: David C. Haws, Laxmi P. Parida
  • Patent number: 9054728
    Abstract: Data compression using a combination of content independent data compression and content dependent data compression. In one aspect, a system for compressing data comprises: a processor; one or more content dependent data compression encoders; and a single data compression encoder. The processor is configured to analyze data within a data block to identify one or more parameters or attributes of the data wherein the analyzing of the data within the data block to identify the one or more parameters or attributes of the data excludes analyzing based solely on a descriptor that is indicative of the one or more parameters or attributes of the data within the data block; to perform content dependent data compression with the one or more content dependent data compression if the one or more parameters or attributes of the data are identified; and to perform data compression with the single data compression encoder, if the one or more parameters or attributes of the data are not identified.
    Type: Grant
    Filed: September 24, 2014
    Date of Patent: June 9, 2015
    Assignee: REALTIME DATA, LLC
    Inventor: James J. Fallon
  • Patent number: 9054735
    Abstract: A method for encoding using a variable length coding is provided, which includes at an encoding system, determining variable length codes for coding a data set to be encoded, dividing a corresponding code corresponding to a specific data included in the data set into a first partial code and a second partial code and storing the divided first and second partial codes at the encoding system, and compressing a first partial code, which is a set of the first partial code, and storing the compressed result at the encoding system.
    Type: Grant
    Filed: December 22, 2014
    Date of Patent: June 9, 2015
    Assignee: Fingram Co., Ltd.
    Inventor: Young Cheul Wee
  • Patent number: 9054734
    Abstract: A variable length coding method is provided for coding coefficients in each block which are obtained by performing frequency transformation on picture data of a moving picture per block having a predetermined size, and includes: a coefficient scanning step of scanning the coefficients in the block in a predetermined order; and a coding step of coding the coefficients scanned in the coefficient scanning step into variable length codes in a predetermined order by switching a plurality of tables to be used for coding. Here, a direction of switching between the tables may be one-directional. Also, the coding may be non-arithmetic coding.
    Type: Grant
    Filed: October 17, 2007
    Date of Patent: June 9, 2015
    Assignee: PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA
    Inventors: Satoshi Kondo, Shinya Kadono, Makoto Hagai, Kiyofumi Abe