AR046869A1 - Arquitectura de fft y metodo. - Google Patents

Arquitectura de fft y metodo.

Info

Publication number
AR046869A1
AR046869A1 ARP040104527A ARP040104527A AR046869A1 AR 046869 A1 AR046869 A1 AR 046869A1 AR P040104527 A ARP040104527 A AR P040104527A AR P040104527 A ARP040104527 A AR P040104527A AR 046869 A1 AR046869 A1 AR 046869A1
Authority
AR
Argentina
Prior art keywords
fft
turn
memory
point
sample
Prior art date
Application number
ARP040104527A
Other languages
English (en)
Inventor
Raghuraman Krishnamoorthi
Chinnappa K Ganapathy
Original Assignee
Qualcomm Inc
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 Qualcomm Inc filed Critical Qualcomm Inc
Publication of AR046869A1 publication Critical patent/AR046869A1/es

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/14Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/14Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/141Discrete Fourier transforms
    • G06F17/142Fast Fourier transforms, e.g. using a Cooley-Tukey type algorithm
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/26Systems using multi-frequency codes
    • H04L27/2601Multicarrier modulation systems
    • H04L27/2647Arrangements specific to the receiver only
    • H04L27/2649Demodulators
    • H04L27/265Fourier transform demodulators, e.g. fast Fourier transform [FFT] or discrete Fourier transform [DFT] demodulators
    • H04L27/2651Modification of fast Fourier transform [FFT] or discrete Fourier transform [DFT] demodulators for performance improvement

