会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Digital Gaussian noise simulator
    • 数字高斯噪声模拟器
    • US07822099B2
    • 2010-10-26
    • US11758975
    • 2007-06-06
    • Andrey A. NikitinAlexander E. AndreevIgor A. Vikhliantsev
    • Andrey A. NikitinAlexander E. AndreevIgor A. Vikhliantsev
    • H04B1/69G06F1/02G06F7/58H03K3/84
    • G06F17/18
    • A Gaussian noise is simulated by discrete analogue ri,j. A first parameter α and pluralities of first and second integers i and j are selected. A plurality of points i,j are identified and a magnitude si,j is calculated for each point based on α, i and j. The discrete analogue ri,j is based on a respective si,j. Examples are given of α = 2 B - A 2 B and D>i≧0 and 2C>j≧0, where B≧0, 2B>A>0, C≧1 and D≧1, and magnitude s i , j = 1 - α i + α i · 1 - α 2 C · j ⁢ ⁢ or ⁢ ⁢ s D - 1 , j = 1 - α D - 1 + α D - 1 · 1 2 C · j . In some embodiments, a segment is defined based on α and i. The segment is divided into points based on respective values of j, and the magnitude is calculated for each point of the segment. The defining and dividing segments and calculating the magnitude is iteratively repeated for each value of i.
    • 高斯噪声由离散模拟ri,j模拟。 选择第一参数α和多个第一和第二整数i和j。 识别多个点i,j,并且基于α,i和j针对每个点计算幅度si,j。 离散的模拟ri,j基于相应的si,j。 给出α= 2 B-A 2 B和D> i≥0和2C>j≥0的实例,其中B≥0,2B> A> 0,C≥1和D≥1,并且幅度si,j = 1-αi +αi·1-α2 C·j·肯·杜·斯D-1,j = 1-αD-1 +αD·1·1 2 C·j。 在一些实施例中,基于α和i定义段。 根据j的相应值将该段划分成点,并且对该段的每个点计算大小。 对于i的每个值迭代地重复定义和分割段并计算幅度。
    • 4. 发明授权
    • Controller architecture for memory mapping
    • 用于内存映射的控制器架构
    • US07065606B2
    • 2006-06-20
    • US10655191
    • 2003-09-04
    • Alexander E. AndreevIgor A. VikhliantsevRanko Scepanovic
    • Alexander E. AndreevIgor A. VikhliantsevRanko Scepanovic
    • G06F12/00
    • G06F12/04
    • The present invention is directed to a method and apparatus for mapping a customer memory onto a plurality of physical memories. The apparatus may include: (a) a plurality of physical memories onto which a customer memory may be mapped, each of physical memories having a data width of m blocks, the customer memory having a data width of k blocks, and k and m being integers; (b) an address controller, communicatively coupled to a plurality of physical memories, for receiving first address information of the customer memory, for outputting second address information to a plurality of physical memories, and for outputting index information; (c) a data input controller, communicatively coupled to the address controller and a plurality of physical memories, for receiving data of the customer memory and the index information, and for outputting data with a data width of m blocks to a plurality of physical memories; and (d) a data output controller, communicatively coupled to a plurality of physical memories and to the address controller though a delay unit, for receiving the index information, for receiving output, with a width of said m blocks, of a plurality of physical memories, and for outputting the customer memory with a width of said k blocks.
    • 本发明涉及一种用于将顾客存储器映射到多个物理存储器上的方法和装置。 该装置可以包括:(a)可以映射客户存储器的多个物理存储器,每个物理存储器具有m个块的数据宽度,该客户存储器的数据宽度为k个块,k和m为 整数 (b)地址控制器,通信地耦合到多个物理存储器,用于接收客户存储器的第一地址信息,用于将第二地址信息输出到多个物理存储器,并用于输出索引信息; (c)数据输入控制器,通信地耦合到地址控制器和多个物理存储器,用于接收客户存储器的数据和索引信息,并且用于将数据宽度为m个块的数据输出到多个物理存储器 ; 以及(d)数据输出控制器,通信地耦合到多个物理存储器,并通过延迟单元与地址控制器通信,用于接收索引信息,用于接收具有所述m个块的宽度的多个物理 存储器,并输出具有所述k个块的宽度的客户存储器。
    • 6. 发明授权
    • Netlist redundancy detection and global simplification
    • 网表冗余检测和全局简化
    • US06848094B2
    • 2005-01-25
    • US10334731
    • 2002-12-31
    • Alexander E. AndreevIgor A. Vikhliantsev
    • Alexander E. AndreevIgor A. Vikhliantsev
    • G06F17/50
    • G06F17/505
    • A method of global simplification of a netlist for an integrated circuit includes steps for generating a variable set representative of the inputs and outputs of logic elements in the netlist, re-ordering the inputs and corresponding outputs of the logic elements in the variable set, generating a key set representative of the inputs of the logic elements that are connected to the outputs, assigning names in the variable set that are representative of equivalent outputs having two or fewer essential variables to the same variable name, inserting names in the variable set representative of outputs having more than two essential variables, and assigning a value to each of the outputs having two or fewer essential variables.
    • 一种用于集成电路的网表的全局简化的方法包括以下步骤:产生表示网表中的逻辑元件的输入和输出的变量集,重新排序变量集中的逻辑元素的输入和对应的输出,产生 代表连接到输出的逻辑元件的输入的键集合,将代表具有两个或更少必需变量的等效输出的变量集中的名称分配给相同的变量名称,在代表 具有多于两个基本变量的输出,并且为具有两个或更少必需变量的每个输出分配值。
    • 7. 发明授权
    • Net delay optimization with ramptime violation removal
    • 净延迟优化与删除违反时间违规
    • US06507939B1
    • 2003-01-14
    • US09858166
    • 2001-05-15
    • Alexander E. AndreevAnatoli A. BolotovIgor A. Vikhliantsev
    • Alexander E. AndreevAnatoli A. BolotovIgor A. Vikhliantsev
    • G06F1750
    • G06F17/505
    • The specification discloses a for reduction of net delays and insertion of buffers in a logic tree having a root and a plurality of leaves. The steps of the method include inserting a plurality of auxiliary nodes into the, defining discrete, approximate scales for delay, load, and ramp time, constructing a set of buffers chains for later insertion into the net tree, determining for each node on the tree a tradeoff function relating ramp time, departure time and load at the node, for each node, removing combinations of the tradeoff functions and the buffer chains, which when inserted into the tradeoff function, lead to a ramp time which exceeds a predetermined maximum allowable ramp time, for each node, using the tradeoff function to determine a minimum delay to insert, and inserting the buffer chain corresponding to the minimum delay as determined by the tradeoff function.
    • 该说明书公开了一种用于在具有根和多个叶的逻辑树中减少净延迟和缓冲器的插入。 该方法的步骤包括将多个辅助节点插入到定义离散的近似尺度以用于延迟,加载和斜坡时间,构建一组缓冲器链以供稍后插入到网络树中,确定树上的每个节点 与每个节点相关的斜坡时间,出发时间和节点处的负载的折衷函数,去除折中功能和缓冲链的组合,当组合被插入到权衡函数中时,导致超过预定的最大允许斜坡的斜坡时间 时间,对于每个节点,使用权衡函数来确定插入的最小延迟,以及插入对应于由权衡函数确定的最小延迟的缓冲链。