| 序号 | 专利名 | 申请号 | 申请日 | 公开（公告）号 | 公开（公告）日 | 发明人 |
|---|---|---|---|---|---|---|
| 1 | 用于基于相量差异对数据进行编码的设备和方法 | CN201180074581.8 | 2011-10-01 | CN103907295A | 2014-07-02 | D.克斯林; M.C.法尔科纳; K.P.斯拉特里; H.G.斯金纳 |
| 用于管理信息的方法包括：接收数据的位，在传输频谱的仅一个频率处确定用于位的相量，组合位的所述相量，其形成具有落在预定的范围内的谱能量的相量，以及从所述组合的相量的所述位形成码字。 | ||||||
| 2 | 编码和解码信息 | CN201080042987.3 | 2010-07-27 | CN102648582A | 2012-08-22 | H·马克拉姆 |
| 用于对时基码中的事件的幅度进行加权的方法和系统。所述时基码被分割成时间间隔。所述时基码的每个时间间隔对应于已接收信号中的一个数字。所述已接收信号的第一状态的每个数字被表达成在所述时基码的对应时间间隔内的第一时刻发生的事件。所述已接收信号的第二状态的每个数字被表达成在所述时基码的对应时间间隔内的第二时刻发生的事件，所述第一时刻与所述第二时刻是可区分的。所述已接收信号中的数字的所有状态都由所述时基码中的事件来表示。所述加权被执行为所述时基码信号中其他事件的时序的函数。 | ||||||
| 3 | 选择装置 | CN95109555.2 | 1995-10-04 | CN1126396A | 1996-07-10 | 安田彰 |
| 一种选择装置，它包括：对相互具有误差的电流元的各自使用次数进行积分的积分器；根据该积分器的积分结果并对应输入信号选择次数少的控制对象的选择器。具有降低工作速度、减少误差，尤其能减少预定频率的误差的优点。 | ||||||
| 4 | 编码和解码信息 | CN201080042987.3 | 2010-07-27 | CN102648582B | 2015-05-27 | H·马克拉姆 |
| 用于对时基码中的事件的幅度进行加权的方法和系统。所述时基码被分割成时间间隔。所述时基码的每个时间间隔对应于已接收信号中的一个数字。所述已接收信号的第一状态的每个数字被表达成在所述时基码的对应时间间隔内的第一时刻发生的事件。所述已接收信号的第二状态的每个数字被表达成在所述时基码的对应时间间隔内的第二时刻发生的事件，所述第一时刻与所述第二时刻是可区分的。所述已接收信号中的数字的所有状态都由所述时基码中的事件来表示。所述加权被执行为所述时基码信号中其他事件的时序的函数。 | ||||||
| 5 | 用于编码低电压摆动信号的方法和设备 | CN200480021104.5 | 2004-07-12 | CN1826731A | 2006-08-30 | R·克里什南; J·D·J·皮内达德吉维斯 |
| 一种编码的低摆动方案，用于在互连总线上发送信号，通过该方案将在总线上待发送的当前值与总线的先前状态相比较。当比特倒转的数量大于N/2时，其中N是总线的宽度，作出发送反转的信号值的决定。另外，“反转”信号还被发送到接收器，以指明总线值是否被反转。这些编码的值接着被转换成其低摆动等效值，并发送这些编码的值。以这种方式，能够确保互连上所消耗能量为最小。该策略不仅降低在互连上转变概率而且还只发送低摆动值，以便实现与常规技术相比极大程度的能量减少。 | ||||||
| 6 | 副比特流与主比特流的复用 | CN03804781.0 | 2003-02-27 | CN1639982A | 2005-07-13 | 耶尔琴·郭; 格里·佩萨文托 |
| 复用副比特流与主比特流，其中主比特流被编码成xB/yB编码比特流，包括选择yB码字来表达副比特流，每个xB字由一组相应的yB码字的其中一个yB码字表示，每组yB码字包括至少一个码字类型属于倾向于表现正DC均衡的yB码字和至少一个类型属于倾向于表现负DC均衡的yB码字，通过从其中一类选择码字来表达1和从另一类选择码字来表达0，复用副比特流的比特与主比特流，没有选来表达副比特流的比特的码字被选来均衡已编码比特流的连续差异。 | ||||||
| 7 | 矢量编码方法及其利用该方法的编码器和解码器 | CN95195265.X | 1995-09-29 | CN1167046C | 2004-09-15 | 片冈章俊; 池户丈太朗 |
| 分别从码本CB1和CB2选择各样品矢量z1i和z2j，并由乘法器21和22乘以与各样品矢量同样维数的各权系数矢量w1和w2，从而产生各加权样品矢量z1iw1和z2jw2，这些加权样品矢量由一合成部件3矢量合成一合成矢量yij，由一控制部件选择各样品矢量的一种组合使合成矢量Yij和输入矢量X间的距离最小化。权系数矢量w1和w2都有一最大分量在不同维内，并选择各所述权系数矢量使得用各权系数矢量的各分量作为对角元素的各对角矩阵W1和W2之和成为一常数乘以单位矩阵。 | ||||||
| 8 | 矢量编码方法及其利用该方法的编码器和解码器 | CN95195265.X | 1995-09-29 | CN1158665A | 1997-09-03 | 片冈章俊; 池户丈太朗 |
| 分别从码本CB1和CB2选择各样品矢量z1i和z2j，并由乘法器21和22乘以与各样品矢量同样维数的各权系数矢量w1和w2，从而产生各加权样品矢量z1iw1和z2jw2，这些加权样品矢量由一合成部件3矢量合成一合成矢量yij，由一控制部件选择各样品矢量的一种组合使合成矢量yij和输入矢量X间的距离最小化。权系数矢量w1和w2都有一最大分量在不同维内，并选择各所述权系数矢量使得用各权系数矢量的各分量作为对角元素的各对角矩阵W1和W2之和成为一常数乘以单位矩阵。 | ||||||
| 9 | 用于基于相量差异对数据进行编码的设备和方法 | CN201180074581.8 | 2011-10-01 | CN103907295B | 2016-06-22 | D.克斯林; M.C.法尔科纳; K.P.斯拉特里; H.G.斯金纳 |
| 用于管理信息的方法包括：接收数据的位，在传输频谱的仅一个频率处确定用于位的相量，组合位的所述相量，其形成具有落在预定的范围内的谱能量的相量，以及从所述组合的相量的所述位形成码字。 | ||||||
| 10 | 用于调制编码及解码的方法和系统 | CN200880114724.1 | 2008-10-23 | CN101849361B | 2014-04-30 | T·米特尔霍尔泽 |
| 本发明提供了用于调制编码二进制输入数据流的方法及装置。将四进位枚举编码算法应用到输入比特流以产生一连串四进位输出符号。所述四进位算法运算以同时编码所述输入比特流的奇数及偶数交错中的相应广义斐波纳契码。然后交错每个连续四进位输出符号的位，从而产生具有全局且交错的连串长度约束的输出比特流。使所述四进位输出符号的位反相将产生具有(G，I)约束的输出比特流，如在反向串连调制系统中所使用的PRML(G，I)码中那样。本发明还提供了对应的解码系统。 | ||||||
| 11 | 调制编码及解码 | CN200880114724.1 | 2008-10-23 | CN101849361A | 2010-09-29 | T·米特尔霍尔泽 |
| 本发明提供了用于调制编码二进制输入数据流的方法及装置。将四进位枚举编码算法应用到输入比特流以产生一连串四进位输出符号。所述四进位算法运算以同时编码所述输入比特流的奇数及偶数交错中的相应广义斐波纳契码。然后交错每个连续四进位输出符号的位，从而产生具有全局且交错的连串长度约束的输出比特流。使所述四进位输出符号的位反相将产生具有(G，I)约束的输出比特流，如在反向串连调制系统中所使用的PRML(G，I)码中那样。本发明还提供了对应的解码系统。 | ||||||
| 12 | 传输装置和再生装置 | CN99123563.0 | 1999-11-08 | CN1130831C | 2003-12-10 | 关井康彰 |
| 一种传输装置和再生装置包括一个转换器用来将输入一比特数字音频信号转换成多比特信号，同时降低采样频率。能够导致取决于其调制度的溢出(限幅)的一比特数字信号在转换器输入的开始阶段被衰减，并在转换器的后面阶段被放大以避免两个阶段之间的限幅状态。 | ||||||
| 13 | D/A转换器以及Δ－Σ调制器 | CN95109555.2 | 1995-10-04 | CN1118941C | 2003-08-20 | 安田彰 |
| 一种选择装置，它包括：对相互具有误差的电流元的各自使用次数进行积分的积分器；根据该积分器的积分结果并对应输入信号选择次数少的控制对象的选择器。具有降低工作速度、减少误差，尤其能减少预定频率的误差的优点。 | ||||||
| 14 | 传输装置和再生装置 | CN99123563.0 | 1999-11-08 | CN1258069A | 2000-06-28 | 关井康彰 |
| 一种传输装置和再生装置包括一个转换器用来将输入一比特数字音频信号转换成多比特信号,同时降低采样频率。能够导致取决于其调制度的溢出(限幅)的一比特数字信号在转换器输入的开始阶段被衰减,并在转换器的后面阶段被放大以避免两个阶段之间的限幅状态。 | ||||||
| 15 | Hybrid comparison for unicode text strings consisting primarily of ASCII characters | US15719479 | 2017-09-28 | US10089281B1 | 2018-10-02 | Thomas Neumann; Viktor Leis; Alfons Kemper |
| Comparing text strings with Unicode encoding includes receiving two text strings S1 and S2. The process computes, for the first text string S1, a first weight according to a weight function ƒ that computes an ASCII prefix ƒA(S1), computes a Unicode weight suffix ƒU(S1), and concatenates the weights to form the first weight ƒ(S1)=ƒA(S1)+ƒU(S1). Computing the ASCII prefix for the first string applies bitwise operations to n-byte contiguous blocks of the first string to determine whether each block contains only ASCII characters, and replaces accented Unicode characters with equivalent unaccented ASCII characters when comparison is designated as accent-insensitive. When there is a first block containing a non-replaceable non-ASCII character, the Unicode weight suffix is computed by performing a character-by-character Unicode weight lookup beginning with the first block. The same process is applied to the second string. The text string are compared by comparing their computed weights. | ||||||
| 16 | SYSTEM AND METHOD FOR CONVERSION OF NUMERIC VALUES BETWEEN DIFFERENT NUMBER BASE FORMATS, FOR USE WITH SOFTWARE APPLICATIONS | US14504288 | 2014-10-01 | US20150095387A1 | 2015-04-02 | OLIVIER LAGNEAU; JOSEPH DARCY |
| Described herein are systems and methods for conversion of numeric values between different number base formats, for use with software applications. In accordance with an embodiment, an integral part of a passed floating-point numeric value in a source number base (e.g., binary) format is isolated and converted to an integer. A fractional part of the numeric value is also isolated and converted to an integer, while limiting the isolation and conversion of the fractional part to a required precision or number of digits, depending on the particular requirements of a software application. The fractional part can be rounded, including determining an exact roundoff as appropriate, and if necessary propagating the rounding to the integral part. Digits from the resulting integers representing the integral and fractional parts can then be collected and used to prepare a representation of the original numeric value in a target number base (e.g., decimal) format. | ||||||
| 17 | Apparatus and method for coding data based on phasor disparity | US14006702 | 2011-10-01 | US08988255B2 | 2015-03-24 | Dawson W. Kesling; Maynard C. Falconer; Kevin P. Slattery; Harry G. Skinner |
| A method for managing information includes receiving bits of data, determining phasors for bits at only one frequency of a transmission spectrum, combining the phasors of bits that form a phasor having a spectral energy that lies within a predetermined range, and forming a codeword from the bits of the combined phasors. | ||||||
| 18 | Data coding buffer for electrical computers and digital data processing systems | US11777144 | 2007-07-12 | US07548176B2 | 2009-06-16 | Donald Martin Monro |
| A method of buffering includes determining, based at least in part on a radix of a data symbol, a number of discrete values resulting from coding the data symbol into a buffer. The number of discrete values is compared with a buffer capacity of the buffer. The buffer is scaled based at least in part on the radix of the data symbol if the number of discrete values does not exceed the buffer capacity of the buffer. The data symbol is coded into the scaled buffer if the number of discrete values does not exceed the buffer capacity of the buffer. | ||||||
| 19 | Data translation system and method | US11454689 | 2006-06-16 | US20070290903A1 | 2007-12-20 | Frank N. G. Cheung |
| 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) ×M bit memory instead of the conventional (2**M)×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. | ||||||
| 20 | Unipolar electrical to CSRZ optical converter | US10435981 | 2003-05-12 | US06842125B2 | 2005-01-11 | John C. Mauro; Salvatore Morasca; Valerio Pruneri; Srikanth Raghavan |
| A conversion method for converting a unipolar voltage data stream into a carrier-suppressed return-to-zero (CSRZ) optical data stream includes modulating a continuous optical wave with an encoded nonreturn-to-zero (NRZ) voltage data stream for providing a CSRZ optical data stream of full-width at half-maximum (FWHM) pulse width less than one-half of the transition time of the encoded nonreturn-to-zero (NRZ) voltage data stream between logical states for a reduced pulse width. The modulating circuit is either a duobinary modulator driven with a swing of ±2Vπ or an optical time domain multiplexed plurality of nonreturn-to-zero (NRZ) modulators with phase shifting and differential encoding. | ||||||
QQ群二维码
意见反馈
意见反馈