CN110781445A - Incremental frequency domain transformation system and method for time domain stream data - Google Patents

Incremental frequency domain transformation system and method for time domain stream data Download PDF

Info

Publication number
CN110781445A
CN110781445A CN201910964362.5A CN201910964362A CN110781445A CN 110781445 A CN110781445 A CN 110781445A CN 201910964362 A CN201910964362 A CN 201910964362A CN 110781445 A CN110781445 A CN 110781445A
Authority
CN
China
Prior art keywords
stream data
time
domain stream
time domain
data
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
Application number
CN201910964362.5A
Other languages
Chinese (zh)
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.)
Tsinghua University
Original Assignee
Tsinghua University
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 Tsinghua University filed Critical Tsinghua University
Priority to CN201910964362.5A priority Critical patent/CN110781445A/en
Publication of CN110781445A publication Critical patent/CN110781445A/en
Pending legal-status Critical Current

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
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/76Arrangements for rearranging, permuting or selecting data according to predetermined rules, independently of the content of the data
    • G06F7/78Arrangements for rearranging, permuting or selecting data according to predetermined rules, independently of the content of the data for changing the order of data flow, e.g. matrix transposition or LIFO buffers; Overflow or underflow handling therefor

Landscapes

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

Abstract

The invention provides an incremental frequency domain transformation system and a transformation method of time domain stream data, wherein the transformation system comprises an input module, a stream data processing frame and an output module; an input module, configured to input time-series stream data to the stream data processing framework, where the time-series stream data includes time-domain stream data of a plurality of time points; the stream data processing framework is used for carrying out fast Fourier transform on the time domain stream data of each time point to form frequency domain stream data corresponding to the time domain stream data of each time point; and the output module is used for outputting the frequency domain stream data in the stream data processing framework. The invention carries out fast Fourier transform on each single-point time domain stream data aiming at the time sequence stream data, and has higher real-time performance compared with the traditional batch processing of the time sequence data.

Description