Landscapes

  • Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Discrete Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Theoretical Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Algebra (AREA)
  • Databases & Information Systems (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Complex Calculations (AREA)

Abstract

Una implementación de hardware de la Transformada Rápida de Fourier (FFT) y el método proveen procesamiento de FFT eficaz mientras que minimiza el área de matriz en un Circuito Integrado (IC). El Hardware de FFT puede implementar un FFT de punto N, donde N = rn es una función de un radical (r). La implementación del hardware incluye una memoria de muestra que tiene N/r filas, cada una almacenando r muestras. Una memoria de factor de giro puede almacenar k factores de giro por fila, donde 0 < k < r representa el número de multiplicadores de giro complejos disponibles. Un módulo lee r filas de la memoria, lleva a cabo un FFT complejo de punto r en la muestra, seguido por multiplicación de giro, y escribe los resultados en un banco de registro r x r. Los contenidos del banco de registro están escritos en orden transpuesto devuelta en la memoria de muestra. Esta operación se repite N/r2 veces para cada etapa y luego repetido para n etapas para producir el FFT de punto N.
ARP040104527A 2003-12-05 2004-12-03 Arquitectura de fft y metodo. AR046869A1 (es)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US52719603P 2003-12-05 2003-12-05

Publications (1)

Publication Number Publication Date
AR046869A1 true AR046869A1 (es) 2005-12-28

Family

ID=34676710

Family Applications (1)

Application Number Title Priority Date Filing Date
ARP040104527A AR046869A1 (es) 2003-12-05 2004-12-03 Arquitectura de fft y metodo.

Country Status (17)

Country Link
US (1) US7702712B2 (es)
EP (1) EP1690196B1 (es)
JP (1) JP2007513431A (es)
KR (1) KR20060096511A (es)
CN (1) CN1914607A (es)
AR (1) AR046869A1 (es)
AT (1) ATE412220T1 (es)
AU (1) AU2004297978A1 (es)
BR (1) BRPI0417222A (es)
CA (1) CA2547488A1 (es)
DE (1) DE602004017351D1 (es)
ES (1) ES2315735T3 (es)
IL (1) IL176050A0 (es)
MX (1) MXPA06006391A (es)
RU (1) RU2006123934A (es)
TW (1) TW200534121A (es)
WO (1) WO2005057423A2 (es)

Families Citing this family (31)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7430575B2 (en) * 2003-12-19 2008-09-30 Fujitsu Limited One-dimensional fourier transform program, method and apparatus
US7720162B2 (en) * 2005-03-10 2010-05-18 Qualcomm Incorporated Partial FFT processing and demodulation for a system with multiple subcarriers
US8266196B2 (en) * 2005-03-11 2012-09-11 Qualcomm Incorporated Fast Fourier transform twiddle multiplication
US8229014B2 (en) * 2005-03-11 2012-07-24 Qualcomm Incorporated Fast fourier transform processing in an OFDM system
WO2007066964A1 (en) * 2005-12-08 2007-06-14 Electronics And Telecommunications Research Institute Memory address generating method and twiddle factor generator using the same
KR100762281B1 (ko) * 2005-12-08 2007-10-01 한국전자통신연구원 고속 푸리에 변환 시스템의 메모리 주소 생성 방법 및 그를이용한 트위들 팩터 생성 장치
US7702713B2 (en) * 2006-03-24 2010-04-20 Debashis Goswami High speed FFT hardware architecture for an OFDM processor
US20070239815A1 (en) * 2006-04-04 2007-10-11 Qualcomm Incorporated Pipeline fft architecture and method
US20070266070A1 (en) * 2006-05-12 2007-11-15 Chung Hua University Split-radix FFT/IFFT processor
US8503545B2 (en) * 2006-08-31 2013-08-06 Advanced Micro Devices, Inc. I/Q imbalance compensation
KR100836624B1 (ko) 2006-12-08 2008-06-10 한국전자통신연구원 가변 고속 푸리에 변환 장치 및 그 방법
US8738680B2 (en) 2008-03-28 2014-05-27 Qualcomm Incorporated Reuse engine with task list for fast fourier transform and method of using the same
US8959133B2 (en) * 2008-04-18 2015-02-17 Nxp, B.V. System and method for configurable mixed radix FFT architecture for multimode device
EP2332072A1 (en) * 2008-09-10 2011-06-15 Co-operative Research Centre For Advanced Automotive Technology Ltd. Method and device for computing matrices for discrete fourier transform (dft) coefficients
CN101478785B (zh) * 2009-01-21 2010-08-04 华为技术有限公司 资源池管理系统及信号处理方法
CN102238348B (zh) * 2010-04-20 2014-02-05 上海华虹集成电路有限责任公司 一种可变数据个数的fft/ifft处理器的基4模块
TWI402695B (zh) * 2010-07-12 2013-07-21 Novatek Microelectronics Corp 分裂基數-2/8快速傅立葉轉換裝置及方法
CN102339272A (zh) * 2010-07-16 2012-02-01 联咏科技股份有限公司 分裂基数-2/8快速傅立叶转换装置及方法
US8819097B2 (en) * 2011-09-09 2014-08-26 Texas Instruments Incorporated Constant geometry split radix FFT
US8825729B1 (en) * 2011-09-19 2014-09-02 Altera Corporation Power and bandwidth efficient FFT for DDR memory
US9275013B2 (en) * 2012-03-16 2016-03-01 Qualcomm Incorporated System and method for analysis and reconstruction of variable pulse-width signals having low sampling rates
KR101335367B1 (ko) * 2012-04-26 2013-12-02 숭실대학교산학협력단 메모리 제어 장치 및 방법
US9275014B2 (en) * 2013-03-13 2016-03-01 Qualcomm Incorporated 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
US9098449B2 (en) 2013-03-15 2015-08-04 Analog Devices, Inc. FFT accelerator
US9311274B2 (en) * 2013-10-17 2016-04-12 Texas Instruments Incorporated Approach for significant improvement of FFT performance in microcontrollers
US20180373676A1 (en) * 2017-03-16 2018-12-27 Jaber Technology Holdings Us Inc. Apparatus and Methods of Providing an Efficient Radix-R Fast Fourier Transform
US10783216B2 (en) 2018-09-24 2020-09-22 Semiconductor Components Industries, Llc Methods and apparatus for in-place fast Fourier transform
CN109558638B (zh) * 2018-10-23 2023-03-24 清华大学 Fft处理器
US11221397B2 (en) * 2019-04-05 2022-01-11 Texas Instruments Incorporated Two-dimensional FFT computation
KR20200143030A (ko) 2019-06-14 2020-12-23 한국전자통신연구원 입력 신호의 특정 주파수 성분들을 분석하기 위한 고속 푸리에 변환 장치
CN115859003A (zh) * 2021-09-27 2023-03-28 华为技术有限公司 执行fft的方法、装置及设备

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS59189474A (ja) 1983-04-13 1984-10-27 Yokogawa Medical Syst Ltd 高速フ−リエ変換演算装置
JP3749022B2 (ja) * 1997-09-12 2006-02-22 シャープ株式会社 高速フーリエ変換を用いて短い待ち時間でアレイ処理を行う並列システム
US6088714A (en) * 1998-07-27 2000-07-11 Agilent Technologies Mechanism for calculating one-dimensional fast fourier transforms
US6839728B2 (en) * 1998-10-09 2005-01-04 Pts Corporation Efficient complex multiplication and fast fourier transform (FFT) implementation on the manarray architecture
US6609140B1 (en) * 1999-11-30 2003-08-19 Mercury Computer Systems, Inc. Methods and apparatus for fast fourier transforms
KR100481852B1 (ko) * 2002-07-22 2005-04-11 삼성전자주식회사 고속 푸리에 변환 장치

Also Published As

Publication number Publication date
CA2547488A1 (en) 2005-06-23
ATE412220T1 (de) 2008-11-15
MXPA06006391A (es) 2006-08-23
JP2007513431A (ja) 2007-05-24
DE602004017351D1 (de) 2008-12-04
KR20060096511A (ko) 2006-09-11
WO2005057423A3 (en) 2006-06-01
US20050182806A1 (en) 2005-08-18
IL176050A0 (en) 2006-10-05
BRPI0417222A (pt) 2007-02-21
ES2315735T3 (es) 2009-04-01
EP1690196A2 (en) 2006-08-16
RU2006123934A (ru) 2008-01-10
WO2005057423A2 (en) 2005-06-23
CN1914607A (zh) 2007-02-14
AU2004297978A1 (en) 2005-06-23
US7702712B2 (en) 2010-04-20
EP1690196B1 (en) 2008-10-22
TW200534121A (en) 2005-10-16

Similar Documents

Publication Publication Date Title
AR046869A1 (es) Arquitectura de fft y metodo.
Cvitanovic et al. Symmetry decomposition of chaotic dynamics
EP0797212A3 (en) Semiconductor device and memory system
EP2228727A3 (en) Programmable processor and method with wide operations
KR920015370A (ko) 반도체 기억장치
EP0535244B1 (en) Quasi radix-16 processor and method
ATE436050T1 (de) Pipeline-asynchron-anweisungs-prozessorschaltun
JP2005522804A (ja) 素因数分解アルゴリズムを用いる最適化された離散フーリエ変換方法および装置
ATE468564T1 (de) Verbindungen in simd-prozessorarchitekturen
DK0543860T3 (da) Digital processor til simulering af driften af et parallelt behandlingsarray
EP1378914A3 (en) Semiconductor memory device
ATE494582T1 (de) Speicherarchitektur
DE602005017360D1 (de) Fifo-speicherbaustein mit nichtflüchtiger speicherstufe
ATE81731T1 (de) Vektorschlange in computern mit vektorregister.
US6438568B1 (en) Method and apparatus for optimizing conversion of input data to output data
Yoshiara A classification of flag-transitive classical c. C2-geometries by means of generators and relations
US6772183B1 (en) Device for converting input data to output data using plural converters
TH71582A (th) วิธีการและสถาปัตยกรรมการแปลงฟูเรียร์แบบเร็ว
RU2388076C2 (ru) Способ размещения отсчетов быстрого преобразования фурье в памяти данных
WO2003071518A3 (en) Method of storing data-elements
ATE443887T1 (de) Datenverarbeitungssystem mit mehreren registerbänke
KR20060087657A (ko) 전치 메모리와 셔플 메모리를 사용하여 메모리 효율성을 높인 파이프라인 방식의 8192-point FFT 프로세서
Smith Some Results on Words in Two Dimensions
SE9804033L (sv) Digital minnesstruktur och -anordning samt metoder för dess hantering
RU2347267C1 (ru) Устройство поиска информации

Legal Events

Date Code Title Description
FA Abandonment or withdrawal