CN101277283B - Fast Fourier Transform Butterfly Device - Google Patents

Fast Fourier Transform Butterfly Device Download PDF

Info

Publication number
CN101277283B
CN101277283B CN2007100648777A CN200710064877A CN101277283B CN 101277283 B CN101277283 B CN 101277283B CN 2007100648777 A CN2007100648777 A CN 2007100648777A CN 200710064877 A CN200710064877 A CN 200710064877A CN 101277283 B CN101277283 B CN 101277283B
Authority
CN
China
Prior art keywords
real
unit
result
formula
addition
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.)
Active
Application number
CN2007100648777A
Other languages
Chinese (zh)
Other versions
CN101277283A (en
Inventor
亓中瑞
陈杰
张�浩
邱昕
刘壹
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Institute of Microelectronics of CAS
Original Assignee
Institute of Microelectronics of CAS
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 Institute of Microelectronics of CAS filed Critical Institute of Microelectronics of CAS
Priority to CN2007100648777A priority Critical patent/CN101277283B/en
Publication of CN101277283A publication Critical patent/CN101277283A/en
Application granted granted Critical
Publication of CN101277283B publication Critical patent/CN101277283B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Complex Calculations (AREA)

Abstract

The invention belongs to the technical field of communication, and particularly relates to an efficient implementation method for a fast Fourier transform butterfly unit. The operation of one branch of the butterfly unit is completed by adopting two real number multipliers and three/five real number adders in two periods through the known rotation factor in the butterfly unit and the design idea of a pipeline structure. The method comprises the following steps: 1) a real number adder unit 701 that completes addition of input data; 2) a real multiplier unit 702 that multiplies the addition result by the twiddle factor; 3) and a real number adder and delay control unit 703 for performing addition, delay and control operations on the data obtained by the unit 702. The method can be widely applied to the realization of fast Fourier transform.

Description

The fast Flourier transformation butterfly type device
Technical field
The invention belongs to communication technical field, particularly a kind of fast Flourier transformation butterfly type device.
Background technology
Fast fourier transform is a kind of way of realization rapidly and efficiently of Fourier transform, and is widely used in the various systems, as OFDM (OFDM) system, radar system, input and estimating system etc.This technology has made full use of the periodicity and the symmetry of Fourier transform twiddle factor, thereby has significantly reduced the computation complexity of Fourier transform and realized cost, therefore gets more and more people's extensive concerning.
For a long time, people have carried out extensive and deep research to fast fourier transform, mainly concentrate on algorithm and the architecture design.Butterfly type unit, as the engine of fast fourier transform, its design is the resource and the speed of decision fast Fourier transform unit directly, this shows it is considerable.Therefore how how the realization butterfly type unit of high-efficiency compact improves calculation process speed under the prerequisite of utilizing resource less, then becomes a very significant thing.
Summary of the invention
The object of the present invention is to provide a kind of butterfly type unit of fast fourier transform.Fast Fourier transform unit provided by the invention can be widely used in various needs and carry out in the system of Fourier transform.
For achieving the above object, fast Flourier transformation butterfly type device provided by the invention, it comprises:
A) real number adder unit is used for the data addition with input, and the number of basic 2 o'clock adders is one, and the number of basic 4 o'clock adders is three, and addition result is given to the real multipliers unit;
B) real multipliers unit, the result and the twiddle factor that are used for the real number adder unit is sent here multiply each other, and the result is delivered to real add musical instruments used in a Buddhist or Taoist mass and delay control unit;
C) real add musical instruments used in a Buddhist or Taoist mass and delay control unit are used for the result that the real multipliers unit obtains is postponed addition, obtain operation result; Wherein:
The real number adder unit will be sent into the data of butterfly type unit and divide the order addition respectively of real imaginary part, G r, G iData are real in order to import, the result of imaginary part addition, and N is the number of input data, I Nr, I NiReal, imaginary part for the input data;
G r = Σ n = 0 N - 1 I nr Formula 1
G i = Σ n = 0 N - 1 I ni Formula 2
The result that the real number adder unit is delivered in the real multipliers unit respectively with real, the imaginary part R of twiddle factor r, R iMultiply each other and obtain H Rr, H Ri, H IrAnd H Ii
H Rr=G rR rFormula 3
H Ri=G rR iFormula 4
H Ir=G iR rFormula 5
H Ii=G iR iFormula 6
Real add musical instruments used in a Buddhist or Taoist mass and delay control unit are finished the delay control addition of the real multipliers unit being delivered to data, the RB as a result that obtains expecting in two cycles r, RB i:
RB r=H Rr-H IiFormula 7
RB i=H Ri+ H IrFormula 8
RB=RB r+ jRB iFormula 9
Wherein, RB is branch's result of calculation,
Figure GSB00000137878400031
Whole process needs 2 cycles to finish altogether, owing to adopted the mode of 4 grades of flowing water, therefore needs the delay in 4 cycles.
Described fast Flourier transformation butterfly type device, wherein, the real number adder unit will deliver to butterfly type unit data real part or imaginary part is carried out addition.
The inventive method can be in two cycles, only need under the prerequisite of two real multipliers and three/five real add musical instruments used in a Buddhist or Taoist mass, finish branch's computing of base 2 or basic 4 fast Flourier transformation butterfly type devices, owing to adopted the The pipeline design structure thought, therefore the hardware of designing has the sequential compactness, the resource utilization height, advantage such as speed is fast, and have application scenario widely.
Description of drawings
For further specifying technical characterictic of the present invention, below in conjunction with embodiment and accompanying drawing the present invention is done a detailed description, wherein:
Fig. 1 is the frame structure schematic diagram of fast Fourier transform unit.
Fig. 2 is the structural representation of frequency domain base 4 fast Flourier transformation butterfly type devices.
Fig. 3 is the hardware implementation structure schematic diagram of frequency domain base 4 butterfly type units one branch.
Embodiment
The efficient implementation method that is used for the fast Flourier transformation butterfly type device of the present invention can utilized under the prerequisite of resource as far as possible less, realizes the high usage of resource and the speed of raising system by streamline.The total plurality of units once of this implementation method, comprising:
Make full use of the design philosophy of the known and pipeline organization of twiddle factor, proposed a kind of efficient, the hardware implementation method of simple fast Flourier transformation butterfly type device, method feature comprises:
1) the real number adder unit 701, are used for the data addition with input, and the number of basic 2 o'clock adders is one, and the number of basic 4 o'clock adders is three, and the result gives 702;
2) the real multipliers unit 702, and the result and the twiddle factor that are used for Unit 701 are sent here multiply each other, and the result is delivered to 703;
3) real add musical instruments used in a Buddhist or Taoist mass and delay control unit 703 are used for the result that Unit 702 obtain is postponed addition, obtain operation result;
See also Fig. 1, the frame structure schematic diagram of fast Fourier transform unit, comprising:
1) memory cell 101,102,103,104, are used for input, temporary and dateout.
2) get conjugate unit 201,202, complex data is got conjugation, finish the switching between FFT and IFFT.
3) MUX301,302 is used to cooperate and gets conjugate unit and finish switching between FFT and IFFT.
4) address-generation unit 400, are used to produce the needed address date of memory cell and twiddle factor unit.
5) the twiddle factor unit 500, are used to export the required twiddle factor of computing.
6) main control unit 600, are used to control the co-ordination of each unit, with memory cell, get conjugate unit, MUX, address-generation unit and butterfly type unit and all be related.
7) butterfly type unit 700, are used for finishing the work of treatment of each grade of fast fourier transform butterfly type unit.
See also Fig. 2, the structural representation of frequency domain base 4 fast Flourier transformation butterfly type devices, this figure is an example with the fast Flourier transformation butterfly type device that frequency domain base 4 extracts, provide butterfly type unit and form a basic schematic diagram of structure, owing to be that therefore base 4 comprises 4 branches in this unit, each bar branch is similarly except that the addition part is slightly had any different basically, and therefore the mode that all can adopt Fig. 3 to provide is realized.
See also Fig. 3, the hardware implementation structure schematic diagram of frequency domain base 4 butterfly type units one branch.Comprising:
1) the real number adder unit 701, divide the order addition respectively of real imaginary part, G with the data of sending into butterfly type unit r, G iData are real in order to import, the result of imaginary part addition, and N is the number of input data, I Nr, I NiReal, imaginary part for the input data;
G r = Σ n = 0 N - 1 I nr - - - ( 1 )
G i = Σ n = 0 N - 1 I ni - - - ( 2 )
2) the real multipliers unit 702, be used for result that Unit 701 are delivered to respectively with real, the imaginary part R of twiddle factor r, R iMultiply each other and obtain H Rr, H Ri, H IrAnd H Ii
H rr=G r·R r (3)
H ri=G r·R i (4)
H ir=G i·R r (5)
H ii=G i·R i (6)
3) real add musical instruments used in a Buddhist or Taoist mass and delay control unit 703 its role is to finish the delay control addition of Unit 702 being delivered to data, the RB as a result that obtains expecting in two cycles r, RB i:
RB r=H rr-H ii (7)
RB i=H ri+H ir (8)
RB = R B r + jR B r , ( j = - 1 ) - - - ( 9 )
Wherein, RB is branch's result of calculation.Whole process needs 2 cycles to finish altogether, owing to adopted the mode of 4 grades of flowing water, therefore needs the delay in 4 cycles.

