Dispositif pour la reduction de codes a base irrationnelle a la forme minimale

Abstract

A device for reducing irrational- base codes, such as the Fibonacci p- code and the "golden" p-proportion code, to a minimal form comprises n substantially identical functional cells 1 equal in a number to that of code digits, whereof each I-th functional cell comprises a flip-flop 8, and a convolution AND gate 10 having one of its inputs connected to an inverting output 9 of the flip-flop. A set input 2, a reset input 6, and a count input are provided for the flip-flops. The remaining input of the I-th convolution AND gate 10 are a first convolution signal input 4 from cell I-1 and a second convolution signal input 5 from cell I-p-1. The count signal input of the I-th functional cell is connected to the information output 3 of the (I-1)-th functional cell. The convolution signal output of the I-th functional cell is connected to the reset input 6 of the (I-1)-th functional cell.; The device changes the states of the I-th and (I-1)th, (I-p-1)-th flip flops sequentially, thereby avoiding switching ambiguities.