Patent US4430722A successfully refreshed from Google Patents.
US4430722A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and arrangement for the correlation of two signals
Assignee: LINDNER KLAUS PETER
•
Filing: 1980-09-26
•
Granted: 1984-02-07
•
Expires: 2000-09-26
Abstract
Abstract Disclosed is a method and apparatus for correlating first and second signals where sampling values of the signals are multiplied together and discrete values of the correlation function are determined. In one embodiment, the signals are sampled at different sampling frequencies such that one sampling frequency is a multiple of the other sampling frequency. A number of the respective last sampling values of the more fully sampled signal are stored and each sampling value of the more rapidly sampled signal is multiplied simultaneously by all of the stored sampling values of the more slowly sampled signal. The results of the multiplication are separately summed corresponding to equal time displacements between the multiplied sampling values. In a further preferred embodiment, a microcomputer is programmed for sampling the two signals with sampling frequencies having a ratio 1:k. The more slowly sampled signals are stored in an n stage register. The contents of corresponding register stages are multiplied in n multiplier circuits by the sampling values of the more quickly sampled signal. A summation store having m=k·n storage locations stores the multiplication values and a distributing circuit introduces the multiplication values into the storage locations associated with the respective time displacements for addition to the preceding storage location content.
Inventors
- 👤 Robert Massen
- 👤 Jurgen Merkel
- 👤 Klaus-Peter Lindner
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 23:33
CPC Classifications
G; G01; G01F; G01F1/00; G01F1/66; G01F1/666; G06; G06F; G06F17/00; G06F17/10; G06F17/15
Claims Analysis
Total Claims: 34
Claim 1
Independent Claim
131 words
Method for correlating first and second signals wherein mutually time-displaced sampling values of the two signals are multiplied together and to determine a discrete value of the correlation function the average value of the multiplication results corresponding to the same time displacement is formed, said method comprising: sampling said second signal at a predetermined sampling frequency, sampling said first signal with a sampling frequency which is a multiple of the sampling frequency of said second signal, storing a number of the respective last sampling values of the more slowly sampled signal, multiplying each sampling value of the more rapidly sampled signal simultaneously by all the stored sampling values of the more slowly sampled signal; and separately summing respective multiplication results corresponding to the equal time displacement between the multiplied sampling values.
Claim 2
Dependent Claim
131 words
Method for correlating first and second signals wherein mutually time-displaced sampling values of the two signals are multiplied together and to determine a discrete value of the correlation function the average value of the multiplication results corresponding to the same time displacement is formed, said method comprising: sampling said second signal at a predetermined sampling frequency, sampling said first signal with a sampling frequency which is a multiple of the sampling frequency of said second signal, storing a number of the respective last sampling values of the more slowly sampled signal, multiplying each sampling value of the more rapidly sampled signal simultaneously by all the stored sampling values of the more slowly sampled signal; and separately summing respective multiplication results corresponding to the equal time displacement between the multiplied sampling values.
Claim 3
Dependent Claim
27 words
Method according to claim 1, wherein prior to said sampling of said second signal said method includes the step of imparting a predelay to the second signal.
Claim 4
Dependent Claim
16 words
Method according to claim 2, wherein said imparting step includes the step of adjusting the predelay.
Claim 5
Dependent Claim
47 words
Method according to claim 1 wherein m=k·n discrete values of the correlation function are formed, in said sampling step, the two signals are sampled in the frequency ratio 1:k, and in said storing step the n last sampling values of the more slowly sampled signal are stored.
Claim 6
Dependent Claim
39 words
Method according to claim 1, wherein m=2 n discrete values of the correlation function are formed, in said sampling step, the two signals are sampled in the frequency ratio 1:2 n /n, where n is a power of 2.
Claim 7
Dependent Claim
77 words
Method according to claim 4 or 5, wherein between said multiplying and summing step there is a second storing step, said second storing step including storing, the n multiplication results obtained simultaneously in each sampling period of the first signal in parallel in a buffer store, reading the multiplication results stored in the buffer store from the buffer store and distributing amongst the store locations of the summation store the multiplication results read from said buffer store.
Claim 8
Dependent Claim
141 words
Arrangement for correlating first and second signals wherein mutually time displaced sampling values of the signals are multiplied together and discrete values of the correlation function are determined, said arrangement comprising: means for sampling the two signals in the frequency ratio 1:k; register means responsive to said sampling means having n stages for storing the n last sampling values of the more slowly sampled signal; n multiplier circuit means for multiplying two inputs, one input responsive to the content of a corresponding register stage and the other input responsive to the sampling values of the more quickly sampled signal; a summation store means having m=k·n storage locations; and distributing circuit means for introducing the multiplication results from the multiplier circuits into the storage locations in said summation store means associated with the respective time displacements with addition to the preceding content.
Claim 9
Dependent Claim
141 words
Arrangement for correlating first and second signals wherein mutually time displaced sampling values of the signals are multiplied together and discrete values of the correlation function are determined, said arrangement comprising: means for sampling the two signals in the frequency ratio 1:k; register means responsive to said sampling means having n stages for storing the n last sampling values of the more slowly sampled signal; n multiplier circuit means for multiplying two inputs, one input responsive to the content of a corresponding register stage and the other input responsive to the sampling values of the more quickly sampled signal; a summation store means having m=k·n storage locations; and distributing circuit means for introducing the multiplication results from the multiplier circuits into the storage locations in said summation store means associated with the respective time displacements with addition to the preceding content.
Claim 10
Dependent Claim
22 words
Arrangement according to claim 7, wherein the distributing circuit means and the summation store means are comprised of parts of a microcomputer.
Claim 11
Dependent Claim
55 words
Arrangement according to claim 7, wherein said n-stage register means comprises a shift register and further includes means for introducing the sampling values of the more slowly sampled signal into the first register state and for shifting the content of each register stage into the next register stage in time with the lower sampling frequency.
Claim 12
Dependent Claim
39 words
Arrangement according to claim 9, wherein said sampling means comprises a plurality of individual sampling means, further including a signal converter preceding each of said individual sampling means for converting the signal to be correlated to a binary signal.
Claim 13
Dependent Claim
63 words
Arrangement according to claim 10, wherein each of said individual sampling means comprises a D flip-flop having a D input, a clock input and a Q output, said D input is connected to the output of the corresponding signal converter, and the clock input of said D flip-flop is connected to clock pulses having a recurrence frequency corresponding to the associated sampling frequency.
Claim 14
Dependent Claim
89 words
Arrangement according to claim 11, wherein said register means includes a D flip-flop receiving the clock pulses with the lower recurrence frequency as the first stage of an n-stage shift register means, said shift register means comprised of a plurality of subsequent stages formed by D flip-flops each subsequent stage D flip flophaving a D input connected to the Q output of the D flip-flop of the preceding stage said n-stage shift register D flip-flop having clock inputs to which clock pulses with the lower recurrence frequency are applied.
Claim 15
Dependent Claim
16 words
Arrangement according to claim 12, wherein each multiplier circuit is comprised of a digital logic circuit.
Claim 16
Dependent Claim
14 words
Arrangement according to claim 13, wherein each digital logic circuit comprises an equivalence circuit.
Claim 17
Dependent Claim
25 words
Arrangement according to claim 7, wherein said sampling means includes an analog-digital converter means for converting each sampling value to a multi-digit digitally coded signal.
Claim 18
Dependent Claim
32 words
Arrangement according to claim 7, the sampling means, the register means and the multiplier circuits are analog circuits and further including an analog-digital converter connected to the output of each multiplier circuit.
Claim 19
Dependent Claim
42 words
Arrangement according to claim 7, wherein said second signal is said more slowly sampled signal, further comprising a delay circuit means, responsive to said second signal, for delaying said second signal and for applying said delayed second signal to said sampling means.
Claim 20
Dependent Claim
15 words
Arrangement according to claim 17, wherein said delay circuit means has an adjustable delay time.
Claim 21
Dependent Claim
30 words
Arrangement according to claim 17, wherein the delay circuit comprises a shift register having a clock input said fast sampling frequency applied to said delay circuit shift register clock input.
Claim 22
Dependent Claim
27 words
Arrangement according to claim 19, further including a sampling circuit controlled in time with the fast sampling frequency providing an output to said delay circuit shift register.
Claim 23
Dependent Claim
40 words
Arrangement according to claim 7, further comprising: a clock generator means for furnishing clock pulses having a recurrence frequency corresponding to the fast sampling frequency; and a frequency divider, responsive to the clock generator and having the division ratio l:k.
Claim 24
Dependent Claim
16 words
Arrangement according to claim 21, wherein said clock generator means comprises an adjustable frequency clock generator.
Claim 25
Dependent Claim
79 words
Arrangement according to claim 7, further including: a buffer store connected between the multiplier circuits and the distributing circuit means; and a control circuit means for controlling the parallel introduction of the multiplication results into the buffer store in each first phase in time with the fast sampling and for transferring the stored information from the buffer store to the distributing circuit in each second phase at a clock frequency independent of the clock frequency of the fast sampling.
Claim 26
Dependent Claim
32 words
Arrangement according to claim 23, wherein said buffer store comprises an integral multiple of k storage locations, each of said storage locations including a capacity adequate to accommodate said multiplier circuit results.
Claim 27
Dependent Claim
44 words
Arrangement according to claim 24, wherein said buffer store further includes an address counter means having a count for indicating the address of the storage location, which storage location is affected by the writing in or reading out of a group of multiplication results.
Claim 28
Dependent Claim
44 words
Arrangement according to claim 25, wherein the control circuit means includes means for advancing of the address counter with the clock frequency of the fast sampling in each first phase and with the clock frequency of the control circuit transfer in each second phase.
Claim 29
Dependent Claim
76 words
Arrangement according to claim 26, further including an address computer means in each second phase, for receiving the signals indicating the count of the address counter and for calculating therefrom the addresses of the storage locations of the summation store means which are associated with the time displacements for which the multiplication results have been obtained which are at the storage location of the buffer store whose address corresponds to the count of the address store.
Claim 30
Dependent Claim
28 words
Arrangement according to claim 27, wherein said control circuit means includes means for triggering each first phase simultaneously with the start of a period of the slower sampling.
Claim 31
Dependent Claim
63 words
Arrangement according to claim 27, further including index counter means which is continuously advanced in time with the faster sampling and by an index register means, which is triggered by the control circuit means at the start of each first phase, for taking over the instantaneous count of the index counter means, said index register having an output connected to the address computer.
Claim 32
Dependent Claim
15 words
Arrangement according to claim 29, wherein said index counter means is a "modulo k" counter.
Claim 33
Dependent Claim
20 words
Arrangement according to claim 30, wherein said index counter means includes the frequency divider used for the frequency division l:k.
Claim 34
Dependent Claim
24 words
Arrangement according to claim 23, wherein said control circuit means, the buffer store, and the register means are comprised by components of a microcomputer.
References Cited (Backward Citations)
DE1549603B1
Cited
US3646334A
Cited
US3648040A
Cited
DE2124222B2
Cited
US4019038A
Cited
FR2206872A5
Cited
US3965338A
Cited
DE2440530A1
Cited
US4097801A
Cited
DE2633565A1
Cited
US4244026A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1987-02-06 | 1987-08-08 | 1988-02-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1991-02-06 | 1991-08-08 | 1992-02-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1995-02-06 | 1995-08-08 | 1996-02-07 | $7700.00 | Window Closed / Lapsed |