Claims (2)

1. fast Flourier transformation butterfly type device, it comprises:
A) real number adder unit is used for the data addition with input, and the number of basic 2 o'clock adders is one, and the number of basic 4 o'clock adders is three, and addition result is given to the real multipliers unit;
B) real multipliers unit, the result and the twiddle factor that are used for the real number adder unit is sent here multiply each other, and the result is delivered to real add musical instruments used in a Buddhist or Taoist mass and delay control unit; And
C) real add musical instruments used in a Buddhist or Taoist mass and delay control unit are used for the result that the real multipliers unit obtains is postponed addition, obtain operation result; Wherein:
The real number adder unit will be sent into the data of butterfly type unit and divide the order addition respectively of real imaginary part, G r, G iData are real in order to import, the result of imaginary part addition, and N is the number of input data, I Nr, I NiReal, imaginary part for the input data;
G r = Σ n = 0 N - 1 I nr Formula 1
G i = Σ n = 0 N - 1 I ni Formula 2
The result that the real number adder unit is delivered in the real multipliers unit respectively with real, the imaginary part R of twiddle factor r, R iMultiply each other and obtain H Rr, H Ri, H IrAnd H Ii
H Rr=G rR rFormula 3
H Ri=G rR iFormula 4
H Ir=G iR rFormula 5
H Ii=G iR iFormula 6
Real add musical instruments used in a Buddhist or Taoist mass and delay control unit are finished the delay control addition of the real multipliers unit being delivered to data, the RB as a result that obtains expecting in two cycles r, RB i:
RB r=H Rr-H IiFormula 7
RB i=H Ri+ H IrFormula 8
RB=RB r+ jRB iFormula 9
Wherein, RB is branch's result of calculation,
Figure FSB00000137878300021
Whole process needs 2 cycles to finish altogether, owing to adopted the mode of 4 grades of flowing water, therefore needs the delay in 4 cycles.
2. fast Flourier transformation butterfly type device according to claim 1, wherein, the real number adder unit will deliver to butterfly type unit data real part or imaginary part is carried out addition.
CN2007100648777A 2007-03-28 2007-03-28 Fast Fourier Transform Butterfly Device Active CN101277283B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2007100648777A CN101277283B (en) 2007-03-28 2007-03-28 Fast Fourier Transform Butterfly Device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2007100648777A CN101277283B (en) 2007-03-28 2007-03-28 Fast Fourier Transform Butterfly Device

Publications (2)

Publication Number Publication Date
CN101277283A CN101277283A (en) 2008-10-01
CN101277283B true CN101277283B (en) 2010-10-20

Family

ID=39996299

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2007100648777A Active CN101277283B (en) 2007-03-28 2007-03-28 Fast Fourier Transform Butterfly Device

Country Status (1)

