会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明授权
    • Calculation of trigonometric functions in an integrated circuit device
    • 集成电路设备中三角函数的计算
    • US08510354B1
    • 2013-08-13
    • US12722683
    • 2010-03-12
    • Martin Langhammer
    • Martin Langhammer
    • G06F7/00
    • G06F7/548
    • Circuitry for computing on x and y datapaths a trigonometric function of an input on a z datapath includes a comparison element to determine that the input is at or above a threshold, or below the threshold. The circuitry also includes a first left-shifter for shifting the z datapath by a constant when the input is below the threshold, and a second left-shifter for shifting an initialization value of the x datapath when the input is below the threshold. The circuitry further includes a look-up table including inverse tangent values based on negative powers of 2, and based on negative powers of 2-plus-the-constant and shifted by the constant, for adding to/subtracting from the z datapath, shifters for right-shifting elements of the x and y datapaths by amounts incorporating the constant and respective predetermined shift amounts that are adjusted when the input is below the threshold.
    • 用于在x和y数据路径上进行计算的电路用于在z数据路径上输入的三角函数包括用于确定输入处于或高于阈值或低于阈值的比较元件。 电路还包括用于当输入低于阈值时将z数据路径移位常数的第一左移位器和用于当输入低于阈值时移位x数据路径的初始值的第二左移位器。 该电路还包括一个查找表,其包括基于2的负功率的反正切值,并且基于2-plus-the常数的负功率并且被该常数偏移,用于从z数据路径添加/减去移位器 用于通过包含当输入低于阈值时调整的常数和相应的预定移位量的量来右移x和y数据通路的元件。
    • 12. 发明授权
    • Reordering discrete fourier transform outputs
    • 重新排列离散傅立叶变换输出
    • US08484275B1
    • 2013-07-09
    • US11952717
    • 2007-12-07
    • Martin LanghammerNeil Kenneth Thorne
    • Martin LanghammerNeil Kenneth Thorne
    • G06F15/00
    • G06F17/142
    • There is provided a method for generating a table for reordering the output of a Fourier transform, the Fourier transform being performed on a predefined number of input samples, the method comprising performing one or more decomposition stages on a sequence corresponding in number to the predefined number of input samples to form a representation of the output of the Fourier transform; wherein at least one of the decomposition stages comprises a composite operation that is equivalent to two or more operations; and rearranging the representation of the output of the Fourier transform to generate a reordering table.
    • 提供了一种用于生成用于对傅里叶变换的输出进行重新排序的表格的方法,所述傅立叶变换是在预定数量的输入样本上执行的,所述方法包括在与预定数量相对应的序列上执行一个或多个分解阶段 的输入样本以形成傅里叶变换的输出的表示; 其中所述分解阶段中的至少一个包括等效于两个或更多个操作的复合操作; 并重新排列傅立叶变换的输出的表示以产生重排序表。
    • 13. 发明申请
    • DOUBLE-CLOCKED SPECIALIZED PROCESSING BLOCK IN AN INTEGRATED CIRCUIT DEVICE
    • 集成电路设备中的双时钟专用处理块
    • US20120233230A1
    • 2012-09-13
    • US13044680
    • 2011-03-10
    • Martin Langhammer
    • Martin Langhammer
    • G06F7/00
    • G06F7/5324
    • Circuitry for increasing the precision of multipliers by a desired factor while limiting the increase in arithmetic complexity of the multiplier to that factor can be provided in a fixed logic device, or can be configured into a programmable integrated circuit device such as a programmable logic device (PLD). The smaller increase in arithmetic complexity, so that the increase is proportional to the increase in precision, rather than to the square of the increase in precision, is achieved by using specialized processing block components differently on alternating clock cycles. For example, to implement double precision, the same multiplier components are used in each of two clock cycles, but some specialized processing block internal structures (e.g., shifters and adders) are used differently in the two cycles, so that over the two cycles, a larger multiplication may be calculated from smaller partial products.
    • 可以在固定逻辑器件中提供用于将乘法器的精度提高所需因数的电路,同时将乘法器的算术复杂度的增加限制为固定逻辑器件,或者可以配置成可编程集成电路器件,例如可编程逻辑器件( PLD)。 算术复杂度的增加较小,因此,通过在交替的时钟周期中不同地使用专门的处理块组件来实现增加与精度的增加成比例,而不是精度增加的平方。 例如,要实现双精度,在两个时钟周期的每一个中使用相同的乘法器组件,但是在两个周期中使用了一些专门的处理块内部结构(例如,移位器和加法器),因此在两个周期中, 可以从较小的部分乘积计算较大的乘积。
    • 15. 发明授权
    • FPGA configuration bitstream encryption using modified key
    • FPGA配置比特流加密使用修改密钥
    • US07984292B1
    • 2011-07-19
    • US12559287
    • 2009-09-14
    • Keone StreicherDavid JeffersonJuju JoyceMartin Langhammer
    • Keone StreicherDavid JeffersonJuju JoyceMartin Langhammer
    • H04L29/06G06F15/16
    • H04L9/0822H04L9/0631H04L9/065H04L9/0861H04L2209/24
    • Circuits, methods, and apparatus that prevent detection and erasure of a configuration bitstream or other data for an FPGA or other device. An exemplary embodiment of the present invention masks a user key in order to prevent its detection. In a specific embodiment, the user key is masked by software that performs a function on it a first number of times. The result is used to encrypt a configuration bitstream. The user key is also provided to an FPGA or other device, where the function is performed a second number of times and the result stored. When the device is configured, the result is retrieved, the function is performed on it the first number of times less the second number of times and then it is used to decrypt the configuration bitstream. A further embodiment uses a one-time programmable fuse (OTP) array to prevent erasure or modification.
    • 阻止对FPGA或其他设备的配置比特流或其他数据的检测和擦除的电路,方法和装置。 本发明的示例性实施例掩盖用户密钥以防止其检测。 在具体实施例中,用户密钥被第一次执行功能的软件掩码。 结果用于加密配置比特流。 用户密钥还提供给FPGA或其他设备,其中功能被执行第二次并且存储结果。 当配置设备时,将检索结果,该功能在其上执行第一次次数少于第二次,然后用于解密配置比特流。 另一实施例使用一次性可编程熔丝(OTP)阵列来防止擦除或修改。
    • 16. 发明授权
    • Adder-rounder circuitry for specialized processing block in programmable logic device
    • 用于可编程逻辑器件中专用处理块的加法器电路
    • US07822799B1
    • 2010-10-26
    • US11426403
    • 2006-06-26
    • Martin LanghammerTriet M. NguyenYi-Wen Lin
    • Martin LanghammerTriet M. NguyenYi-Wen Lin
    • G06F7/38
    • G06F7/509G06F7/49963G06F7/5016G06F7/508
    • Adder/rounder circuitry for use in a programmable logic device computes a rounded sum quickly, and ideally within one clock cycle. The rounding position is selectable within a range of bit positions. In an input stage, for each bit position in that range, bits from both addends and a rounding bit are processed, while for each bit position outside that range only bits from both addends are processed. The input stage processing aligns its output in a common format for bits within and outside the range. The input processing may include 3:2 compression for bit positions within the range and 2:2 compression for bit positions outside the range, so that further processing is performed for all bit positions on a sum vector and a carry vector. Computation of the sum proceeds substantially simultaneously with and without the rounding input, and rounding logic makes a selection later in the computation.
    • 用于可编程逻辑器件的加法器/圆形电路可以快速计算舍入的并且理想地在一个时钟周期内计算。 舍入位置可在位位置范围内选择。 在输入级中,对于该范围内的每个位位置,处理来自两个加数和舍入位的位,而对于该范围之外的每个位位置,只处理来自两个加数的位。 输入级处理以范围内和外的位的通用格式对齐其输出。 输入处理可以包括在该范围内的比特位置的3:2压缩,以及在该范围之外的比特位置的2:2压缩,使得对和矢量和进位向量的所有比特位置执行进一步的处理。 总和的计算基本上与舍入输入同时进行,并且舍入逻辑在计算中稍后进行选择。
    • 19. 发明授权
    • Logic cell supporting addition of three binary words
    • 逻辑单元支持添加三个二进制字
    • US07565388B1
    • 2009-07-21
    • US10718968
    • 2003-11-21
    • Gregg BaecklerMartin LanghammerJames SchleicherRichard Yuan
    • Gregg BaecklerMartin LanghammerJames SchleicherRichard Yuan
    • G06F7/38G06F7/50
    • G06F7/509H03K19/1733
    • Logic circuits that support the addition of three binary numbers using hardwired adders are described. In one embodiment, this is accomplished by using a 3:2 compressor (i.e., a Carry Save Adder method), using hardwired adders to add the sums and carrys produced by the 3:2 compression, and sharing carrys data calculated in one logic element (“LE”) with the following LE. In such an embodiment, with the exception of the first and last LEs in a logic array block (“LAB”), each LE in effect lends one look-up table (“LUT”) to the LE below (i.e., the following LE) and borrows one LUT from the LE above (i.e., the previous LE). The LUT being lent or borrowed is one that implements the carry function in the 3:2 compressor model. In another aspect, an embodiment of the present invention provides LEs that include selectors to select signals corresponding to the addition of three binary numbers mode.
    • 描述了支持使用硬连线加法器添加三个二进制数的逻辑电路。 在一个实施例中,这是通过使用3:2压缩器(即,进位保存加法器方法)来实现的,其使用硬连线加法器来添加由3:2压缩产生的和和携带,并且共享携带在一个逻辑元件中计算的数据 (“LE”)与以下LE。 在这样的实施例中,除了逻辑阵列块(“LAB”)中的第一个和最后一个LE之外,每个LE有效地将一个查找表(“LUT”)提供给下面的LE(即,下面的LE )并从上面的LE借用一个LUT(即,先前的LE)。 借出或借用的LUT是在3:2压缩机模型中实现进位功能的LUT。 在另一方面,本发明的实施例提供了包括选择器的LE,用于选择对应于三进制数模式的添加的信号。