Coding By Table Look-up Techniques Patents (Class 341/106)
-
Patent number: 8704687Abstract: A management module registers a request to convert code from a first code set to a second code set, identifies a code set converter (CSC), determines whether a most recently used CSC is the identified CSC and, in response to determining that the most recently used CSC is not the identified CSC, locates a user-preferred CSC pool comprising a subset of locally stored CSCs each corresponding to a preference index. The management module, in response to determining that the identified CSC is located within the user-preferred CSC pool, searches the user-preferred CSC pool for the identified CSC, loads the identified CSC, initiates the identified CSC that converts the code from the first code set to the second code set, modifies usage data for the identified CSC, and orders the user-preferred CSC pool based on a preference index for each CSC stored in the CSC pool.Type: GrantFiled: August 1, 2012Date of Patent: April 22, 2014Assignee: International Business Machines CorporationInventors: David N. Clissold, Mark A. Grubbs, Su Liu, Kevin R. Sloan
-
Patent number: 8698657Abstract: The present invention relates to data compression using compression dictionary. A compression method according to the invention comprises obtaining an initial compression dictionary and a separate secondary dictionary SD; determining at least one subpart of the secondary dictionary that correlates with a block of data DB to compress; updating the initial compression dictionary by inserting the determined at least one subpart therein, to obtain an updated compression dictionary used for compressing the block of data; and compressing the block of data using one or more references to entries of the obtained updated compression dictionary.Type: GrantFiled: September 10, 2012Date of Patent: April 15, 2014Assignee: Canon Kabushiki KaishaInventors: Youenn Fablet, Romain Bellessort, Hervé Ruellan
-
Patent number: 8700794Abstract: A video transmission method is provided, which includes receiving state information from at least one mobile terminal that intends to perform a video stream service through a wireless network, determining a size of an image by selecting a specified spatial layer bit stream on the basis of the state information of the mobile terminal from a plurality of spatial layer bit streams generated at different bit rates during encoding of the bit stream, selecting a specified time and an SNR layer bit stream by increasing or decreasing time of the image and a layer position of the SNR layer bit stream on the basis of network parameters included in the state information of the mobile terminal, and transmitting the bit stream generated by extracting the specified layer bit stream of the selected layer to the mobile terminal.Type: GrantFiled: April 13, 2010Date of Patent: April 15, 2014Assignees: Samsung Electronics Co., Ltd., Korea University Research and Business FoundationInventors: Sung-Kee Kim, Tae-Sung Park, Sung-Jae Ko, Hyeong-Min Nam
-
Patent number: 8686883Abstract: Disclosed are a Multiple User Multiple Input Multiple Output (MU-MIMO) codebook design method, and a communication device using the codebook. A MU-MIMO codebook design method includes analyzing beam patterns of candidate vectors included in a predetermined candidate codebook, and eliminating at least one of the candidate vectors based on the beam patterns of the candidate vectors to generate the MU-MIMO codebook for a MU-MIMO system being comprised of the remaining vectors.Type: GrantFiled: September 15, 2011Date of Patent: April 1, 2014Assignee: Samsung Electronics Co., Ltd.Inventors: Joon-Il Choi, Yongxing Zhou
-
Publication number: 20140085115Abstract: Embodiments relate to data compression using dictionary encoding. An aspect includes subdividing a table of uncompressed data into a first block and a second block of complete rows. Another aspect includes determining information about a frequency of occurrence of different values for each column of the first block. Another aspect includes selecting a row of the first block to be removed out of the first block using frequency of occurrence-information. Another aspect includes removing the a row out of the first block to form an updated first block and determining information about a frequency of occurrence of different values for each column of the updated first block. Another aspect includes deriving a dictionary containing code-words for encoding the values of the updated first block. Another aspect includes encoding the values of the updated first block based on the code-words. Another aspect includes adding the removed row to the second block.Type: ApplicationFiled: September 23, 2013Publication date: March 27, 2014Applicant: International Business Machines CorporationInventors: Felix Beier, Carlos J. Caballero Grolimund, Vijayshankar Raman, Knut Stolze
-
Patent number: 8674859Abstract: A method for arithmetic coding of symbols in a stream is described. The method comprises the following steps: coding a current symbol with a current probability model, and updating the current probability model according to the coding of the current symbol. selecting the current probability model in a set of at least two probability models according to a coding cost criterion, and coding an identifier of the selected probability model.Type: GrantFiled: June 22, 2010Date of Patent: March 18, 2014Assignee: Thomson LicensingInventors: Philippe Bordes, Dominique Thoreau, Jerome Vieron, Edouard Francois
-
Patent number: 8665124Abstract: Method, apparatus, and systems employing dictionary-based high-bandwidth lossless compression. A pair of dictionaries having entries that are synchronized and encoded to support compression and decompression operations are implemented via logic at a compressor and decompressor. The compressor/decompressor logic operatives in a cooperative manner, including implementing the same dictionary update schemes, resulting in the data in the respective dictionaries being synchronized. The dictionaries are also configured with replaceable entries, and replacement policies are implemented based on matching bytes of data within sets of data being transferred over the link. Various schemes are disclosed for entry replacement, as well as a delayed dictionary update technique. The techniques support line-speed compression and decompression using parallel operations resulting in substantially no latency overhead.Type: GrantFiled: October 1, 2011Date of Patent: March 4, 2014Assignee: Intel CorporationInventors: Ilan Pardo, Ido Y. Soffair, Dror Reif, Debendra Das Sharma, Akshay G. Pethe
-
Patent number: 8645145Abstract: An audio decoder includes an arithmetic decoder for providing a plurality of decoded spectral values on the basis of an arithmetically encoded representation of the spectral values, and a frequency-domain-to-time-domain converter for providing a time-domain audio representation using the decoded spectral values. The arithmetic decoder selects a mapping rule describing a mapping of a code value onto a symbol code in dependence on a context state described by a numeric current context value. The arithmetic decoder determines the numeric current context value in dependence on a plurality of previously decoded spectral values. The arithmetic decoder evaluates a hash table, entries of which define both significant state values and boundaries of intervals of numeric context values, in order to select the mapping rule. A mapping rule index value is individually associated to a numeric context value being a significant state value.Type: GrantFiled: July 12, 2012Date of Patent: February 4, 2014Assignee: Fraunhoffer-Gesellschaft zur Foerderung der Angewandten Forschung E.V.Inventors: Vignesh Subbaraman, Guillaume Fuchs, Markus Multrus, Nikolaus Rettelbach, Marc Gayer, Oliver Weiss, Christian Griebel, Patrick Warmbold
-
Patent number: 8638245Abstract: Disclosed are systems, apparatus, and methods for encoding data transmitted in a data line. In various embodiments, a device may include a first input port operative to receive a first data value. In some embodiments, the device may further include a first memory device operative to look up a second data value based on the first data value, where the second data value is a representation of the first data value encoded according to an encoding scheme that allows clock recovery, and where the memory device is operative to be configured according to a plurality of line encoding schemes. In various embodiments, the device may further include a first output port operative to provide an output signal, where the output signal comprises one or more data values including the second data value.Type: GrantFiled: July 31, 2012Date of Patent: January 28, 2014Assignee: Altera CorporationInventors: Gregg William Baeckler, David W. Mendel
-
Patent number: 8618962Abstract: A system and method that process encoded data, wherein the encoded data is an encoded video stream. The encoded data may be buffered and the characteristics of the buffered encoded data may be determined and used to select a decoding table from a plurality of decoding tables. An encoded word may then be decoded using the selected decoding table. The output of the decoding table may be the corresponding decoded word and the size of the encoded word. The size of the encoded word may be utilized to shift the buffered encoded data. The decoded word may be sent to the appropriate portion of the system.Type: GrantFiled: July 14, 2009Date of Patent: December 31, 2013Assignee: Broadcom CorporationInventor: Timothy Hellman
-
Patent number: 8604947Abstract: An image coding apparatus provides a run-length encoding unit RLE1 that subjects quantized coefficients which are obtained by quantizing frequency components of an image signal to a variable length coding process by using a run value Run that indicates the number of successive zero coefficients and a level value Lev that indicates a value of a non-zero coefficient following the zero coefficients. The run-length encoding unit RLE1 includes a reordering unit Lreodr for reordering level values Lev; a variable length coder LVLC for coding reordered level values ROLev by using a code table that is selected according to the value of a quantization parameter QP; a reordering unit Rreodr for reordering run values Run from high frequency component of the quantized coefficients to low frequency component; and a variable length coder RVLC for coding reordered run values RORun by using a code table that is selected according to the number of already-processed run values.Type: GrantFiled: April 21, 2011Date of Patent: December 10, 2013Assignee: Panasonic CorporationInventors: Shinya Kadono, Satoshi Kondo, Makoto Hagai, Kiyofumi Abe
-
Patent number: 8599049Abstract: A dynamic decoding lookup table generation method is provided. The generation method includes: receiving a variable length coding (VLC) table; and dynamically establishing an adaptive decoding lookup table from the VLC table according to a target decoding rate and a free system memory resource.Type: GrantFiled: August 26, 2011Date of Patent: December 3, 2013Assignee: Industrial Technology Research InstituteInventors: Wen-Shan Wang, Tse-Min Chen
-
Patent number: 8593308Abstract: A system and method of accelerating dynamic Huffman decompaction within the inflate algorithm. To improve the performance of a decompression engine during the inflate/decompression process, Huffman trees decompacted a priori are used thus eliminating the requirement of decompacting the DHT for each input stream. The Huffman tree in the input stream is matched prior to decompaction. If a match is found, the stored decompacted Huffman tree is used which reduces the required decompression time.Type: GrantFiled: May 31, 2012Date of Patent: November 26, 2013Assignee: International Business Machines CorporationInventors: Giora Biran, Amit Golander, Shai I Tahar
-
Patent number: 8593306Abstract: A Huffman decoder includes a storage module, a receiving module, and a determining module. The storage module stores a target path corresponding to a rare path. The receiving module receives a codeword in a source data stream and acquires corresponding path data for the codeword. The determining module compares the path data and the target path, and determines the codeword as the rare code when the path data and the target path are the same.Type: GrantFiled: August 29, 2011Date of Patent: November 26, 2013Assignee: Mstar Semiconductor, Inc.Inventor: Han-Chi Lin
-
Patent number: 8588540Abstract: The number of times of processing to increment the number of reserved bits in arithmetic coding processing is reduced. For this purpose, upon inputting a binary symbol, a zone is divided into two zones at a ratio between occurrence probabilities of MPS and LPS, and one of the divided zones is selected according to the input symbol. When the length of the selected zone is shorter than a predetermined length, normalization is performed. Then it is determined whether or not a threshold for determining a decimal place of interest exists within the zone of interest. When the threshold exists within the zone of interest, the number of reserved bits is incremented by one. When the threshold exists without the zone, 1-bit data determined based on a relative position between the zone of interest and the threshold is outputted, bit data corresponding to the number of reserved bits is determined and outputted, and the number of reserved bits is cleared to zero.Type: GrantFiled: October 30, 2007Date of Patent: November 19, 2013Assignee: Canon Kabushiki KaishaInventor: Shingo Nozawa
-
Patent number: 8581757Abstract: The invention relates to a method for the vector quantization of a feature vector, in particular with respect to a data compression of a signal to be transmitted or to be stored, particularly a voice signal or a video signal, wherein at least one codebook from a plurality of codebook vectors is searched for a code vector representing the feature vector. During the search, a sequence of codebook vectors is examined for the suitability thereof to represent the feature vector. In the course of the search for the code vector, a set of neighboring vectors is dedicated to at least one of the codebook vectors potentially to be examined, preferably prior to the search. The search for the code vector includes at least part of the neighboring vectors.Type: GrantFiled: June 30, 2010Date of Patent: November 12, 2013Assignee: Siemens Enterprise Communications GmbH & Co. KGInventors: Stefan Schandl, Panji Setiawan
-
Patent number: 8583835Abstract: A command portal enables a host system to send non-standard or “vendor-specific” storage subsystem commands to a storage subsystem using an operating system (OS) device driver that does not support or recognize such non-standard commands. The architecture thereby reduces or eliminates the need to develop custom device drivers that support the storage subsystem's non-standard commands. To execute non-standard commands using the command portal, the host system embeds the non-standard commands in blocks of write data, and writes these data blocks to the storage subsystem using standard write commands supported by standard OS device drivers. The storage subsystem extracts and executes the non-standard commands. The non-standard commands may alternatively be implied by the particular target addresses used. The host system may retrieve execution results of the non-standard commands using standard read commands.Type: GrantFiled: February 12, 2009Date of Patent: November 12, 2013Assignee: Siliconsystems, Inc.Inventor: Alan Kan
-
Patent number: 8572218Abstract: A method and system for transport data compression between a server and a client based on patches to the dictionaries used for encoding the data. The method includes requesting the server for data, returning the data and a dictionary patch to the client where data having been compressed based on a previously used dictionary and the dictionary patch, and decompressing the returned data using the dictionary and the dictionary patch. The dictionary patch includes updates to the previously used dictionary. Each dictionary has a dictionary identifier that the server and client use to identify the dictionary in their requests and responses. The identifier might be a unique identification or a network session number. Upon receiving a response, the client updates the previously used dictionary with information in the patch and decompresses the returned data using the updated dictionary.Type: GrantFiled: December 10, 2009Date of Patent: October 29, 2013Assignee: International Business Machines CorporationInventors: Hariharan L. Narayanan, Arun Ramakrishnan, Krishna C. Shastry, Rohit Shetty
-
Patent number: 8552891Abstract: A semiconductor device may include a coding lookup table unit including a plurality of coding lookup tables each of which is selected by a respectively selection signal, and a selection unit configured to receive one of N-bit parallel data and extract respective encoded data corresponding to the selection signal and to which the N-bit parallel data is mapped from the coding lookup table unit, and encoded data and extract respective N-bit parallel data corresponding to the selection signal and to which the encoded data is mapped from the coding lookup table unit, wherein N is 2 or an integer greater than 2, and wherein the coding lookup tables respectively store a plurality of coded data patterns that respectively correspond to patterns of the N-bit parallel data and are random temporally and spatially.Type: GrantFiled: March 4, 2011Date of Patent: October 8, 2013Assignee: Samsung Electronics Co., Ltd.Inventors: Seung Jun Bae, Jong Keun Ahn, Kwang Chol Choe
-
Patent number: 8537038Abstract: A method of compressing sorted data representation symbols sequentially. Steps include determining whether a symbol currently being encoded is identical to an immediately preceding symbol; encoding the result as a binary event; if the symbols are identical, encoding the symbol ends; if the symbols are different and there is a constant difference between several previous pairs of symbols, determining whether the difference between the current symbol a and the symbol immediately preceding it b is the same as the difference between the symbol b and the symbol immediately preceding it c, and encoding the determination result as another binary event; in the case of positive result of the latest determination, encoding the symbol ends; otherwise, encoding the symbol using a bitwise operation in which bits of the symbol's binary representation are processed sequentially from the most significant bit to the least significant bit. A corresponding decompression method is provided.Type: GrantFiled: October 24, 2011Date of Patent: September 17, 2013Assignee: Smith Micro Software, Inc.Inventors: Vladimir Semenyuk, Serge Volkoff
-
Patent number: 8508389Abstract: In a coding system, input data within a system is encoded. The input data might include sequences of symbols that repeat in the input data or occur in other input data encoded in the system. The encoding includes determining a target segment size, determining a window size, identifying a fingerprint within a window of symbols at an offset in the input data, determining whether the offset is to be designated as a cut point and segmenting the input data as indicated by the set of cut points. For each segment so identified, the encoder determines whether the segment is to be a referenced segment or an unreferenced segment, replacing the segment data of each referenced segment with a reference label and storing a reference binding in a persistent segment store for each referenced segment, if needed.Type: GrantFiled: November 4, 2010Date of Patent: August 13, 2013Assignee: Riverbed Technology, Inc.Inventors: Steven McCanne, Michael J. Demmer
-
Patent number: 8503809Abstract: The present invention relates to an information processing apparatus and method which make it possible to transmit image data with high quality and low delay. A wavelet transform unit 101 applies wavelet transform to image data using a reversible filter that performs data transform with a reversible method that completely ensures forward direction and backward direction transform. An entropy coding unit 103 encodes coefficient data using a predetermined entropy coding scheme, with a reversible method that completely ensures forward direction and backward direction transform. The present invention is applicable to, for example, an encoding apparatus or a decoding apparatus.Type: GrantFiled: May 16, 2008Date of Patent: August 6, 2013Assignee: Sony CorporationInventors: Takahiro Fukuhara, Katsutoshi Ando
-
Patent number: 8498824Abstract: Methods and apparatuses for nucleic aced sequencing using a compacted code technique are disclosed. In one embodiment, a method includes providing a nucleic acid to be sequenced, determining the identity of each base in a subsequence of bases in the nucleic acid, encoding the identity of the subsequence in a format having a number of bytes that is less than the number of bases, and storing the encoded identity.Type: GrantFiled: June 2, 2008Date of Patent: July 30, 2013Assignee: Intel CorporationInventor: Xing Su
-
Patent number: 8482440Abstract: Methods for decoding are provided. The proposed method includes steps of: receiving a most probable symbol (MPS) value and a probability value for generating a probability model update; and receiving the probability model update for generating the MPS value and the probability value, wherein when the probability value shows that an MPS is occurred, a path corresponds to the MPS is estimated and a first bin included in the path is decoded beforehand.Type: GrantFiled: May 17, 2012Date of Patent: July 9, 2013Assignee: National Cheng Kung UniversityInventors: Gwo Giun Lee, He-Yuan Lin, Jia-Wei Liang, Ching-Jui Hsiao
-
Patent number: 8482441Abstract: 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: GrantFiled: June 1, 2012Date of Patent: July 9, 2013Assignee: Massachusetts Institute of TechnologyInventors: Muriel MĂ©dard, Soheil Feizi-Khankandi
-
Patent number: 8462023Abstract: An encoding method and encoding apparatus for B-transform, and encoded data for same are provided. The apparatus is for encoding input data and includes: a B-transform unit for performing a B-transform on the input data to generate a binary expression; and an encoder for removing one or more binary symbols from the binary expression and scanning the binary expression with the one or more binary symbols removed to generate a bitstream. According to the method and apparatus, it is possible to encode uniform distribution data efficiently, and using the B-transform by its characteristics for reducing the bit number in the generation of the binary expressions from the B-transform operation on the uniform distribution data enhances the data compression performance.Type: GrantFiled: September 9, 2009Date of Patent: June 11, 2013Assignee: SK Telecom Co., Ltd.Inventors: Hayoon Kim, Yoonsik Choe, Yonggoo Kim, Yungho Choi, Sungjei Kim, Jinwoo Jung
-
Publication number: 20130141259Abstract: A method and system for effective pattern compression are provided. The method includes selecting a Minimal Perfect Hashing Function (MPHF); identifying a base character set for which the MPHF is designed; identifying characters of a target character set; and applying scrambling to distribute the characters of the target character set over the base character set.Type: ApplicationFiled: December 5, 2012Publication date: June 6, 2013Applicant: Samsung Electronics Co., Ltd.Inventor: Samsung Electronics Co., Ltd.
-
Patent number: 8456333Abstract: 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: GrantFiled: October 24, 2011Date of Patent: June 4, 2013Assignee: Smith Micro Software, Inc.Inventors: Vladimir Semenyuk, Serge Volkoff
-
Patent number: 8432302Abstract: 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: GrantFiled: December 30, 2010Date of Patent: April 30, 2013Assignee: Huawei Technologies Co., Ltd.Inventors: Dongning Feng, Weiguang Liang, Dongyu Geng, Jing Li, Frank Effenberger, Sergio Benedetto, Guido Montorsi
-
Patent number: 8421653Abstract: 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: GrantFiled: January 14, 2011Date of Patent: April 16, 2013Assignee: Canon Kabushiki KaishaInventor: Jumpei Ashida
-
Patent number: 8417730Abstract: A method for compressing a data stream based on a combination of two digests is used. Each combination of digests that occurs multiple times is assigned a codeword. When the first digest matches, a data structure of second digests occurring with the same first digest is built, associating each combination of digests with a position in the stream where the combination of digests is found. When a new match is found a new codeword is defined. When a match with an existing codeword is found, a byte sequence is emitted that identifies the codeword associated with the matched data. When a partial match is found, the length of a codeword is changed and a corresponding byte sequence is emitted. The method finds particular application in data streams that are sent to printers, and which contain large blocks of identical data such as images or repetitive text.Type: GrantFiled: December 3, 2010Date of Patent: April 9, 2013Assignee: Objectif Lune Inc.Inventor: Paul Jones
-
Publication number: 20130082851Abstract: Method, apparatus, and systems employing dictionary-based high-bandwidth lossless compression. A pair of dictionaries having entries that are synchronized and encoded to support compression and decompression operations are implemented via logic at a compressor and decompressor. The compressor/decompressor logic operatives in a cooperative manner, including implementing the same dictionary update schemes, resulting in the data in the respective dictionaries being synchronized. The dictionaries are also configured with replaceable entries, and replacement policies are implemented based on matching bytes of data within sets of data being transferred over the link. Various schemes are disclosed for entry replacement, as well as a delayed dictionary update technique. The techniques support line-speed compression and decompression using parallel operations resulting in substantially no latency overhead.Type: ApplicationFiled: October 1, 2011Publication date: April 4, 2013Inventors: Ilan Pardo, Ido Y. Soffair, Dror Reif, Debendra Das Sharma, Akshay G. Pethe
-
Patent number: 8378861Abstract: 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: GrantFiled: November 29, 2010Date of Patent: February 19, 2013Assignee: ARM LimitedInventors: Anders Berkeman, Dominic Hugo Symes
-
Patent number: 8354946Abstract: A digital decoding apparatus and method for receiving and decoding a compression-coded digital signal in predetermined transmission units is disclosed.Type: GrantFiled: January 5, 2011Date of Patent: January 15, 2013Assignee: Mitsubishi Denki Kabushiki KaishaInventors: Shunichi Sekiguchi, Yoshihisa Yamada, Kohtaro Asai
-
Patent number: 8340450Abstract: A vector quantizer includes a lattice quantizer (10) approximating a vector x by a lattice vector belonging to a lattice ?0. A lattice vector decomposer (14) connected to the lattice quantizer successively decomposes the lattice vector into a sequence of quotient vectors y, and a sequence of remainder vectors ri on successive lattices ?I?1 by lattice division with a corresponding predetermined sequence of integers pi?2, where i=1 . . . k and k is a positive integer representing the number of elements in each sequence.Type: GrantFiled: September 12, 2006Date of Patent: December 25, 2012Assignee: Telefonaktiebolaget LM Ericsson (Publ)Inventor: Anisse Taleb
-
Patent number: 8320473Abstract: A data communication method is disclosed. The method may include obtaining a data vector to be communicated; selecting a code table configured for facilitating the data communication; selecting a vector of real numbers representative of the data vector using the code table; and transmitting the vector of real numbers, wherein the vector of real numbers is transformed, upon reception, into a best corresponding vector by utilizing the code table.Type: GrantFiled: February 4, 2010Date of Patent: November 27, 2012Assignee: Prairie Blue, LLCInventor: Bruce Conway
-
Patent number: 8319672Abstract: A decoding device is suitable for a context-based adaptive binary arithmetic coding (CABAC) technique and allows a real-time decoding of high-definition video. The CABAC decoding device allows a simultaneous performing since determination according to multiple conditions is based on logic circuits when the device is formed in hardware. Additionally, when one macro block starts to be decoded, the device reads and stores information about neighboring macro blocks at a time from a memory. Therefore, the device does not need to access the memory at every operation and this improves the overall decoding speed.Type: GrantFiled: April 8, 2011Date of Patent: November 27, 2012Assignee: Korea Electronics Technology InstituteInventors: Dong-Sun Kim, SeungYerl Lee, Tae-Ho Hwang, Byung-Ho Choi
-
Patent number: 8315709Abstract: 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: GrantFiled: March 26, 2007Date of Patent: November 20, 2012Assignee: Medtronic, Inc.Inventor: Eric D. Corndorf
-
Patent number: 8315329Abstract: Methods and apparatus are disclosed for applying successive multi-rank beamforming strategies (e.g., successive precoding strategies) for the design of precoders over a set of parallel channels. Successive beamforming is applied to a narrow band channel model and is also applied for finer quantization of a single beamforming vector (e.g., recursive beamforming). A first embodiment provides the optimal approach with high complexity. An alternative embodiment provides successive beamforming for near optimal precoding selection with medium complexity. A low complexity method for precoder selection is also provided wherein a channel representative matrix for the set of parallel channels is determined and successive beamforming on the calculated channel representative is applied.Type: GrantFiled: May 20, 2011Date of Patent: November 20, 2012Assignee: NEC Laboratories America, Inc.Inventor: Mohammad A. Khojastepour
-
Patent number: 8279096Abstract: Dictionary-based sequential compression is performed in parallel on input data using multiple cores of a computer system. The compression can be performed by first determining a dictionary size for data compression, followed by determining a block size for partitioning the input data. The block size is greater than the dictionary size. The multiple cores of the computer system then execute multiple threads in parallel, with each thread compressing one block of the input data according to a dictionary-based sequential compression scheme.Type: GrantFiled: May 19, 2010Date of Patent: October 2, 2012Assignee: Red Hat, Inc.Inventor: Jind{hacek over (r)}ich NovĂ˝
-
Patent number: 8250465Abstract: An information processing apparatus comprises a readout unit adapted to read out, from a storage unit, correspondence information that includes a document structure of a structured document and a first code for encoding the document structure; a verification unit adapted to verify whether grammar of a portion included in a structured document for processing is valid, based on the document structure included in the correspondence information; and an encoding unit adapted to encode the structured document using the first code, in relation to a portion whose grammar is verified as being valid by the verification unit.Type: GrantFiled: February 5, 2008Date of Patent: August 21, 2012Assignee: Canon Kabushiki KaishaInventor: Hitoshi Uchida
-
Patent number: 8228213Abstract: A system to compress an inter-system channel data stream may include a data compression application executing via a computer processor. The system may additionally include a transmit dictionary used by said data compression application to compress an inter-system channel data stream. The system may also include a data decompression application executing via a second computer processor to decompress the inter-system channel data stream. The system may further include a receive dictionary used by said data decompression application to decompress the inter-system channel data stream.Type: GrantFiled: September 23, 2009Date of Patent: July 24, 2012Assignee: International Business Machines CorporationInventors: Casimer M. DeCusatis, Thomas A. Gregg
-
Publication number: 20120182164Abstract: An improved transmission protocol is used to transmit a signal between two components of an electronic device. The improved transmission protocol is configured to reduce the number of simultaneous channel transitions that occur when multiple signal channels are transmitted in parallel. Reducing the number of simultaneous channel transitions is beneficial because a signal that is subject to skew, distortion, or electromagnetic interference during transmission may have a shorter settling time when fewer channels undergo a transition simultaneously. When the protocol is used to transmit a signal from a controller to an optical pickup unit in an optical data storage system, the reduced settling times allow for a higher data transmission rate.Type: ApplicationFiled: January 13, 2012Publication date: July 19, 2012Inventors: Eric Li, Shang-Kuan Tang, Nedi Nadershahi
-
Patent number: 8217813Abstract: A compression technique includes storing respective fixed-size symbols for each of a plurality of words in a data block, e.g., a cache line, into a symbol portion of a compressed data block, e.g., a compressed cache line, where each of the symbols provides information about a corresponding one of the words in the data block. Up to a first plurality of data segments are stored in a data portion of the compressed data block, each data segment corresponds to a unique one of the symbols in the compressed data block and a unique one of the words in the cache line. Up to a second plurality of dictionary entries are stored in the data portion of the compressed cache line. The dictionary entries can correspond to multiple ones of the symbols.Type: GrantFiled: April 29, 2010Date of Patent: July 10, 2012Assignee: Advanced Micro Devices, Inc.Inventor: James Michael O'Connor
-
Patent number: 8217811Abstract: Methods and apparatus for iteratively encoding a portion of a signal are described in which the portion of the signal is quantised and an output bit count is estimated based on the sum of logarithms to base n of values of each sample in the plurality of quantised samples and the total number of samples. The output bit count corresponds to an estimate of the output bit count for the portion of the signal once encoded using a code, such as a Huffman code.Type: GrantFiled: September 9, 2008Date of Patent: July 10, 2012Assignee: Cambridge Silicon Radio LimitedInventors: David Hargreaves, Esfandiar Zavarehei
-
Patent number: 8212695Abstract: Generating and using a high-speed, scalable and easily updateable data structures are described. The proposed data structure provides minimal perfect hashing functionality while intrinsically supporting low-cost set-membership queries. In other words, in some embodiments, it provides at most one match candidate in a set of known arbitrary-length bit strings that is used to match the query.Type: GrantFiled: February 5, 2009Date of Patent: July 3, 2012Assignee: Polytechnic Institute of New York UniversityInventors: Sertac Artan, H. Jonathan Chao
-
Patent number: 8207876Abstract: A network optimization device may receive a stream of data and generate a signature for a plurality of fixed length overlapping windows of the stream of data. The device may select a predetermined number of the generated signatures for each Ln-byte segment of the data stream, wherein Ln is greater than a length of each of the windows. The network device may store the selected signatures in a bucketed hash table that includes a linked-list of entries for each bucket.Type: GrantFiled: May 5, 2011Date of Patent: June 26, 2012Assignee: Juniper Networks, Inc.Inventor: An-Cheng Huang
-
Patent number: 8203470Abstract: A digital decoding method and apparatus for receiving a compression coded digital signal in predetermined transmission units for decoding is disclosed. The decoding apparatus includes an initialization unit for initializing a probability of occurrence based on information multiplexed into data constituting the transmission unit, when decoding of the transmission unit is started, a binarization unit for generating a binarization rule determined based on a type of decoded data, a probability of occurrence generation unit for providing the probability of occurrence of symbol generated by the binarization rule, and a decoding unit for executing arithmetic decoding based on the probability of occurrence thus generated.Type: GrantFiled: January 5, 2011Date of Patent: June 19, 2012Assignee: Mitsubishi Denki Kabushiki KaishaInventors: Shunichi Sekiguchi, Yoshihisa Yamada, Kohtaro Asai
-
Patent number: 8188895Abstract: In a bit stream syntax containing compressed video slice data for compressed video data of a slice structure, a slice header for compressed video slice data has attached thereto a slice start code, a register reset flag indicating whether a register value, which designates a status of a codeword occurring in an arithmetic coding process, should be reset in the next transmission unit, an initial register value which indicates a register value to be used to start arithmetic coding/decoding to build/decompose the next transmission unit, only when the register reset flag indicates that the register should not be reset.Type: GrantFiled: January 10, 2011Date of Patent: May 29, 2012Assignee: Mitsubishi Denki Kabushiki KaishaInventors: Shunichi Sekiguchi, Yoshihisa Yamada, Kohtaro Asai
-
Patent number: 8184025Abstract: A method and apparatus for generating and transmitting codewords is provided. The method includes receiving information bits with a variable length, selecting vectors by the length of the information bits from a generator matrix, and generating a codeword based on the information bits and the generator matrix. Codewords with a certain length providing a coding performance with respect to received variable information bits can be obtained.Type: GrantFiled: May 8, 2009Date of Patent: May 22, 2012Assignee: LG Electronics Inc.Inventors: Young Seob Lee, Bin Chul Ihm, Jin Young Chun, Suk Woo Lee, Min Seok Oh