US4187500A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and device for reduction of Fibonacci p-codes to minimal form
Assignee: Southern Federal University
•
Filing: 1977-07-15
•
Granted: 1980-02-05
•
Expires: 1997-07-15
Abstract
Abstract An arrangement for reduction of Fibonacci p-codes to minimal form, which performs, in succession, all convolutions and all devolutions of bits of the original Fibonacci p-code of a number, whereto the original combination of binary signals corresponds. The original combination of binary signals is handled during the convolution operation so that a binary signal corresponding to a 0 value of the lth digit of the original Fibonacci p-code of the number, as well as binary signals corresponding to l values of the (l - i)th and the (l - p- 1)th digit of the original Fibonacci p-code of the number, are substituted by their inverse signals. The original combination of binary signals is handled during the devolution operation so that a binary signal corresponding to a 1 value of the lth digit of the original Fibonacci p-code of the number, as well as binary signals corresponding to 0 values of the digits (l - p) through (l - 2p), inclusive, of the original Fibonacci p-code of the number, are substituted by their inverse signals.
Inventors
- 👤 Alexei P. Stakhov
- 👤 Jury M. Vishnyakov
- 👤 Vladimir A. Luzhetsky
- 👤 Alexandr V. Ovodenko
- 👤 Nikolai A. Solyanichenko
- 👤 Alexandr V. Fomichev
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 06:42
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/60
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
95 words
A method of reduction of Fibonacci p-codes to minimal form, comprising the steps of performing all convolutions of bits of an original Fibonacci p-code of a number whereto an original combination of binary signals corresponds, processing said original combination of binary signals by replacing a binary signal corresponding to a 0 value of the lth digit of the original Fibonacci p-code of the number by its inverse signal, and replacing binary signals corresponding to 1 values of the (l-1)th and the (l-p-1)th digit of the original Fibonacci p-code of the number by its inverse signal.
Claim 2
Independent Claim
95 words
A method of reduction of Fibonacci p-codes to minimal form, comprising the steps of performing all convolutions of bits of an original Fibonacci p-code of a number whereto an original combination of binary signals corresponds, processing said original combination of binary signals by replacing a binary signal corresponding to a 0 value of the lth digit of the original Fibonacci p-code of the number by its inverse signal, and replacing binary signals corresponding to 1 values of the (l-1)th and the (l-p-1)th digit of the original Fibonacci p-code of the number by its inverse signal.
Claim 3
Dependent Claim
94 words
A method as claimed in claim 1, comprising further performing all devolutions of bits of the original Fibonacci p-code of a number whereto the original combination of binary signals corresponds, processing said original combination of binary signals by replacing a binary signal corresponding to a 1 value of the lth digit of the original Fibonacci p-code of the number by its inverse signal, and replacing binary signals corresponding to 0 values of the digits (l-p) through (l-2p), inclusive, by its inverse signal, said processing step being of the original Fibonacci p-code of the number.
Claim 4
Independent Claim
209 words
A device for reduction of Fibonacci p-codes to minimal form, comprising: n functional stages, involving those labeled l, (l-1), and (l-p-1), each being provided with at least two convolution set inputs comprising a first and second convolution set inputs, a convolution control input, a message input, a message output, and a convolution output; said convolution output of said lth functional stage being coupled to one of said convolution set inputs of said (l-1)th functional stage and to one of said convolution set inputs of said (l-p-1)th functional stage; convolution message inputs of said lth functional stage being coupled, respectively, to said message outputs of said (l-1)th and (l-p-1)th functional stages; said message inputs of all said functional stages forming a multidigit message input of said device for reduction of Fibonacci p-codes to minimal form; said message outputs of said functional stages forming a multidigit message output of said device for reduction of Fibonacci p-codes to minimal form; said convolution control inputs of all said functional stages being connected to a common point which is a convolution control input of said device for reduction of Fibonacci p-codes to minimal form, where p=1, 2, 3 . . . ; l=3,4, . . . n; and n is the Fibonacci p-code length.
Claim 5
Independent Claim
209 words
A device for reduction of Fibonacci p-codes to minimal form, comprising: n functional stages, involving those labeled l, (l-1), and (l-p-1), each being provided with at least two convolution set inputs comprising a first and second convolution set inputs, a convolution control input, a message input, a message output, and a convolution output; said convolution output of said lth functional stage being coupled to one of said convolution set inputs of said (l-1)th functional stage and to one of said convolution set inputs of said (l-p-1)th functional stage; convolution message inputs of said lth functional stage being coupled, respectively, to said message outputs of said (l-1)th and (l-p-1)th functional stages; said message inputs of all said functional stages forming a multidigit message input of said device for reduction of Fibonacci p-codes to minimal form; said message outputs of said functional stages forming a multidigit message output of said device for reduction of Fibonacci p-codes to minimal form; said convolution control inputs of all said functional stages being connected to a common point which is a convolution control input of said device for reduction of Fibonacci p-codes to minimal form, where p=1, 2, 3 . . . ; l=3,4, . . . n; and n is the Fibonacci p-code length.
Claim 6
Dependent Claim
136 words
A device as claimed in claim 3, wherein each said functional stage includes: a flip-flop provided with a "1" set input, a "0" set input, a "1" output, and a "0" output; a switching unit provided with at least four inputs two outputs; a convolution unit provided with at least four inputs and an output producing a convolution signal applied to said flip-flops of said lth, (l-1)th and (l-p-1)th functional stages; said "0" output of said flip-flop being coupled to a first input of said convolution unit; said output of said convolution unit being coupled to one of said inputs of said switching unit; a first output of said switching unit, coupled to said "1" set input of said flip-flop; a second output of said switching unit, coupled to said "0" set input of said flip-flop.
Claim 7
Dependent Claim
18 words
A device as claimed in claim 4, wherein said convolution unit comprises an AND gate having four inputs.
Claim 8
Dependent Claim
119 words
A device as claimed in claim 5, wherein a switching unit comprises: two OR gates each being provided with two inputs; an output of a first OR gate of said two OR gates, coupled to said "0" set input of said flip-flop; an output of a second OR gate of said two OR gates, coupled to said "0" set input of said flip-flop; one of said inputs of said second OR gate, being coupled to said output of said convolution unit; devolution inputs, said inputs of said first OR gate serving as said devolution inputs of each of said functional stages; the other input of said OR gate serving as said message input of each of said functional stages.
Claim 9
Dependent Claim
119 words
A device as claimed in claim 4, wherein said switching unit comprises: two OR gates each being provided with two inputs; an output of a first OR gate of said two OR gates, coupled to said "0" set input of said flip-flop; an output of a second OR gate of said two OR gates, coupled to said "0" set input of said flip-flop; one of said inputs of said second OR gate being coupled to said output of said convolution unit; devolution inputs; said inputs of said first OR gate serving said devolution inputs of each of said functional stages; the other input of said second OR gate, serving as said message input of each of said functional stages.
Claim 10
Dependent Claim
194 words
A device as claimed in claim 3, comprising (l+1)th, (l-i-1)th, (l-p-j+1)th and (l-p-s+2)th stages, each being provided with: another message output; a convolution inhibit output; a devolution output; (p-1) convolution inhibit inputs; a devolution control input; (p+2) devolution message inputs; (p+1) devolution set inputs; said convolution inhibit output of said lth functional stage being coupled to an ith convolution inhibit input of said (l-i-1)th functional stage where i is the ith digit; said devolution output of said lth functional state being coupled to a jth devolution set input of said (l-p j+1)th functional stage where j is the jth digit; said devolution control inputs of all said functional stages being connected to a common point which is a devolution control input of said device for reduction of Fibonacci p-codes to minimal form; a (p+2)th devolution message input of said lth functional stage, coupled to said another message output of said (l+1)th functional stage; an (sth) devolution message input of said lth functional stage coupled to said another message output of said (l-p-s+2)th functional stage, where i=1, 2 . . . (p+1); j=1, 2 . . . (p+1); and 2, 3 . . . (p+2).
Claim 11
Dependent Claim
218 words
A device as claimed in claim 8, including switching units and a flip-flop, each of said functional stage (l-p) through (l-2p), inclusive, comprising: a devolution unit provided with at least (p+4) inputs and an output producing a devolution signal applied via said switching units to said flip-flop of said lth functional stage and to said flip-flops of said functional stages (l-p) through (l-2p), inclusive: said convolution unit provided with (l-p) convolution inhibit inputs and a convolution inhibit output being used, respectively, as said convolution inhibit inputs and said convolution inhibit output of any one of said n functional stages; said switching unit being provided with another (p+2) inputs: one of said inputs of said devolution unit, being coupled to said "1" output of said flip-flop; said output of said devolution unit, coupled to a first input of said (p+2) inputs of said switching unit; a second input and the remaining (p+2) inputs of said devolution unit, which serve, respectively, as said devolution control input and said message inputs of any one of said n functional stages; said (p+1) inputs of said switching unit serving as said devolution set inputs of any one of said n functional stages; said "0" set output of said flip-flop serving as said another message output of any one of said n functional stages.
Claim 12
Dependent Claim
61 words
A device as claimed in claim 9, wherein any one of said n functional stages comprises a convolution unit including: an AND gate provided with four inputs and another (p-1) inputs; an inverter; an output of said inverter, which is said convolution inhibit output of said convolution unit; an input of said inverter, coupled to the output of said AND gate.
Claim 13
Dependent Claim
69 words
A device as claimed in claim 10, including a switching unit comprising: two OR gates each being provided with two inputs; a first OR gate of said two OR gates, provided with another input coupled to said output of said devolution unit; a second OR gate of said two OR gates, provided with another (p+1) inputs which serve as said devolution set inputs of each of said functional stages.
Claim 14
Dependent Claim
18 words
A device as claimed in claim 9, wherein said devolution unit comprises an AND gate having (p+4) inputs.
Claim 15
Dependent Claim
187 words
A device as claimed in claim 9, comprising a minimality indicator which includes: a first OR gate provided with n inputs; n identical stages; each said stage of said minimality indicator comprising an AND gate and a second OR gate; two inputs and an output of said AND gate; p inputs and an output of said second OR gate; said message output of each said lth functional stage, being coupled to an input of said AND gate of an lth stage of said minimality indicator; the other input of said AND gate being coupled to said output of said second OR gate of said lth stage of said minimality indicator; said p inputs of said second OR gate being coupled to said message outputs of said functional stages (l-1) through (l-p) inclusive; said output of said AND gate of each lth stage of said minimality indicator being coupled to an lth input of said first OR gate of said minimality indicator, and said output of said first OR gate being used as the minimality signal output of said device for reduction of Fibonacci p-codes to minimal form.
Claim 16
Dependent Claim
55 words
A device as claimed in claim 8, wherein each said functional stage and an (l-k-1)th functional stage comprise: (p-2) devolution inhibit inputs; a devolution inhibit output; said devolution inhibit output of said lth functional stage being coupled to a kth devolution inhibit inputs of said (l-k-1)th functional stage, where k=1, 2 . . . (p-1).
Claim 17
Dependent Claim
60 words
A device as claimed in claim 14, wherein each of said n functional stages comprises a convolution unit including: an AND gate provided with four inputs and another (p-1) inputs; an inverter; an output of said inverter, which is said convolution inhibit output of said convolution unit; an input of said inverter, coupled to the output of said AND gate.
Claim 18
Dependent Claim
69 words
A device as claimed in claim 15, including a switching unit comprising: two OR gates each being provided with two inputs; a first OR gate of said two OR gates, provided with another input coupled to said output of said devolution unit; a second OR gate of said two OR gates, provided with another (p+1) inputs which serve as said devolution set inputs of each of said functional stages.
Claim 19
Dependent Claim
74 words
A device as claimed in claim 14, wherein each said functional stage comprises a devolution unit including: an AND gate provided with (p+4) inputs, another (p+2) inputs and an output; an inverter coupled to said output of said AND gate; said (p+2) inputs of said AND gate serving as said devolution inhibit inputs of said devolution unit; an output of said inverter, which serves as said devolution inhibit output of each said functional stage.
Claim 20
Dependent Claim
59 words
A device as claimed in claim 14, including a complement input and comprising: flip flops said flip-flops of said functional stages 1 through (n-p), inclusive, each being provided with count inputs; said count inputs of said flip-flops, coupled to a common point which serves as said complement input of said device for reduction of Fibonacci p-codes to minimal form.
Claim 21
Dependent Claim
57 words
A device as claimed in claim 14, wherein each said functional stage comprises a devolution unit including: an AND gate provided with (p+4) inputs, another (p+2) inputs and an output; an inverter coupled to said output of said AND gate; an output of said inverter, which serves as said devolution inhibit output of each said functional stage.
Claim 22
Dependent Claim
61 words
A device as claimed in claim 8, wherein any one of said n functional stages comprises a convolution unit including: an AND gate provided with four inputs and another (p-1) inputs; an inverter; an output of said inverter, which is said convolution inhibit output of said convolution input; an input of said inverter, coupled to the output of said AND gate.
Claim 23
Dependent Claim
60 words
A device as claimed in claim 8, including a complement input and comprising: flip flops; said flip-flops of said functional stages 1 through (n-p), inclusive, each being provided with count inputs; said count inputs of said flip-flops being connected to a common point which serves as said complement input of said device for reduction of Fibonacci p-codes to minimal form.
References Cited (Backward Citations)
US4032979A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1983-02-04 | 1983-08-06 | 1984-02-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1987-02-04 | 1987-08-06 | 1988-02-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1991-02-04 | 1991-08-06 | 1992-02-05 | $7700.00 | Window Closed / Lapsed |