𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Estimation of the complexity of decoding circuits

✍ Scribed by O. N. Yurin

Publisher
Springer US
Year
1973
Tongue
English
Weight
175 KB
Volume
6
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the complexity of encoding in analog
On the complexity of encoding in analog circuits
✍ Ingo Wegener πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 329 KB

Fan-in 2 analog circuits over the basis {+, -, \*, /} are investigated. The problem of encoding a Boolean vector is the problem of computing a one-to-one mapping f : (0, 1)" + R. It is proved that the optimal encoding formula has size [( 3n -1)/21 and that encoding circuits have at least 5n/4 -0( 1)