Fast Arithmetic Circuits

Fast Arithmetic Circuits is a class of digital circuit architectures designed within configurable logic blocks that optimize arithmetic operations by minimizing propagation delay through specialized interconnects and parallel computation structures, thereby distinguishing itself from conventional arithmetic circuits by its emphasis on speed-optimized logic synthesis and reduced critical path latency.

455

Publications

21K

Citations

1K

Authors

388

Institutions

Publications per year

2017–2026

53

Variants

Fast Arithmetic Circuit

Authors

1K

  1. EE
    Earl E. Swartzlander

    The University of Texas at Austin, United States

    8 publications · 203 citations

    8

    h-index

  2. GJ
    Ghassem Jaberipur

    Shahid Beheshti University, Iran

    6 publications · 166 citations

    6

    h-index

  3. NT
    Naofumi Takagi

    Nagoya University, Japan

    6 publications · 123 citations

    6

    h-index

  4. VG
    Vojin G. Oklobdzija

    University of California, Davis, United States

    6 publications · 204 citations

    6

    h-index

  5. LD
    L. Dadda

    Politecnico di Milano, Italy

    5 publications · 165 citations

    5

    h-index

1–5 of 1K

Venues

  1. IEEE Transactions on Computers

    48 publications · 3.1K citations

    31

    h-index

  2. Electronics Letters

    11 publications · 247 citations

    10

    h-index

  3. IEEE Journal of Solid-State Circuits

    9 publications · 504 citations

    9

    h-index

  4. 9

    h-index

  5. IEEE Transactions on Electronic Computers

    7 publications · 4K citations

    7

    h-index

1–5