JP2008506191A5 - - Google Patents
Download PDFInfo
- Publication number
- JP2008506191A5 JP2008506191A5 JP2007520491A JP2007520491A JP2008506191A5 JP 2008506191 A5 JP2008506191 A5 JP 2008506191A5 JP 2007520491 A JP2007520491 A JP 2007520491A JP 2007520491 A JP2007520491 A JP 2007520491A JP 2008506191 A5 JP2008506191 A5 JP 2008506191A5
- Authority
- JP
- Japan
- Prior art keywords
- architecture
- unit
- butterfly
- reconfigurable
- stage
- Prior art date
- Legal status (The legal status 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 status listed.)
- Pending
Links
Claims (30)
1つまたは複数のバタフライ・ユニットを含むように構成され配置された計算ユニットと、
前記計算ユニットの出力に結合され、前記変換の少なくとも1つの段階向けの前記バタフライ演算をすべて実施するように構成され配置された1つまたは複数の乗算器を含むブロックと、
各バタフライ演算を実施する前記計算ユニットにより使用される、前記バタフライ演算の中間結果と所定の係数とを格納するように構成され配置された記憶ユニットとを備え、前記記憶ユニットはメモリおよび多重化アーキテクチャを含んでおり、さらに、
前記段階用にただ1つの計算ユニットが必要とされるように、前記変換の前記バタフライ演算すべてを前記一段階向けの前記計算ユニットを用いて時分割するように構成され配置されたマルチプレクサ・ユニットと、
前記計算ユニットに係数を与え、前記記憶ユニット内のメモリのサイズおよび多重化アーキテクチャを制御するように構成され配置されたコントローラとを備え、
各段階用の、前記乗算器の係数、前記計算ユニットの前記係数、メモリのサイズ、および多重化アーキテクチャが、Nの値に応じて修正されることを特徴とする再構成可能なアーキテクチャ。 A reconfigurable architecture that performs fast orthogonal transformation of vectors in multiple stages, the size of the vector is N, N may vary, and the number of stages is a function of N;
A computing unit constructed and arranged to include one or more butterfly units;
A block including one or more multipliers coupled to the output of the computing unit and configured and arranged to perform all the butterfly operations for at least one stage of the transformation;
Are more used to the calculation unit implementing the butterfly operation, wherein configured to store the intermediate result and a predetermined coefficient of the butterfly operation and an arranged storage unit, said storage unit is a memory and multiplexing and Nde including the architecture, further,
So that only one calculation unit for pre Symbol steps are required, the conversion of the butterfly operation all configured to divide that time by using the computing unit of said one stage for arranged multiplexer unit When,
A controller configured and arranged to provide coefficients to the computing unit and to control the size and multiplexing architecture of the memory in the storage unit;
A reconfigurable architecture , characterized in that for each stage the coefficients of the multiplier, the coefficients of the computing unit, the size of the memory and the multiplexing architecture are modified according to the value of N.
1つまたは複数のバタフライ・ユニットを含むように構成され配置された計算ユニットと、
前記計算ユニットの出力に結合され、前記変換の少なくとも1つの段階向けの前記バタフライ演算をすべて実施するように構成され配置された1つまたは複数の乗算器を含むブロックと、
各バタフライ演算を実施する前記計算ユニットにより使用される、前記バタフライ演算の中間結果と所定の係数とを格納するように構成され配置された記憶ユニットとを備え、前記記憶ユニットはメモリおよび多重化アーキテクチャを含んでおり、さらに、
前記段階用にただ1つの計算ユニットが必要とされるように、前記変換の前記バタフライ演算すべてを前記一段階向けの前記計算ユニットを用いて時分割するように構成され配置されたマルチプレクサ・ユニットと、
前記計算ユニットに係数を与え、前記記憶ユニット内のメモリのサイズおよび多重化アーキテクチャを制御するように構成され配置されたコントローラとを備え、
各段階用の、前記乗算器の係数、前記計算ユニットの前記係数、メモリのサイズ、および多重化アーキテクチャが、Nの値に応じて修正されることを特徴とする集積チップ。 An integrated chip with a reconfigurable architecture that performs fast orthogonal transformation of vectors in multiple stages, the size of the vector is N, N may vary, and the number of stages is a function of N; The architecture is
A computing unit constructed and arranged to include one or more butterfly units;
A block comprising one or more multipliers coupled to the output of the computing unit and configured and arranged to perform all the butterfly operations for at least one stage of the transformation;
Are more used to the calculation unit implementing the butterfly operation, wherein configured to store the intermediate result and a predetermined coefficient of the butterfly operation and an arranged storage unit, said storage unit is a memory and multiplexing and Nde including the architecture, further,
So that only one calculation unit for pre Symbol steps are required, the conversion of the butterfly operation all configured to divide that time by using the computing unit of said one stage for arranged multiplexer unit When,
A controller configured and arranged to provide coefficients to the computing unit and to control the size and multiplexing architecture of the memory in the storage unit;
For each stage, coefficients of the multiplier, wherein the coefficient calculation unit, integrated chip size of the memory, and multiplexing architecture, characterized in that it is modified according to the value of N.
1つまたは複数のバタフライ・ユニットを含むように計算ユニットを構成し配置し、前記計算ユニットの出力に結合された1つまたは複数の乗算器を含むようにブロックを構成し配列し、そして、前記変換の少なくとも1つの段階向けの前記バタフライ演算をすべて実施するように前記1つまたは複数のバタフライ・ユニットと1つまたは複数の乗算器とを構成し配列し、
各バタフライ演算を実施する前記計算ユニットにより使用される、前記バタフライ演算の中間結果と所定の係数とを記憶ユニットに格納することを含み、前記記憶ユニットはメモリおよび多重化アーキテクチャを含んでおり、さらに、
前記段階用にただ1つの計算ユニットが必要とされるように、前記変換の前記バタフライ演算すべてを前記一段階向けの前記計算ユニットを用いて時分割し、そして、
前記計算ユニットに係数を与え、前記記憶ユニット内のメモリのサイズおよび多重化アーキテクチャを制御することを含み、
各段階用の、前記乗算器の係数、前記計算ユニットの前記係数、メモリのサイズ、および多重化アーキテクチャが、Nの値に応じて修正されることを特徴とする方法。 A method for performing a fast orthogonal transformation of a vector in multiple stages, where the size of the vector is N, N may vary, the number of stages is a function of N,
Configuring and arranging a computing unit to include one or more butterfly units, configuring and arranging a block to include one or more multipliers coupled to the output of the computing unit; and Configuring and arranging the one or more butterfly units and one or more multipliers to perform all the butterfly operations for at least one stage of the transformation ;
Are more used to the calculation unit implementing the respective butterfly operation includes storing the intermediate result and a predetermined coefficient of the butterfly operation in a storage unit, said storage unit is Nde including a memory and multiplexing architecture, In addition ,
So that only one calculation unit for pre Symbol step is required, dividing the time all the butterfly operation of the conversion by using the computing unit of said one stage for, and,
Providing coefficients to the computing unit and controlling the size and multiplexing architecture of the memory in the storage unit;
For each stage, coefficients of the multiplier, wherein said coefficient of said computing unit, the size of the memory, and multiplexing architecture, characterized in that it is modified according to the value of N.
少なくとも1つの計算ユニットが前記変換の少なくとも1つの段階向けの前記バタフライ演算すべてを実施することができるよう、前記少なくとも1つの計算ユニットが少なくとも1つのバタフライ・ユニットと前記バタフライ・ユニットの出力に結合された乗算器とを含むように構成し配列するように、構成され配置された、再構成可能な一群のバタフライ・ユニットと再構成可能な1組の乗算器、及び、前記バタフライ演算の中間結果および各バタフライ演算の実施において使用するために所定の係数を格納するよう前記計算ユニットに結合された再構成可能なメモリ、を使用することを含み、
各段階用の係数およびメモリのサイズが、Nの値に応じて修正されることを特徴とする方法。 A method for performing a fast orthogonal transformation of a vector in multiple stages, where the size of the vector is N, N may vary, the number of stages is a function of N,
Cormorant by at least one calculation unit capable of performing the butterfly operation all of the at least one stage for the pre-Symbol conversion, the output of the at least one calculation unit and at least one butterfly unit said butterfly unit as coupled configured to include a multiplier arranged, it is constructed and arranged, reconfigurable set of butterfly units and reconfigurable set of multipliers, and said butterfly operation intermediate comprises using the result and the memory, reconfigurable coupled to by cormorants before Symbol calculating unit storing predetermined coefficients for use in the practice of the butterfly operation,
A method , characterized in that the coefficients for each stage and the size of the memory are modified according to the value of N.
少なくとも1つの計算ユニットが前記変換の少なくとも1つの段階向けの前記バタフライ演算すべてを実施することができるよう、前記少なくとも1つの計算ユニットが少なくとも1つのバタフライ・ユニットと前記バタフライ・ユニットの出力に結合された乗算器とを含むように構成し配列するように、構成され配置された、再構成可能な一群のバタフライ・ユニットと再構成可能な1組の乗算器、及び、前記バタフライ演算の中間結果および各バタフライ演算の実施において使用するために所定の係数を格納するよう前記計算ユニットに結合された再構成可能なメモリを含み、
各段階用の係数およびメモリのサイズが、Nの値に応じて修正されることを特徴とするシステム。 A system that performs fast orthogonal transformation of a vector in multiple stages, the size of the vector is N, N may vary, the number of stages is a function of N,
Cormorant by at least one calculation unit capable of performing the butterfly operation all of the at least one stage for the pre-Symbol conversion, the output of the at least one calculation unit and at least one butterfly unit said butterfly unit as coupled configured to include a multiplier arranged, it is constructed and arranged, reconfigurable set of butterfly units and reconfigurable set of multipliers, and said butterfly operation intermediate including the results and the reconfigurable memory coupled to by cormorants before Symbol calculating unit storing predetermined coefficients for use in the practice of the butterfly operation,
A system , characterized in that the coefficients for each stage and the size of the memory are modified according to the value of N.
Applications Claiming Priority (7)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US58639004P | 2004-07-08 | 2004-07-08 | |
US58638904P | 2004-07-08 | 2004-07-08 | |
US58635304P | 2004-07-08 | 2004-07-08 | |
US58639104P | 2004-07-08 | 2004-07-08 | |
US60425804P | 2004-08-25 | 2004-08-25 | |
US11/071,340 US7568059B2 (en) | 2004-07-08 | 2005-03-03 | Low-power reconfigurable architecture for simultaneous implementation of distinct communication standards |
PCT/US2005/024063 WO2006014528A1 (en) | 2004-07-08 | 2005-07-08 | A method of and apparatus for implementing fast orthogonal transforms of variable size |
Publications (2)
Publication Number | Publication Date |
---|---|
JP2008506191A JP2008506191A (en) | 2008-02-28 |
JP2008506191A5 true JP2008506191A5 (en) | 2008-08-21 |
Family
ID=35787416
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
JP2007520491A Pending JP2008506191A (en) | 2004-07-08 | 2005-07-08 | Method and apparatus for performing variable size fast orthogonal transform |
Country Status (6)
Country | Link |
---|---|
EP (1) | EP1769391A1 (en) |
JP (1) | JP2008506191A (en) |
KR (1) | KR101162649B1 (en) |
AU (1) | AU2005269896A1 (en) |
CA (1) | CA2563450A1 (en) |
WO (1) | WO2006014528A1 (en) |
Families Citing this family (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2009110022A1 (en) * | 2008-03-03 | 2009-09-11 | 富士通株式会社 | Wireless communication device |
FR2935819B1 (en) * | 2008-09-05 | 2010-09-10 | Commissariat Energie Atomique | DIGITAL PROCESSING DEVICE FOR FOURIER TRANSFORMATION AND FINAL IMPULSE RESPONSE FILTERING |
CN102737007B (en) * | 2011-04-07 | 2015-01-28 | 中兴通讯股份有限公司 | Method and device supporting random replacement of plurality of data units |
JPWO2013042249A1 (en) * | 2011-09-22 | 2015-03-26 | 富士通株式会社 | Fast Fourier transform circuit |
WO2013042249A1 (en) * | 2011-09-22 | 2013-03-28 | 富士通株式会社 | Fast fourier transform circuit |
KR101275087B1 (en) | 2011-10-28 | 2013-06-17 | (주)에프씨아이 | Ofdm receiver |
US9525579B2 (en) | 2012-07-18 | 2016-12-20 | Nec Corporation | FFT circuit |
JP6288089B2 (en) | 2013-07-23 | 2018-03-07 | 日本電気株式会社 | Digital filter device, digital filter processing method, and storage medium storing digital filter program |
JP6489021B2 (en) | 2013-12-13 | 2019-03-27 | 日本電気株式会社 | Digital filter device, digital filter processing method, and digital filter program |
GB2548908B (en) * | 2016-04-01 | 2019-01-30 | Advanced Risc Mach Ltd | Complex multiply instruction |
KR102155770B1 (en) * | 2018-11-27 | 2020-09-14 | 한국항공대학교산학협력단 | Scalable fast Fourier transform apparatus and method based on twice perfect shuffle network for radar applications |
CN113111300B (en) * | 2020-01-13 | 2022-06-03 | 上海大学 | Fixed point FFT implementation system with optimized resource consumption |
US20230029006A1 (en) | 2020-02-06 | 2023-01-26 | Mitsubishi Electric Corporation | Complex multiplication circuit |
Family Cites Families (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE3854818T2 (en) * | 1987-08-21 | 1996-05-15 | Commw Scient Ind Res Org | TRANSFORMATION PROCESSING CIRCUIT |
US5293330A (en) * | 1991-11-08 | 1994-03-08 | Communications Satellite Corporation | Pipeline processor for mixed-size FFTs |
WO1997019412A1 (en) * | 1995-11-17 | 1997-05-29 | Teracom Svensk Rundradio | Improvements in or relating to real-time pipeline fast fourier transform processors |
US6003056A (en) * | 1997-01-06 | 1999-12-14 | Auslander; Lewis | Dimensionless fast fourier transform method and apparatus |
JPH11143860A (en) | 1997-11-07 | 1999-05-28 | Matsushita Electric Ind Co Ltd | Orthogonal transformer |
US6061705A (en) * | 1998-01-21 | 2000-05-09 | Telefonaktiebolaget Lm Ericsson | Power and area efficient fast fourier transform processor |
JP2001156644A (en) * | 1999-11-29 | 2001-06-08 | Fujitsu Ltd | Orthogonal transform device |
JP3846197B2 (en) * | 2001-01-19 | 2006-11-15 | ソニー株式会社 | Arithmetic system |
US20030055861A1 (en) * | 2001-09-18 | 2003-03-20 | Lai Gary N. | Multipler unit in reconfigurable chip |
JP4546711B2 (en) * | 2002-10-07 | 2010-09-15 | パナソニック株式会社 | Communication device |
-
2005
- 2005-07-08 WO PCT/US2005/024063 patent/WO2006014528A1/en active Application Filing
- 2005-07-08 AU AU2005269896A patent/AU2005269896A1/en not_active Abandoned
- 2005-07-08 EP EP05768342A patent/EP1769391A1/en not_active Withdrawn
- 2005-07-08 CA CA002563450A patent/CA2563450A1/en not_active Abandoned
- 2005-07-08 JP JP2007520491A patent/JP2008506191A/en active Pending
- 2005-07-08 KR KR1020077003027A patent/KR101162649B1/en not_active IP Right Cessation
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP2008506191A5 (en) | ||
US6366936B1 (en) | Pipelined fast fourier transform (FFT) processor having convergent block floating point (CBFP) algorithm | |
KR101162649B1 (en) | A method of and apparatus for implementing fast orthogonal transforms of variable size | |
US20080071848A1 (en) | In-Place Radix-2 Butterfly Processor and Method | |
CN103955447B (en) | FFT accelerator based on DSP chip | |
JP4163178B2 (en) | Optimized discrete Fourier transform method and apparatus using prime factorization algorithm | |
US6317770B1 (en) | High speed digital signal processor | |
KR20110081971A (en) | Method and device for computing matrices for discrete fourier transform coefficients | |
KR20090127462A (en) | Fast fourier transform/inverse fast fourier transform operating core | |
US20100128818A1 (en) | Fft processor | |
CN109783766A (en) | A kind of Fast Fourier Transform (FFT) hardware design methods of 2-base algorithm | |
US7653676B2 (en) | Efficient mapping of FFT to a reconfigurable parallel and pipeline data flow machine | |
Singh et al. | Design of radix 2 butterfly structure using vedic multiplier and CLA on xilinx | |
Sanjeet et al. | Comparison of real-valued FFT architectures for low-throughput applications using FPGA | |
Cheng et al. | Low-cost fast VLSI algorithm for discrete Fourier transform | |
US6728742B1 (en) | Data storage patterns for fast fourier transforms | |
KR20220017638A (en) | Fast Fourier transform device and method using real valued as input | |
EP3066582A1 (en) | FFT device and method for performing a Fast Fourier Transform | |
TW201724089A (en) | Frequency domain adaptive filter system with second-order sliding discrete fourier transform | |
Nikara et al. | Discrete cosine and sine transforms—regular algorithms and pipeline architectures | |
Ranganathan et al. | Efficient hardware implementation of scalable FFT using configurable Radix-4/2 | |
Goodman et al. | A hardware implementation of the discrete Pascal transform for image processing | |
CN104572578B (en) | Novel method for significantly improving FFT performance in microcontrollers | |
CN110750249B (en) | Method and device for generating fast Fourier transform code | |
Naresh et al. | A Novel Architecture for Radix-4 Pipelined FFT Processor using Vedic Mathematics Algorithm |