Unlock instant, AI-driven research and patent intelligence for your innovation.

Recursion type discrete Fourier transformer

A discrete Fourier transforming device technology, applied in the field of Fourier transforming computing devices, can solve the problem of not considering simple structure and the like

Inactive Publication Date: 2002-01-30
VICTOR CO OF JAPAN LTD
View PDF2 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0027] However, in these disclosed inventions, a method for realizing a circuit configured with complex data as an input is described, and a signal provided as time-domain data used in the field of frequency analysis and the like is used as an object for conversion processing, and no consideration is given to only A circular Fourier transform method that provides a simple configuration of a real signal

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Recursion type discrete Fourier transformer
  • Recursion type discrete Fourier transformer
  • Recursion type discrete Fourier transformer

Examples

Experimental program
Comparison scheme
Effect test

no. 1 example

[0104] figure 1 is a schematic diagram of the structure of the recursive discrete Fourier transform device of the first embodiment of the present invention, and the Figure 1 to explain.

[0105] This recursive discrete Fourier transform device is composed of the following parts: a data update unit 1 that is provided with data sampled at a certain time interval and temporarily stores the latest N (N is a positive integer) data provided is set to The base frequency setting unit 2 performs the base frequency of the discrete Fourier transform, the recursive DFT calculation unit 3 performs the recursive DFT calculation, and the storage unit 4 temporarily stores the calculated data.

[0106] Hereinafter, the operation of the recursive Fourier transform device having such a configuration will be described.

[0107]First, the supplied data is sampled at regular time intervals by a sampling circuit (not shown), and the sampled and quantized discrete data is supplied to the data upda...

no. 2 example

[0188] Figure 7 It is a schematic configuration diagram of a recursive discrete Fourier transform apparatus according to a second embodiment of the present invention, and will be described based on this diagram.

[0189] The components of the recursive discrete Fourier transform device are:

[0190] The data update unit 101 is used to provide data sampled at a certain time interval, and temporarily store the latest N (N is a positive integer) data provided;

[0191] A base frequency setting unit 102, configured to set the base frequency required for discrete Fourier transform;

[0192] The recursive processing unit 103 is equipped with a storage circuit inside, and is used to perform signal processing while recursively utilizing the temporarily stored signal; and

[0193] The multiplication processing unit 104 performs multiplication processing and outputs the obtained Fourier transform coefficients.

[0194] The operation of the recursive discrete Fourier transform appara...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

This invention relates to a Fourier transformation device, in which when storing successively supplied data temporarily by deleting old data while obtaining the newest N data, a difference between a data value supplied just before and a data value to be deleted is supplied by a data updating portion, this supplied data value and a result of FFT operation just before, stored temporarily in a memory portion are supplied to a recursive DFT operating portion and these values are computed according to a predetermined method so as to output a result of the FFT operation with respect to the newest N data values.

Description

technical field [0001] The present invention relates to a computing device for Fourier transform, and more particularly to a computing device for performing Fourier transform through simple computing processing and obtaining a Fourier transform computing result in a short time. Background technique [0002] In the past, the Fourier transform method using frequency analysis of time-series series has been widely used in high-compression coding of audio signals and image signals in addition to signal spectrum analysis in the field of audio signal processing and image data processing of medical equipment. way, and is also used as a modulation and demodulation technique in the field of communications. [0003] This Fourier transform method will use the sampling sequence as a digital quantity in a set of N (N is an integer, such as 1024), and use the time interval during which such N sequence exists as the window period, and at the same time use the window period as the base Freq...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F17/14
CPCG06F17/142G06F17/141
Inventor 高冈胜美
Owner VICTOR CO OF JAPAN LTD