JPH056392A - System for selecting fourier transformation computing method - Google Patents

System for selecting fourier transformation computing method

Info

Publication number
JPH056392A
JPH056392A JP3157286A JP15728691A JPH056392A JP H056392 A JPH056392 A JP H056392A JP 3157286 A JP3157286 A JP 3157286A JP 15728691 A JP15728691 A JP 15728691A JP H056392 A JPH056392 A JP H056392A
Authority
JP
Japan
Prior art keywords
fourier transform
complex fourier
dimensional complex
dimensional
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
JP3157286A
Other languages
Japanese (ja)
Inventor
Yuko Takeuchi
祐子 竹内
Hitoshi Nonomura
仁 野々村
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.)
NEC Corp
NEC Solution Innovators Ltd
Original Assignee
NEC Corp
NEC Solution Innovators Ltd
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 NEC Corp, NEC Solution Innovators Ltd filed Critical NEC Corp
Priority to JP3157286A priority Critical patent/JPH056392A/en
Publication of JPH056392A publication Critical patent/JPH056392A/en
Pending legal-status Critical Current

Links

Landscapes

  • Complex Calculations (AREA)

Abstract

PURPOSE:To automatically select an arithmetic method having the shortest calculation time to the combination of inputted data points. CONSTITUTION:A switching point table storing the multiplicity of one- dimensional complex Fourier transformation corresponding to the data length of input data is prepared and the multiplicity of the inputted data is compared with that obtained by referring the switching point table while referring the table upon the data length of data inputted at the time of operating multiple one-dimensional complex Fourier transformation. When the former is smaller or equal than/to the latter, a multiple one-dimensional complex Fourier transformation computing part based upon an one-dimensional scanning method is selected, and when the former is larger than the latter, a multiple one- dimensional complex Fourier transformation computing part incorporating the multiplication of one-dimensional complex Fourier transformation in the interior of one-dimensional Fourier transformation is selected, as the feature of this system.

Description

【発明の詳細な説明】Detailed Description of the Invention

【0001】[0001]

【産業上の利用分野】本発明はフーリエ変換演算手法選
択方式、特にベクトル計算機を用いた多重1次元複素フ
ーリエ変換の計算におけるフーリエ変換演算手法選択方
式に関するものである。
BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method for selecting a Fourier transform calculation method, and more particularly to a method for selecting a Fourier transform calculation method in calculation of multiple one-dimensional complex Fourier transform using a vector computer.

【0002】[0002]

【従来の技術】従来、この種のフーリエ変換演算は、入
力データ数の組合せにかかわらず、1次元スキャン法に
よる多重1次元複素フーリエ変換、または1次元複素フ
ーリエ変換の多重化をフーリエ変換の内部に組み入れた
多重1次複素フーリエ変換のいずれかに固定された手法
によりおこなわれていた。
2. Description of the Related Art Conventionally, this kind of Fourier transform operation has been performed by using a multiple one-dimensional complex Fourier transform by a one-dimensional scanning method, or by multiplexing a one-dimensional complex Fourier transform, regardless of the combination of the number of input data. The method was fixed to one of the multiple first-order complex Fourier transforms incorporated in.

【0003】[0003]

【発明が解決しようとする課題】上述した従来のフーリ
エ変換演算手法選択方式では、演算手法が固定されてい
たため、データ点数の組合せに対して、計算時間が1番
短く、最適な演算が行われない可能性があった。
In the above-mentioned conventional Fourier transform calculation method selection method, since the calculation method is fixed, the calculation time is the shortest for the combination of the data points, and the optimum calculation is performed. There was no possibility.

【0004】そのため利用者は、最適な演算を行うため
に、ベクトル計算機を用いて入力データ数の組合せに対
してプログラムを改良し、計算時間をあらかじめ測定し
て、その測定結果により計算方法を決定する必要がある
ので長時間と多労力を要するという欠点がある。
Therefore, the user uses a vector computer to improve the program for the combination of the number of input data, measures the calculation time in advance, and determines the calculation method according to the measurement result in order to perform the optimum calculation. However, there is a drawback that it requires a long time and a lot of labor.

【0005】[0005]

【課題を解決するための手段】本発明のフーリエ変換演
算手法選択方式は、入力データのデータ長対応に1次元
複素フーリエ変換の多重度を格納した切り替え点テーブ
ルを設け、多重1次元複素フーリエ変換演算時に入力さ
れたデータのデータ長によって前記切り換え点テーブル
を参照して、入力されたデータの多重度と、前記参照に
より得られた多重度とを比較し、前者が後者より小さい
か等しい場合は、1次元スキャン法による多重1次元複
素フーリエ変換演算部、前者が後者より大きい場合は、
1次元複素フーリエ変換の多重化を1次元フーリエ変換
内部に組み入れた多重1次元複素フーリエ変換演算部を
それぞれ選択することを特徴とする。
According to the Fourier transform calculation method selection method of the present invention, a switching point table storing the multiplicity of the one-dimensional complex Fourier transform is provided corresponding to the data length of the input data, and the multiple one-dimensional complex Fourier transform is provided. By referring to the switching point table according to the data length of the data input at the time of calculation, the multiplicity of the input data is compared with the multiplicity obtained by the reference, and if the former is less than or equal to the latter, A multiple 1-dimensional complex Fourier transform operation unit by the 1-dimensional scanning method, if the former is larger than the latter,
The present invention is characterized in that each of the multiple 1-dimensional complex Fourier transform operation units in which the multiplexing of the one-dimensional complex Fourier transform is incorporated into the one-dimensional Fourier transform is selected.

【0006】[0006]

【実施例】次に本発明について図面を参照して説明す
る。
The present invention will be described below with reference to the drawings.

【0007】図1は本発明の一実施例の構成図である。FIG. 1 is a block diagram of an embodiment of the present invention.

【0008】2は1次元スキャン法による多重1次元複
素フーリエ変換演算部、3は1次元複素フーリエ変換の
内部に多重化を組み入れた多重1次元複素フーリエ変換
演算部、1は入力されたデータ点数の組合せにより、1
次元スキャン法による多重1次元複素フーリエ変換演算
部2と、1次元複素フーリエ変換の多重化をフーリエ変
換の内部に組み入れた多重1次元複素フーリエ変換演算
部3を、自動的に選択する最適演算手法自動選択部であ
る。
Reference numeral 2 is a multiplex one-dimensional complex Fourier transform operation unit by the one-dimensional scan method, 3 is a multiplex one-dimensional complex Fourier transform operation unit incorporating multiplexing inside the one-dimensional complex Fourier transform, and 1 is the number of input data points. 1 by the combination of
Optimal calculation method for automatically selecting the multiplex one-dimensional complex Fourier transform calculation unit 2 by the three-dimensional scanning method and the multiplex one-dimensional complex Fourier transform calculation unit 3 in which multiplexing of the one-dimensional complex Fourier transform is incorporated in the Fourier transform It is an automatic selection unit.

【0009】以下に各部の機能を順を追って説明する。The functions of the respective parts will be described below in order.

【0010】まず、図1の最適演算手法自動選択部1に
データが入力される。入力されるデータは、図2のよう
な形式になっている。1次元複素フーリエ変換の各デー
タは、INCNとびに格納され、各データ列の間隔はI
NCMとびに格納され、多重化されている。INCN、
INCMは利用者により入力される値である。
First, data is input to the optimum calculation method automatic selection unit 1 of FIG. The input data has a format as shown in FIG. Each data of the one-dimensional complex Fourier transform is stored in INCN and each data string has an interval I
It is stored in each NCM and multiplexed. INCN,
INCM is a value input by the user.

【0011】最適演算手法自動選択部1は、入力された
データの組を分析する。ここでは、仮に、入力された1
次元複素フーリエ変換のデータの長さをN、1次元複素
フーリエ変換の多重化の数をM本とする。
The optimum calculation method automatic selection unit 1 analyzes the input data set. Here, if the input 1
The data length of the dimensional complex Fourier transform is N, and the number of multiplexing of the one-dimensional complex Fourier transform is M.

【0012】最適演算手法自動選択部1は、入力された
データ長n,多重度mの値によって、切り替え点テーブ
ルを参照し、1次元スキャン法による多重1次元複素フ
ーリエ変換演算部2と、1次元複素フーリエ変換の内部
に多重化を組み入れた多重1次元複素フーリエ変換演算
部3のどちらかを選択し、入力されたデータを選択され
た演算部に渡す。
The optimum calculation method automatic selection section 1 refers to the switching point table according to the values of the input data length n and the multiplicity m, and the multiple one-dimensional complex Fourier transform calculation section 2 by the one-dimensional scanning method One of the multiplex one-dimensional complex Fourier transform operation units 3 in which multiplexing is incorporated in the dimensional complex Fourier transform is selected, and the input data is passed to the selected operation unit.

【0013】切り替え点テーブルを図3に示し、N、M
の値の関係とそのとき選択される演算手法の関係をグラ
フに表わしたものを図4に示す。入力データののデータ
長がn、1次元複素フーリエ変換の多重度がmのとき、
切り替え点テーブルのデータ長N=nのときの多重度M
の値より、入力された多重度mの方が小さいか等しいと
きは、1次元スキャン法による多重1次元複素フーリエ
変換演算部2に入力さデータが渡され、1次元スキャン
法による多重1次元複素フーリエ変換により演算が計算
され、結果が出力される。
The switching point table is shown in FIG.
FIG. 4 is a graph showing the relationship between the values of and the calculation method selected at that time. When the data length of the input data is n and the multiplicity of the one-dimensional complex Fourier transform is m,
Multiplicity M when the data length of the switching point table is N = n
When the input multiplicity m is smaller than or equal to the value of, the input data is passed to the multiplex one-dimensional complex Fourier transform operation unit 2 by the one-dimensional scan method, and the multiplex one-dimensional complex by the one-dimensional scan method is given. The operation is calculated by the Fourier transform, and the result is output.

【0014】また逆に、切り替え点テーブルの多重度M
の値が入力された多重度mの値より小さい時は、1次元
複素フーリエ変換の多重化をフーリエ変換内部に組み入
れた多重1次元複素フーリエ変換演算部3に入力データ
が渡され、1次元複素フーリエ変換の多重化をフーリエ
変換内部に組み入れた多重1次元複素フーリエ変換によ
り演算が計算され、結果が出力される。
On the contrary, the multiplicity M of the switching point table
When the value of is smaller than the input value of the multiplicity m, the input data is passed to the multiplex one-dimensional complex Fourier transform calculation unit 3 in which the multiplexing of the one-dimensional complex Fourier transform is incorporated in the Fourier transform, and the one-dimensional complex Fourier transform is performed. The operation is calculated by the multiple one-dimensional complex Fourier transform in which the multiplex of the Fourier transform is incorporated into the Fourier transform, and the result is output.

【0015】例えばn=4、m=3の時は、N=4の時
の切り替え点テーブルのMの値は1だから、入力された
多重度m=3>1より1次元複素フーリエ変換の多重化
をフーリエ変換内部に組み入れた多重1次元複素フーリ
エ変換演算部3に入力データ(n=4、m=3)が渡さ
れ、1次元複素フーリエ変換の多重化をフーリエ変換内
部に組み入れた多重1次元複素フーリエ変換により演算
が計算される。
For example, when n = 4 and m = 3, the value of M in the switching point table when N = 4 is 1, so that the multiplicity of the one-dimensional complex Fourier transform is obtained from the input multiplicity m = 3> 1. The input data (n = 4, m = 3) is passed to the multiplex one-dimensional complex Fourier transform operation unit 3 in which the multiplexing is incorporated in the Fourier transform, and the multiplex 1 in which the multiplexing of the one-dimensional complex Fourier transform is incorporated in the Fourier transform is performed. The operation is calculated by the dimensional complex Fourier transform.

【0016】1次元スキャン法による多重1次元複素フ
ーリエ変換演算部2では、連続データとして入力されて
いるデータを、1次元スキャン法でINCNとびに1次
元データとして取り出し、1次元複素フーリエ変換を1
本ずつ多重化の数の回数回、計算する方法により多重1
次元複素フーリエ変換の計算をする。
In the multiple one-dimensional complex Fourier transform calculation unit 2 by the one-dimensional scan method, the data input as continuous data is taken out as INCN and one-dimensional data by the one-dimensional scan method, and the one-dimensional complex Fourier transform is calculated by one.
Multiplex 1 times by the method of calculating the number of times of multiplexing one by one
Compute the dimensional complex Fourier transform.

【0017】1次元複素フーリエ変換の多重化をフーリ
エ変換内部に組み入れた多重1次元複素フーリエ変換演
算部3では、連続データとして入力されたデータを取り
出し、1次元複素フーリエ変換の多重化の繰り返しと1
次元複素フーリエ変換の演算の多重化をする繰り返しと
1次元複素フーリエ変換の演算の多重化をする繰り返し
を入れ換えた計算をする。
In the multiplex one-dimensional complex Fourier transform calculation unit 3 in which the one-dimensional complex Fourier transform multiplexing is incorporated into the Fourier transform, the data input as continuous data is taken out and the one-dimensional complex Fourier transform multiplexing is repeated. 1
The calculation in which the repetition for multiplexing the operation of the one-dimensional complex Fourier transform and the repetition for multiplexing the operation of the one-dimensional complex Fourier transform are exchanged is performed.

【0018】各演算部2,3で計算された結果は、それ
ぞれ出力される。
The results calculated by the arithmetic units 2 and 3 are output respectively.

【0019】[0019]

【発明の効果】以上説明したように本発明は、多重1次
元複素フーリエ変換において、ベクトル計算機に最適な
演算手法を、入力されたデータの組合せにより、データ
数の組合せに依存した計算手法を自動的に選択すること
により、データの組あわせごとに計算時間を測定、比較
して、1番計算時間の短い演算手法を捜す手間を不用と
する効果がある。
As described above, according to the present invention, in the multiple one-dimensional complex Fourier transform, the optimum calculation method for the vector computer is automatically calculated by the combination of the input data. By making a selective selection, it is possible to measure and compare the calculation time for each combination of data, thereby making it unnecessary to search for a calculation method with the shortest calculation time.

【図面の簡単な説明】[Brief description of drawings]

【図1】本発明の一実施例の構成図である。FIG. 1 is a configuration diagram of an embodiment of the present invention.

【図2】入力される多重1次元複素フーリエ変換のデー
タの構造図である。
FIG. 2 is a structural diagram of input multiple 1-dimensional complex Fourier transform data.

【図3】本発明における切り替え点テーブルの一例を示
す図である。
FIG. 3 is a diagram showing an example of a switching point table according to the present invention.

【図4】本発明によるフーリエ変換切り替え値を表わし
たグラフである。
FIG. 4 is a graph showing a Fourier transform switching value according to the present invention.

【符号の説明】[Explanation of symbols]

1 最適演算手法自動選択生成部 2 1次元スキャン法による多重1次元複素フーリエ
変換演算部 3 1次元複素フーリエ変換の多重化を1次元複素フ
ーリエ変換内部に組み入れた多重1次元複素フーリエ変
換演算部
1 Optimal calculation method automatic selection generation unit 2 Multiple 1-dimensional complex Fourier transform calculation unit by 1-dimensional scanning method 3 Multiplexed 1-dimensional complex Fourier transform calculation unit incorporating 1-dimensional complex Fourier transform multiplexing inside 1-dimensional complex Fourier transform

