This article provides a survey of circuit complexity bounds for basic boolean transforms exploited in digital circuit design and efficient methods for synthesizing such circuits. The exposition covers structurally simple functions and operators, such as counters, adders, encoders, and multiplexors, and excludes more complex algebraic operations with numbers, polynomials, and matrices. Several applications to implementing more specific operations are also discussed.

翻译：本文综述了数字电路设计中基本布尔变换的电路复杂度界限，以及用于综合此类电路的高效方法。论述涵盖了结构简单的函数与算子，例如计数器、加法器、编码器和多路选择器，而排除了涉及数字、多项式和矩阵的复杂代数运算。此外，还讨论了其在实现特定运算中的若干应用。