US4818969A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of fixed-length binary encoding and decoding and apparatus for same
Assignee: Kronos Inc
•
Filing: 1988-04-26
•
Granted: 1989-04-04
•
Expires: 2008-04-26
Abstract
Abstract A novel method of adapting Fibonacci number weighting to raw binary code data of variable length to use the code as a fixed length code by using only those code sequences with a fixed number of cells rather than a fixed number of bits, converting the code to a continuous numerical sequence useful particularly for linear media and data transmission. Encoder and decoder systems useful to enable storing or recording and reading or utilization of the Fibonacci code in bar code, magnetic and other media.
Inventors
- 👤 Lawrence J. Krakauer
- 👤 Larry Baxter
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 18:31
CPC Classifications
H; H03; H03M; H03M5/00; H03M5/02; H03M5/04; H03M5/06; H03M5/08; H03M5/14; H03M5/145
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
237 words
A machine-implemented method wherein numbers are digitally encoded in n fixed-length cells, n being an arbitrary integer, comprising the following machine-implemented encoding steps: (1) comparing a number to be encoded with a predetermined Fibonacci Number in a sequence of Fibonacci Numbers and generating a first code element consisting of a predetermined first integer number of cells if the number to be encoded is greater than or equal to said predetermined Fibonacci Number, but generating a first code element consisting of a predetermined second integer number of cells if the number to be encoded is less than said predetermined Fibonacci Number; (2) then, if a first code element of said first number of cells has been generated in step (1), subtracting said predetermined Fibonacci Number from the number to be encoded in step (1) and repeating the comparing and generating of step (1) using the difference obtained by the subtracting as the number to be encoded and using the Fibonacci Number preceding said predetermined Fibonacci Number in said sequence, but if a first code element of said second predetermined number of cells has been generated in step (1), performing no subtraction, and repeating the comparing and generating of step (1) using the original number to be encoded and the Fibonacci Number before said preceding Fibonacci Number, thereby to generate a second code element; and iterating steps (1) and (2) until n cells have been utilized in the encoding.
Claim 2
Dependent Claim
237 words
A machine-implemented method wherein numbers are digitally encoded in n fixed-length cells, n being an arbitrary integer, comprising the following machine-implemented encoding steps: (1) comparing a number to be encoded with a predetermined Fibonacci Number in a sequence of Fibonacci Numbers and generating a first code element consisting of a predetermined first integer number of cells if the number to be encoded is greater than or equal to said predetermined Fibonacci Number, but generating a first code element consisting of a predetermined second integer number of cells if the number to be encoded is less than said predetermined Fibonacci Number; (2) then, if a first code element of said first number of cells has been generated in step (1), subtracting said predetermined Fibonacci Number from the number to be encoded in step (1) and repeating the comparing and generating of step (1) using the difference obtained by the subtracting as the number to be encoded and using the Fibonacci Number preceding said predetermined Fibonacci Number in said sequence, but if a first code element of said second predetermined number of cells has been generated in step (1), performing no subtraction, and repeating the comparing and generating of step (1) using the original number to be encoded and the Fibonacci Number before said preceding Fibonacci Number, thereby to generate a second code element; and iterating steps (1) and (2) until n cells have been utilized in the encoding.
Claim 3
Dependent Claim
40 words
A method in accordance with claim 1, wherein said numbers are digitally encoded in a range from 0 to Fib(n-1), where Fib(n) is the nth Fibonacci Number in said sequence, and wherein said predetermined Fibonacci Number is Fib(n-2), and Fib(-1)=0.
Claim 4
Dependent Claim
41 words
A method in accordance with claim 2, wherein each of the code elements of said first predetermined number of cells consists of one cell and each of the code elements of said second predetermined number of cells consists of two cells.
Claim 5
Dependent Claim
41 words
A method in accordance with claim 3, wherein encoded numbers are decoded by weighting each of the n cells with numbers F(n-2) through Fib(-1), respectively, and by adding together the weights of the cells of code elements consisting of one cell.
Claim 6
Dependent Claim
21 words
A method in accordance with claim 1, wherein n fixed-length cells representing each digitally encoded number are stored on a medium.
Claim 7
Dependent Claim
24 words
A method in accordance with claim 1, wherein signals are produced and transmitted that include n fixed-length cells corresponding to each digitally encoded number.
Claim 8
Dependent Claim
225 words
Apparatus wherein numbers are digitally encoded in a space of n fixed-length cells, n being an arbitrary integer, comprising: means for comparing a number to be encoded with a predetermined Fibonacci Number in a sequence of Fibonacci Number and generating a first code element consisting of a predetermined first integer number of cells if the number to be encoded is greater than or equal to said prededetermined Fibonacci Number, but generating a first code element consisting of a predetermined second integer number of cells if the number to be encoded is less than said predetermined Fibonacci number; means for subtracting said predetermined Fibonacci Number from the number to be encoded if a first code element of said first number of cells has been generated and for repeating said comparing and generating using the difference obtained by the subtracting as the number to be encoded and using the Fibonacci Number preceding said predetermined Fibonacci Number in said sequence, but if a first code element of said second number of cells has been generated, performing no subtraction, and repeating said comparing and generating using the original number to be encoded and the Fibonacci Number before said preceding Fibonacci Number, thereby to generate a second code element; and means for causing all of the aforesaid means to operate iteratively until n cells have been utilized in the encoding.
Claim 9
Dependent Claim
225 words
Apparatus wherein numbers are digitally encoded in a space of n fixed-length cells, n being an arbitrary integer, comprising: means for comparing a number to be encoded with a predetermined Fibonacci Number in a sequence of Fibonacci Number and generating a first code element consisting of a predetermined first integer number of cells if the number to be encoded is greater than or equal to said prededetermined Fibonacci Number, but generating a first code element consisting of a predetermined second integer number of cells if the number to be encoded is less than said predetermined Fibonacci number; means for subtracting said predetermined Fibonacci Number from the number to be encoded if a first code element of said first number of cells has been generated and for repeating said comparing and generating using the difference obtained by the subtracting as the number to be encoded and using the Fibonacci Number preceding said predetermined Fibonacci Number in said sequence, but if a first code element of said second number of cells has been generated, performing no subtraction, and repeating said comparing and generating using the original number to be encoded and the Fibonacci Number before said preceding Fibonacci Number, thereby to generate a second code element; and means for causing all of the aforesaid means to operate iteratively until n cells have been utilized in the encoding.
Claim 10
Dependent Claim
39 words
Apparatus in accordance with claim 7, wherein said numbers are digitally encoded in a range from 0 to Fib(n-1), where Fib(n) is the nth Fibonacci Number in said sequence, and wherein said predetermined Fibonacci Number is Fib(n-2), and Fib(-1)=0.
Claim 11
Dependent Claim
40 words
Apparatus in accordance with claim 8, wherein each of the code elements of said first predetermined number of cells consists of one cell and each of the code elements of said second predetermined number of cells consists of two cells.
Claim 12
Dependent Claim
43 words
Apparatus in accordance with claim 9, further comprising means for decoding the encoded numbers by weighting each of the n cells with numbers Fib(n-2) through Fib(-1), respectively, and by adding together the weights of the cells of code elements consisting of one cell.
Claim 13
Dependent Claim
60 words
Apparatus in accordance with claim 10, wherein the decoding means includes an accumulator register, a Fibonacci word bit generator connected to an adder, with an output of the adder connected to the accumulator register and an output of the accumulator register connected back to the adder and to an output register, the output register being interfaced with computer control means.
Claim 14
Dependent Claim
65 words
Apparatus in accordance with claim 11, wherein each of the code elements of said first predetermined number of cells consists of one cell and each of the code elements of said second predetermined number of cells consists of two cells, and wherein the accumulator register compensates for the Fibonacci weights and skips a number on the occurrence of a code element consisting of two cells.
Claim 15
Dependent Claim
25 words
Apparatus in accordance with claim 7, further comprising means for recording on a medium signals that include n fixed-length cells for each digitally encoded number.
Claim 16
Dependent Claim
65 words
Apparatus in accordance with claim 7, wherein the means recited comprises the combination of a Fibonacci word bit generator connected to apply an output to a subtractor, a multiplexer connected to receive an output of the subtractor and, in turn, to feed an accumulator register, an output of which is applied back to the subtractor, and a computer-controlled "next word" register connected to the multiplexer.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-04-03 | 1992-10-03 | 1993-04-04 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-04-03 | 1996-10-03 | 1997-04-04 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-04-03 | 2000-10-03 | 2001-04-04 | $7700.00 | Window Closed / Lapsed |