Claims (1)

【特許請求の範囲】 【請求項1】 入力データのデータ長対応に1次元複素
フーリエ変換の多重度を格納した切り替え点テーブルを
設け、多重1次元複素フーリエ変換演算時に入力された
データのデータ長によって前記切り換え点テーブルを参
照して、入力されたデータの多重度と、前記参照により
得られた多重度とを比較し、前者が後者より小さいか等
しい場合は、1次元スキャン法による多重1次元複素フ
ーリエ変換演算部、前者が後者より大きい場合は、1次
元複素フーリエ変換の多重化を1次元フーリエ変換内部
に組み入れた多重1次元複素フーリエ変換演算部をそれ
ぞれ選択することを特徴とするフーリエ変換演算手法選
択方式。
Claim: What is claimed is: 1. A switching point table storing the multiplicity of a one-dimensional complex Fourier transform is provided corresponding to the data length of input data, and the data length of data input during a multiple one-dimensional complex Fourier transform operation. By referring to the switching point table, the multiplicity of the input data is compared with the multiplicity obtained by the reference, and if the former is smaller than or equal to the latter, the multiple one-dimensional scanning method is performed. A complex Fourier transform operation unit, and when the former is larger than the latter, a Fourier transform characterized by selecting a multiplex one-dimensional complex Fourier transform operation unit in which multiplexing of one-dimensional complex Fourier transform is incorporated into the one-dimensional Fourier transform Calculation method selection method.
JP3157286A 1991-06-28 1991-06-28 System for selecting fourier transformation computing method Pending JPH056392A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP3157286A JPH056392A (en) 1991-06-28 1991-06-28 System for selecting fourier transformation computing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP3157286A JPH056392A (en) 1991-06-28 1991-06-28 System for selecting fourier transformation computing method

Publications (1)

Publication Number Publication Date
JPH056392A true JPH056392A (en) 1993-01-14

Family

ID=15646345

Family Applications (1)

Application Number Title Priority Date Filing Date
JP3157286A Pending JPH056392A (en) 1991-06-28 1991-06-28 System for selecting fourier transformation computing method

Country Status (1)

Country Link
JP (1) JPH056392A (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH03142671A (en) * 1989-10-30 1991-06-18 Nec Corp Automatic selection system for fft arithmetic method

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH03142671A (en) * 1989-10-30 1991-06-18 Nec Corp Automatic selection system for fft arithmetic method

Similar Documents

Publication Publication Date Title
KR880008107A (en) Numerical Control Unit for Highly Dynamic Processes
JPH056392A (en) System for selecting fourier transformation computing method
KR100232935B1 (en) Image processing apparatus
US5357575A (en) Sound processing system
JPH0589048A (en) Command processing system
JPH06204798A (en) System for interpolating asynchronous sampling frequency conversion
JPH08152883A (en) Digital signal processing
JP2697401B2 (en) Execution information collection method
JPH05127727A (en) Device operating method
JPH1118005A (en) Image effect processing system and computer
JP3271156B2 (en) ADPCM decoding device
JPS6318476A (en) Thinning circuit
JPH06103302A (en) Matrix multiplying circuit
JP2878795B2 (en) Setting pattern generator for injection molding machines
JPH05324849A (en) Hatching system
JPH0245888A (en) Interpolation generating circuit for straight line and luminance
JPH05300479A (en) Rate converter
JPH07302749A (en) Multiaxial sampling control device
JPH03252820A (en) Optimum object generating/processing system
JPH11313399A (en) Digital signal processing method and digital signal processing unit
JPH03191414A (en) Data input system
JPH0728518A (en) Numerical controller with manual interpolating function
JPH05135183A (en) Control point data processor
JPH03126098A (en) Musical tone signal generator
JPS6228629B2 (en)

Legal Events

Date Code Title Description
A02 Decision of refusal

Free format text: JAPANESE INTERMEDIATE CODE: A02

Effective date: 19970715