会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Modifying timing graph to avoid given set of paths
    • 修改时序图以避免给定的路径集
    • US06292924B1
    • 2001-09-18
    • US08964997
    • 1997-11-05
    • Ivan PavisicAnatoli A. BolotovAlexander E. AndreevRanko Scepanovic
    • Ivan PavisicAnatoli A. BolotovAlexander E. AndreevRanko Scepanovic
    • G06F1750
    • G06F17/5031
    • Integrated circuit chips (IC's) require proper placement of many cells (groups of circuit components) and complex routing of wires to connect the pins of the cells. Designing of the IC's require meeting real-world constraints such as minimization of the circuit area, minimization of wire length within the circuit, and minimization of the time the IC requires to perform its function, referred to as the IC delay. In order to design circuits to meet a given set of requirements, each signal path of the circuit must be analyzed. Because of the large number of the cells and the complex connections, the number of paths is very large and requires much computing power to analyze. Also, some of the paths are not important for the purposes of the operations of the chip and can be discounted during the analysis process. The present invention discloses a method and apparatus used to avoid analyzing non-important paths, referred to as false paths of a directed timing graph. To avoid the false paths, the timing graph representing the circuit is modified to exclude the false paths before the graph is analyzed. To modify the timing graph, duplicate nodes are constructed, duplicate edges are constructed, and some edges of the original graph are cut and replaced by mixed edges connecting non-duplicate nodes to duplicate nodes. Finally, mixed edges are created to connect duplicate nodes to non-duplicate nodes, integrating the duplicate graph with the original graph.
    • 集成电路芯片(IC)需要适当放置许多单元(电路组件组)和复杂的导线布线以连接单元的引脚。 IC的设计需要满足实际的限制,例如最小化电路面积,最小化电路内的电线长度,以及使IC执行其功能所需的时间最小化,称为IC延迟。 为了设计电路以满足给定的一组要求,必须分析电路的每个信号路径。 由于大量的单元和复杂的连接,路径数量非常多,需要很多计算能力进行分析。 此外,一些路径对于芯片的操作的目的不重要,并且可以在分析过程期间被折扣。 本发明公开了一种用于避免分析非重要路径的方法和装置,被称为定向定时图的假路径。 为了避免错误路径,修改表示电路的时序图,以排除图表分析之前的虚假路径。 为了修改时序图,构造了重复的节点,构建了重复的边,原始图的一些边被剪切,并将不重复的节点连接到重复节点的混合边替换。 最后,创建混合边以将重复节点连接到非重复节点,将重复图与原始图集成。
    • 4. 发明授权
    • Fast free memory address controller
    • 快速可用内存地址控制器
    • US06662287B1
    • 2003-12-09
    • US10000243
    • 2001-10-18
    • Alexander E. AndreevAnatoli A. BolotovRanko Scepanovic
    • Alexander E. AndreevAnatoli A. BolotovRanko Scepanovic
    • G06F1200
    • G06F12/023Y10S707/99953Y10S707/99956
    • A memory manager for managing allocation of addresses in the memory is structured as a hierarchical tree having a top vertex, a bottom level and at least one intermediate level. The bottom level contains a plurality of bottom vertices each containing a plurality of representations of a Free or Taken status of respective addresses in the memory. Each intermediate contains at least one hierarchy vertex containing a plurality of labels such that each label is associated with a child vertex and defines whether or not a path that includes the respective child vertex ends in a respective bottom level vertex containing at least one Free representation. An allocation command changes the representation of the first Free address to Taken and a free command changes the representation of a specified address to Free. The labels in hierarchical vertices are changed to reflect the path conditions to the bottom vertices.
    • 用于管理存储器中的地址分配的存储器管理器被构造为具有顶部顶点,底部水平和至少一个中间水平的分层树。 底层包含多个底部顶点,每个底部顶点包含多个存储器中相应地址的自由或取代状态的表示。 每个中间体包含至少一个包含多个标签的层次顶点,使得每个标签与子顶点相关联,并且定义包含相应子顶点的路径是否包含在包含至少一个自由表示的相应底层顶点中。 一个分配命令将第一个自由地址的表示更改为Taken,一个free命令将指定地址的表示更改为Free。 更改层次顶点中的标签以反映底层顶点的路径条件。
    • 5. 发明授权
    • Memory mapping for parallel turbo decoding
    • 并行turbo解码的内存映射
    • US08132075B2
    • 2012-03-06
    • US11924385
    • 2007-10-25
    • Alexander E. AndreevAnatoli A. BolotovRanko Scepanovic
    • Alexander E. AndreevAnatoli A. BolotovRanko Scepanovic
    • H03M13/00
    • H03M13/2771H03M13/2764H03M13/2957
    • A routing multiplexer system provides p outputs based on a selected permutation of p inputs. Each of a plurality of modules has two inputs, two outputs and a control input and is arranged to supply signals at the two inputs to the two outputs in a direct or transposed order based on a value of a bit at the control input. A first p/2 group of the modules are coupled to the n inputs and a second p/2 group of the modules provide the n outputs. A plurality of control bit tables each contains a plurality of bits in an arrangement based on a respective permutation. The memory is responsive to a selected permutation to supply bits to the respective modules based on respective bit values of a respective control bit table, thereby establishing a selected and programmable permutation of the inputs to the outputs.
    • 路由复用器系统基于所选择的p个输入的排列来提供p个输出。 多个模块中的每一个具有两个输入,两个输出和一个控制输入,并且被布置为基于控制输入处的位的值,以直接或转置的顺序将两个输入端的信号提供给两个输出。 模块的第一个p / 2组耦合到n个输入端,第二个p / 2组模块提供n个输出。 多个控制位表各自包含基于相应置换的布置中的多个位。 存储器响应于所选择的置换,以基于相应控制位表的相应位值向相应模块提供位,由此建立对输出的输入的选择和可编程排列。
    • 8. 发明授权
    • FIFO memory with single port memory modules for allowing simultaneous read and write operations
    • 具有单端口存储器模块的FIFO存储器,用于允许同时的读写操作
    • US07181563B2
    • 2007-02-20
    • US10692664
    • 2003-10-23
    • Alexander E. AndreevAnatoli A. BolotovRanko Scepanovic
    • Alexander E. AndreevAnatoli A. BolotovRanko Scepanovic
    • G06F12/00
    • G06F12/06G06F5/14G06F5/16
    • The present invention is directed to a FIFO memory with single port memory modules that may allow simultaneous read and write operations. In an exemplary aspect of the present invention, a method for employing a FIFO memory with single port memory modules of half capacity to perform simultaneous read and write operations includes the following steps: (a) providing a first single port memory module for an even address of a read or write operation; (b) providing a second single port memory module for an odd address of a read or write operation; (c) alternating even address and odd address; and (d) when both a read request and a write request reach either the first single port memory module or the second single port memory module at a clock cycle, fulfilling the read request at the current clock cycle and fulfilling the write request at the next clock cycle.
    • 本发明涉及具有单端口存储器模块的FIFO存储器,其可以允许同时的读和写操作。 在本发明的示例性方面,一种采用具有半容量的单端口存储器模块的FIFO存储器来执行同时读和写操作的方法包括以下步骤:(a)提供用于偶数地址的第一单端口存储器模块 的读或写操作; (b)提供用于读或写操作的奇数地址的第二单端口存储器模块; (c)交替地址和奇地址; 和(d)当读请求和写请求都在时钟周期到达第一单端口存储器模块或第二单端口存储器模块时,在当前时钟周期满足读请求并在下一个时刻满足写请求 时钟周期。
    • 9. 发明授权
    • Memory mapping for parallel turbo decoding
    • 并行turbo解码的内存映射
    • US07305593B2
    • 2007-12-04
    • US10648038
    • 2003-08-26
    • Alexander E. AndreevAnatoli A. BolotovRanko Scepanovic
    • Alexander E. AndreevAnatoli A. BolotovRanko Scepanovic
    • G06F11/00
    • H03M13/2771H03M13/2764H03M13/2957
    • A routing multiplexer system provide p outputs based on a selected permutation of p inputs. Each of a plurality of modules has two inputs, two outputs and a control input and is arranged to supply signals at the two inputs to the two outputs in a direct or transposed order based on a value of a bit at the control input. A first p/2 group of the modules are coupled to the n inputs and a second p/2 group of the modules provide the n outputs. A plurality of control bit tables each contains a plurality of bits in an arrangement based on a respective permutation. The memory is responsive to a selected permutation to supply bits to the respective modules based on respective bit values of a respective control bit table, thereby establishing a selected and programmable permutation of the inputs to the outputs.
    • 路由多路复用器系统基于所选择的p个输入的排列来提供p个输出。 多个模块中的每一个具有两个输入,两个输出和一个控制输入,并且被布置为基于控制输入处的位的值,以直接或转置的顺序将两个输入端的信号提供给两个输出。 模块的第一个p / 2组耦合到n个输入端,第二个p / 2组模块提供n个输出。 多个控制位表各自包含基于相应置换的布置中的多个位。 存储器响应于所选择的置换,以基于相应控制位表的相应位值向相应模块提供位,由此建立对输出的输入的选择和可编程排列。