子分类：
- H03M7/001： .{以所用的元件为特征的}
- H03M7/02： .转换到加权代码或相反转换,即对一数字的加权与该数字在信息组或代码字中的位置有关{(布斯编码器入G06F7/52C2D1,G06F7/52C2D2A)}
- H03M7/14： .转换到非加权代码或相反转换
- H03M7/26： .转换到随机码或相反转换
- H03M7/28： .可编程序结构,即代码转换器所包括的设备其算符是可变的,以调整转换程序
- H03M7/30： .压缩(用于减少冗余的语言分析-合成入G10L19/00;用于图像通信的入H04N);扩展;消除不需要的数据,例如减少冗余{(用于数据获得的入G06F17/40;用于图像数据处理的入 G06T9/00;在数据记录中减少冗余的入G11B20/14;用于传输的入H04B1/66)}
| 序号 | 专利名 | 申请号 | 申请日 | 公开（公告）号 | 公开（公告）日 | 发明人 |
|---|---|---|---|---|---|---|
| 201 | Method and apparatus for high bandwidth dictionary compression technique using set update dictionary update policy | US13638132 | 2011-10-01 | US09514085B2 | 2016-12-06 | Ilan Pardo; Ido Y. Soffair; Dror Reif; Debendra Das Sharma; Akshay G. Pethe |
| Method, apparatus, and systems employing novel dictionary entry replacement schemes for 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. | ||||||
| 202 | SEMICONDUCTOR DEVICE | US15214979 | 2016-07-20 | US20160329348A1 | 2016-11-10 | Fujio MASUOKA; Masamichi ASANO |
| A semiconductor device includes a 2-input NOR decoder and an inverter that have six MOS transistors arranged in a line. The MOS transistors of the decoder are formed in a planar silicon layer disposed on a substrate and each have a structure in which a drain, a gate, and a source are arranged vertically and the gate surrounds a silicon pillar. The planar silicon layer includes a first active region having a first conductivity type and a second active region having a second conductivity type. The first and second active regions are connected to each other via a silicon layer on a surface of the planar silicon layer. | ||||||
| 203 | Method and system for transmitting data stream | US14500770 | 2014-09-29 | US09467985B2 | 2016-10-11 | Rongdao Yu |
| Disclosed are a method and a system for transmitting a data stream, aiming at increasing system capacity. The method includes: transmitting, by a first sending end, a coded first data stream to a first receiving end, and transmitting, by a second sending end, a coded second data stream to a second receiving end on time-frequency resources occupied by transmission of the first data stream by the first sending end; decoding, by the first receiving end, a first received signal received to obtain a first decoded result, and transmitting at least one decoded result in the first decoded result to the second receiving end; and decoding, by the second receiving end, a second received signal received, by using the at least one decoded result in the first decoded result to obtain a second decoded result. | ||||||
| 204 | DATA BEARING MEDIUM | US14916708 | 2013-09-06 | US20160217357A1 | 2016-07-28 | Robert Ulichney; Mathew D. Gaubatz; Steven J Simske |
| An example method for forming a data-bearing medium in accordance with aspects of the present disclosure includes setting variables associated with the data-bearing medium, the variables comprising a bit length of a payload, a row-to-row offset and an interleave period, identifying a standard form of the payload, the standard form being a circularly shifted version of the payload, generating a phase code based on the variables, and arranging rows of the data-bearing medium with the standard form of the payload and the phase code based on the interleave period. | ||||||
| 205 | Determination of encoding based on perceived code point classes | US14702897 | 2015-05-04 | US09390074B2 | 2016-07-12 | Benjamin D. Cox; Stewart O. M. Francis |
| A method, a computer program product, and a computer system for determination of encoding based on received code point classes are provided. The computer implemented method includes transferring data in a text form. The computer implemented method includes, in response to determining that decoding the data in text form passes, transferring some or all of the data in a binary form. The computer implemented method includes calculating code point class proportions for the data in the text form and the data in the binary form and determining a best form for transferring the data, based on comparison of the code point class proportions. | ||||||
| 206 | SEMICONDUCTOR DEVICE | US14844861 | 2015-09-03 | US20160182032A1 | 2016-06-23 | Akiko GOTO |
| First and second external terminals are connected to high-voltage and low-voltage terminals, respectively, of a direct-current voltage source circuit in which first and second direct-current voltage sources are connected in series. A third external terminal is connected to a connecting point between the first and second direct-current voltage sources. A first switching element is connected between the first and fourth external terminals. A second switching element is connected between the fourth and second external terminals. A first AC switch unit includes third and fourth switching elements connected in inverse series between the third and fourth external terminals. A second AC switch unit includes fifth and sixth switching elements connected in inverse series between the third and fourth external terminals The first and second AC switch units are connected in parallel. The first and second switching elements and the first and second AC switch units are incorporated in one module. | ||||||
| 207 | APPARATUS AND METHOD FOR IMPLEMENTING POWER SAVING TECHNIQUES WHEN PROCESSING FLOATING POINT VALUES | US14581600 | 2014-12-23 | US20160180489A1 | 2016-06-23 | Young Moon Kim; Sang Phill Park |
| An apparatus and method are described for reducing power when reading and writing graphics data. For example, one embodiment of an apparatus comprises: a graphics processor unit (GPU) to process graphics data including floating point data; a set of registers, at least one of the registers of the set partitioned to store the floating point data; and encode/decode logic to reduce a number of binary 1 values being read from the at least one register by causing a specified set of bit positions within the floating point data to be read out as 0s rather than 1s. | ||||||
| 208 | SORTING DECODER | US14823866 | 2015-08-11 | US20160036461A1 | 2016-02-04 | Harm Cronie; Brian Holden |
| A sorting decoder captures the rank-order of a set of input analogue signals in the digital domain using simple logic components such as self-timed first state elements, without requiring conventional analogue-to-digital signal converters. The analogue signals are each compared against a monotonic dynamic reference and the resulting comparisons are snapshot by a self-timed first state element for each input signal, or the last member of a sorted collection of input signals, at the time when it reaches the reference signal, so that a different snapshot representing the signal value ranking relative to the other signal values is produced for each input signal. The resulting rank-order estimation snapshots are binary signals that can then be further processed by a simple sorting logic circuit based on elementary logic components. | ||||||
| 209 | Generating an ICONV module in real time | US14082125 | 2013-11-16 | US09172395B2 | 2015-10-27 | Su Liu; Rong Qu; Teerasit Tinnakul |
| Provided are techniques for detecting a mapping, by a universal convertor, of a first character set to a second character set and of the second character set to a third character set; monitoring, logging, and analyzing code set conversion (CSC) operations; generating an updated character set conversion module from the first character set to the third character set in response to the detecting and a determination that the CSC operation exceed the predefined threshold; and storing the updated character set conversion module for utilization of subsequent processing of the first character set to the third character set. | ||||||
| 210 | Unicode character conversion using one of two conversion services | US13915233 | 2013-06-11 | US09048854B2 | 2015-06-02 | Michel Laviolette |
| Disclosed is a method to convert a Unicode character. The method includes intercepting a service call for a character conversion, determining if a character associated with the service call is a candidate for a first conversion service, if the character is a candidate for the first conversion service, converting the character using the first conversion service, if the character is not a candidate for the first conversion service, converting the character using a second conversion service, and returning the converted character. | ||||||
| 211 | Hierarchical entropy encoding and decoding | US14240066 | 2011-08-25 | US09035807B2 | 2015-05-19 | Wenfei Jiang; Kangying Cai; Ping Hu |
| A particular implementation receives geometry data of a 3D mesh, and represents the geometry data with an octree. The particular implementation partitions the octree into three parts, wherein the symbols corresponding to the middle part of the octree are hierarchical entropy encoded. To partition the octree into three parts, different thresholds are used. Depending on whether a symbol associated with a node is an S1 symbol, the child node of the node is included in the middle part or the upper part of the octree. In hierarchical entropy encoding, a non-S1 symbol is first encoded as a pre-determined symbol ‘X’ using symbol set S2={S1, ‘X’} and the non-S1 symbol itself is then encoded using symbol set S0 (S2⊂S0), and an S1 symbol is encoded using symbol set S2. Another implementation defines corresponding hierarchical entropy decoding. A further implementation reconstructs the octree and restores the geometry data of a 3D mesh from the octree representation. | ||||||
| 212 | SYSTEMS AND METHODS FOR LOSSLESS COMPRESSION OF DATA AND HIGH SPEED MANIPULATION THEREOF | US14568782 | 2014-12-12 | US20150101068A1 | 2015-04-09 | Richard A. Evans; Glen E. Graf; Joseph Lesko; John G. McDonald; Christina L. Richards |
| The present disclosure includes a system, method, and article of manufacture for lossless compression of data and high speed manipulation of the data. The method may comprise associating a customer with a plurality of levels, and counting, in near real time, a number of transactions at each level in the plurality of levels based on a transaction history of the customer at each of a plurality of merchants. The method may further comprise counting the number of transactions during a time period. Similarly, the method may comprise determining an opportunity comprising an offer based upon the counting, determining an opportunity based upon a count indicating a transaction by the customer with a merchant, and/or determining an opportunity with a first merchant based upon a count indicating a transaction by the customer with a second merchant. | ||||||
| 213 | Systems, methods, and media for managing RAM resources for in-memory NoSQL databases | US13853011 | 2013-03-28 | US08954478B2 | 2015-02-10 | Yiftach Shoolman; Ofer Bengal |
| In some embodiments, systems for managing an in-memory NoSQL database are provided, the systems comprising a hardware processor that is configured to: receive a dataset; split the dataset into a plurality of parts of the dataset; and storing each of the plurality of parts of the dataset in a separate one of plurality of 32-bit software architecture in-memory NoSQL databases. | ||||||
| 214 | PROTECTING STORAGE DATA DURING SYSTEM MIGRATION | US13956656 | 2013-08-01 | US20150039567A1 | 2015-02-05 | Su Liu; Shunguo Yan |
| Provided are techniques for determining whether a character code point value of a first plurality of character code point values corresponds to a second character code point value from a second plurality of character code point values, first value associated with a first encoding version and the second value associated with a second encoding. In response to the first value does not corresponding to any of the second character code point values, a determination is made as to whether the value corresponds to a third character code point value of a third plurality of code point values stored in a character value record table (CVRT). In response the value corresponding to the third value, an entry in the CVRT that associates the character with the third value is made; and the character is stored in conjunction with an application associated with the second encoding using the third value. | ||||||
| 215 | Method and apparatus for parallel XML processing | US13760453 | 2013-02-06 | US08949112B2 | 2015-02-03 | Robert D. Cameron |
| One embodiment of the present invention is an XML application module that processes an XML character stream, which module includes an XML interface module, a parallel bit stream module, a lexical item stream module, a parser and a parsed data receiver. The XML interface module applies the XML character stream as input to the parallel bit stream module and the parser; the parallel bit stream module forms parallel bit streams and applies them as input to the lexical item stream module; the lexical stream module forms lexical item streams and applies them as input to the parser; the parser forms a stream of parsed XML data and applies it as input to the parsed data receiver; and the parsed data receiver processes the stream of parsed XML data. The parsed data receiver may be, for example, a communication module of a portable communication device. | ||||||
| 216 | METHOD AND SYSTEM FOR TRANSMITTING DATA STREAM | US14500770 | 2014-09-29 | US20150016343A1 | 2015-01-15 | Rongdao YU |
| Disclosed are a method and a system for transmitting a data stream, aiming at increasing system capacity. The method includes: transmitting, by a first sending end, a coded first data stream to a first receiving end, and transmitting, by a second sending end, a coded second data stream to a second receiving end on time-frequency resources occupied by transmission of the first data stream by the first sending end; decoding, by the first receiving end, a first received signal received to obtain a first decoded result, and transmitting at least one decoded result in the first decoded result to the second receiving end; and decoding, by the second receiving end, a second received signal received, by using the at least one decoded result in the first decoded result to obtain a second decoded result. | ||||||
| 217 | SYSTEMS AND METHODS FOR ORDERING CODEWORDS BASED ON POSTERIOR INFORMATION IN SUCCESSIVE INTERFERENCE CANCELLATION (SIC) RECEIVERS | US14263753 | 2014-04-28 | US20140327559A1 | 2014-11-06 | Mingguang Xu; Yakun Sun; Hui-Ling Lou |
| Systems and methods are provided for determining a decoding order in a successive interference cancellation receiver. The method includes receiving, using control circuitry, a plurality of codewords. The method further includes computing at least one ordering metric for at least one of the plurality of codewords based on posterior information associated with the plurality of codewords, and determining the decoding order based on the at least one ordering metric. | ||||||
| 218 | Delay-optimized overlap transform, coding/decoding weighting windows | US14128718 | 2012-06-26 | US08847795B2 | 2014-09-30 | Julien Faure; Pierrick Philippe |
| Coding/decoding of a digital signal, consisting of successive blocks of samples, the coding being of the transform with overlap type and comprising, upon analysis, the application of a weighting window to two blocks of M successive samples. In particular, this weighting window is asymmetric and comprises four distinct portions extending successively over the two aforesaid blocks, with: a first portion, increasing over a first interval of samples, a second portion, constant at a value of 1 over a second interval, a third portion, decreasing over a third interval, and a fourth portion, constant at a value of 0 over a fourth interval. | ||||||
| 219 | Method and system for data compression at a storage system | US14098213 | 2013-12-05 | US08836548B1 | 2014-09-16 | Surendar Chandra |
| A computer-implemented method for compressing data is disclosed. The method starts with determining a way to read a received data block in its native endian format of at a storage system, where the data block contains a set of data and the determination is based on sampling a subset from a set of data and checking variation of the values. The method selects a base value for the data block based on the determined way to read the data block and generates a set of updated data, where each value of the set of updated data corresponds to the base value and an original value. The method separates each data within the set of updated data into two portions with different bit-value distribution patterns and compresses one portion with a first algorithm while compresses another portion with a second algorithm different from the first. | ||||||
| 220 | Encoder, decoder and method | US13782819 | 2013-03-01 | US08810439B1 | 2014-08-19 | Ossi Mikael Kalevo |
| There is provided an encoder and decoder for encoding and decoding input data (D1, D2 or D3) to generate corresponding encoded output data (D2 or D3, D5). The encoder includes a data processing arrangement, optionally for analyzing a range of values present in the input data (D1) to determine at least one pre- and/or post-pedestal value, optionally to translate the input data (D1) using the at least one pre- and/or post-pedestal value to generate translated data, and then to apply a form of ODelta coding to the data, optionally translated data, to generate processed data, and to combine the processed data and optionally the at least one pre- and/or post-pedestal value for generating the encoded output data (D2 or D3). The decoder includes a data processing arrangement for processing the encoded data (D2 or D3), optionally to extract therefrom at least one pre- and/or post-pedestal value. | ||||||
QQ群二维码
意见反馈
意见反馈