Country Link
CN (1) CN101277283B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102339271A (en) * 2010-07-15 2012-02-01 中国科学院微电子研究所 8-based fast Fourier transform implementation system and method
CN102810086A (en) * 2011-05-30 2012-12-05 中国科学院微电子研究所 Fast Fourier transform butterfly type operation processing device and data processing method
CN103631759B (en) 2012-08-22 2018-02-13 中兴通讯股份有限公司 A kind of device and method for realizing FFT/DFT

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1477802A (en) * 2003-07-10 2004-02-25 上海交通大学 Method for defining parallel dual butterfly computation fast Fourier transform processor structure
CN1486001A (en) * 2002-09-23 2004-03-31 ���ǿƼ��ɷ����޹�˾ Pipelined low complexity fft/ifft processor
US20050278405A1 (en) * 2004-04-05 2005-12-15 Jaber Associates, L.L.C. Fourier transform processor
CN1932800A (en) * 2005-09-15 2007-03-21 中国科学院微电子研究所 Asynchronous Fast Fourier Transform Processor Circuit

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1486001A (en) * 2002-09-23 2004-03-31 ���ǿƼ��ɷ����޹�˾ Pipelined low complexity fft/ifft processor
CN1477802A (en) * 2003-07-10 2004-02-25 上海交通大学 Method for defining parallel dual butterfly computation fast Fourier transform processor structure
US20050278405A1 (en) * 2004-04-05 2005-12-15 Jaber Associates, L.L.C. Fourier transform processor
CN1932800A (en) * 2005-09-15 2007-03-21 中国科学院微电子研究所 Asynchronous Fast Fourier Transform Processor Circuit

Also Published As

Publication number Publication date
CN101277283A (en) 2008-10-01

Similar Documents

Publication Publication Date Title
CN101834581B (en) Filtering apparatus, filtering method, program, and surround processor
CN109522674A (en) The Fast Fourier Transform (FFT) hardware design methods of base 2-2 algorithm
CN101149730B (en) Optimized discrete Fourier transform method and apparatus using prime factor algorithm
CN101847137B (en) FFT processor for realizing 2FFT-based calculation
CN101930425A (en) Signal processing method, data processing method and device
CN101277283B (en) Fast Fourier Transform Butterfly Device
Wang et al. Novel memory reference reduction methods for FFT implementations on DSP processors
CN105095152B (en) A kind of 128 configurable point FFT devices
CN102364456A (en) 64-point fast Fourier transform (FFT) calculator
CN100576200C (en) A kind of fraction Fourier conversion implementation method based on multisampling
CN104657334A (en) FFT (Fast Fourier Transform) radix-2-4-8 mixed-radix butterfly operator and application thereof
CN102637124A (en) Device and method for parallel processing of radix 4 FFT (fast Fourier transform) algorithm
CN103262067B (en) A kind of data processing method, data processing equipment and communication system
CN104268124A (en) FFT (Fast Fourier Transform) implementing device and method
CN108628805A (en) A kind of butterfly processing element and processing method, fft processor of low-power consumption
Swarztrauber et al. Bluestein's FFT for arbitrary n on the hypercube
Su et al. Reconfigurable FFT design for low power OFDM communication systems
CN114201725B (en) Narrowband communication signal processing method based on multimode reconfigurable FFT
CN101833540B (en) Signal processing method and device
CN105791197A (en) Pulse shaping filter for offset orthogonal multicarrier system
CN106649200B (en) One kind being based on time-multiplexed auto-correlation computation VLSI design method
CN105137176A (en) Signal harmonic analysis method for using fast triangular-form Fourier transform
Tsai et al. Power-efficient continuous-flow memory-based FFT processor for WiMax OFDM mode
CN101741801B (en) Structure for implementing DFT of 32-channel parallel data
TW201227351A (en) Recursive modified discrete cosine transform and inverse discrete cosine transform system with a computing kernel of RDFT

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20190905

Address after: 100029 Beijing city Chaoyang District Beitucheng West Road No. 3

Patentee after: Beijing Zhongke micro Investment Management Co.,Ltd.

Address before: 100029 Beijing city Chaoyang District Beitucheng West Road No. 3

Patentee before: Institute of Microelectronics of the Chinese Academy of Sciences

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20200423

Address after: 264315 No. 788 Laoshan South Road, Rongcheng, Weihai, Shandong.

Patentee after: China core (Rongcheng) Information Technology Industry Research Institute Co.,Ltd.

Address before: 100029 Beijing city Chaoyang District Beitucheng West Road No. 3

Patentee before: Beijing Zhongke micro Investment Management Co.,Ltd.

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20230720

Address after: 100029 Beijing city Chaoyang District Beitucheng West Road No. 3

Patentee after: Institute of Microelectronics of the Chinese Academy of Sciences

Address before: 264315 No. 788 Laoshan South Road, Rongcheng, Weihai, Shandong.

Patentee before: China core (Rongcheng) Information Technology Industry Research Institute Co.,Ltd.