GB1518501A - Apparatus for computing the discrete fourier transform - Google Patents

Apparatus for computing the discrete fourier transform

Info

Publication number
GB1518501A
GB1518501A GB2290774A GB2290774A GB1518501A GB 1518501 A GB1518501 A GB 1518501A GB 2290774 A GB2290774 A GB 2290774A GB 2290774 A GB2290774 A GB 2290774A GB 1518501 A GB1518501 A GB 1518501A
Authority
GB
United Kingdom
Prior art keywords
samples
sine
values
transform
discrete fourier
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.)
Expired
Application number
GB2290774A
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.)
National Research Development Corp UK
Original Assignee
National Research Development Corp UK
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 National Research Development Corp UK filed Critical National Research Development Corp UK
Priority to GB2290774A priority Critical patent/GB1518501A/en
Publication of GB1518501A publication Critical patent/GB1518501A/en
Expired legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR 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

Landscapes

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

Abstract

1518501 Digital calculating NATIONAL RESEARCH DEVELOPMENT CORP 13 Aug 1975 [22 May 1974]. 22907/74 Heading G4A Discrete Fourier transformation (or its inverse) is performed on computer by adding and/or subtracting those values (samples) of the function to be transformed which require to be multiplied by the same (apart from sign) sine or cosine value in forming a given value (sample) of the transform, then using the results to obtain the values of the transform (viz. by multiplying by the sine or cosine value and summing as appropriate). If the function is complex, real and imaginary parts are treated separately, followed by addition of the final results. A special-purpose computer (a ROM may hold the algorithm programme) or a suitably-programmed general-purpose computer may be used. The algorithm, the mathematics of which are disclosed, uses an n x n matrix (where n is the number of samples) with entries +1, -1,0 to specify which samples are to be added, which subtracted and which ignored in performing the first stage above (i.e. prior to the multiplication by the sine and/or cosine values), a definition of this matrix being given which is recursive on the number of samples.
GB2290774A 1975-08-13 1975-08-13 Apparatus for computing the discrete fourier transform Expired GB1518501A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
GB2290774A GB1518501A (en) 1975-08-13 1975-08-13 Apparatus for computing the discrete fourier transform

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
GB2290774A GB1518501A (en) 1975-08-13 1975-08-13 Apparatus for computing the discrete fourier transform

Publications (1)

Publication Number Publication Date
GB1518501A true GB1518501A (en) 1978-07-19

Family

ID=10186991

Family Applications (1)

Application Number Title Priority Date Filing Date
GB2290774A Expired GB1518501A (en) 1975-08-13 1975-08-13 Apparatus for computing the discrete fourier transform

Country Status (1)

Country Link
GB (1) GB1518501A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2190221A (en) * 1986-05-08 1987-11-11 Secr Defence Signal transforming device

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2190221A (en) * 1986-05-08 1987-11-11 Secr Defence Signal transforming device
GB2190221B (en) * 1986-05-08 1990-05-02 Secr Defence Signal transforming device

Similar Documents

Publication Publication Date Title
Chandra Sign/logarithm arithmetic for FFT implementation
Byszewski Existence and uniqueness of solutions of nonlocal problems for hyperbolic equation uxt= F (x, t, u, ux)
Foote et al. An exact solution for the stress intensity factor for a double cantilever beam
DE69333113T2 (en) Method and device for carrying out the discrete cosine transformation and inverse discrete cosine transformation
Nauenberg Scaling representation for critical phenomena
DE502004001490D1 (en) DEVICE AND METHOD FOR IMPLEMENTING INTO A TRANSFORMED PRESENTATION OR FOR INVERSING THE TRANSFORMED PRESENTATION
GB1518501A (en) Apparatus for computing the discrete fourier transform
Eberlein A note on Fourier-Stieltjes transforms
Comstock The Poincaré–Lighthill perturbation technique and its generalizations
Nelson Using nested designs: I. Estimation of standard deviations
Nakano Parameter estimation of an autoregressive moving average model
Bellman Invariant imbedding and random walk
GB1380888A (en) Method for estimating the ambiguity function and device for carrying out said method
Kober A remark on a monotone singular function
Karlovych et al. A remark on Toeplitz and Laurent operators acting on ℓp spaces with power weights
SU815733A1 (en) Statistic moment computer
Mortici et al. On the growth rate of divergent series
SU151051A1 (en) The method of building a static functional converter
Groden et al. Electrode surface concentrations for mixed transfer processes: transfer by diffusion and chemical reaction for a plane electrode
DIMMICK et al. Studies on possible propagation of microbial contamination in planetary clouds(Metabolism and propagation of microbial contamination in planetary atmospheres)[Quarterly Status Report, Aug. 1, 1973]
Korzeniowski Probabilistic viscosity algorithm for the scalar conservation law
AVRAHAMI INFORMATION: A FORTRAN IV program for converting information values into probabilities, odds, and evidence values
Sedransk Prediction Analysis.
POLGE et al. Theory and implementation of fast fourier and Hadamard transforms, volume 1(Algorithm for discrete transforms for implementing computer programs in radar signal processing)[Interim Technical Report, Mar. 1972- Mar. 1973]
Morduchow Integrals and Equal Division Sums

Legal Events

Date Code Title Description
PS Patent sealed
PCNP Patent ceased through non-payment of renewal fee