会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 51. 发明授权
    • Multi-port SRAM with reduced access requirements
    • 多端口SRAM,具有降低的访问要求
    • US5953283A
    • 1999-09-14
    • US127332
    • 1998-07-31
    • David MeltzerJoel Abraham Silberman
    • David MeltzerJoel Abraham Silberman
    • G11C13/00G11C8/16G11C8/00
    • G11C8/16
    • An improved multi-port SRAM that requires fewer access means, bit lines and sense amplifiers for multiport access. The number of access means can be reduced to ceiling (log.sub.2 B), where B is the number of access ports. The number of bit line sense amplifiers needed to achieve multiport access can also be reduced by the same factor as the number of access devices per cell. An efficient means is provided to select a correct access device among the plurality of access devices within the array and to condition a correct multiplexer select signal to couple a correct bit as specified by the port read address to the port read output. The access device selection can be implemented by a tree representation of all possible bit line and multiplexer select combinations. The tree representation can be implemented in hardware or software. Examples are provided of both a circuit and a tree walking algorithm that gives priority by port order. Alternatively, logic to select the bit lines and controls could give priority in bit order. In either case, examples are provided for modifying the strict priority order to avoid conflicts and obtain a correct solution.
    • 一种改进的多端口SRAM,其需要较少的访问方式,位线和用于多端口访问的读出放大器。 访问方式的数量可以减少到上限(log2B),其中B是接入端口的数量。 实现多端口访问所需的位线读出放大器的数量也可以减少与每个单元的访问设备数量相同的因素。 提供了一种有效的方法来选择阵列内的多个访问设备中的正确的访问设备,并且调整正确的多路复用器选择信号以将由端口读取地址指定的正确位耦合到端口读取输出。 访问设备选择可以通过所有可能的位线和多路复用器选择组合的树形表示来实现。 树表示可以在硬件或软件中实现。 提供了通过端口顺序优先的电路和树行走算法的示例。 或者,选择位线和控制的逻辑可以按位顺序给出优先级。 在这两种情况下,都提供了修改严格优先顺序以避免冲突并获得正确解决方案的示例。
    • 55. 发明授权
    • Method and apparatus for accelerating instruction fetching for a processor
    • 用于加速处理器的指令获取的方法和装置
    • US06604191B1
    • 2003-08-05
    • US09498932
    • 2000-02-04
    • Brian King FlacksDavid MeltzerJoel Abraham Silberman
    • Brian King FlacksDavid MeltzerJoel Abraham Silberman
    • G06F1200
    • G06F9/3814G06F9/3802G06F9/3804G06F12/0875
    • An instruction fetching system (and/or architecture) which may be utilized by a high-frequency short-pipeline microprocessor, for efficient fetching of both in-line and target instructions. The system contains an instruction fetching unit (IFU), having a control logic and associated components for controlling a specially designed instruction cache (I-cache). The I-cache is a sum-address cache, i.e., it receives two address inputs, which compiled by a decoder to provide the address of the line of instructions desired fetch. The I-cache is designed with an array of cache lines that can contain 32 instructions, and three buffers that each have a capacity of 32 instructions. The three buffers include a Predicted (PRED) buffer that holds the instructions which are currently being executed, a NEXT buffer that holds the instructions which are to be executed after the instructions in the PRED buffer, and an ALT buffer that holds the alternate set of instructions when a branch is predicted taken/not taken and is utilized along with the PRED buffer to permit branch target retrieval within I-cache prior to a prediction.
    • 可以由高频短流水线微处理器利用的指令获取系统(和/或架构),用于有效地提取在线和目标指令。 该系统包含指令提取单元(IFU),具有用于控制专门设计的指令高速缓存(I-cache)的控制逻辑和相关组件。 I缓存是和地址高速缓存,即它接收两个地址输入,其由解码器编译以提供期望提取的指令行的地址。 I缓存设计有可以包含32个指令的高速缓存行数组,每个缓冲区的容量为32个指令。 三个缓冲器包括保存当前正在执行的指令的预测(PRED)缓冲器,保存在PRED缓冲器中的指令之后要执行的指令的NEXT缓冲器,以及保存该替换组的ALT缓冲器 预测采取/未采取分支时使用指令,并与PRED缓冲区一起使用,以允许在预测之前在I缓存中进行分支目标检索。