CN108182169B - Method for realizing high-efficiency FFT in MTD filter - Google Patents

Method for realizing high-efficiency FFT in MTD filter Download PDF

Info

Publication number
CN108182169B
CN108182169B CN201711363764.7A CN201711363764A CN108182169B CN 108182169 B CN108182169 B CN 108182169B CN 201711363764 A CN201711363764 A CN 201711363764A CN 108182169 B CN108182169 B CN 108182169B
Authority
CN
China
Prior art keywords
data
chip memory
fft
address
sequence
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
CN201711363764.7A
Other languages
Chinese (zh)
Other versions
CN108182169A (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.)
Beijing Microelectronic Technology Institute
Mxtronics Corp
Original Assignee
Beijing Microelectronic Technology Institute
Mxtronics Corp
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 Beijing Microelectronic Technology Institute, Mxtronics Corp filed Critical Beijing Microelectronic Technology Institute
Priority to CN201711363764.7A priority Critical patent/CN108182169B/en
Publication of CN108182169A publication Critical patent/CN108182169A/en
Application granted granted Critical
Publication of CN108182169B publication Critical patent/CN108182169B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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
    • G06F17/141Discrete Fourier transforms
    • G06F17/142Fast 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)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Theoretical Computer Science (AREA)
  • Discrete Mathematics (AREA)
  • Algebra (AREA)
  • Databases & Information Systems (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Radar Systems Or Details Thereof (AREA)
  • Static Random-Access Memory (AREA)

Abstract

A method for realizing high-efficiency FFT in an MTD filter relates to the field of radar digital signal processing; the method comprises the following steps: performing FFT operation on received data by adopting an FFT arithmetic unit, and outputting the data after the FFT operation to an on-chip storage management unit; step two, the on-chip memory management unit writes the calculated data into the off-chip memory according to the address sequence which is generated by the jump of the counter and used for accessing the off-chip memory; and step three, the on-chip memory management unit reads back data from the off-chip memory according to the form of the read-back data written in as required and the address sequence generated by the jump of the counter and used for accessing the off-chip memory or the address sequence generated by the jump of the counter and inverted sequence and successfully arranged, and sends the data to the FFT arithmetic unit. The invention saves the on-chip SRAM memory with the capacity of 8 multiplied by 2Mb, greatly reduces the chip design scale and the power consumption, and improves the chip reliability.

Description

Method for realizing high-efficiency FFT in MTD filter
Technical Field
The invention relates to the field of radar digital signal processing, in particular to a high-efficiency FFT implementation method in an MTD filter.
Background
FFT (fast Fourier transform) is a very important processing means in radar digital signal processing, and in a Moving Target Detection (MTD) clutter suppression technology which is widely applied at present, FFT is a core operation unit for rapidly and successfully detecting a target.
The work block diagram of the conventional way that the FFT processes the data comprises an FFT IP core and a data interface. The FFT IP core in the traditional mode comprises an FFT operation module and a reverse order memory, wherein after FFT operation is completed on input natural (reverse) order data, the reverse order data is inverted by the reverse order memory and then is output to an off-chip memory through a data interface, and the data interface only has a data transmission function. Although the FFT IP core in the traditional mode has high operation efficiency, the defects are as follows: when each frame of 32 Kx 64bit radar signal data is processed, in order to realize the function of the inverted sequence, a 2Mb inverted sequence memory is required to be configured in the chip, and when 8 FFTs are adopted to simultaneously process data, the capacity of the inverted sequence memory is expanded to 16Mb, so that the scale and the power consumption of the chip are sharply increased, and the reliability of the chip is greatly reduced.
Disclosure of Invention
The invention aims to overcome the defects in the prior art, and provides a method for realizing high-efficiency FFT in an MTD filter, which saves an on-chip SRAM memory with the capacity of 8 multiplied by 2Mb, greatly reduces the design scale and power consumption of a chip, and improves the reliability of the chip.
The above purpose of the invention is realized by the following technical scheme:
a method for realizing high-efficiency FFT in an MTD filter comprises the following steps:
performing FFT operation on received data by adopting an FFT arithmetic unit, and outputting the data after the FFT operation to an on-chip storage management unit;
step two, the on-chip memory management unit writes the calculated data into the off-chip memory according to the address sequence which is generated by the jump of the counter and used for accessing the off-chip memory;
and step three, the on-chip memory management unit reads back data from the off-chip memory according to the form of the read-back data written in as required and the address sequence generated by the jump of the counter and used for accessing the off-chip memory or the address sequence generated by the jump of the counter and inverted sequence and successfully arranged, and sends the data to the FFT arithmetic unit.
In the above method for implementing high-efficiency FFT in an MTD filter, in the step (one), the data includes natural-order data and inverted-order data; when the FFT arithmetic unit receives the natural sequence data, the inverted sequence data is generated after the FFT arithmetic unit carries out operation; when the FFT arithmetic unit receives the inverted sequence data, the natural sequence data is generated after the FFT arithmetic unit carries out operation.
In the above method for implementing high-efficiency FFT in an MTD filter, in the step (one), the operation capability of the FFT operator is 32K × 64 bits.
In the above method for implementing high-efficiency FFT in an MTD filter, in the step (two), the counter is represented as a row address, a bank address and a col address from high order to low order.
In the above method for implementing high-efficiency FFT in an MTD filter, in the step (three),
when the on-chip memory management unit needs to read back data from the off-chip memory according to the writing sequence, the data is read back and sent to the FFT arithmetic unit according to the address sequence which is generated by the jump of the counter and accesses the off-chip memory;
when the on-chip memory management unit needs to read back data from the off-chip memory according to the inverted sequence mode, the data are read back and sent to the FFT arithmetic unit according to the address sequence generated by the jump of the counter and used for accessing the off-chip memory after inverted sequence power arrangement.
In the above method for implementing high-efficiency FFT in an MTD filter, in the step (three), the method for performing the inverted sequence power arrangement on the address sequence accessing the off-chip memory generated by the counter jump includes: and exchanging the high and low bits of the address sequence for accessing the off-chip memory generated by the jump of the counter.
In the above method for implementing high-efficiency FFT in an MTD filter, in the step (three), the exchanged address sequences are a col address, a bank address, and a row address from the high order to the low order.
Compared with the prior art, the invention has the following advantages:
(1) the invention cancels a reverse order memory required after the traditional FFT operation in the MTD filter, saves the on-chip SRAM memory with the capacity of 8 multiplied by 2Mb, greatly reduces the chip design scale and the power consumption, and improves the chip reliability.
Drawings
FIG. 1 is a flow chart of an efficient FFT implementation of the present invention;
fig. 2 is a schematic block diagram of an efficient FFT implementation of the present invention.
Detailed Description
The invention is described in further detail below with reference to the following figures and specific examples:
the invention overcomes the defects of the prior art and provides a high-efficiency FFT implementation method in an MTD filter, for a 32K-point FFT IP core used in a Moving Target Detection (MTD) filter bank, an on-chip storage management unit (MMU) high-efficiency read-write control mode is utilized, data after FFT operation is firstly written into an off-chip memory out of order/in sequence, and then the data is read out of order/out of order as required. By adopting the method, the inverted sequence SRAM with the capacity of 2Mb in a single 32K-point FFT IP core (the maximum supports 8 FFTs, the on-chip SRAM with the capacity of 16Mb can be saved) can be saved, and the design scale and the power consumption can be effectively reduced.
As shown in fig. 1, which is a flowchart of a method for implementing an efficient FFT, it can be known that a method for implementing an efficient FFT in an MTD filter includes the following steps:
step (one), as shown in fig. 2, which is a schematic block diagram for implementing high-efficiency FFT, it can be known that an FFT operator is used to perform FFT operation on received data, and the calculated data is output to an on-chip storage management unit; the data comprises natural-order data and inverted-order data; when the FFT arithmetic unit receives the natural sequence data, the inverted sequence data is generated after the FFT arithmetic unit carries out operation; when the FFT arithmetic unit receives the inverted sequence data, the natural sequence data is generated after the FFT arithmetic unit carries out operation; the FFT operator has an arithmetic capability of 32K × 64 bits.
Step two, the on-chip memory management unit writes the calculated data into the off-chip memory according to the address sequence which is generated by the jump of the counter and used for accessing the off-chip memory; the counters are represented from high order to low order as row address, bank address and col address, respectively.
And step three, the on-chip memory management unit reads back data from the off-chip memory according to the form of the read-back data written in as required and the address sequence generated by the jump of the counter and used for accessing the off-chip memory or the address sequence generated by the jump of the counter and inverted sequence and successfully arranged, and sends the data to the FFT arithmetic unit.
When the on-chip memory management unit needs to read back data from the off-chip memory according to the writing sequence, the data is read back and sent to the FFT arithmetic unit according to the address sequence which is generated by the jump of the counter and accesses the off-chip memory;
when the on-chip memory management unit needs to read back data from the off-chip memory according to the inverted sequence mode, the data are read back and sent to the FFT arithmetic unit according to the address sequence generated by the jump of the counter and used for accessing the off-chip memory after inverted sequence power arrangement.
The method for carrying out the inverted sequence power arrangement on the address sequence generated by the jump of the counter and used for accessing the off-chip memory comprises the following steps: and exchanging the high and low bits of the address sequence for accessing the off-chip memory generated by the jump of the counter. The exchanged address sequences are respectively a col address, a bank address and a row address from high order to low order.
Meanwhile, in order to solve the problem that the access conflict of activating the bank next time is caused by insufficient precharging time after the same bank access operation, high and low bits of a row address and a bank address are locally exchanged.
Those skilled in the art will appreciate that those matters not described in detail in the present specification are well known in the art.

Claims (5)

1. A method for realizing high-efficiency FFT in an MTD filter is characterized in that: the method comprises the following steps:
performing FFT operation on received data by adopting an FFT arithmetic unit, and outputting the data after the FFT operation to an on-chip storage management unit; the operation capacity of the FFT operator is 32 Kx 64 bits;
step two, the on-chip memory management unit writes the calculated data into the off-chip memory according to the address sequence which is generated by the jump of the counter and used for accessing the off-chip memory;
thirdly, the on-chip memory management unit reads back data from the off-chip memory and sends the data to the FFT arithmetic unit according to the form of the read-back data written in by the need and the address sequence generated by the jump of the counter and used for accessing the off-chip memory or the address sequence generated by the jump of the counter and inverted sequence order successfully arranged;
when the on-chip memory management unit needs to read back data from the off-chip memory according to the writing sequence, the data is read back and sent to the FFT arithmetic unit according to the address sequence which is generated by the jump of the counter and accesses the off-chip memory;
when the on-chip memory management unit needs to read back data from the off-chip memory according to the inverted sequence mode, the data are read back and sent to the FFT arithmetic unit according to the address sequence generated by the jump of the counter and used for accessing the off-chip memory after inverted sequence power arrangement.
2. The method of claim 1, wherein the method comprises: in the step (one), the data includes natural order data and inverted order data; when the FFT arithmetic unit receives the natural sequence data, the inverted sequence data is generated after the FFT arithmetic unit carries out operation; when the FFT arithmetic unit receives the inverted sequence data, the natural sequence data is generated after the FFT arithmetic unit carries out operation.
3. The method of claim 2, wherein the method comprises: in the step (two), the counter is respectively expressed as a row address, a bank address and a col address from high order to low order.
4. The method of claim 3, wherein the method comprises: in the step (three), the method for performing the inverted sequence power arrangement on the address sequence generated by the jump of the counter and used for accessing the off-chip memory comprises the following steps: and exchanging the high and low bits of the address sequence for accessing the off-chip memory generated by the jump of the counter.
5. The method of claim 4, wherein the method comprises: in the step (three), the exchanged address sequences are respectively a col address, a bank address and a row address from high order to low order.
CN201711363764.7A 2017-12-18 2017-12-18 Method for realizing high-efficiency FFT in MTD filter Active CN108182169B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711363764.7A CN108182169B (en) 2017-12-18 2017-12-18 Method for realizing high-efficiency FFT in MTD filter

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711363764.7A CN108182169B (en) 2017-12-18 2017-12-18 Method for realizing high-efficiency FFT in MTD filter

Publications (2)

Publication Number Publication Date
CN108182169A CN108182169A (en) 2018-06-19
CN108182169B true CN108182169B (en) 2021-06-08

Family

ID=62546358

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711363764.7A Active CN108182169B (en) 2017-12-18 2017-12-18 Method for realizing high-efficiency FFT in MTD filter

Country Status (1)

Country Link
CN (1) CN108182169B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109712268B (en) * 2018-12-13 2022-01-04 北京遥测技术研究所 High-speed aircraft black-barrier area data measurement processing method and processor
CN111198789B (en) * 2019-12-20 2023-06-09 北京时代民芯科技有限公司 Verification method of FFT hardware implementation module

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101072218A (en) * 2007-03-01 2007-11-14 华为技术有限公司 FFT/IFFI paired processing system, method and its device and method
CN101729463A (en) * 2008-10-24 2010-06-09 中兴通讯股份有限公司 Hardware device and method for implementing Fourier transform and Fourier inverse transform
CN103838704A (en) * 2014-03-20 2014-06-04 南京大学 FFT accelerator with high throughput rate
CN104698446A (en) * 2015-03-06 2015-06-10 西安电子科技大学 Radar echo filtering method based on moving target detection
CN105488753A (en) * 2015-11-27 2016-04-13 武汉精测电子技术股份有限公司 Method and device for carrying out two-dimensional Fourier transform and inverse transform on image
CN107358165A (en) * 2017-06-15 2017-11-17 深圳市泰和安科技有限公司 Method, terminal device and computer-readable recording medium based on FFT filtering

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AUPR881001A0 (en) * 2001-11-12 2001-12-06 Lake Technology Limited Low latency computation in real time utilizing a dsp processor

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101072218A (en) * 2007-03-01 2007-11-14 华为技术有限公司 FFT/IFFI paired processing system, method and its device and method
CN101729463A (en) * 2008-10-24 2010-06-09 中兴通讯股份有限公司 Hardware device and method for implementing Fourier transform and Fourier inverse transform
CN103838704A (en) * 2014-03-20 2014-06-04 南京大学 FFT accelerator with high throughput rate
CN104698446A (en) * 2015-03-06 2015-06-10 西安电子科技大学 Radar echo filtering method based on moving target detection
CN105488753A (en) * 2015-11-27 2016-04-13 武汉精测电子技术股份有限公司 Method and device for carrying out two-dimensional Fourier transform and inverse transform on image
CN107358165A (en) * 2017-06-15 2017-11-17 深圳市泰和安科技有限公司 Method, terminal device and computer-readable recording medium based on FFT filtering

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
基于ADSP21XX C 运行环境下FFT 的实现;卢江;《微电子技术》;20031031;第31卷(第5期);第33-36页 *

Also Published As

Publication number Publication date
CN108182169A (en) 2018-06-19

Similar Documents

Publication Publication Date Title
CN108182169B (en) Method for realizing high-efficiency FFT in MTD filter
US9026746B2 (en) Signal control device and signal control method
US9075765B2 (en) State change in systems having devices coupled in a chained configuration
CN106776458B (en) Communication device and communication method between DSPs (digital Signal processors) based on FPGA (field programmable Gate array) and HPI (high Performance Integrated interface)
US20050033875A1 (en) System and method for selectively affecting data flow to or from a memory device
CN105511981A (en) Method for rapidly detecting NAND Flash memory
CN103208314A (en) Internal memory test method of embedded system and embedded system
US11137939B2 (en) Semiconductor memory device and operating method thereof
CN103389413B (en) A kind of real-time statistical method of spectral histogram
CN101853198B (en) Detection method, equipment and system of address bus
CN106158012A (en) Sequential processing method, on-chip SRAM and the FPGA of FPGA on-chip SRAM
CN104932830A (en) Information processing method and electronic device
CN103500149A (en) Direct memory access controller and direct memory access control method
CN105487953A (en) Bus performance analysis method and apparatus
CN104035898A (en) Memory access system based on VLIW (Very Long Instruction Word) type processor
CN102033823B (en) Method and device for storing data
CN102646073B (en) Data processing method and device
CN104252421A (en) Caching method and caching device
CN108520262B (en) Method for extracting FHOG characteristics in real time based on FPGA
CN100365787C (en) Writing buffer-supporting FLASH internal unit testing metod
CN112216333A (en) Chip testing method and device
CN204808884U (en) Data storage type flash memory optimization decoding makes can device
CN106292527B (en) Numerical control device and numerical control system
CN100565443C (en) A kind of adiabatic fifo circuit based on CTGAL
CN109831599B (en) FPGA-based compression method for image storage in 3D measurement

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant