WO1994003866A1 - Procede pour determiner les composantes spectrales d'une sequence de donnees et dispositif de mise en ×uvre dudit procede - Google Patents

Procede pour determiner les composantes spectrales d'une sequence de donnees et dispositif de mise en ×uvre dudit procede Download PDF

Info

Publication number
WO1994003866A1
WO1994003866A1 PCT/DE1993/000509 DE9300509W WO9403866A1 WO 1994003866 A1 WO1994003866 A1 WO 1994003866A1 DE 9300509 W DE9300509 W DE 9300509W WO 9403866 A1 WO9403866 A1 WO 9403866A1
Authority
WO
WIPO (PCT)
Prior art keywords
binary
analysis function
value
complex
data sequence
Prior art date
Application number
PCT/DE1993/000509
Other languages
German (de)
English (en)
Inventor
Andreas Wolf
Hans Werner Arweiler
Original Assignee
Siemens Aktiengesellschaft
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 Siemens Aktiengesellschaft filed Critical Siemens Aktiengesellschaft
Priority to AU43066/93A priority Critical patent/AU4306693A/en
Publication of WO1994003866A1 publication Critical patent/WO1994003866A1/fr

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/14Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/141Discrete Fourier transforms

Definitions

  • the invention relates to a method for determining
  • the task arises in digital measurement technology
  • the discrete Fourier transform (DFT) of a sequence of numbers d (n) is, for example, for the computational implementation of the known transformations
  • N field length of the data sequence d (n)
  • DFT discrete Fourier transform
  • N 1024 position numbers or binary values - is
  • the object of the invention is therefore to create an extremely fast, low-effort method for the reliable determination of spectral components in a binary data sequence.
  • threshold value within the value range of the analysis function (f (n, m)) is assigned to form a complex binary analysis function
  • At least one evaluation point is formed and evaluated.
  • Data sequence with a binary analysis function provides sufficiently precise analysis results so that an elaborate multiplication of a binary data sequence with a multi-value analysis function can be replaced by a simple link.
  • Binary value assigned It can be used without limitation
  • the method defines whether, if a value of the complex analysis function is equal to the threshold value, this value of the analysis function is assigned the first or the second binary value.
  • the multiplicative linkage to be carried out in the method according to the invention is thereby advantageously reduced to the width of only one place in each case. This results in further advantages of the method according to the invention in the extraordinarily high process speed and the very low circuit complexity for carrying out the method.
  • the method according to the invention can be implemented entirely in digital technology using simple logic modules.
  • the analysis function can be formed, for example, by periodic rectangular functions or sawtooth functions; A particularly advantageous embodiment of the method according to the invention is, however, that trigonometric functions are used as the complex analysis function and that the threshold value has the value zero. at
  • An embodiment of the method according to the invention which is advantageous with regard to the implementation of the method consists in that the complex binary analysis function is formed and stored in advance for a large number of position numbers and evaluation points.
  • periodic components can be increased in that the positions of the data sequence are scanned several times and corresponding to the number of scans several times with the position number-specific one Value of the binary analysis function can be linked.
  • a summing device which forms the cross sum for the real and imaginary part of the result of the combination. If the data sequence is in the form of bipolar binary values, these are previously converted into unipolar binary values
  • the device according to the invention is relatively simple and can be constructed using purely digital technology; she
  • an advantageous embodiment of the device according to the invention contains
  • a multiple scanner which samples each value of the data sequence several times, preferably twice, and
  • a particularly preferred embodiment of the logic level in terms of circuitry is that the logic level is formed by EXCLUSIVE-OR logic elements with a subsequent inverting level.
  • the invention is explained in more detail below using exemplary embodiments with the aid of a drawing; show it:
  • Figure 2 shows an example calculation for the determination of
  • Figure 3 is a graphical representation of results of the inventive method.
  • FIGS 4 and 5 devices for performing the method according to the invention.
  • Binary value -1 assigned.
  • a second binary value +1 is assigned to each value of the analysis function f (n, m) that lies above the threshold value S or is equal to the threshold value S.
  • a complex binary analysis function BA (n, m) is thus formed with a real and imaginary part according to equations (5) and (6), to which unipolar binary values 0; 1 are then assigned.
  • Evaluation points m can preferably be formed and stored in advance.
  • the respective values 0.1 of the data sequence d '(n) are then multiplicatively linked with the respective unipolar binary value 0.1 of the binary analysis function BA (n, m) assigned to them.
  • the multiplicative combination is carried out in a simple manner by means of an EXCLUSIVE-OR combination and subsequent inversion.
  • line D of FIG. 2 the EXCLUSIVE-OR combination of the respective parts sn '(n, m) and cs' (n, m) of the binary analysis function with the data sequence d' (shown on the far left in line D) is accordingly first (n) shown. Because of the negative
  • the sign of the imaginary part is only to be inverted due to the multiplicative link (the imaginary part remains unchanged due to the double inversion due to the multiplicative link on the one hand and the negative sign according to equation (7) on the other).
  • the values of the imaginary part are each in the first sub-column, while the values of the real part are each in the third sub-column under the symbol INV.
  • the DFT or BFT basically gives the double spectrum over the value N.
  • the small field length N chosen only for better explanation leads to comparatively little characteristic results.
  • FIG. 3 illustrates that the method according to the invention is particularly useful for double scanning (simulation) BFT2, which then supplies 256 evaluation points m , only marginally from an analysis result with a discrete Fourier Transformation DFT1 deviates with a sample value (corresponding striking spectral line MSP).
  • the device contains a device 10 and 11 which assigns the unipolar binary values 0 and 1 to the binary values -1 and +1 of the complex binary analysis function. This assignment takes place separately according to the real and imaginary part, so that the imaginary part by
  • a logic level V multiplies the binary values 0 and 1 of the data sequence d '(n) by those of the considered
  • Evaluation point m 2 assigned position number-specific unipolar binary values 0 and 1 of the complex binary
  • a summing device 15 forms the cross sum QSI and QSR for the real part Re (2) and the imaginary part Im (2) of the combination result.
  • the amount of the total linking result is determined by squaring and subsequent square rooting.
  • Linkage level V consists of
  • EXCLUSIVE-OR logic elements EXOR1 and EXOR2 the logic element EXOR2 being followed by an inversion stage INVT.
  • An inversion level to be added to the logic element EXOR1 for the multiplication is omitted due to the negative sign of the imaginary part.
  • FIG. 5 shows a section of the device according to FIG. 4, which has been modified with regard to the sampling frequency of the data sequence d '(n) and the linkage.
  • the data sequence d '(n) is scanned twice by a multiple scanning device 20, so that a modified data sequence d' '(n) results, in which each position is duplicated with the corresponding value compared to the original data sequence d' (n) is.
  • a duplicator 21 and 22 orders the binary values -1 and +1 of the complex ones

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

Afin de déterminer les composantes spectrales et/ou périodiques d'une séquence de données (d(n)), qui contient des valeurs binaires (0; 1) à un nombre (N) de numéros de position (n), la séquence de données (d(n)) est évaluée par numéro de position, à des points d'évaluation (m) discrets avec une fonction d'analyse (f(n, m)) complexe. A cet effet, afin de constituer une fonction d'analyse binaire complexe (BA(n, m)) sur la fonction d'analyse complexe (f(n, m)), on utilise une fonction de comparaison (k) en respectant les prescriptions suivantes: k {f(n, m)} = + 1 pour f(n, m) > (S); k {f(n, m)} = - 1 pour f(n, m) < (S); k{f(n, m)} = - 1 ou + 1 pour f(n, m) = (S); (S) représentant la valeur seuil dans la gamme de valeurs de la fonction d'analyse (f(n, m)). Les valeurs (0, 1) de la séquence de données (d(n)) sont combinées, par multiplication, avec chacune des valeurs binaires (-1; +1) de la fonction d'analyse binaire (BA(n, m)) qui leur est allouée et la somme des résultats de la combinaison (QS) est faite et évaluée pour au moins un point d'évaluation (m).
PCT/DE1993/000509 1992-07-29 1993-06-07 Procede pour determiner les composantes spectrales d'une sequence de donnees et dispositif de mise en ×uvre dudit procede WO1994003866A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU43066/93A AU4306693A (en) 1992-07-29 1993-06-07 Process for determining spectral components of a sequence of data and device for implementing it

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DEP4225401.9 1992-07-29
DE19924225401 DE4225401C1 (de) 1992-07-29 1992-07-29 Verfahren zum Bestimmen spektraler Anteile eines Signals und Vorrichtung zur Durchführung des Verfahrens

Publications (1)

Publication Number Publication Date
WO1994003866A1 true WO1994003866A1 (fr) 1994-02-17

Family

ID=6464607

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/DE1993/000509 WO1994003866A1 (fr) 1992-07-29 1993-06-07 Procede pour determiner les composantes spectrales d'une sequence de donnees et dispositif de mise en ×uvre dudit procede

Country Status (3)

Country Link
AU (1) AU4306693A (fr)
DE (1) DE4225401C1 (fr)
WO (1) WO1994003866A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105472189A (zh) * 2014-09-30 2016-04-06 想象技术有限公司 声回波消除的检测

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2120293A5 (fr) * 1970-12-29 1972-08-18 Labo Cent Telecommunicat
FR2277377A1 (fr) * 1974-07-05 1976-01-30 Anvar Transformateur stochastique de fourier et analyseur spectral realise a partir de celui-ci
FR2536541A1 (fr) * 1982-11-23 1984-05-25 Labo Cent Telecommunicat Systeme simplifie d'analyse spectrale a exploitation de phase

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2205668B1 (fr) * 1972-11-07 1981-04-10 Thomson Csf
FR2424669A1 (fr) * 1978-04-27 1979-11-23 Materiel Telephonique Dispositifs analyseurs numeriques de spectres

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2120293A5 (fr) * 1970-12-29 1972-08-18 Labo Cent Telecommunicat
FR2277377A1 (fr) * 1974-07-05 1976-01-30 Anvar Transformateur stochastique de fourier et analyseur spectral realise a partir de celui-ci
FR2536541A1 (fr) * 1982-11-23 1984-05-25 Labo Cent Telecommunicat Systeme simplifie d'analyse spectrale a exploitation de phase

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
IBM TECHNICAL DISCLOSURE BULLETIN Bd. 25, Nr. 11A, April 1983, NEW YORK US Seiten 5561 - 5570 T.C.ANCHETA 'FASTER FOURIER TRANSFORM WITHOUT MULTIPLICATIONS' *
TECHNOLOGIE DE POINTE POUR LE TRAITEMENT DES SIGNAUX - JOURNEES D'ELECTRONIQUE 14. Oktober 1975, LAUSANNE, CH Seiten 283 - 294 F.CASTANIE ET AL 'TRANSFORMATEUR STOCHASTIQUE DE FOURIER' *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105472189A (zh) * 2014-09-30 2016-04-06 想象技术有限公司 声回波消除的检测
US10841431B2 (en) 2014-09-30 2020-11-17 Imagination Technologies Limited Detection of acoustic echo cancellation
US11601554B2 (en) 2014-09-30 2023-03-07 Imagination Technologies Limited Detection of acoustic echo cancellation

Also Published As

Publication number Publication date
AU4306693A (en) 1994-03-03
DE4225401C1 (de) 1994-05-26

Similar Documents

Publication Publication Date Title
DE2909153C2 (de) Einrichtung zur digitalen Analyse von Bild- oder Zeichenmustern
DE2928144C2 (fr)
DE3217861A1 (de) Verfahren und apparat zur kompensation von signallaufzeitaenderungen innerhalb der kanaele einer mehrkanalvorrichtung
DE2220784C2 (de) Anordnung zur Berechnung der diskreten Fourier-Transformierten aufgrund von N reellen Abtastwerten
DE2355640A1 (de) Anordnung zur spektralanalyse von elektrischen signalen
DE19961817A1 (de) Frequenzabweichung detektierendes Gerät und Frequenzabweichungs-Detektionsverfahren
EP0043571B1 (fr) Dispositif pour la reconnaissance automatique de caractères
DE3148735A1 (de) Verfahren und vorrichtung zur frequenzanalyse
DE2163621A1 (de) Schaltungsanordnung zur Durchführung der Fourier-Analyse
WO1994003866A1 (fr) Procede pour determiner les composantes spectrales d&#39;une sequence de donnees et dispositif de mise en ×uvre dudit procede
EP0742672A2 (fr) Procédé pour la réduction de données d&#39;images par codage fractal d&#39;images
DE3633461A1 (de) Taktsignalgebervorrichtung
WO2001080235A1 (fr) Procede permettant de determiner un enregistrement caracteristique pour un signal de donnees
DE3523972A1 (de) Kreuzkorrelator
DE3416536C2 (fr)
DE2704641A1 (de) Digitalfilter
DE19645057C2 (de) Vorrichtung zur Selektion von Adressenwörtern mittels Demultiplex-Decodierung
EP2082331A1 (fr) Procédé et dispositif pour incrémenter des positions de compteur mémorisées dans des cellules de mémoire d&#39;une mémoire
EP0449363B1 (fr) Circuit pour déterminer la position des valeurs extrêmes d&#39;une fonction de corrélation
EP0951750B1 (fr) Procede et configuration de circuits pour la generation d&#39;oscillations sinusoidales/cosinusoidales
DE4022381A1 (de) Verwendung langer digitalfilter bei vorkommnis von abrundungsfehlern
DE1937258C3 (de) Vorrichtung zur Erzeugung der Fouriertransformierten einer Funktion
DE1498062A1 (de) Verfahren und Einrichtung zur automatischen Auswertung von durch regelmaessiges,klassenweises Pruefen eines schwankenden Vorganges erhaltenen Pruefwerten
DE2257534A1 (de) Verfahren und vorrichtung zur spektralanalyse
DE10004457A1 (de) Konfigurationsmatcher zur Erkennung großer Fingerabdruck-Datenbanken

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AU CA JP NO US

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH DE DK ES FR GB GR IE IT LU MC NL PT SE

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: CA