专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

11. 发明申请

US20060098500A1 Truly random number generating circuit and method thereof 审中-公开
标题翻译：真正的随机数生成电路及其方法
公开(公告)号：US20060098500A1
公开(公告)日：2006-05-11
申请号：US10985158
申请日：2004-11-09
申请人： Hongyi Chen , Zhun Huang , Guoqiang Bai
发明人： Hongyi Chen , Zhun Huang , Guoqiang Bai
IPC分类号： G11C5/14
CPC分类号： G11C29/10 , G06F7/588 , G11C2029/3602 , H04L9/001
摘要： A chaotic circuit for truly random number generation is provided. The chaotic dynamical system used in the circuit is implemented based on the charge redistribution of capacitors. The random number generator circuit is a switched network including four capacitors and eight switches that are controlled by two-phase non-overlapping clock signals. The two clocks turn on switches alternatively. The circuit further includes inverter chain and amplifier. When a first clock signal turns on, four capacitors are charged by the inverter chain and the amplifier that connected as a unity gain buffer. When a second clock signal turns on, the charges are redistributed. The voltage of output terminal of the amplifier is function of its previous status, and thus a random bit stream is generated at an output terminal of the inverter chain. A smaller core area and lower power consumption is provided since circuit is simpler and no resistor is required.
摘要翻译：提供了真正随机数生成的混沌电路。电路中使用的混沌动力学系统是基于电容器的电荷再分配实现的。随机数发生器电路是包括由两相非重叠时钟信号控制的四个电容器和八个开关的开关网络。两个时钟交替开启交换机。该电路还包括逆变器链和放大器。当第一个时钟信号导通时，四个电容器由反相器链和作为单位增益缓冲器连接的放大器充电。当第二个时钟信号接通时，电荷被重新分配。放大器的输出端子的电压是其先前状态的函数，因此在逆变器链的输出端产生随机比特流。提供更小的核心区域和更低的功率消耗，因为电路更简单并且不需要电阻器。

12. 发明授权

US06463081B1 Method and apparatus for fast rotation 失效
标题翻译：快速旋转的方法和装置
公开(公告)号：US06463081B1
公开(公告)日：2002-10-08
申请号：US09056454
申请日：1998-04-07
申请人： Hongyi Chen , Zhiqiang Zeng
发明人： Hongyi Chen , Zhiqiang Zeng
IPC分类号： H04J302
CPC分类号： G06F17/147
摘要： An apparatus and a method of fast rotation. A pipeline comprising a plurality of multiplexes a plurality of shifters to perform last rotation of data selected by the multiplexes, and a plurality of adders/subtracters is provided. A plurality sets of data is input to be filtered and selected by the multiplexes. Fast rotation is performed to the data selected by the multiplexes. A final computation is performed a set of resultant data is output through the adder/subtractors.
摘要翻译：一种快速旋转的装置和方法。一种流水线，包括多个复用多个移位器以执行由多路复用选择的数据的最后旋转，并且提供多个加法器/减法器。输入多组数据以通过多路复用进行滤波和选择。对由多路复用选择的数据执行快速旋转。执行最终计算，一组结果数据通过加法器/减法器输出。

13. 发明授权

US6141552A Estimation of mobility for network planning based on highway maps and traffic data 失效
标题翻译：基于公路图和交通数据估计网络规划的移动性
公开(公告)号：US6141552A
公开(公告)日：2000-10-31
申请号：US971441
申请日：1997-11-17
申请人： Andrew Sendonaris , Hongyi Chen , Nikhil Jain , Seshagri Madhavapeddy , Sairam Subramanian
发明人： Andrew Sendonaris , Hongyi Chen , Nikhil Jain , Seshagri Madhavapeddy , Sairam Subramanian
IPC分类号： H04W16/18 , H04Q7/00
CPC分类号： H04W16/18
摘要： The mobility of mobile subscribers within a wireless digital communications system is estimated based on highway maps and traffic data. Cells within the network are modelled as nodes connected by edges where neighboring cells are connected by roads. Each edge has two edge weight components representing traffic flow from one cell to the other and vice versa. The edge weight components are calculated from terrain factors based on the size or capacity of the roads connecting the two cells and the total traffic within the subject cell, which information may be obtained from commercial geographic databases and/or government agencies. The resulting edge weight represents an expected number of handoffs between the two cells. The problem of partitioning cells among available switches within the network is thus reduced to the purely mathematical problem of minimizing the total edge weights of edges intersected by the partition boundaries. Existing mathematical optimization techniques for optimizing node-edge systems may therefore be applied to reduce the total number of expected inter-switch handoffs as mobile subscribers pass from cell to cell within the network.
摘要翻译：基于高速公路地图和交通数据估计无线数字通信系统内移动用户的移动性。网络内的小区被建模为通过边缘连接的节点，其中相邻小区通过道路连接。每个边缘具有两个边缘权重分量，表示从一个小区到另一个小区的业务流量，反之亦然。基于连接两个小区的道路的大小或容量以及主体小区内的总流量，从地形因子计算边缘权重分量，该信息可以从商业地理数据库和/或政府机构获得。所得到的边缘权重表示两个单元之间的预期切换次数。因此，将网络内的可用交换机之间的小区划分成一个问题，从而减少了将分区边界相交的边缘的总边缘权重最小化的纯数学问题。因此，用于优化节点边缘系统的现有数学优化技术可以被应用于当移动用户从网络中的小区传送到小区时，减少预期的交换机间切换的总数。

