JPS6473457A - Operation system for fast fourier transformation - Google Patents

Operation system for fast fourier transformation

Info

Publication number
JPS6473457A
JPS6473457A JP62230227A JP23022787A JPS6473457A JP S6473457 A JPS6473457 A JP S6473457A JP 62230227 A JP62230227 A JP 62230227A JP 23022787 A JP23022787 A JP 23022787A JP S6473457 A JPS6473457 A JP S6473457A
Authority
JP
Japan
Prior art keywords
points
program
dft
operation means
equal
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
JP62230227A
Other languages
Japanese (ja)
Inventor
Masao Iida
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.)
Oki Electric Industry Co Ltd
Original Assignee
Oki Electric Industry Co 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 Oki Electric Industry Co Ltd filed Critical Oki Electric Industry Co Ltd
Priority to JP62230227A priority Critical patent/JPS6473457A/en
Publication of JPS6473457A publication Critical patent/JPS6473457A/en
Pending legal-status Critical Current

Links

Abstract

PURPOSE:To shorten the generation time of a program and to speed up an operation time by making the operation contents of first and fourth operation means equal and making the operation contents of third and fifth operation means equal. CONSTITUTION:The operation contents of DFT operation means 11-1 and 11-2 being the first and fourth operation means, and those of the rearrangement means of data arrangement 16-1 and 16-2 being the third and fifth operation means to be equal. Namely, the 4L points DFT operation means in line direction 11-1 and 11-2, a multiplication means 13 executing a twist coefficient operation and the rearrangement means of data arrangement 16-1 and 16-2 are provided, and the 4L points DFT operation means 11-1 and 11-2, and the rearrangement means of data arrangement 16-1 and 16-2 are repeatedly used. The number of program steps of an operation processing reduces and the generation time of the program can be shortened. Furthermore, a DFT operation unit comes to be 4L points and the address alteration range of a data memory in the operation unit reduces from 4L bits of 4<2>L points to the L bits of the 4L point, whereby the number of the steps of an assembler program in the operation unit is reduced.
JP62230227A 1987-09-14 1987-09-14 Operation system for fast fourier transformation Pending JPS6473457A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP62230227A JPS6473457A (en) 1987-09-14 1987-09-14 Operation system for fast fourier transformation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP62230227A JPS6473457A (en) 1987-09-14 1987-09-14 Operation system for fast fourier transformation

Publications (1)

Publication Number Publication Date
JPS6473457A true JPS6473457A (en) 1989-03-17

Family

ID=16904537

Family Applications (1)

Application Number Title Priority Date Filing Date
JP62230227A Pending JPS6473457A (en) 1987-09-14 1987-09-14 Operation system for fast fourier transformation

Country Status (1)

Country Link
JP (1) JPS6473457A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2008533873A (en) * 2005-03-11 2008-08-21 クゥアルコム・インコーポレイテッド Fast Fourier transform twiddle multiplication
US8229014B2 (en) 2005-03-11 2012-07-24 Qualcomm Incorporated Fast fourier transform processing in an OFDM system

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2008533873A (en) * 2005-03-11 2008-08-21 クゥアルコム・インコーポレイテッド Fast Fourier transform twiddle multiplication
US8229014B2 (en) 2005-03-11 2012-07-24 Qualcomm Incorporated Fast fourier transform processing in an OFDM system
US8266196B2 (en) 2005-03-11 2012-09-11 Qualcomm Incorporated Fast Fourier transform twiddle multiplication

Similar Documents

Publication Publication Date Title
JPS5652454A (en) Input/output control method of variable word length memory
JPS55128641A (en) Controlling system for vehicle
JPS5533232A (en) Sequential controller
JPS6473457A (en) Operation system for fast fourier transformation
JPS5658800A (en) Driving device of step motor for auxiliary scanning use
JPS5547565A (en) Fourier conversion processing system
JPS53139939A (en) Memory addressing method
JPS57143640A (en) Data processing device
JPS5489434A (en) Memory access control processing system
JPS56168254A (en) Advance control system for input/output control unit
JPS57199052A (en) Data processing device
JPS6431253A (en) Data transferring system
JPS55157027A (en) Input and output transfer control unit
JPH0317756A (en) Storage access system
JPS6453275A (en) Straight line plotting device
JPS6459537A (en) System for controlling cache memory of data processor
JPS56116139A (en) Production system of transfer data quantity
JPS54101632A (en) Data transfer system
JPS6488743A (en) Data unifying device
JPS6488668A (en) Bus control system
JPS56168256A (en) Data processor
JPS6423343A (en) Programmable interruption signal generator
JPS6424533A (en) Circ encoder
JPS5469044A (en) Input/output control system for lsi
JPS54149439A (en) Sequence control circuit