会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method for computing a fast fourier transform and associated circuit for addressing a data memory
    • US06629117B2
    • 2003-09-30
    • US10126602
    • 2002-06-05
    • Yair AizenbergYue-Peng Zheng
    • Yair AizenbergYue-Peng Zheng
    • G06F1714
    • G06F17/142
    • The present invention is generally directed to a novel method of computing a fast Fourier transform (FFT), and an associated circuit that controls the addressing of a data memory of the FFT processing circuit. The novel method operates by computing all complex butterfly operations in a given stage of computations, before computing any of the complex butterfly operations in a subsequent stage. Further, and within any given computation stage, the method performs by computing all other complex butterfly operations in a given stage of computations having a twiddle factor equal to the first twiddle value of that stage, before computing any other complex butterfly operations in the given stage of computations. Thereafter, subsequent computations are performed in the same way. More particularly, after computing a first set of complex butterfly operations (each having the same twiddle value) in a given computation stage, a first complex butterfly operation (having a different twiddle value) of a second set of complex butterfly operations, is computed in that stage. Thereafter, all remaining complex butterfly operations (having the same value) in that stage will be computed. This methodology will be repeated until all butterfly operations are calculated in each stage. An addressing circuit is also provided for addressing a data memory in a system for computing a FFT, the system having a data memory for storing data values and a coefficient memory for storing coefficient values.
    • 2. 发明授权
    • Circuit and method for computing a fast fourier transform
    • 用于计算快速傅里叶变换的电路和方法
    • US06615227B2
    • 2003-09-02
    • US10247144
    • 2002-09-19
    • Yair AizenbergDaniel AmranyYue-Peng Zheng
    • Yair AizenbergDaniel AmranyYue-Peng Zheng
    • G06F1714
    • G06F17/142
    • A processing circuit is disclosed for computing a fast Fourier transform (FFT). In one embodiment, the processing circuit includes a memory device, a multiplier, a detector, a state machine, and a circuit for performing the 2's compliment of a coefficient. The memory storage device stores data values and coefficient (or twiddle) values. The detector integrates a data pointer with the state machine. The detector is designed to identify the symmetry lines (by memory address). The state machine, when notified by the detector that a line of symmetry has been encountered, appropriately adjusts either the coefficients, the imaginary sign, or the real sign for input to a multiplier.
    • 公开了一种用于计算快速傅里叶变换(FFT)的处理电路。 在一个实施例中,处理电路包括一个存储器件,一个乘法器,一个检测器,一个状态机以及一个用于执行2的系数的补偿的电路。 存储器存储设备存储数据值和系数(或旋转)值。 检测器将数据指针与状态机集成。 检测器设计用于识别对称线(通过存储器地址)。 状态机当被检测器通知已经遇到对称线时,适当地调整系数,虚拟符号或输入到乘法器的真实符号。
    • 3. 发明授权
    • Circuit and method for computing a fast fourier transform
    • 用于计算快速傅里叶变换的电路和方法
    • US06477554B1
    • 2002-11-05
    • US09398636
    • 1999-09-17
    • Yair AizenbergDaniel AmranyYue-Peng Zheng
    • Yair AizenbergDaniel AmranyYue-Peng Zheng
    • G06F1714
    • G06F17/142
    • A process circuit is disclosed for computing a fast Fourier transform (FFT). In one embodiment, the processing circuit includes a memory device, a multiplier, a detector, a state machine, and a circuit for performing the 2's compliment of a coefficient. The memory storage device stores data values and coefficient (or twiddle) values. The detector integrates a date pointer with the state machine. The detector is designed to identify the symmetry lines (by memory address). The state machine, when notified by the detector that a line of symmetry has been encountered, appropriately adjusts either the coefficients, the imaginary sign, or the real sign for input to a multiplier.
    • 公开了一种用于计算快速傅里叶变换(FFT)的处理电路。 在一个实施例中,处理电路包括一个存储器件,一个乘法器,一个检测器,一个状态机以及一个用于执行2的系数的补偿的电路。 存储器存储设备存储数据值和系数(或旋转)值。 检测器将日期指针与状态机集成。 检测器设计用于识别对称线(通过存储器地址)。 状态机当被检测器通知已经遇到对称线时,适当地调整系数,虚拟符号或输入到乘法器的真实符号。
    • 4. 发明授权
    • Multi-mode buffer for digital signal processor
    • 用于数字信号处理器的多模式缓冲器
    • US06065127A
    • 2000-05-16
    • US152441
    • 1998-09-14
    • Yair AizenbergDaniel Amrany
    • Yair AizenbergDaniel Amrany
    • G06F9/38G06F13/38
    • G06F9/3869
    • The present invention is generally directed to a multi-mode buffer that is configurable to control output delivered to an input, with a variable clock cycle delay. For example, the buffer may be controlled, in one mode to deliver input data to an output, at a one clock cycle delay (i.e., output data at next clock edge). In another mode, the buffer may be controlled to deliver input data to an output, at a two clock cycle delay. In accordance with one aspect of the present invention, the buffer includes a clock input, a data input, a control input, and an output. The input and the output may be of variable bit width. For example, 8 bits, 16 bits, or some other bit width. The buffer further includes circuitry for delivering data on the data input to the output in response to the clock input. In this regard, the buffer includes circuitry responsive to the control input to vary a delay in delivering the data input to the output, such that the delay may be one clock cycle, two clock cycles, or some other desired length.
    • 本发明一般涉及一种多模式缓冲器,其可配置为以可变的时钟周期延迟来控制传送到输入端的输出。 例如,可以在一个时钟周期延迟(即在下一个时钟边沿输出数据)的一种模式中控制缓冲器以将输入数据传送到输出。 在另一种模式中,缓冲器可以被控制,以两个时钟周期的延迟将输入数据传送到输出端。 根据本发明的一个方面,缓冲器包括时钟输入,数据输入,控制输入和输出。 输入和输出可以是可变的位宽。 例如,8位,16位或其他位宽。 缓冲器还包括用于响应于时钟输入将数据输入到输出端的数据输出的电路。 在这方面,缓冲器包括响应于控制输入以改变将数据输入传送到输出的延迟的电路,使得延迟可以是一个时钟周期,两个时钟周期或一些其它期望的长度。
    • 5. 发明授权
    • Method for computing a fast fourier transform and associated circuit for addressing a data memory
    • US06490672B1
    • 2002-12-03
    • US09311964
    • 1999-05-14
    • Yair AizenbergYue-Peng Zheng
    • Yair AizenbergYue-Peng Zheng
    • G06F1200
    • G06F17/142
    • The present invention is generally directed to a novel method of computing a fast Fourier transform (FFT), and an associated circuit that controls the addressing of a data memory of the FFT processing circuit. The novel method operates by computing all complex butterfly operations in a given stage of computations, before computing any of the complex butterfly operations in a subsequent stage. Further, and within any given computation stage, the method performs by computing all other complex butterfly operations in a given stage of computations having a twiddle factor equal to the first twiddle value of that stage, before computing any other complex butterfly operations in the given stage of computations. Thereafter, subsequent computations are performed in the same way. More particularly, after computing a first set of complex butterfly operations (each having the same twiddle value) in a given computation stage, a first complex butterfly operation (having a different twiddle value) of a second set of complex butterfly operations, is computed in that stage. Thereafter, all remaining complex butterfly operations (having the same value) in that stage will be computed. This methodology will be repeated until all butterfly operations are calculated in each stage. An addressing circuit is also provided for addressing a data memory in a system for computing a FFT, the system having a data memory for storing data values and a coefficient memory for storing coefficient values.