ATE131948T1 - Transformationsverarbeitungsschaltung - Google Patents

Transformationsverarbeitungsschaltung

Info

Publication number
ATE131948T1
ATE131948T1 AT88907212T AT88907212T ATE131948T1 AT E131948 T1 ATE131948 T1 AT E131948T1 AT 88907212 T AT88907212 T AT 88907212T AT 88907212 T AT88907212 T AT 88907212T AT E131948 T1 ATE131948 T1 AT E131948T1
Authority
AT
Austria
Prior art keywords
circuit
fft
ifft
input
sample points
Prior art date
Application number
AT88907212T
Other languages
English (en)
Inventor
Kien Thanh Hua
John David O'sullivan
Colin Eric Jacka
David Ross Brown
Original Assignee
Commw Scient Ind Res Org
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 Commw Scient Ind Res Org filed Critical Commw Scient Ind Res Org
Application granted granted Critical
Publication of ATE131948T1 publication Critical patent/ATE131948T1/de

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F5/00—Methods or arrangements for data conversion without changing the order or content of the data handled
    • G06F5/06—Methods or arrangements for data conversion without changing the order or content of the data handled for changing the speed of data flow, i.e. speed regularising or timing, e.g. delay lines, FIFO buffers; over- or underrun control therefor
    • G06F5/08—Methods or arrangements for data conversion without changing the order or content of the data handled for changing the speed of data flow, i.e. speed regularising or timing, e.g. delay lines, FIFO buffers; over- or underrun control therefor having a sequence of storage locations, the intermediate ones not being accessible for either enqueue or dequeue operations, e.g. using a shift register
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/141—Discrete Fourier transforms
    • G06F17/142—Fast Fourier transforms, e.g. using a Cooley-Tukey type algorithm
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F5/00—Methods or arrangements for data conversion without changing the order or content of the data handled
    • G06F5/01—Methods or arrangements for data conversion without changing the order or content of the data handled for shifting, e.g. justifying, scaling, normalising
    • G06F5/015—Methods or arrangements for data conversion without changing the order or content of the data handled for shifting, e.g. justifying, scaling, normalising having at least two separately controlled shifting levels, e.g. using shifting matrices
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • G06F7/4806—Computations with complex numbers

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Mathematical Physics (AREA)
  • General Engineering & Computer Science (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Computing Systems (AREA)
  • Software Systems (AREA)
  • Discrete Mathematics (AREA)
  • Algebra (AREA)
  • Databases & Information Systems (AREA)
  • Complex Calculations (AREA)
  • Electrophonic Musical Instruments (AREA)
  • Oscillators With Electromechanical Resonators (AREA)
  • Time-Division Multiplex Systems (AREA)
  • Radar Systems Or Details Thereof (AREA)
  • Hardware Redundancy (AREA)
AT88907212T 1987-08-21 1988-08-22 Transformationsverarbeitungsschaltung ATE131948T1 (de)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
AUPI388887 1987-08-21

Publications (1)

Publication Number Publication Date
ATE131948T1 true ATE131948T1 (de) 1996-01-15

Family

ID=3772401

Family Applications (1)

Application Number Title Priority Date Filing Date
AT88907212T ATE131948T1 (de) 1987-08-21 1988-08-22 Transformationsverarbeitungsschaltung

Country Status (8)

Country Link
US (1) US5297070A (de)
EP (1) EP0377604B1 (de)
JP (1) JPH02504682A (de)
KR (1) KR890702151A (de)
AT (1) ATE131948T1 (de)
AU (1) AU610934B2 (de)
DE (1) DE3854818T2 (de)
WO (1) WO1989001668A1 (de)

Families Citing this family (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2531913B2 (ja) * 1991-01-31 1996-09-04 エコジエン・インコーポレーテツド バシルス チュリンギエンシス（Ｂａｓｉｌｌｕｓ ｔｈｕｒｉｎｇｉｅｎｓｉｓ） ｃｒｙＩＩＩＣ（ｂ）毒素遺伝子及び甲虫類昆虫に毒性のタンパク質
DE4130451B4 (de) * 1991-09-13 2004-09-16 Diehl Stiftung & Co.Kg Schaltungsstruktur zur Durchführung der schnellen Fourier-Transformation
US5682340A (en) * 1995-07-03 1997-10-28 Motorola, Inc. Low power consumption circuit and method of operation for implementing shifts and bit reversals
SE509108C2 (sv) * 1997-01-15 1998-12-07 Ericsson Telefon Ab L M Förfarande och anordning för beräkning av FFT
KR100201946B1 (ko) * 1997-03-19 1999-06-15 윤종용 Fft 망의 첵섬 계산장치 및 방법
US6035313A (en) * 1997-03-24 2000-03-07 Motorola, Inc. Memory address generator for an FFT
US6169723B1 (en) * 1997-07-02 2001-01-02 Telefonaktiebolaget Lm Ericsson Computationally efficient analysis and synthesis of real signals using discrete fourier transforms and inverse discrete fourier transforms
JP3900670B2 (ja) * 1998-04-17 2007-04-04 ソニー株式会社 通信装置
US6240141B1 (en) 1998-05-09 2001-05-29 Centillium Communications, Inc. Lower-complexity peak-to-average reduction using intermediate-result subset sign-inversion for DSL
SE9802059D0 (sv) * 1998-06-10 1998-06-10 Ericsson Telefon Ab L M Digital channeliser and De-shanneliser
US6532484B1 (en) * 1999-06-21 2003-03-11 Sun Microsystems, Inc. Parallel system and method for performing fast fourier transform
US6477554B1 (en) 1999-09-17 2002-11-05 Globespanvirata, Inc. Circuit and method for computing a fast fourier transform
KR100477649B1 (ko) * 2002-06-05 2005-03-23 삼성전자주식회사 다양한 프레임 사이즈를 지원하는 정수 코딩 방법 및 그를적용한 코덱 장치
TWI281619B (en) * 2002-12-20 2007-05-21 Realtek Semiconductor Corp Data processing structure and method for fast Fourier transformation/inverse fast Fourier transformation
AU2005269896A1 (en) * 2004-07-08 2006-02-09 Asocs Ltd. A method of and apparatus for implementing fast orthogonal transforms of variable size
SG133451A1 (en) * 2005-12-30 2007-07-30 Oki Techno Ct Singapore Pte A processor and method for performing a fast fourier transform and/or an inverse fast fourier transform of a complex input signal
US7702713B2 (en) * 2006-03-24 2010-04-20 Debashis Goswami High speed FFT hardware architecture for an OFDM processor
US8275822B2 (en) * 2007-01-10 2012-09-25 Analog Devices, Inc. Multi-format multiplier unit
US20090172062A1 (en) * 2007-12-31 2009-07-02 Broadcom Corporation Efficient fixed-point implementation of an fft
US8572148B1 (en) * 2009-02-23 2013-10-29 Xilinx, Inc. Data reorganizer for fourier transformation of parallel data streams
US8583718B2 (en) * 2010-08-17 2013-11-12 Fujitsu Limited Comparing boolean functions representing sensor data
US8787422B2 (en) 2011-12-13 2014-07-22 Qualcomm Incorporated Dual fixed geometry fast fourier transform (FFT)
WO2013095631A1 (en) * 2011-12-23 2013-06-27 Intel Corporation Systems, apparatuses, and methods for performing a butterfly horizontal and cross add or substract in response to a single instruction
WO2018149471A1 (en) * 2017-02-14 2018-08-23 Heldeis Christoph Method for operating an active input element and corresponding input element, input arrangement and computer program product

Family Cites Families (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3174106A (en) * 1961-12-04 1965-03-16 Sperry Rand Corp Shift-register employing rows of flipflops having serial input and output but with parallel shifting between rows
US3673399A (en) * 1970-05-28 1972-06-27 Ibm Fft processor with unique addressing
US3702393A (en) * 1970-10-21 1972-11-07 Bell Telephone Labor Inc Cascade digital fast fourier analyzer
US3892956A (en) * 1971-12-27 1975-07-01 Bell Telephone Labor Inc Cascade digital fast fourier analyzer
US3818203A (en) * 1973-08-27 1974-06-18 Honeywell Inc Matrix shifter
US3943347A (en) * 1974-11-27 1976-03-09 Rca Corporation Data processor reorder random access memory
FR2326743A1 (fr) * 1975-10-02 1977-04-29 Thomson Csf Calculateur de transformee de fourier discrete
JPS549543A (en) * 1977-06-24 1979-01-24 Hitachi Ltd Signal processing system
JPS5523501A (en) * 1978-06-29 1980-02-20 Fujitsu Ltd Shift operation unit
US4181976A (en) * 1978-10-10 1980-01-01 Raytheon Company Bit reversing apparatus
US4241411A (en) * 1978-11-16 1980-12-23 Probe Systems, Incorporated FFT Parallel processor having mutually connected, multiple identical cards
US4547862A (en) * 1982-01-11 1985-10-15 Trw Inc. Monolithic fast fourier transform circuit
US4563750A (en) * 1983-03-04 1986-01-07 Clarke William L Fast Fourier transform apparatus with data timing schedule decoupling
US4689762A (en) * 1984-09-10 1987-08-25 Sanders Associates, Inc. Dynamically configurable fast Fourier transform butterfly circuit
JPS6178240A (ja) * 1984-09-25 1986-04-21 Nippon Telegr & Teleph Corp <Ntt> Ｄｅｓ暗号装置
WO1986002474A1 (en) * 1984-10-16 1986-04-24 The Commonwealth Of Australia Care Of The Secretar A cellular floating-point serial-pipelined multiplier
JPS6231472A (ja) * 1985-04-03 1987-02-10 Nec Corp ビツト処理回路
JPS62175866A (ja) * 1986-01-30 1987-08-01 Nec Corp シグナルプロセツサ

Also Published As

Publication number Publication date
AU610934B2 (en) 1991-05-30
DE3854818T2 (de) 1996-05-15
KR890702151A (ko) 1989-12-23
JPH02504682A (ja) 1990-12-27
EP0377604A1 (de) 1990-07-18
EP0377604B1 (de) 1995-12-20
EP0377604A4 (en) 1991-09-18
AU2327388A (en) 1989-03-09
US5297070A (en) 1994-03-22
WO1989001668A1 (en) 1989-02-23
DE3854818D1 (de) 1996-02-01

Similar Documents

Publication Publication Date Title
DE3854818D1 (de) Transformationsverarbeitungsschaltung
KR950009472A (ko) 2차원 이산코사인 변환장치, 2차원 역이산코사인 변환장치 및 디지탈 신호처리 장치
Garrido et al. A serial commutator fast Fourier transform architecture for real-valued signals
WO1998018083A1 (en) A device and method for calculating fft
US8010588B2 (en) Optimized multi-mode DFT implementation
Kallapu et al. DRRA-based reconfigurable architecture for mixed-radix FFT
Arguello et al. Parallel architecture for fast transforms with trigonometric kernel
US6330580B1 (en) Pipelined fast fourier transform processor
Yen A pipelined distributed arithmetic PFFT processor
Chiu et al. An Efficient Real-Valued Cross-Correlator via Fast Fourier Transform
Thokala Area Efficient and High-Throughput Radix-4 1024-Point FFT Processor for DSP Applications
HORNG et al. Discrete Walsh polynomials in the optimal control of linear digital time-varying systems
Yang et al. Centralized fast slant transform algorithms
Hsiao et al. Parallel, pipelined and folded architectures for computation of 1-D and 2-D DCT in image and video codec
Kumar A Normal I/O Order Radix-2 FFT Architecture for High Speed Applications
Ramesh et al. Comprehensive address generator for digital signal processing
Lee A 2k/3× 2k-Point Multi-Path Partial FFT Processor and Bit Reversal Circuits for Non-Power-of-Two FFTs
Dyer et al. Computation of the discrete cosine transform via the arcsine transform
JP2507473B2 (ja) 処理装置
JPH0219507B2 (de)
Karwoski Four-cycle butterfly arithmetic architecture
JPH0148582B2 (de)
Prasanna Kumar et al. Design and Implementation of AGU based FFT Pipeline Architecture
Kudeshia et al. Novel design of FFT using high radix butterfly of complex valued data
Caraiscos et al. Two dimensional DFT using mixed time and frequency decimations

Legal Events

Date Code Title Description
RER Ceased as to paragraph 5 lit. 3 law introducing patent treaties