14. 发明授权

US6094631A Method of signal compression 失效
标题翻译：信号压缩方法
公开(公告)号：US6094631A
公开(公告)日：2000-07-25
申请号：US112949
申请日：1998-07-09
申请人： Yongming Li , Xiaodong Wu , Hongyi Chen
发明人： Yongming Li , Xiaodong Wu , Hongyi Chen
IPC分类号： G10L19/02 , H04N7/26 , G10L21/04
CPC分类号： G10L19/0212 , H04N19/61 , H04N19/63 , G10L25/27 , H04N19/115 , H04N19/146
摘要： A method of signal compression. An input signal is divided into a plurality of segments. Each of the segments is decomposed by wavelet packet transform to a plurality of levels, so that each of the segments is in a form of a group of coefficients in each of a plurality of domains corresponding to each of the levels. Each of the domains is divided into a plurality of sub-domains to calculate a degree of characteristic concentration corresponding thereto. One of the domains having a highest degree of characteristic concentration is select to perform bit allocation and quantization, so that the group of coefficients in the selected domain is represented as an information. The information is formatted into a frame for transmission, and then the frame is output.
摘要翻译：一种信号压缩方法。输入信号被分成多个段。每个段通过小波包变换分解为多个级别，使得每个段在与每个级别对应的多个域中的每一个域中是一组系数的形式。每个域被分成多个子域以计算与其对应的特征浓度的程度。选择具有最高特征浓度度的区域之一来执行比特分配和量化，使得所选择的域中的系数组被表示为信息。将信息格式化为一帧以进行传输，然后输出该帧。

15. 发明授权

US07231090B2 Method for performing motion estimation with Walsh-Hadamard transform (WHT) 有权
公开(公告)号：US07231090B2
公开(公告)日：2007-06-12
申请号：US10283477
申请日：2002-10-29
申请人： Hongyi Chen , Xiaohai Qiu
发明人： Hongyi Chen , Xiaohai Qiu
IPC分类号： G06K9/36 , G06K9/46
CPC分类号： H04N19/547 , G06T7/223 , G06T7/262 , G06T2207/10016 , G06T2207/20048 , H04N19/61 , H04N19/63
摘要： A method for performing a motion estimation combined with a Walsh-Hadamard transform algorithm. In image frame, which includes a pixel array to display an image object, the method includes fetching a current image pixel content C and a reference image pixel content R. A Walsh-Hadamard transform algorithm is used to transform the current image pixel content C and the reference image pixel content R, so that a WHT SAD(i, j), WSAD(i,j) is computed to serve as a matching criterion. The formula for computing WSAD(i,j) is WSAD ⁡ ( i , j ) = ∑ k = 0 N - 1 ⁢ ⁢ ∑ l = 0 N - 1 ⁢  W E ⁡ ( k , l )  = ∑ k = 0 N - 1 ⁢ ⁢ ∑ l = 0 N - 1 ⁢  W C ⁡ ( k , l ) - W R ⁡ ( i , j ) ⁡ ( k , l )  , WE(k,l)=WHT(E)=WHT(C—R(i, j))=WC—WR(i,j), W C = WHT ⁡ ( C ) = ∑ μ = 0 N - 1 ⁢ ⁢ ∑ v = 0 N - 1 ⁢ t ⁢ k , l ⁡ ( μ , v ) × C ⁡ ( x + μ , y + v ) , W R ⁡ ( i , j ) = WHT ⁡ ( R ⁡ ( i , j ) ) = ∑ μ = 0 N - 1 ⁢ ⁢ ∑ v = 0 N - 1 ⁢ t ⁢ k , l ⁡ ( μ , v ) ⁢ R ⁡ ( x + i + μ , y + j + v ) , where E is the difference macro block (MB) of a current MB and a reference MB, (x, y) is the location of current MB, (i,j) is the candidate motion vector, i.e., the location of reference MB, N is the MB size, and ti,j=ti·tj′, where ti,j is a matrix by a product of two basis ti and Trans[tj].

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式