Method and device for reduction of Fibonacci p-codes to minimal form
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 h...
Gespeichert in:
Hauptverfasser: | , , , , , |
---|---|
Format: | Patent |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|