Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
356 words
A system comprising: clock means for providing a succession of clock pulses of equal clock pulse intervals, each sequence of M clock pulse intervals defining a data frame, M being an integer other than a distinct prime and not less than one thousand; a plurality of modulo-mi multistage counters where each mi is a different prime power divisor of M, each modulo-mi counter comprising a different cascade of Alpha modulo-pi counters, where pi in each cascade is the same and is a different distinct prime of M and Alpha i in each cascade is an integer not less than 1, with at least one Alpha i being greater than 1 and each mi pi ; means for coupling said counters to said clock means for clocking said modulo-mi counters in parallel with said clock pulses, with the first counter in each cascade being clocked directly with each clock pulse and each succeeding counter in a cascade is clocked by a clock pulse only when the preceding counter in a cascade changes from a last state in its state cycle to a first state in its cycle whereby each modulo-pi counter cycles through a cycle of pi states and the combined states of the Alpha i counters forming each modulo-mi counter represent different states of a state cycle of mi states; and logic means coupled to selected ones of said counters for providing a plurality of subperiods of said data frame as a function of the states of the counters to which it is cOupled, each subperiod being a sequence of output pulses, each with an output pulse interval which is equal to the clock pulse interval times a different factor definable as Xi, where Xi is an integer and a factor of M and wherein the smallest value of Xi is equal to the smallest distinct prime of M, said subperiods including one delayed subperiod whose first output pulse is delayed by an interval from the start of said data frame, which is not less than one clock pulse interval and not greater than Y clock pulse intervals, where Y < OR = Xi - 1.
Claim 2
Independent Claim
356 words
A system comprising: clock means for providing a succession of clock pulses of equal clock pulse intervals, each sequence of M clock pulse intervals defining a data frame, M being an integer other than a distinct prime and not less than one thousand; a plurality of modulo-mi multistage counters where each mi is a different prime power divisor of M, each modulo-mi counter comprising a different cascade of Alpha modulo-pi counters, where pi in each cascade is the same and is a different distinct prime of M and Alpha i in each cascade is an integer not less than 1, with at least one Alpha i being greater than 1 and each mi pi ; means for coupling said counters to said clock means for clocking said modulo-mi counters in parallel with said clock pulses, with the first counter in each cascade being clocked directly with each clock pulse and each succeeding counter in a cascade is clocked by a clock pulse only when the preceding counter in a cascade changes from a last state in its state cycle to a first state in its cycle whereby each modulo-pi counter cycles through a cycle of pi states and the combined states of the Alpha i counters forming each modulo-mi counter represent different states of a state cycle of mi states; and logic means coupled to selected ones of said counters for providing a plurality of subperiods of said data frame as a function of the states of the counters to which it is cOupled, each subperiod being a sequence of output pulses, each with an output pulse interval which is equal to the clock pulse interval times a different factor definable as Xi, where Xi is an integer and a factor of M and wherein the smallest value of Xi is equal to the smallest distinct prime of M, said subperiods including one delayed subperiod whose first output pulse is delayed by an interval from the start of said data frame, which is not less than one clock pulse interval and not greater than Y clock pulse intervals, where Y < OR = Xi - 1.
Claim 3
Dependent Claim
78 words
A system as described in claim 1 wherein M includes at least two prime power divisors definable as m1 and m2 wherein m1 p1 , p1 being a distinct prime of M and Alpha 1 is an integer greater than 1, and said plurality of counters includes a modulo-m1 counter and a modulo-m2 counter, said modulo-m1 counter comprises a cascade of Alpha 1 identical modulo-p1 counters, each of said modulo-p1 counters cycling through a cycle of p1 states.
Claim 4
Dependent Claim
50 words
A system as described in claim 2 wherein m2 p2 , where p2 is a distinct prime of M other than p1 and Alpha 2 is an integer greater than 1, said modulo-2 counter comprises a cascade of Alpha 2 modulo-p2 counters each cycling through a cycle of p2 states.
Claim 5
Dependent Claim
134 words
A system as described in claim 3 wherein said modulo-m1 counter includes logic means for controlling each of said modulo-p1 counters except for the first in said cascade of Alpha 1 counters to be clocked only when a clock pulse is received from said clock means and the preceding modulo-p1 counter in the cascade changes from the highest state in its p1-state cycle to the first state of the state cycle, and said modulo-m2 counter includes logic means for controlling each of said modulo-p2 counters except the first in said cascade of Alpha 2 counters to be clocked only when a clock pulse is received from said clock means and the preceding modulo-p2 counter in the cascade changes from the highest state in its p2-state cycle to the first state of the state cycle.
Claim 6
Dependent Claim
353 words
A modulo-M counter, where M is an integer other than a distinct prime and is not less than one thousand, comprising: a plurality of parallel modulo-mi multistage counters, each mi being a prime power divisor of M, i l through n where n is not less than two, each mi counter including a cascade of Alpha i identical modulo-pi counters where mi pi , where each p1 is a different distinct prime of M and is the same in each cascade and each Alpha i is an integer not less than 1, at least one Alpha i is not less than 2 with the total number of stages of all of said counters being not greater than the sum of Alpha i.pi of all the cascades, and is less than M; means for clocking in parallel said plurality of modulo-mi counters with each clock pulse in a sequence of clock pulses of equal intervals, with the first counter in each cascade being clocked directly by each clock pulse and each succeeding counter in a cascade being clocked by a clock pulse only when the preceding counter in the cascade changes from a last state in its cycle to a first state in its cycle, whereby each modulo-pi counter cycles through a state cycle of pi states and the combined states of Alpha i counters forming each modulo-mi counter represent different states of a state cycle of mi states; and output means coupled to selected stages of selected counters of said plurality of counters for proViding at least one output when said selected stages of said selected counters are in preselected states, said one output being a sequence of output pulses at an interval which is equal to the clock pulse interval times a factor X where X is a factor of M and the first output pulse occurring at a delay interval from a time when all of said counters are at their first states, said delay interval being equal to the clock pulse interval times a factor Y where 1 < Y < or = X-l, both Y and X being integers.
Claim 7
Dependent Claim
353 words
A modulo-M counter, where M is an integer other than a distinct prime and is not less than one thousand, comprising: a plurality of parallel modulo-mi multistage counters, each mi being a prime power divisor of M, i l through n where n is not less than two, each mi counter including a cascade of Alpha i identical modulo-pi counters where mi pi , where each p1 is a different distinct prime of M and is the same in each cascade and each Alpha i is an integer not less than 1, at least one Alpha i is not less than 2 with the total number of stages of all of said counters being not greater than the sum of Alpha i.pi of all the cascades, and is less than M; means for clocking in parallel said plurality of modulo-mi counters with each clock pulse in a sequence of clock pulses of equal intervals, with the first counter in each cascade being clocked directly by each clock pulse and each succeeding counter in a cascade being clocked by a clock pulse only when the preceding counter in the cascade changes from a last state in its cycle to a first state in its cycle, whereby each modulo-pi counter cycles through a state cycle of pi states and the combined states of Alpha i counters forming each modulo-mi counter represent different states of a state cycle of mi states; and output means coupled to selected stages of selected counters of said plurality of counters for proViding at least one output when said selected stages of said selected counters are in preselected states, said one output being a sequence of output pulses at an interval which is equal to the clock pulse interval times a factor X where X is a factor of M and the first output pulse occurring at a delay interval from a time when all of said counters are at their first states, said delay interval being equal to the clock pulse interval times a factor Y where 1 < Y < or = X-l, both Y and X being integers.
Claim 8
Dependent Claim
188 words
A modulo-M counter as described in claim 5 wherein M is equal to the product of at least two prime power divisors, definable as mi and m2, m1 p1 , where p1 is a distinct prime and Alpha 1 is an integer greater than 1, and m2 p2 , where p2 is a distinct prime other than p1 and Alpha 2 is an integer not less than 1, said modulo-M counter including a first cascade of Alpha 1 modulo-p1 counters each modulo-p1 counter cycling through a cycle of p1 states, with the combined states of said Alpha 1 modulo-p1 counters representing a cycle of m1 states, and a second cascade of Alpha 2 modulo-p2 counters, each modulo-p2 counter cycling through a cycle of p2 states, and logic means coupled to at least a plurality of the counters in the group including said modulo-p1 and modulo-p2 counters for providing an output for every M''th clock pulse where M'' is less than M and is equal to p1 p2 , where Alpha 3 is an integer not less than 1 and Alpha 4 is an integer not less than 1.
Claim 9
Dependent Claim
19 words
A modulo-M counter as described in claim 6 wherein each of said modulo-p1 counters is a p1-stage ring counter.
Claim 10
Independent Claim
310 words
A method for producing a selected output pulse related to a data frame represented by M clock pulse intervals of a succession of M equal interval clock pulses, M being an integer not less than one thousand and other than a distinct prime and is equal to the product of n prime power factors definable as m1 through mn, where n is at least equal to 2, the steps comprising: providing a first cascade of Alpha 1 modulo-p1 counters where m1 p1 , p1 being a distinct prime and being the same in each counter of said first cascade and Alpha 1 is an integer greater than 1; providing at least a second cascade of Alpha 2 modulo-p2 counters where m2 p2 , p2 being a distinct prime different from p1 and the same in each counter of said second cascade and Alpha 2 is an integer greater than 1; clocking said first and second cascades of counters with equal interval clock pulses, with the first counter in each cascade being clocked directly by each clock pulse and each preceding counter in a cascade being clocked by a clock pulse only when the preceding counter in the cascade changes from the last state in its state cycle to the first state in its cycle, whereby each modulo-p1 counter cycles through a cycle of p1 states, with the combined states of said Alpha 1 modulo-p1 counters representing a cycle of m1 states, and each modulo-p2 counter cycles through a cycle of p2 states with the combined states of said Alpha 2 modulo-p2 counters representing a cycle of m2 states; and utilizing the states of selected stages of all of said counters to provide a selected output pulse during each data frame, at a time from the start of said data frame which is an integer multiple of said clock pulse interval.
Claim 11
Independent Claim
310 words
A method for producing a selected output pulse related to a data frame represented by M clock pulse intervals of a succession of M equal interval clock pulses, M being an integer not less than one thousand and other than a distinct prime and is equal to the product of n prime power factors definable as m1 through mn, where n is at least equal to 2, the steps comprising: providing a first cascade of Alpha 1 modulo-p1 counters where m1 p1 , p1 being a distinct prime and being the same in each counter of said first cascade and Alpha 1 is an integer greater than 1; providing at least a second cascade of Alpha 2 modulo-p2 counters where m2 p2 , p2 being a distinct prime different from p1 and the same in each counter of said second cascade and Alpha 2 is an integer greater than 1; clocking said first and second cascades of counters with equal interval clock pulses, with the first counter in each cascade being clocked directly by each clock pulse and each preceding counter in a cascade being clocked by a clock pulse only when the preceding counter in the cascade changes from the last state in its state cycle to the first state in its cycle, whereby each modulo-p1 counter cycles through a cycle of p1 states, with the combined states of said Alpha 1 modulo-p1 counters representing a cycle of m1 states, and each modulo-p2 counter cycles through a cycle of p2 states with the combined states of said Alpha 2 modulo-p2 counters representing a cycle of m2 states; and utilizing the states of selected stages of all of said counters to provide a selected output pulse during each data frame, at a time from the start of said data frame which is an integer multiple of said clock pulse interval.
Claim 12
Dependent Claim
284 words
A modulo-M counter, wheRe M is an integer other than a distinct prime and is not less than one thousand, comprising: a plurality of parallel modulo-mi multistage counters, each mi being a prime power divisor of M, i 1 through n where n is not less than two, each mi counter including a cascade of Alpha i identical modulo-pi counters, where mi pi , where each p1 is a different distinct prime of M and is the same in each cascade and each Alpha i is an integer not less than 1, at least one Alpha i is not less than 2 with the total number of stages of all of said counters being not greater than the sum of Alpha i.pi of all the cascades, and is less than M; means for clocking in parallel said plurality of modulo-mi counters with each clock pulse in a sequence of clock pulses of equal intervals, with the first counter in each cascade being clocked directly by each clock pulse and each succeeding counter in a cascade being clocked by a clock pulse only when the preceding counter in the cascade changes from a last state in its cycle to a first state in its cycle, whereby each modulo-pi counter cycles through a state cycle of pi states and the combined states of the Alpha i counters forming each modulo-mi counter represent different states of a state cycle of mi states; and output means coupled to a selected stage of each of said counters for providing a single output pulse which is delayed by X clock pulse intervals from an interval when all of said counters are in their first state, X being an integer where
Claim 13
Dependent Claim
284 words
A modulo-M counter, wheRe M is an integer other than a distinct prime and is not less than one thousand, comprising: a plurality of parallel modulo-mi multistage counters, each mi being a prime power divisor of M, i 1 through n where n is not less than two, each mi counter including a cascade of Alpha i identical modulo-pi counters, where mi pi , where each p1 is a different distinct prime of M and is the same in each cascade and each Alpha i is an integer not less than 1, at least one Alpha i is not less than 2 with the total number of stages of all of said counters being not greater than the sum of Alpha i.pi of all the cascades, and is less than M; means for clocking in parallel said plurality of modulo-mi counters with each clock pulse in a sequence of clock pulses of equal intervals, with the first counter in each cascade being clocked directly by each clock pulse and each succeeding counter in a cascade being clocked by a clock pulse only when the preceding counter in the cascade changes from a last state in its cycle to a first state in its cycle, whereby each modulo-pi counter cycles through a state cycle of pi states and the combined states of the Alpha i counters forming each modulo-mi counter represent different states of a state cycle of mi states; and output means coupled to a selected stage of each of said counters for providing a single output pulse which is delayed by X clock pulse intervals from an interval when all of said counters are in their first state, X being an integer where