- 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)}
| 序号 | 专利名 | 申请号 | 申请日 | 公开（公告）号 | 公开（公告）日 | 发明人 |
|---|---|---|---|---|---|---|
| 121 | 프로토콜 변환장치 및 그 방법 | KR1019860007679 | 1986-09-12 | KR1019950002678B1 | 1995-03-24 | 마에다사또루; 다오아끼히꼬 |
| 내용 없음. | ||||||
| 122 | REDUCED MEMORY ITERATIVE DEMODULATION AND DECODING | EP15179282.7 | 2015-07-31 | EP2985916B1 | 2018-12-12 | Engin, Nur |
| A receiver performing iterative demodulation and decoding, including: a posteriori probability demodulator configured to receive an input digital signal and output demodulated data; a deinterleaver configured to deinterleave the demodulated data; a forward error correction (FEC) decoder configured to error correct the demodulated data; a FEC encoder configured to encode the error corrected demodulated data; an interleaver configured to interleave the FEC encoded data and output the interleaved FEC encoded data to the posteriori probability demodulator; and a symbol compressor/decompressor configured to compress symbol data from the a posteriori demodulator and store the compressed data in a symbol memory and configured to decompress compressed symbol data stored in the symbol memory. | ||||||
| 123 | ENTROPY ENCODING AND DECODING SCHEME | EP18160276.4 | 2012-01-12 | EP3349360A1 | 2018-07-18 | MARPE, Detlev; NGUYEN, Tung; SCHWARZ, Heiko; WIEGAND, Thomas |
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 VCL 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, in accordance with embodiments, 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 (1401-3) 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.
|
||||||
| 124 | TRAITEMENT À LA VOLÉE DE DONNÉES DANS UN SYSTÈME D'ACQUISITION | EP18150450.7 | 2018-01-05 | EP3346389A1 | 2018-07-11 | GUICQUERO, William; VERDANT, Arnaud |
L'invention concerne un système électronique comportant : |
||||||
| 125 | Entropy encoding scheme | EP14160512 | 2012-01-12 | EP2760138B1 | 2018-03-07 | MARPE DETLEV; NGUYEN TUNG; SCHWARZ HEIKO; WIEGAND THOMAS |
| 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 VCL 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, in accordance with embodiments, syntax elements are decomposed into a respective number n of source symbols s i with i=1...n, the respective number n of source symbols depending on as to which of a sequence of n partitions (140 1-3 ) 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 s i yields z, and, if n>1; for all i=1...n-1, the value of s i corresponds to a range of the i th partition. | ||||||
| 126 | COMPRESSION AND DE-COMPRESSION OF COMPLEX VALUED OFDM DATA FOR A RADIO BASE STATION | EP13871325 | 2013-01-16 | EP2946538A4 | 2017-01-04 | XIA BIN; WEI MIN |
| A compression method is disclosed, which comprises receiving an OFDM data block comprising a plurality of complex valued data samples wherein each in-phase and quadrature sample value is represented by a first number of bits. The method also comprises calculating an average of absolute sample values of the OFDM data block and mapping the average absolute sample value to a standard deviation value. The method further comprises quantizing each of the sample values using quantization thresholds scaled by the standard deviation value to produce quantized in phase and quadrature sample value representations, each comprising a second number of bits, and mapping the standard deviation value and the quantized sample value representations to an OFDM transmission frame. Corresponding de-compression method, compressor, de-compressor and network node are also disclosed. | ||||||
| 127 | Entropy encoding and decoding scheme | EP14160496.7 | 2012-01-12 | EP2768144B1 | 2016-03-23 | Marpe, Detlev; Nguyen, Tung; Schwarz, Heiko; Wiegand, Thomas |
| 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 VCL 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, in accordance with embodiments, syntax elements are decomposed into a respective number n of source symbols s i with i=1...n, the respective number n of source symbols depending on as to which of a sequence of n partitions (140 1-3 ) 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 s i yields z, and, if n>1; for all i=1...n-1, the value of s i corresponds to a range of the i th partition. | ||||||
| 128 | REDUCED MEMORY ITERATIVE DEMODULATION AND DECODING | EP15179282.7 | 2015-07-31 | EP2985916A1 | 2016-02-17 | Engin, Nur |
A receiver performing iterative demodulation and decoding, including: a posteriori probability demodulator configured to receive an input digital signal and output demodulated data; a deinterleaver configured to deinterleave the demodulated data; a forward error correction (FEC) decoder configured to error correct the demodulated data; a FEC encoder configured to encode the error corrected demodulated data; an interleaver configured to interleave the FEC encoded data and output the interleaved FEC encoded data to the posteriori probability demodulator; and a symbol compressor/decompressor configured to compress symbol data from the a posteriori demodulator and store the compressed data in a symbol memory and configured to decompress compressed symbol data stored in the symbol memory.
|
||||||
| 129 | COMPRESSION AND DE-COMPRESSION OF COMPLEX VALUED OFDM DATA FOR A RADIO BASE STATION | EP13871325.0 | 2013-01-16 | EP2946538A1 | 2015-11-25 | XIA, Bin; WEI, Min |
| A compression method is disclosed, which comprises receiving an OFDM data block comprising a plurality of complex valued data samples wherein each in-phase and quadrature sample value is represented by a first number of bits. The method also comprises calculating an average of absolute sample values of the OFDM data block and mapping the average absolute sample value to a standard deviation value. The method further comprises quantizing each of the sample values using quantization thresholds scaled by the standard deviation value to produce quantized in- phase and quadrature sample value representations, each comprising a second number of bits, and mapping the standard deviation value and the quantized sample value representations to an OFDM transmission frame. Corresponding de-compression method, compressor, de-compressor and network node are also disclosed. | ||||||
| 130 | ENCODING METHOD, DECODING METHOD, ENCODING DEVICE, DECODING DEVICE, PROGRAM, AND RECORDING MEDIUM | EP11803546.8 | 2011-07-04 | EP2573766B1 | 2015-03-18 | FUKUI, Masahiro; SASAKI, Shigeaki; HIWASAKI, Yusuke; KOYAMA, Shoichi; TSUTSUMI, Kimitaka |
| A plurality of samples are vector-quantized to obtain a vector quantization index and quantized values; bits are assigned in a predetermined order of priority based on auditory perceptual characteristics to one or more sets of sample positions among a plurality of sets of sample positions, each set having a plurality of sample positions and being given an order of priority based on the auditory perceptual characteristics, the number of bits not being larger than the number of bits obtained by subtracting the number of bits used for a code corresponding to the vector quantization index from the number of bits assigned for the code corresponding to the vector quantization index; and index information indicating a group of coefficients that minimizes the sum of the error between the value of each sample included in each of the sets of sample positions to which the bits are assigned and the value obtained by multiplying the quantized value of each sample included in the set of sample positions by a coefficient corresponding to the position of the sample, of all the sample positions included in the set of sample positions, is output. | ||||||
| 131 | Entropy encoding and decoding scheme | EP14160496.7 | 2012-01-12 | EP2768144A3 | 2014-10-08 | Marpe, Detlev; Nguyen, Tung; Schwarz, Heiko; Wiegand, Thomas |
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 VCL 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, in accordance with embodiments, 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 (1401-3) 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. |
||||||
| 132 | Entropy encoding and decoding scheme | EP14160511.3 | 2012-01-12 | EP2768145A2 | 2014-08-20 | Marpe, Detlev; Nguyen, Tung; Schwarz, Heiko; Wiegand, Thomas |
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 VCL 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, in accordance with embodiments, 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 (1401-3) 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. |
||||||
| 133 | Entropy encoding and decoding scheme | EP14160496.7 | 2012-01-12 | EP2768144A2 | 2014-08-20 | Marpe, Detlev; Nguyen, Tung; Schwarz, Heiko; Wiegand, Thomas |
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 VCL 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, in accordance with embodiments, 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 (1401-3) 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. |
||||||
| 134 | HIERARCHICAL ENTROPY ENCODING AND DECODING | EP11871284.3 | 2011-08-25 | EP2749023A1 | 2014-07-02 | JIANG, Wenfei; CAI, Kangying; HU, Ping |
| 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 5 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 ⊂10 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. | ||||||
| 135 | ESTIMATOR FOR ESTIMATING A PROBABILITY DISTRIBUTION OF A QUANTIZATION INDEX | EP11871287.6 | 2011-08-23 | EP2734942A1 | 2014-05-28 | KLEJSA, Janusz; LI, Minyue; KLEIJN, Willem Bastiaan |
| Estimator for estimating a probability distribution of a quantization index The invention relates to an estimator (1007) for estimating a probability distribution of a quantization index generated from a source coder encoding a source signal, into a sequence of quantization indices, the source signal being described by a signal model, the source coder providing a current quantization index and current side information, the estimator being configured to obtain auxiliary parameters based on a configuration of the source coder and the current available side information and the signal model, the estimator being further configured to adaptively update the probability distribution of a quantization index upon the basis of a probability density function relating to a previous state of the estimator, the auxiliary parameters, the current quantization index and the current side information. | ||||||
| 136 | FENÊTRES DE PONDÉRATION EN CODAGE/DÉCODAGE PAR TRANSFORMÉE AVEC RECOUVREMENT, OPTIMISÉES EN RETARD | EP12734996.7 | 2012-06-26 | EP2727107A1 | 2014-05-07 | FAURE, Julien; PHILIPPE, Pierrick |
| The invention relates to the 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 (wl), increasing over a first interval of samples, a second portion (w2), constant at a value of 1 over a second interval, a third portion (w3), decreasing over a third interval, and a fourth portion (w4), constant at a value of 0 over a fourth interval. | ||||||
| 137 | ENTROPY ENCODING AND DECODING SCHEME | EP12700329.1 | 2012-01-12 | EP2664070A2 | 2013-11-20 | MARPE, Detlev; NGUYEN, Tung; SCHWARZ, Heiko; WIEGAND, Thomas |
| 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 VCL 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, in accordance with embodiments, syntax elements are decomposed into a respective number n of source symbols s i with i=1...n, the respective number n of source symbols depending on as to which of a sequence of n partitions (140 1-3 ) 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 s i yields z, and, if n>1; for all i=1...n-1, the value of s i corresponds to a range of the i th partition. | ||||||
| 138 | Data decoding method and apparatus | EP13160354.0 | 2013-03-21 | EP2642678A1 | 2013-09-25 | Zhang, Yafan; Zhang, Jiaji |
Embodiments of the present invention disclose a data decoding method and apparatus, relate to the field of wireless communications, and can improve a resource utilization rate in a decoding process, thereby improving decoding efficiency. The method of the present invention includes: dividing a to-be-decoded data transport block into N code blocks, where N is an integer greater than or equal to 2; and decoding the N code blocks in parallel according to a reverse direction of encoding. The present invention is applicable to data decoding.
|
||||||
| 139 | EFFICIENT CODING OF SIDE INFORMATION IN A LOSSLESS ENCODER | EP99965560.8 | 1999-12-24 | EP1062732B1 | 2012-05-02 | BRUEKERS, Alphons, A., M., L.; RIJNBERG, Adriaan, J. |
| For 'Super Audio CD' (SACD) the DSD signals are losslessly coded, using framing, prediction and entropy coding. Besides the efficiently encoded signals, a large number of parameters, i.e. the side-information, has to be stored on the SACD too. The side information comprises the prediction filter coefficients and the probability table which have been used for encoding, and which should be transmitted to the decoder. The smaller the storage capacity that is required for the side-information, the better the overall coding gain is. Therefore coding techniques are applied to the side-information too so as to compress the amount of data of the side information. The frames can be segmented, each segment having its own set of filter coefficients and probability table. | ||||||
| 140 | Method and system for efficient information exchange | EP01310305.6 | 2001-12-10 | EP1239594B1 | 2012-03-28 | Matsuzaki, Yasurou, c/o Fujitsu Limited; Taguchi, Masao, c/o Fujitsu Limited |
