| 序号 | 专利名 | 申请号 | 申请日 | 公开（公告）号 | 公开（公告）日 | 发明人 |
|---|---|---|---|---|---|---|
| 81 | PROCEDE DE SYNCHRO-TRAME A BASE DE LOGARITHME DISCRET | EP08856271.5 | 2008-12-03 | EP2220799A2 | 2010-08-25 | GARRIDO, Eric; FUMAROLI, Guillaume; BERTINCHAMPS, Xavier |
| Method for transmitting data having a first format or format 1 in a datastream complying with a second format, the second format or format 2 consisting of a stream of data symbols incorporating in a regular manner a symbol dedicated to synchronization and placed every r data symbols, the symbol dedicated to synchronization being the current term of a series S(t) satisfying a linear recurrence, the data being split in format 1 into data blocks of fixed size including kr symbols, the data symbols being considered to be elements of a finite field GF(q) where q is the number of elements of the field, the series S(t) satisfies a linear recurrence over GF(q) and admits as characteristic polynomial a primitive polynomial P of degree n over GF(q), and is periodic with a period T=q n-1, α being a root of P in the field GF(q n). | ||||||
| 82 | DATA TRANSLATION SYSTEM AND METHOD | EP07795906.2 | 2007-06-07 | EP2036205A2 | 2009-03-18 | CHEUNG, Frank, N. |
| A data translation system and method. This invention provides a reverse approach to implement a M bit input to N bit output cumulative/monotonic transfer function (where M>N) by a (2**N) x M bit memory instead of the conventional (2**M) x N bit memory. The invention offers substantial circuit size savings without compromising on transfer function resolution and is independent of transfer function mapping algorithms. The M bit memory content of the reverse LUT contains input video group information for each output level and the (2**N) addresses of the reverse LUT represent the corresponding transfer function output levels. This data to address representation of the input to output relationship is exactly opposite to the conventional address to data format. Search and compare methods are employed to locate the input video group that the incoming video belongs to and the associated address of the reverse LUT represents the output. | ||||||
| 83 | MULTIPLEXING AN ADDITIONAL BIT STREAM WITH A PRIMARY BIT STREAM WITH CONVERSION BETWEEN qB/rB AND xB/yB ENCODED BIT STREAMS | EP04756743.3 | 2004-07-07 | EP1661252A1 | 2006-05-31 | KUO, Jerchen; PESAVENTO, Gerry |
| Managing a primary bit stream involves converting a qB/rB encoded bit stream to an xB/yB encoded bit stream and multiplexing an additional bit stream with the xB/yB encoded bit stream at a transmission side of a link. The additional bit stream is then demultiplexed from the xB/yB encoded bit stream and the xB/yB encoded bit stream is converted back to the qB/rB encoded bit stream at the receiver side of the link. The qB/rB encoded bit stream is converted to and from the xB/yB encoded bit stream so that the additional bit stream can be multiplexed with the qB/rB encoded bit stream using multiplexing/demultiplexing systems that are compatible with the xB/yB multiplexing system. In an application, a 4B/5B encoded bit stream is converted to an 8B/10B encoded bit stream and an additional bit stream is multiplexed with the IOB code-words of the 8B/10B encoded bit stream using code-word manipulation. | ||||||
| 84 | Apparatus for transmitting and reproducing a digital audio signal | EP99308718.8 | 1999-11-03 | EP0999646B1 | 2005-03-02 | Sekii, Yasuaki, Sony Corporation |
| 85 | VECTOR ENCODING METHOD AND ENCODER/DECODER USING THE METHOD | EP95932940.0 | 1995-09-29 | EP0786762B1 | 2002-06-12 | KATAOKA, Akitoshi; IKEDO, Jotaro |
| Representative vectors z1i and z2j are selected from codebooks CB1 and CB1, respetively, and multiplied by weighting coefficient vectors w1 and w2 of the same number of dimensions as those of the representative vectors by multipliers 21 and 22, whereby weighted representative vectors z1iw1 and z2jw2 are generated. These weighted representative vectors are vector combined by a combining part 3 into a combined vector yij, and a combination of the representative vectors is seleced by a control part in such a manner as to minimize the distance between the combined vector yij and an input vector X. The weighting coefficient vectors w1 and w2 each have a maximum component in a different dimension and are selected so that the sum of diagonal matrixes W1 and W2 using components of the weighting coefficient vectors as their diagonal elements becomes a constant multiple of the unit matrix. |
||||||
| 86 | Procédé de codage binaire à taux de basculement des éléments binaires sensiblement uniforme, et procédés d'incrémentation et de décrémentation correspondants | EP91460045.7 | 1991-10-30 | EP0484259B1 | 2001-06-06 | Burger, Jacques; Girault, Marc |
| 87 | VECTOR ENCODING METHOD AND ENCODER/DECODER USING THE METHOD | EP95932940 | 1995-09-29 | EP0786762A4 | 1999-03-03 | KATAOKA AKITOSHI; IKEDO JOTARO |
| Representative vectors z1i and z2j are selected from codebooks CB1 and CB1, respetively, and multiplied by weighting coefficient vectors w1 and w2 of the same number of dimensions as those of the representative vectors by multipliers 21 and 22, whereby weighted representative vectors z1iw1 and z2jw2 are generated. These weighted representative vectors are vector combined by a combining part 3 into a combined vector yij, and a combination of the representative vectors is seleced by a control part in such a manner as to minimize the distance between the combined vector yij and an input vector X. The weighting coefficient vectors w1 and w2 each have a maximum component in a different dimension and are selected so that the sum of diagonal matrixes W1 and W2 using components of the weighting coefficient vectors as their diagonal elements becomes a constant multiple of the unit matrix. |
||||||
| 88 | Selection device for selecting electric cells and apparatus using the same | EP95306951.5 | 1995-09-29 | EP0704978A1 | 1996-04-03 | Yasuda, Akira, c/o Intellectual Property Div. |
A selection device comprises an integrator (14₁, 14₂) that integrates data representing a state in which each of current cells (22₁ to 22n) having relative error between them is used during a predetermined period, and a selector (13) that, on the basis of the integration result of the integrator, selects a control object with a smaller number of uses according to an input signal. |
||||||
| 89 | Binary converter | EP94303701.0 | 1994-05-24 | EP0643489A1 | 1995-03-15 | Taddiken, Albert H. |
Multiple resonant tunneling devices offer significant advantages for realizing circuits which efficiently convert values represented by multivalued number systems to conventional binary representation. In one form of the invention, a number represented by a range-4 base-2 word is converted into a conventional binary word (range-2 base-2) having the same value. The conversion is accomplished by a series of decomposition stages 53, each decomposition stage 53 producing an interim range-4 base-2 word and a binary digit, which becomes one of the digits of the binary output word. Preferably, the decomposition at each stage is accomplished by a set of range-4 base-2 to binary converters 50, each of which operates on a single digit of the interim word. Preferably, summation circuits 52 sum outputs of adjoining range-4 base-2 converters 50 to form the new interim word. The least significant digit of the output of the decomposition stage becomes a digit of the output binary word. Preferably, the range-4 base-2 to binary converters 50 are multi-level folding circuits 54 connected by a voltage divider. Preferably, the multi-level folding circuits contain multiple-peak resonant tunneling transistors 56 (e.g. an FET 58 and a multiple-peak resonant tunneling diode 60) which exhibit multiple negative differential transconductance. The novel circuits presented allow the results of multivalued logic operations to be translated to binary representation at very high speed. Additionally, because they make use of resonant tunneling devices, the novel converter circuits described herein may be fabricated with very few components. |
||||||
| 90 | MODULATION CODING AND DECODING | EP08846601.6 | 2008-10-23 | EP2212999B1 | 2017-11-22 | MITTELHOLZER, Thomas |
| 91 | ENCODING AND DECODING OF INFORMATION | EP10737051.2 | 2010-07-27 | EP2460276A2 | 2012-06-06 | MARKRAM, Henry |
| Method and system for weighting the amplitude of an event in a time -based code. The time-based code is divided into time intervals. Each of the time intervals of the time-based code corresponds to a digit in the received signal. Each digit of a first state of the received signal is expressed as a event occurring at a first time within the corresponding time interval of the time -based code. Each digit of a second state of the received signal is expressed as a event occurring at a second time within the corresponding time intervals of the time -based code, the first time is distinguishable from the second time. All of the states of the digits in the received signal are represented by events in the time-based code. The weighting is performed as a function of the timing of other events in the time-based code signal. | ||||||
| 92 | MODULATION CODING AND DECODING | EP08846601.6 | 2008-10-23 | EP2212999A2 | 2010-08-04 | MITTELHOLZER, Thomas |
| Methods and apparatus are provided for modulation coding a stream of binary input data. A 4-ary enumerative encoding algorithm is applied to the input bit-stream to produce a succession of 4-ary output symbols. The 4-ary algorithm is operative to simultaneously encode respective generalized Fibonacci codes in the odd and even interleaves of the input bit-stream. The bits of each successive 4-ary output symbol are then interleaved, producing an output bit-stream which has global and interleaved run-length constraints. Inverting the bits of the 4-ary output symbols produces an output bit-stream with (G, I) -constraints as in the PRML (G, I) codes used in reverse-concatenation modulation systems. Corresponding decoding systems are also provided. | ||||||
| 93 | MULTIPLEXING AN ADDITIONAL BIT STREAM WITH A PRIMARY BIT STREAM WITH CONVERSION BETWEEN qB/rB AND xB/yB ENCODED BIT STREAMS | EP04756743 | 2004-07-07 | EP1661252A4 | 2006-10-04 | KUO JERCHEN; PESAVENTO GERRY |
| Managing a primary bit stream involves converting a qB/rB encoded bit stream to an xB/yB encoded bit stream and multiplexing an additional bit stream with the xB/yB encoded bit stream at a transmission side of a link. The additional bit stream is then demultiplexed from the xB/yB encoded bit stream and the xB/yB encoded bit stream is converted back to the qB/rB encoded bit stream at the receiver side of the link. The qB/rB encoded bit stream is converted to and from the xB/yB encoded bit stream so that the additional bit stream can be multiplexed with the qB/rB encoded bit stream using multiplexing/demultiplexing systems that are compatible with the xB/yB multiplexing system. In an application, a 4B/5B encoded bit stream is converted to an 8B/10B encoded bit stream and an additional bit stream is multiplexed with the IOB code-words of the 8B/10B encoded bit stream using code-word manipulation. | ||||||
| 94 | Selection device for selecting electric cells and apparatus using the same | EP95306951.5 | 1995-09-29 | EP0704978B1 | 2003-06-18 | Yasuda, Akira, c/o Intellectual Property Div. |
| 95 | Apparatus for transmitting and reproducing a digital audio signal | EP99308718.8 | 1999-11-03 | EP0999646A3 | 2003-01-08 | Sekii, Yasuaki, Sony Corporation |
A transmitting apparatus and a reproducing apparatus comprising a converter for converting an input one-bit digital signal into a multi-bit signal while effecting down-sampling of a sampling frequency. A one-bit digital signal that could develop an overflow (clip) depending on its modulation degree is attenuated at a stage upstream of the input of the converter, and is amplified at a stage downstream of the converter to avert a clipped state between the stages. |
||||||
| 96 | Relative logarithmic time stamps for reduced memory map size | EP98105904.1 | 1998-03-31 | EP0910025A3 | 2002-07-10 | Rust, Robert A. |
A system and method for managing a time stamp wherein a table of time stamps is maintained. Each time stamp corresponds to the age of a block of data. The age of the data is determined from the value of the time stamp in the table. When a block of data is written, the time stamp corresponding to the data is individually reset by writing a zero to the stamped value. Each stamp is aged by updating the time stamps at predetermined time intervals. Aging a time stamp includes reading (20) the time stamp, determining (40) whether to advance the time stamp, and advancing (50) the time stamp. A random number is generated (10) for each time stamp. The random number is compared (30) to an increment threshold value. If the random number matches the increment threshold value, the time stamp is incremented (50). |
||||||
| 97 | Relative logarithmic time stamps for reduced memory map size | EP98105904.1 | 1998-03-31 | EP0910025A2 | 1999-04-21 | Rust, Robert A. |
A system and method for managing a time stamp wherein a table of time stamps is maintained. Each time stamp corresponds to the age of a block of data. The age of the data is determined from the value of the time stamp in the table. When a block of data is written, the time stamp corresponding to the data is individually reset by writing a zero to the stamped value. Each stamp is aged by updating the time stamps at predetermined time intervals. Aging a time stamp includes reading (20) the time stamp, determining (40) whether to advance the time stamp, and advancing (50) the time stamp. A random number is generated (10) for each time stamp. The random number is compared (30) to an increment threshold value. If the random number matches the increment threshold value, the time stamp is incremented (50). |
||||||
| 98 | VECTOR ENCODING METHOD AND ENCODER/DECODER USING THE METHOD | EP95932940.0 | 1995-09-29 | EP0786762A1 | 1997-07-30 | KATAOKA, Akitoshi; IKEDO, Jotaro |
Representative vectors z1i and z2j are selected from codebooks CB1 and CB1, respetively, and multiplied by weighting coefficient vectors w1 and w2 of the same number of dimensions as those of the representative vectors by multipliers 21 and 22, whereby weighted representative vectors z1iw1 and z2jw2 are generated. These weighted representative vectors are vector combined by a combining part 3 into a combined vector yij, and a combination of the representative vectors is seleced by a control part in such a manner as to minimize the distance between the combined vector yij and an input vector X. The weighting coefficient vectors w1 and w2 each have a maximum component in a different dimension and are selected so that the sum of diagonal matrixes W1 and W2 using components of the weighting coefficient vectors as their diagonal elements becomes a constant multiple of the unit matrix. |
||||||
| 99 | Hybrid approach to collating unicode text strings consisting primarily of ASCII characters | US15885646 | 2018-01-31 | US10089282B1 | 2018-10-02 | Thomas Neumann; Viktor Leis; Alfons Kemper |
| Collating text strings having Unicode encoding includes receiving two text strings S=s1s2 . . . sn and T=t1t2 . . . tm. When the two text strings are not identical, there is a smallest positive integer p for which the two text strings differ. The process looks up the characters sp and tp in a predefined lookup table. If either of these characters is missing from the lookup table, the collation of the text strings is determined using the standard Unicode comparison of the text strings spsp+1 . . . sn and tptp+1 . . . tm. Otherwise, the lookup table assigns weights vp and wp for the characters sp and tp. When vp≠wp, these weights define the collation order of the strings S and T. When vp=wp, the collation of S and T is determined recursively using the suffix strings sp+1 . . . sn and tp+1 . . . tm. | ||||||
| 100 | Hamming distance based binary representations of numbers | US15614914 | 2017-06-06 | US09912352B1 | 2018-03-06 | Minghai Qin; Chao Sun; Dejan Vucinic |
| Technology is described herein for encoding and decoding numbers. In one aspect, floating point numbers are represented as binary strings. The binary strings may be encoded in a manner such that if one bit flips, the average and maximum distortion in the number that is represented by the binary string is relatively small. In one aspect, 2^n binary strings are ordered across an interval [a, b) in accordance with their Hamming weights. Numbers in the interval may be uniformly quantized into one of 2^n sub-intervals. For example, floating point numbers in the interval [a, b) may be uniformly quantized into 2^n sub-intervals. These 2^n sub-intervals may be mapped to the 2^n binary strings. Thus, the number may be assigned to one of the 2^n binary strings. Doing so may reduce the distortion in the number in the event that there is a bit flip in the assigned binary string. | ||||||
