会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明申请
    • Methods and apparatus for fast fourier transforms
    • 快速傅里叶变换的方法和装置
    • US20050102342A1
    • 2005-05-12
    • US10643164
    • 2003-08-18
    • Jonathan Greene
    • Jonathan Greene
    • G06F17/14G06F15/00
    • G06F17/142
    • A system for calculating fast Fourier transforms includes a non-final stage calculating element for repetitively performing in-place butterfly calculations for n−1 stages as well as a final stage calculating element for performing a final stage of butterfly calculations. The final stage calculation includes a first loop and a second loop. The first loop performs a portion of the final stage butterfly calculations and includes control logic to perform groups of butterfly calculations and to store the butterfly calculation outputs in a shuffled order in place of the inputs to result in a correct ordering of transform outputs. The second loop performs a remaining portion of the final stage butterfly calculations and includes control logic to perform butterfly calculations and to store the butterfly calculation outputs in a shuffled order in place of the inputs to result in a correct ordering of transform outputs.
    • 用于计算快速傅里叶变换的系统包括用于重复执行n-1级的就地蝶形计算的非最终级计算元件以及用于执行蝴蝶计算的最后级的最终级计算元件。 最后阶段计算包括第一循环和第二循环。 第一个循环执行最后阶段蝴蝶计算的一部分,并且包括控制逻辑以执行蝶形计算组并以混洗顺序存储蝴蝶计算输出来代替输入以产生变换输出的正确排序。 第二循环执行最后阶段蝴蝶计算的剩余部分,并且包括执行蝶形计算的控制逻辑,并且以混洗顺序存储蝴蝶计算输出来代替输入以产生变换输出的正确排序。
    • 7. 发明申请
    • RAM BLOCK DESIGNED FOR EFFICIENT GANGING
    • RAM块被设计用于高效率
    • US20130111119A1
    • 2013-05-02
    • US13285210
    • 2011-10-31
    • Volker HechtJonathan Greene
    • Volker HechtJonathan Greene
    • G06F12/00
    • G06F12/00H03K19/17768H03K19/17796
    • A random-access memory block for a field programmable gate array includes a random-access memory array having address inputs, a data input, a data output and including a plurality of storage locations. At least two programmably invertible enable inputs are provided. Hardwired decoding logic is coupled to the at least two programmably invertible enable inputs to selectively enable the random-access memory array. A gate is coupled to the output of the random-access memory array and is configured to pass the output of the random-access memory array only if the random-access memory is enabled for a read operation, and otherwise generate a preselected logic state.
    • 用于现场可编程门阵列的随机存取存储器块包括具有地址输入,数据输入,数据输出并且包括多个存储位置的随机存取存储器阵列。 提供至少两个可编程的可逆可用输入。 硬连线解码逻辑被耦合到至少两个可编程的可逆可用使能输入以选择性地启用随机存取存储器阵列。 门被耦合到随机存取存储器阵列的输出,并且被配置为仅当对读操作启用随机存取存储器时才传递随机存取存储器阵列的输出,否则生成预选逻辑状态。
    • 9. 发明授权
    • Logic module including versatile adder for FPGA
    • 逻辑模块包括FPGA通用加法器
    • US08085064B2
    • 2011-12-27
    • US12823266
    • 2010-06-25
    • Wenyi FengJonathan Greene
    • Wenyi FengJonathan Greene
    • H03K19/173G06F7/38
    • H03K19/1737G06F7/503H03K19/17728
    • A logic module for an FPGA includes a LUT formed from an N-level tree of 2:1 multiplexers. Each of the N inputs to the LUT is connected to the select inputs of the multiplexers in one level of the tree. Each of the data inputs at the leaves of the tree is driven by a configuration memory cell that produces either a logic 0 or a logic 1. The output of the single multiplexer at the last level of the tree forms a Y output and is coupled to one input of an XOR gate and to the select input of a two-input carry multiplexer. The 0 input of the carry multiplexer is coupled to a G input. A CI input is coupled to the other input of the XOR gate and to the 1 input of the carry multiplexer.
    • 用于FPGA的逻辑模块包括由2:1多路复用器的N级树形成的LUT。 LUT的N个输入中的每一个连接到树的一个级别中的多路复用器的选择输入。 在树的叶片处的每个数据输入由产生逻辑0或逻辑1的配置存储器单元驱动。在树的最后一级的单个多路复用器的输出形成Y输出,并耦合到 XOR门的一个输入和双输入进位多路复用器的选择输入。 进位多路复用器的0输入耦合到G输入。 CI输入耦合到XOR门的另一个输入端和进位复用器的1个输入端。
    • 10. 发明授权
    • Logic module including versatile adder for FPGA
    • 逻辑模块包括FPGA通用加法器
    • US07772879B1
    • 2010-08-10
    • US12101589
    • 2008-04-11
    • Wenyi FengJonathan Greene
    • Wenyi FengJonathan Greene
    • G06F7/38H03K19/173
    • H03K19/1737G06F7/503H03K19/17728
    • A logic module for an FPGA includes a LUT formed from an N-level tree of 2:1 multiplexers. Each of the N inputs to the LUT is connected to the select inputs of the multiplexers in one level of the tree. Each of the data inputs at the leaves of the tree is driven by a configuration memory cell that produces either a logic 0 or a logic 1. The output of the single multiplexer at the last level of the tree forms a Y output and is coupled to one input of an XOR gate and to the select input of a two-input carry multiplexer. The 0 input of the carry multiplexer is coupled to a G input. A CI input is coupled to the other input of the XOR gate and to the 1 input of the carry multiplexer.
    • 用于FPGA的逻辑模块包括由2:1多路复用器的N级树形成的LUT。 LUT的N个输入中的每一个连接到树的一个级别中的多路复用器的选择输入。 在树的叶片处的每个数据输入由产生逻辑0或逻辑1的配置存储器单元驱动。在树的最后一级的单个多路复用器的输出形成Y输出,并耦合到 XOR门的一个输入和双输入进位多路复用器的选择输入。 进位多路复用器的0输入耦合到G输入。 CI输入耦合到XOR门的另一个输入端和进位复用器的1个输入端。