会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明授权
    • Digital multiply-accumulate circuit that can operate on both integer and floating point numbers simultaneously
    • 可同时对整数和浮点数进行操作的数字乘法累加电路
    • US06205462B1
    • 2001-03-20
    • US09414322
    • 1999-10-06
    • David C. WylandDavid A. Harrison
    • David C. WylandDavid A. Harrison
    • G06F744
    • G06F7/5443G06F2207/3824
    • Disclosed is a Multiply-Accumulate circuit that includes an exponent adder circuit, a mantissa multiplier circuit, a shifter, a full adder, and an accumulator. The product adder circuit receives two operands in a special combined data format which prescribes a mantissa and an exponent for both integer and floating point operands. The exponent adder circuit adds the exponents of the two operands. But if before the addition the exponent adder circuit detects an integer as an operand, it replaces the exponent of the integer by a substitute value in that addition. This substitute value is related to the number of bits of the mantissa of the integer. The mantissa multiplier circuit multiplies the two mantissas of the two operands. The shifter shifts the resultant product of multiplication into a pre-defined fixed point format according to the resultant sum of the addition generated by the exponent adder circuit. The full adder adds this shifted product to the current content of the accumulator.
    • 公开了一种乘法累加电路,其包括指数加法器电路,尾数乘法器电路,移位器,全加器和累加器。 产品加法器电路以特殊的组合数据格式接收两个操作数,它们规定了整数和浮点操作数的尾数和指数。 指数加法器电路将两个操作数的指数相加。 但是如果在加法之前,指数加法器电路检测一个整数作为一个操作数,它将以该加法代替整数的指数。 该替代值与整数的尾数的位数有关。 尾数乘法器电路将两个操作数的两个奇数相乘。 移位器根据由指数加法器电路产生的加法结果之和将乘积乘积的乘积移位到预定义的固定点格式。 全加器将此移位乘积加到累加器的当前内容。
    • 13. 发明申请
    • METHOD AND SYSTEM FOR PERFORMING DMA IN A MULTI-CORE SYSTEM-ON-CHIP USING DEADLINE-BASED SCHEDULING
    • 使用基于DEADLINE的调度在多芯片系统中执行DMA的方法和系统
    • US20100005470A1
    • 2010-01-07
    • US12167096
    • 2008-07-02
    • Moshe B. SimonErik P. MachnickiDavid A. Harrison
    • Moshe B. SimonErik P. MachnickiDavid A. Harrison
    • G06F9/46
    • G06F13/28G06F13/30
    • A direct memory access (DMA) engine schedules data transfer requests of a system-on-chip data processing system according to both an assigned transfer priority and the deadline for completing a transfer. Transfer priority is based on a hardness representing the penalty for missing a deadline. Priorities are also assigned to zero-deadline transfer requests in which there is a penalty no matter how early the transfer completes. If desired, transfer requests may be scheduled in timeslices according to priority in order to bound the latency of lower priority requests, with the highest priority hard real-time transfers wherein the penalty for missing a deadline is severe are given the largest timeslice. Service requests for preparing a next data transfer are posted while a current transaction is in progress for maximum efficiency. Current transfers may be preempted whenever a higher urgency request is received.
    • 直接存储器访问(DMA)引擎根据分配的传送优先级和完成传送的截止时间调度片上系统数据处理系统的数据传输请求。 转移优先级基于表示错过期限的惩罚的硬度。 优先权也被分配到零期限转移请求,其中有罚款,无论传输完成的时间早。 如果需要,可以根据优先级按照时间表调度传输请求,以便限制较低优先级请求的延迟,具有最高优先级的硬实时传输,其中丢失最后期限的惩罚是最大的时间片。 在进行当前事务处理以最大效率的情况下,会发布准备下一次数据传输的服务请求。 当接收到更高的紧急请求时,可以抢占当前的传输。
    • 14. 发明授权
    • Programmable logic device placement method utilizing weighting function
to facilitate pin locking
    • 可编程逻辑器件放置方法利用加权函数来促进引脚锁定
    • US5790882A
    • 1998-08-04
    • US746656
    • 1996-11-13
    • Joshua M. SilverDavid A. HarrisonHua Xue
    • Joshua M. SilverDavid A. HarrisonHua Xue
    • H03K19/173G06F17/50G06F3/00
    • G06F17/5072G06F17/5054
    • A method for placing a logic function into the function blocks of a complex programmable logic device (CPLD) to maintain the same input/output pin locations after the logic function is subsequently modified by a user. The method utilizes a weighting function to assign portions of the logic function to the function blocks such that sufficient resources are available in each function block to implement subsequent modifications to the logic function without changing the originally-assigned input and output pin locations. For each portion of the logic function, the weighting function is employed to identify the function block which implements the portion while maximizing the available resources in all of the function blocks. If a particular equation cannot be placed, the method utilizes a corrective measure such as fitting refinement, buffering and logic reformation to place the equation. If the equation still cannot be placed, the weighting function is altered, thereby changing the criteria by which logic portions are assigned to the function blocks. The placement method is then repeated with the altered weighting function.
    • 一种用于将逻辑功能放置在复杂可编程逻辑器件(CPLD)的功能块中以在逻辑功能随后由用户修改之后保持相同的输入/输出引脚位置的方法。 该方法利用加权函数将逻辑功能的部分分配给功能块,使得在每个功能块中有足够的资源可用于实现对逻辑功能的后续修改而不改变原始分配的输入和输出引脚位置。 对于逻辑功能的每个部分,采用加权函数来识别实现该部分的功能块,同时使所有功能块中的可用资源最大化。 如果不能放置特定的方程,则该方法利用纠正措施,例如拟合细化,缓冲和逻辑重构来排列方程。 如果方程式仍然不能放置,则加权函数被改变,从而改变将逻辑部分分配给功能块的标准。 然后用改变的加权函数重复放置方法。
    • 16. 发明授权
    • Method and system for performing DMA in a multi-core system-on-chip using deadline-based scheduling
    • 在使用基于时限的调度的多核片上系统片上执行DMA的方法和系统
    • US08151008B2
    • 2012-04-03
    • US12167096
    • 2008-07-02
    • Moshe B. SimonErik P. MachnickiDavid A. Harrison
    • Moshe B. SimonErik P. MachnickiDavid A. Harrison
    • G06F13/28G06F13/30
    • G06F13/28G06F13/30
    • A direct memory access (DMA) engine schedules data transfer requests of a system-on-chip data processing system according to both an assigned transfer priority and the deadline for completing a transfer. Transfer priority is based on a hardness representing the penalty for missing a deadline. Priorities are also assigned to zero-deadline transfer requests in which there is a penalty no matter how early the transfer completes. If desired, transfer requests may be scheduled in timeslices according to priority in order to bound the latency of lower priority requests, with the highest priority hard real-time transfers wherein the penalty for missing a deadline is severe are given the largest timeslice. Service requests for preparing a next data transfer are posted while a current transaction is in progress for maximum efficiency. Current transfers may be preempted whenever a higher urgency request is received.
    • 直接存储器访问(DMA)引擎根据分配的传送优先级和完成传送的截止时间调度片上系统数据处理系统的数据传输请求。 转移优先级基于表示错过期限的惩罚的硬度。 优先权也被分配到零期限转移请求,其中有罚款,无论传输完成的时间早。 如果需要,可以根据优先级按照时间表调度传输请求,以便限制较低优先级请求的延迟,具有最高优先级的硬实时传输,其中丢失最后期限的惩罚是最大的时间片。 在进行当前事务处理以最大效率的情况下,会发布准备下一次数据传输的服务请求。 当接收到更高的紧急请求时,可以抢占当前的传输。