Incremental frequency domain transformation system and method for time domain stream data
Technical Field
The invention belongs to the technical field of data processing, and particularly relates to an incremental frequency domain transformation system and method for time domain stream data.
Background
The method comprises the steps that multi-channel sensor monitoring is arranged on various devices in an industrial field, monitoring data essentially flow along time, time series flow data are formed, wherein the time series flow data are time domain data, and the time domain flow data need to be converted into frequency domain flow data in the data processing process.
In the existing transformation mode, time domain and frequency domain transformation is usually carried out on time series stream data in batches, and under the background of big data, the traditional single-machine data processing technology is not enough to support the processing of mass data in an industrial field. Meanwhile, the traditional data batch processing technology is difficult to meet the real-time requirement of stream data processing.
Disclosure of Invention
To overcome the above-mentioned existing problems or to at least partially solve the above-mentioned problems, embodiments of the present invention provide an incremental frequency domain transform system and transform method for time domain stream data.
According to a first aspect of the embodiments of the present invention, there is provided an incremental frequency domain transform system for time domain stream data, comprising an input module, a stream data processing framework, and an output module;
the input module is configured to input time-series stream data to the stream data processing framework, where the time-series stream data includes time-domain stream data of a plurality of time points;
the stream data processing framework is used for performing fast Fourier transform on the time domain stream data of each time point to form frequency domain stream data corresponding to the time domain stream data of each time point;
the output module is used for outputting the frequency domain stream data in the stream data processing framework.
On the basis of the technical scheme, the invention can be further improved as follows.
Further, the stream data processing framework comprises a queue buffering module, a data position overturning module, a Fourier transform module and a data position recovering module;
the queue buffer module is used for buffering the time domain stream data with the preset length input by the input module;
the data position turning module is used for adjusting the position of each time domain stream data in the queue buffer module according to a turning rule so as to rearrange the position of each time domain stream data;
the Fourier transform module is used for carrying out fast Fourier transform on each time domain stream data after the position rearrangement to obtain frequency domain stream data corresponding to each time domain stream data;
and the data position recovery module is used for overturning the position of each frequency domain stream data again and recovering the position of each frequency domain stream data to the position of each time domain stream data.
Further, the data position turning module comprises a conversion unit and a turning operation unit;
the conversion unit is used for converting the position subscript of each time domain stream data in the queue buffer module from decimal to binary to obtain the position subscript of the binary form corresponding to each time domain stream data;
the overturning operation unit is used for down marking the post log of the position of each binary system form corresponding to the time domain stream data 2And turning N bits to obtain the position subscript of each turned time domain stream data, wherein N is the number of the time domain stream data in the queue buffer module.
Further, the streaming data processing framework further comprises a storage module;
the storage module is used for storing the position subscript of the binary form corresponding to each time domain stream data converted by the conversion unit into an array;
correspondingly, the flipping operation unit is specifically configured to store the post log of the position subscript of the binary form corresponding to each time domain stream data in the array 2And turning the N bits to obtain the position subscript of each turned time domain stream data.
Further, the Fourier transform module comprises a discrete Fourier transform unit, a merging calculation unit and a write-back queue unit;
the discrete Fourier transform unit is used for performing fast Fourier transform on each time domain stream data after the position is turned over to obtain a plurality of odd-numbered data and a plurality of even-numbered data after the fast Fourier transform;
the merging calculation unit is configured to merge a plurality of odd-numbered data corresponding to each time domain stream data, and merge a plurality of even-numbered data corresponding to each time domain stream data to obtain frequency domain stream data corresponding to each time domain stream data;
the write-back queue unit is used for writing back each frequency domain stream data into the queue buffer module.
According to a second aspect of the embodiments of the present invention, there is provided a method for incremental frequency domain transform of time domain stream data, including:
storing time series stream data in a queue;
and performing fast Fourier transform on the time domain stream data of each time point in the time sequence stream data in the queue, and converting the time domain stream data of each time point into corresponding frequency domain stream data.
Further, the fast fourier transforming the time domain stream data at each time point in the time series stream data in the queue includes:
adjusting the position of each time domain stream data in the queue according to a turnover rule so as to rearrange the position of each time domain stream data;
and performing fast Fourier transform on each time domain stream data after the position rearrangement to obtain frequency domain stream data corresponding to each time domain stream data.
Further, the adjusting the position of each time domain stream data in the queue according to the flipping rule includes:
converting each time domain stream data into binary from decimal in the queue position subscript to obtain a binary position subscript corresponding to each time domain stream data;
the overturning operation unit is used for down marking the post log of the position of each binary system form corresponding to the time domain stream data 2And turning N bits to obtain the position subscript of each turned time domain stream data, wherein N is the number of the time domain stream data in the queue buffer module.
Further, the performing fast fourier transform on each time domain stream data after the position rearrangement to obtain frequency domain stream data corresponding to each time domain stream data includes:
performing fast Fourier transform on each time domain stream data after the position is turned over to obtain a plurality of odd-numbered data and a plurality of even-numbered data after the fast Fourier transform;
and merging a plurality of odd-numbered data corresponding to each time domain stream data, and merging a plurality of even-numbered data corresponding to each time domain stream data to obtain frequency domain stream data corresponding to each time domain stream data.
The embodiment of the invention provides an incremental frequency domain transformation system and method of time domain stream data, aiming at time sequence stream data, wherein the time sequence data is the time domain stream data which is continuously increased, and the time data volume is larger and larger.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.
Fig. 1 is a schematic diagram of an overall structure of an incremental frequency domain transform system for time domain stream data according to an embodiment of the present invention;
fig. 2 is a block diagram illustrating connection of modules inside a streaming data processing framework according to an embodiment of the present invention;
FIG. 3 is a block diagram illustrating the internal connections of the data position flipping module according to an embodiment of the present invention;
FIG. 4 is a block diagram of the internal connections of a Fourier transform module provided in one embodiment of the present invention;
fig. 5 is a flowchart of an incremental frequency domain transformation method for time domain stream data according to an embodiment of the present invention.
Detailed Description
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.
In an embodiment of the present invention, a system for incremental frequency domain transformation of time domain stream data is provided, and fig. 1 is a system for incremental frequency domain transformation of time domain stream data provided in an embodiment of the present invention, which includes an input module 1, a stream data processing framework 2, and an output module 3.
An input module 1 configured to input time-series stream data to a stream data processing framework 2, the time-series stream data including time-domain stream data of a plurality of time points;
the stream data processing framework 2 is used for performing fast fourier transform on the time domain stream data of each time point to form frequency domain stream data corresponding to the time domain stream data of each time point;
and the output module 3 is used for outputting the frequency domain stream data in the stream data processing framework.
It can be understood that, in the prior art, when time domain stream data is transformed into frequency domain stream data, a batch of time series stream data is stored as offline data and then transformed in batch, because the time series stream data includes time domain stream data at each time point, the time domain stream data is updated in real time along with the change of time, and the data volume is larger and larger, and the time domain stream data is incremental along with the time, the real-time performance of the time domain and frequency domain transformation mode in the prior art is low, and the time domain and frequency domain transformation mode is essentially offline transformation. In order to solve the problem, the embodiment of the invention performs fast fourier transform on the time domain stream data at each time point to obtain the frequency domain stream data corresponding to the time domain stream data at each time point, and performs fast fourier transform on each single-point time domain stream data for time series stream data.
Referring to fig. 2, on the basis of the above embodiments, in the embodiment of the present invention, the stream data processing framework 2 includes a queue buffering module 21, a data position flipping module 22, a fourier transform module 23, and a data position restoring module 24.
The queue buffer module 21 is configured to buffer time domain stream data with a predetermined length input by the input module 1;
the data position flipping module 22 is configured to adjust a position of each time domain stream data in the queue buffering module 21 according to a flipping rule, so as to rearrange the position of each time domain stream data;
the fourier transform module 23 is configured to perform fast fourier transform on each time domain stream data after the position rearrangement to obtain frequency domain stream data corresponding to each time domain stream data;
the data position recovery module 24 is configured to flip the position of each frequency domain stream data again, and recover the position of each frequency domain stream data to the position of each time domain stream data.
It is to be understood that the embodiment of the present invention implements fast fourier transform on the time domain stream data at each time point in the stream data processing framework 2. Specifically, the stream data processing framework 2 maintains a queue in the memory, where the queue is used to buffer the input time series stream data, where the time series stream data includes time domain stream data corresponding to multiple time points, that is, each time point corresponds to one time domain stream data.
After the time domain stream data corresponding to each time point is stored in the queue, each time domain stream data corresponds to the position of the time domain stream data, when the time domain stream data is subjected to Fourier transform, the position of each time domain stream data in the queue is adjusted according to an overturning rule, and the position of each time domain stream data is rearranged. And performing fast Fourier transform on each time domain stream data after the position rearrangement to obtain frequency domain stream data corresponding to each time domain stream data.
And after each original time domain stream data is subjected to fast Fourier transform, each position after overturning is overturned again and is restored to the original position, so that the conversion from each time domain stream data in the queue to the frequency domain stream data is realized.
On the basis of the above embodiments, in the embodiment of the present invention, referring to fig. 3, the data position flipping module 22 includes a conversion unit 221 and a flipping operation unit 222;
the conversion unit 221 is configured to convert the position index of each time domain stream data in the queue buffer module 21 from decimal to binary, so as to obtain a position index in a binary form corresponding to each time domain stream data;
the flip operation unit 222 is configured to down-log the position subscript of the binary format corresponding to each time domain stream data 2And inverting the N bits to obtain a position index of each inverted time domain stream data, where N is the number of the time domain stream data in the queue buffer module 21 and may also be understood as the length of the time sequence stream data.
It can be understood that the position index corresponding to each time domain stream data in the queue is in a decimal form, and when the position of each time domain stream data in the queue is inverted, the position index in the decimal form of each time domain stream data in the queue is firstly converted into a binary form through the conversion unit 221, so as to obtain the position index in the binary form corresponding to each time domain stream data.
After the decimal position subscript of each time domain stream data is converted into the binary position subscript, the last log of the binary position subscript corresponding to each time domain stream data is recorded 2Turning over N bits to obtain each turned over bitThe position index of the time domain stream data, where N is the number of time domain stream data in the queue buffer module 21. For example, if the decimal form of the position subscript of a certain time domain stream data is 4, the corresponding binary form is 0100, and if N is 8, log is 2 8If the number is 3, the last three bits of 0100 are turned over, and the subscript of the turned position is 0001; and overturning the decimal position subscript of each time domain stream data to obtain the overturned position subscript of each time domain stream data.
On the basis of the above embodiments, in the embodiments of the present invention, the stream data processing framework further includes a storage module;
the storage module is configured to store the position index of the binary form corresponding to each time domain stream data converted by the conversion unit 221 in an array;
correspondingly, the flipping operation unit 222 is specifically configured to perform post-log of a position subscript of a binary form corresponding to each time domain stream data stored in the array 2And overturning the N bits to obtain the position subscript of each overturned time domain stream data.
It is understood that the stream data processing framework 2 opens up an array in the memory, and the stream data processing framework 2 includes a storage module, and the storage module is mainly used to store the position index of the binary form corresponding to each time domain stream data in the opened array.
On the basis of the above embodiments, in the embodiment of the present invention, referring to fig. 4, the fourier transform module 23 includes a discrete fourier transform unit 231, a merge calculation unit 232, and a write-back queue unit 233.
The discrete fourier transform unit 231 is configured to perform fast fourier transform on each time domain stream data after the position is flipped, so as to obtain a plurality of odd-numbered data and a plurality of even-numbered data after the fast fourier transform;
a merging calculation unit 232, configured to merge multiple odd-numbered items of data corresponding to each time domain stream data, and merge multiple even-numbered items of data corresponding to each time domain stream data to obtain frequency domain stream data corresponding to each time domain stream data;
a write-back queue unit 233, configured to write back each frequency domain stream data into the queue buffer module 21.
It is understood that after performing the fast fourier transform on each time domain stream data, a plurality of odd-numbered data items and a plurality of even-numbered data items of each time domain stream data after performing the fast fourier transform are obtained. And for each time domain stream data, merging a plurality of odd-numbered data obtained after fast Fourier transform, and merging a plurality of even-numbered data to obtain frequency domain stream data corresponding to each time domain stream data.
And after the frequency domain stream data corresponding to each time domain stream data is obtained after fast Fourier transform, the rearranged position subscript is turned over again, the original position subscript is recovered, and then each time domain stream data at the original position is transformed into the corresponding frequency domain stream data through fast Fourier transform.
Referring to fig. 5, in another embodiment of the present invention, there is provided a method of incremental frequency domain transformation of time domain stream data, the method comprising: storing time series stream data in a queue; and performing fast Fourier transform on the time domain stream data of each time point in the time sequence stream data in the queue, and converting the time domain stream data of each time point into corresponding frequency domain stream data.
On the basis of the foregoing embodiments, in an embodiment of the present invention, performing fast fourier transform on time-domain stream data at each time point in time-series stream data in a queue includes:
adjusting the position of each time domain stream data in the queue according to a turnover rule so as to rearrange the position of each time domain stream data;
and performing fast Fourier transform on each time domain stream data after the position rearrangement to obtain frequency domain stream data corresponding to each time domain stream data.
On the basis of the foregoing embodiments, in an embodiment of the present invention, the adjusting, according to a flipping rule, a position of each time domain stream data in the queue includes:
converting each time domain stream data into binary from decimal in the queue position subscript to obtain a binary position subscript corresponding to each time domain stream data;
the overturning operation unit is used for down marking the post log of the position of each binary system form corresponding to the time domain stream data 2And turning N bits to obtain the position subscript of each turned time domain stream data, wherein N is the number of the time domain stream data in the queue buffer module.
On the basis of the foregoing embodiments, in an embodiment of the present invention, the performing fast fourier transform on each time domain stream data after the position rearrangement to obtain frequency domain stream data corresponding to each time domain stream data includes:
performing fast Fourier transform on each time domain stream data after the position is turned over to obtain a plurality of odd-numbered data and a plurality of even-numbered data after the fast Fourier transform;
and merging a plurality of odd-numbered data corresponding to each time domain stream data, and merging a plurality of even-numbered data corresponding to each time domain stream data to obtain frequency domain stream data corresponding to each time domain stream data.
In the process of merging a plurality of odd-numbered data and a plurality of even-numbered data obtained by performing fast fourier transform on each time domain stream data, the merging is performed according to the sequence shown in the formulas (1) to (2), that is to say
X[k+n/2]=X[k]-t; (1)
X[k]=X[k]+t; (2)
In the formula (I), the compound is shown in the specification,
Figure BDA0002229998650000101
for temporary variables, k is 0,1,2 N=e -j2π/NReferred to as twiddle factors. When the data length N is determined, each layer actually participating in calculation
Figure BDA0002229998650000102
Are all uniquely determined and when n is 1The recursive boundary is reached, indicating that no further merge calculations are to be performed.
According to the incremental frequency domain transformation system and the incremental frequency domain transformation method for the time domain stream data, provided by the embodiment of the invention, aiming at the time domain stream data, wherein the time domain stream data is continuously updated, and the time data volume is larger and larger, the embodiment of the invention carries out fast Fourier transformation on each single-point time domain stream data, and has higher real-time performance compared with the traditional batch processing of the time domain stream data.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.

Claims (9)

1. An incremental frequency domain transformation system of time domain stream data is characterized by comprising an input module, a stream data processing frame and an output module;
the input module is configured to input time-series stream data to the stream data processing framework, where the time-series stream data includes time-domain stream data of a plurality of time points;
the stream data processing framework is used for performing fast Fourier transform on the time domain stream data of each time point to form frequency domain stream data corresponding to the time domain stream data of each time point;
the output module is used for outputting the frequency domain stream data in the stream data processing framework.
2. The incremental frequency-domain transform system of time-domain stream data of claim 1, wherein said stream data processing framework comprises a queue buffering module, a data position flipping module, a fourier transform module, and a data position recovery module;
the queue buffer module is used for buffering the time domain stream data with the preset length input by the input module;
the data position turning module is used for adjusting the position of each time domain stream data in the queue buffer module according to a turning rule so as to rearrange the position of each time domain stream data;
the Fourier transform module is used for carrying out fast Fourier transform on each time domain stream data after the position rearrangement to obtain frequency domain stream data corresponding to each time domain stream data;
and the data position recovery module is used for overturning the position of each frequency domain stream data again and recovering the position of each frequency domain stream data to the position of each time domain stream data.
3. The incremental frequency-domain transform system of time-domain stream data of claim 2, wherein said data position flipping module comprises a conversion unit and a flipping operation unit;
the conversion unit is used for converting the position subscript of each time domain stream data in the queue buffer module from decimal to binary to obtain the position subscript of the binary form corresponding to each time domain stream data;
the overturning operation unit is used for down marking the post log of the position of each binary system form corresponding to the time domain stream data 2And turning N bits to obtain the position subscript of each turned time domain stream data, wherein N is the number of the time domain stream data in the queue buffer module.
4. The incremental frequency-domain transform system of time-domain stream data of claim 3, wherein said stream data processing framework further comprises a storage module;
the storage module is used for storing the position subscript of the binary form corresponding to each time domain stream data converted by the conversion unit into an array;
accordingly, the flip operation unitThe post log of the position subscript of the binary form corresponding to each time domain stream data stored in the array is specifically used for 2And overturning the N bits to obtain the position subscript of each overturned time domain stream data.
5. The incremental frequency-domain transform system of time-domain stream data of claim 3, wherein said Fourier transform module comprises a discrete Fourier transform unit, a merge computation unit, and a write-back queue unit;
the discrete Fourier transform unit is used for performing fast Fourier transform on each time domain stream data after the position is turned over to obtain a plurality of odd-numbered data and a plurality of even-numbered data after the fast Fourier transform;
the merging calculation unit is configured to merge a plurality of odd-numbered data corresponding to each time domain stream data, and merge a plurality of even-numbered data corresponding to each time domain stream data to obtain frequency domain stream data corresponding to each time domain stream data;
the write-back queue unit is used for writing back each frequency domain stream data into the queue buffer module.
6. A method of incremental frequency domain transformation of time domain stream data, comprising:
storing time series stream data in a queue;
and performing fast Fourier transform on the time domain stream data of each time point in the time sequence stream data in the queue, and converting the time domain stream data of each time point into corresponding frequency domain stream data.
7. The system for incremental frequency-domain transformation of time-domain stream data according to claim 6, wherein said fast Fourier transforming in-line the time-domain stream data at each time point in the time-series stream data comprises:
adjusting the position of each time domain stream data in the queue according to a turnover rule so as to rearrange the position of each time domain stream data;
and performing fast Fourier transform on each time domain stream data after the position rearrangement to obtain frequency domain stream data corresponding to each time domain stream data.
8. The system for incremental frequency-domain transformation of time-domain stream data according to claim 7, wherein said adjusting the position of each time-domain stream data in said queue according to a flipping rule comprises:
converting each time domain stream data into binary from decimal in the queue position subscript to obtain a binary position subscript corresponding to each time domain stream data;
the overturning operation unit is used for down marking the post log of the position of each binary system form corresponding to the time domain stream data 2And turning N bits to obtain the position subscript of each turned time domain stream data, wherein N is the number of the time domain stream data in the queue buffer module.
9. The system for incremental frequency-domain transformation of time-domain stream data according to claim 7, wherein said performing a fast fourier transform on each time-domain stream data after position rearrangement to obtain frequency-domain stream data corresponding to each time-domain stream data comprises:
performing fast Fourier transform on each time domain stream data after the position is turned over to obtain a plurality of odd-numbered data and a plurality of even-numbered data after the fast Fourier transform;
and merging a plurality of odd-numbered data corresponding to each time domain stream data, and merging a plurality of even-numbered data corresponding to each time domain stream data to obtain frequency domain stream data corresponding to each time domain stream data.
CN201910964362.5A 2019-10-11 2019-10-11 Incremental frequency domain transformation system and method for time domain stream data Pending CN110781445A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910964362.5A CN110781445A (en) 2019-10-11 2019-10-11 Incremental frequency domain transformation system and method for time domain stream data

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910964362.5A CN110781445A (en) 2019-10-11 2019-10-11 Incremental frequency domain transformation system and method for time domain stream data

Publications (1)

Publication Number Publication Date
CN110781445A true CN110781445A (en) 2020-02-11

Family

ID=69385142

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910964362.5A Pending CN110781445A (en) 2019-10-11 2019-10-11 Incremental frequency domain transformation system and method for time domain stream data

Country Status (1)

Country Link
CN (1) CN110781445A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101930425A (en) * 2009-06-24 2010-12-29 华为技术有限公司 Signal processing method, data processing method and device
CN109033024A (en) * 2018-08-01 2018-12-18 电子科技大学 A kind of fast discrete time Fourier transformation method of parallel iteration processing
CN109328382A (en) * 2016-06-22 2019-02-12 杜比国际公司 For by digital audio and video signals from the first frequency-domain transform to the audio decoder of the second frequency domain and method
CN110019922A (en) * 2017-12-07 2019-07-16 北京雷石天地电子技术有限公司 A kind of audio climax recognition methods and device

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101930425A (en) * 2009-06-24 2010-12-29 华为技术有限公司 Signal processing method, data processing method and device
CN109328382A (en) * 2016-06-22 2019-02-12 杜比国际公司 For by digital audio and video signals from the first frequency-domain transform to the audio decoder of the second frequency domain and method
CN110019922A (en) * 2017-12-07 2019-07-16 北京雷石天地电子技术有限公司 A kind of audio climax recognition methods and device
CN109033024A (en) * 2018-08-01 2018-12-18 电子科技大学 A kind of fast discrete time Fourier transformation method of parallel iteration processing

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
刘建伟: "流数据查询系统结构及模式查询算法的研究", 《中国博士学位论文全文数据库信息科技辑》 *
庞景先 等: "时域抽取基2快速傅里叶变换(FFT)算法", 《光学精密工程》 *

Similar Documents

Publication Publication Date Title
Shen et al. Reliable dissipative control for Markov jump systems using an event-triggered sampling information scheme
US9317481B2 (en) Data access method and device for parallel FFT computation
CN103440121B (en) A kind of triangular matrix multiplication vectorization method of vector processor-oriented
JP4698394B2 (en) Fast Fourier transform circuit
CN109840585B (en) Sparse two-dimensional convolution-oriented operation method and system
WO2016107236A1 (en) Self-adaptive equalization filtering apparatus and method in optical fibre communications, and storage medium
WO2010108371A1 (en) Circuit and method for implementing fft/ifft transform
CN103647937A (en) An image tracking system and an image data processing method thereof
JP5359569B2 (en) Memory access method
JP2007148623A5 (en)
JP6256348B2 (en) Fast Fourier transform circuit, fast Fourier transform processing method, and fast Fourier transform processing program
CN110781445A (en) Incremental frequency domain transformation system and method for time domain stream data
US20120278373A1 (en) Data rearranging circuit, variable delay circuit, fast fourier transform circuit, and data rearranging method
WO2015087495A1 (en) Digital filter device, digital filter processing method, and storage medium having digital filter program stored thereon
CN101308568B (en) Method and apparatus for production line real-time processing based FIFO
CN102541813B (en) Method and corresponding device for multi-granularity parallel FFT (Fast Fourier Transform) butterfly computation
CN102957993B (en) Low-power-consumption WOLA filter bank and analysis stage circuit thereof
CN103970904A (en) Quick response type remote sensing big data processing system
CN101345026A (en) Frame data buffering apparatus and related frame data acquisition method
CN103095249A (en) Median filtering circuit and method thereof
CN101025910A (en) Image data converting system and method
CN113034344B (en) Two-dimensional FFT method with low memory resource overhead
CN113812124B (en) Predistortion parameter updating device and method and predistortion processing system
US20110257917A1 (en) Voltage management methods and systems for performing analog-to-digital conversions
CN111525912B (en) Random resampling method and system for digital signals

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20200211

RJ01 Rejection of invention patent application after publication