ATE377215T1 - Paralleles multiprocessing für die fast fourier- transformation mit pipelinearchitektur - Google Patents

Paralleles multiprocessing für die fast fourier- transformation mit pipelinearchitektur

Info

Publication number
ATE377215T1
ATE377215T1 AT01924134T AT01924134T ATE377215T1 AT E377215 T1 ATE377215 T1 AT E377215T1 AT 01924134 T AT01924134 T AT 01924134T AT 01924134 T AT01924134 T AT 01924134T AT E377215 T1 ATE377215 T1 AT E377215T1
Authority
AT
Austria
Prior art keywords
parallel processors
fast fourier
dft
length
parallel
Prior art date
Application number
AT01924134T
Other languages
English (en)
Inventor
Marwan Jaber
Original Assignee
Jaber Associates L L C
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Jaber Associates L L C filed Critical Jaber Associates L L C
Application granted granted Critical
Publication of ATE377215T1 publication Critical patent/ATE377215T1/de

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/141—Discrete Fourier transforms
    • G06F17/142—Fast Fourier transforms, e.g. using a Cooley-Tukey type algorithm

Landscapes

  • Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computational Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Theoretical Computer Science (AREA)
  • Discrete Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Algebra (AREA)
  • Complex Calculations (AREA)
  • Radar Systems Or Details Thereof (AREA)
  • Measurement Of Resistance Or Impedance (AREA)
  • Investigating Or Analyzing Materials By The Use Of Magnetic Means (AREA)
AT01924134T 2000-03-10 2001-03-10 Paralleles multiprocessing für die fast fourier- transformation mit pipelinearchitektur ATE377215T1 (de)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US18841200P 2000-03-10 2000-03-10

Publications (1)

Publication Number Publication Date
ATE377215T1 true ATE377215T1 (de) 2007-11-15

Family

ID=22693032

Family Applications (1)

Application Number Title Priority Date Filing Date
AT01924134T ATE377215T1 (de) 2000-03-10 2001-03-10 Paralleles multiprocessing für die fast fourier- transformation mit pipelinearchitektur

Country Status (5)

Country Link
EP (1) EP1269346B1 (de)
AT (1) ATE377215T1 (de)
AU (1) AU2001250817A1 (de)
DE (1) DE60131152D1 (de)
WO (1) WO2001069424A2 (de)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100388699C (zh) * 2002-06-19 2008-05-14 中兴通讯股份有限公司 非对称数字用户环线系统中的离散傅里叶变换装置
EP1426872A3 (de) * 2002-12-03 2006-02-22 STMicroelectronics Ltd. Linear skalierbare FFT/IFFT Berechnung in einem Multiprozessorsystem
EP1447752A3 (de) * 2003-02-17 2006-02-22 STMicroelectronics Pvt. Ltd Verfahren und System zur Mehrfachprozessor-FFT/IFFT-Berechnung mit minimaler Zwischenprozessorkommunikation
US7774397B2 (en) * 2003-12-05 2010-08-10 STMicroelectronics (R&D) Ltd. FFT/IFFT processor
RU2388076C2 (ru) * 2006-04-03 2010-04-27 Общество с ограниченной ответственностью "Уральская Архитектурная Лаборатория" Способ размещения отсчетов быстрого преобразования фурье в памяти данных
EA030776B9 (ru) 2011-03-28 2019-01-31 Долби Лабораторис Лайсэнзин Корпорейшн Преобразование пониженной сложности для канала низкочастотных эффектов
WO2014108718A1 (en) * 2013-01-09 2014-07-17 Intel Corporation Continuous-flow conflict-free mixed-radix fast fourier transform in multi-bank memory
US20170344876A1 (en) * 2016-05-31 2017-11-30 Samsung Electronics Co., Ltd. Efficient sparse parallel winograd-based convolution scheme
CN113537480B (zh) * 2016-12-30 2024-04-02 上海寒武纪信息科技有限公司 用于执行lstm神经网络运算的装置和运算方法

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5034910A (en) * 1988-03-14 1991-07-23 E-Systems, Inc. Systolic fast Fourier transform method and apparatus
GB0001517D0 (en) * 2000-01-25 2000-03-15 Jaber Marwan Computational method and structure for fast fourier transform analizers

Also Published As

Publication number Publication date
DE60131152D1 (en) 2007-12-13
EP1269346B1 (de) 2007-10-31
WO2001069424A2 (en) 2001-09-20
WO2001069424A3 (en) 2002-02-28
AU2001250817A1 (en) 2001-09-24
EP1269346A2 (de) 2003-01-02

Similar Documents

Publication Publication Date Title
WO2001055896A3 (en) Butterfly-processing element for efficient fast fourier transform method and apparatus
ATE377215T1 (de) Paralleles multiprocessing für die fast fourier- transformation mit pipelinearchitektur
WO2014164298A3 (en) Vector processing engines having programmable data path configurations for providing multi-mode radix-2x butterfly vector processing circuits, and related vector processors, systems, and methods
CN107451097B (zh) 国产申威26010众核处理器上多维fft的高性能实现方法
Wang et al. Novel memory reference reduction methods for FFT implementations on DSP processors
CN104699624A (zh) 面向fft并行计算的无冲突存储访问方法
CN106933777A (zh) 基于国产申威26010处理器的基2一维fft的高性能实现方法
CN105718424A (zh) 一种并行快速傅立叶变换处理方法
EP1426872A3 (de) Linear skalierbare FFT/IFFT Berechnung in einem Multiprozessorsystem
Takahashi A parallel 1-D FFT algorithm for the Hitachi SR8000
Fan et al. Pruning fast Fourier transform algorithm design using group-based method
CN106095730B (zh) 一种基于指令级并行ilp和数据级并行dlp的fft浮点优化方法
Mansouri On the parallelization of integer polynomial multiplication
Skodras et al. Efficient computation of the split-radix FFT
Takahashi High-performance parallel FFT algorithms for the HITACHI SR8000
CN104572578B (zh) 用于显著改进微控制器中fft性能的新颖方法
Andrade et al. From opencl to gates: The fft
JP3709291B2 (ja) 高速複素フーリエ変換方法及び装置
Sun et al. A rational-expansion-based method to compute Gabor coefficients of 2D indicator functions supported on polygonal domain
Du et al. Research on the realization and optimization of FFTs in ARMv8 platform
Sahebi et al. A data-flow approach to accelerate real-valued fast fourier transform
Sun et al. A Design of a Power Specific Processor Based on RISC-V Architecture
Gong et al. Interval arithmetic-based FFT for large integer multiplication
Hsu et al. Parallel-computing approach for FFT implementation on digital signal processor (DSP)
Yu et al. Efficient Utilization of Vector Registers to Improve FFT Performance on SIMD Microprocessors

Legal Events

Date Code Title Description
RER Ceased as to paragraph 5 lit. 3 law introducing patent treaties