Patent US4513387A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4513387A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and an apparatus for generating periodic digital time function signals

Assignee: Siemens Building Technologies AG
•
Filing: 1982-07-13
•
Granted: 1985-04-23
•
Expires: 2002-07-13
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and an apparatus for obtaining digital periodic time function signals, and wherein each time function signal is defined by an instantaneous frequency varying in dependence of time within a characteristic period T equal to the period of a first clock signal, includes a generator for generating a second clock signal, period counters for cyclically counting the periods of the second clock signal, a divider for deriving a third clock signal from the second clock signal, and wherein the third clock signal is a subharmonic of the second clock signal, a memory which has a plurality of storage cells for storing groups of binary numbers characteristic of the time function signals, respectively, an address counter for sequentially calling up and reading out the storage cells with the aid of the third clock signal, a logic circuit for enabling the count of one period counter with a predetermined delay with respect to the time of call-up of each corresponding storage cell, and bistable multivibrators for inverting the digital instantaneous values of one time function signal after predetermined counts of the periods of the second clock signal, in dependence of the binary number read out from the memory, whereby a selected digital periodic time function signal is generated, in dependence of the corresponding group of binary numbers stored in the memory and representing the time values of the edges of the digital time function signal which is generated.

Inventors

  • 👤 Norbert Neyer

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-28 11:09
CPC Classifications
G; G06; G06F; G06F1/00; G06F1/04; G06F1/14

Claims Analysis

Total Claims: 14
Claim 1
Independent Claim 567 words
In a method of obtaining digital periodic time function signals with the aid of a memory (3) having a plurality of storage cells, each time function signal having a first period (T), predetermined binary numbers stored in corresponding storage cells defining each periodic time function signal, the steps comprising for each of said digital periodic time function signals calculating a first group of binary numbers (x j ) representing relative time values of their positive and negative going edges by choosing for each of said relative time values an own zero reference point by taking into account the delay time of said memory (3), by using a second period (T 2 ) as a time unit, allotting to said binary numbers (x j ) a predetermined, normally not used binary number (255="11111111"), in each case an edge is not to be produced, assigning a prearranged number of said storage cells to each of said digital periodic time function signals to be obtained, storing each one of said first groups of binary numbers (x j ) in those of said storage cells which belong to said digital periodic time function signal, and in such an order of succession that increasing absolute time values related to said binary numbers (x j ) correspond to increasing values of memory addresses, whereby said absolute time values correspond to said relative time values with the difference that the absolute time values have a single zero reference point common for all of them, generating a first clock signal (CL1) for resetting purposes, having a period (T 1 ) equal to said first period (T) of said digital periodic time function signals, generating a second clock signal (CL2) having said second period (T 2 ), which has a predetermined relationship to said first period (T), deriving from said second clock signal (CL2) a third clock signal (CL3), having a third period (T 3 ) which is a multiple of said second period (T 2 ), binary counting the number of said third periods (T 3 ) with the aid of an address counter (2) and allotting this second group of binary numbers to said memory addresses of said storage cells, successive calling up said different storage cells belonging to said digital periodic time function signal, with the aid of said second group of binary numbers and the address inputs of said memory (3), and thereby successively reading of said binary numbers (x j ) of said first group of binary numbers out of said memory (3), successive parallel loading said binary numbers (x j ) of said first group of binary numbers in period counters (4; 5), delayed enabling between each of said loadings during an enabling time interval, only the counting of one of said period counters (4; 5) with the aid of a logic circuit (12), if an edge of said digital periodic time function signal which belongs to said one period counter must be produced during said enabling time interval, counting the number of second periods (T 2 ) during said enabling time beginning with said loaded binary number (x j ) of said first group of binary numbers until a predetermined reference number is reached, in the moment of reaching said predetermined reference number, inverting the digital instantaneous value of said digital periodic time function signal at the output of a D-flip-flop (6; 7) with the aid of this D-flip-flop.
Claim 2
Dependent Claim 567 words
In a method of obtaining digital periodic time function signals with the aid of a memory (3) having a plurality of storage cells, each time function signal having a first period (T), predetermined binary numbers stored in corresponding storage cells defining each periodic time function signal, the steps comprising for each of said digital periodic time function signals calculating a first group of binary numbers (x j ) representing relative time values of their positive and negative going edges by choosing for each of said relative time values an own zero reference point by taking into account the delay time of said memory (3), by using a second period (T 2 ) as a time unit, allotting to said binary numbers (x j ) a predetermined, normally not used binary number (255="11111111"), in each case an edge is not to be produced, assigning a prearranged number of said storage cells to each of said digital periodic time function signals to be obtained, storing each one of said first groups of binary numbers (x j ) in those of said storage cells which belong to said digital periodic time function signal, and in such an order of succession that increasing absolute time values related to said binary numbers (x j ) correspond to increasing values of memory addresses, whereby said absolute time values correspond to said relative time values with the difference that the absolute time values have a single zero reference point common for all of them, generating a first clock signal (CL1) for resetting purposes, having a period (T 1 ) equal to said first period (T) of said digital periodic time function signals, generating a second clock signal (CL2) having said second period (T 2 ), which has a predetermined relationship to said first period (T), deriving from said second clock signal (CL2) a third clock signal (CL3), having a third period (T 3 ) which is a multiple of said second period (T 2 ), binary counting the number of said third periods (T 3 ) with the aid of an address counter (2) and allotting this second group of binary numbers to said memory addresses of said storage cells, successive calling up said different storage cells belonging to said digital periodic time function signal, with the aid of said second group of binary numbers and the address inputs of said memory (3), and thereby successively reading of said binary numbers (x j ) of said first group of binary numbers out of said memory (3), successive parallel loading said binary numbers (x j ) of said first group of binary numbers in period counters (4; 5), delayed enabling between each of said loadings during an enabling time interval, only the counting of one of said period counters (4; 5) with the aid of a logic circuit (12), if an edge of said digital periodic time function signal which belongs to said one period counter must be produced during said enabling time interval, counting the number of second periods (T 2 ) during said enabling time beginning with said loaded binary number (x j ) of said first group of binary numbers until a predetermined reference number is reached, in the moment of reaching said predetermined reference number, inverting the digital instantaneous value of said digital periodic time function signal at the output of a D-flip-flop (6; 7) with the aid of this D-flip-flop.
Claim 3
Dependent Claim 15 words
The method as claimed in claim 1, wherein said digital time function signals are "Chirp"-signals.
Claim 4
Dependent Claim 50 words
The method as claimed in claim 1 or 2, wherein said digital time function signals include first and second time function signals, and further comprising the steps of assigning a "logical 1" value to said first time function signal, and a logical "0" value to said second time function signal.
Claim 5
Dependent Claim 77 words
The method as claimed in claim 1 further comprising the step of choosing said relative time values represented by binary numbers (x j ) of said first group of binary numbers at most equal to h times said third period (T 3 ), wherein h equals the number of said periodic time function signals, and wherein the step of calling up said storage cells is performed in a timemultiplexed manner for said different periodic time function signals.
Claim 6
Dependent Claim 53 words
The method as claimed in claim 1 further comprising the step of choosing said relative time values represented by binary numbers (x j ) of said first group of binary numbers at most equal to said third period (T 3 ), when all of said time function signals have the same memory addresses.
Claim 7
Dependent Claim 38 words
The method as claimed in claim 4, wherein h equals two, and further comprising the steps of assigning even memory addresses to one of the time function signals, and odd memory addresses to the other time function signal.
Claim 8
Dependent Claim 20 words
The method as claimed in claim 1 wherein said counting of second periods (T 2 ) is a down counting.
Claim 9
Dependent Claim 61 words
The method as claimed in claim 1 wherein said counting of second periods (T 2 ) is an up counting, and wherein said first group of binary numbers consists of binary numbers (2 N -1-x j ) and each up count terminates at the value (2 N -1), where N is the number of bits employed in said digital binary number.
Claim 10
Dependent Claim 30 words
The method as claimed in claim 1 further comprising the step of choosing the delay time of said delayed enabling equal to about one-half said third period T 3 .
Claim 11
Dependent Claim 32 words
The method as claimed in claim 1 further comprising the step of setting the period T of each periodic time function signal equal to one-half the period of the mains supply frequency.
Claim 12
Dependent Claim 38 words
The method as claimed in claim 10 further comprising the step of resetting said counting of third periods (T 3 ) at the beginning of each period T in synchronism with the frequency of the mains supply system.
Claim 13
Dependent Claim 20 words
The method as claimed in claim 1 wherein said periodic time function signals are reference signals of a coherence receiver.
Claim 14
Dependent Claim 31 words
The method as claimed in claim 12, further comprising the step of connecting said coherence receiver to the mains supply so as to receive intelligence information transmitted over said mains supply.

References Cited (Backward Citations)

US3579146A Cited
US3937899A Cited
US3980960A Cited
US4225936A Cited
US4257108A Cited
US4330751A Cited
US4404644A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1988-04-22 1988-10-22 1989-04-23 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1992-04-22 1992-10-22 1993-04-23 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1996-04-22 1996-10-22 1997-04-23 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag