Алгоритмічні основи побітової обробки кодів золотої пропорції

Abstract

The bit-by-bit golden ratio codes operation let us to decrease of information interconnections count in distributed calculation. The algorithms of bit-by-bit adding, subtraction and algebraic adding of serial golden ratio codes are proposed. It is ground, that carrier length in higher and lower orders no large two orders. The bit-by-bit multiplication algorithm, which basics on constant delay of resulting codes stream independents from order count, is described. The bit-by-bit division algorithm, which basics on forming of result codes in slice register, is described.