Energy-efficient threshold circuits computing MOD functions

Akira Suzuki, Kei Uchizawa, Xiao Zhou

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

We prove that the modulus function MOD m of n variables can be computed by a threshold circuit C of energy e and size s = O(e(n/m) 1/(e-1)) for any integer e ≥ 2, where the energy e is defined to be the maximum number of gates outputting "1" over all inputs to C, and the size s to be the number of gates in C. Our upper bound on the size s almost matches the known lower bound s = Ω(e(n/m) 1/e).

Original languageEnglish
Title of host publicationTheory of Computing 2011 - Proceedings of the 17th Computing
Subtitle of host publicationThe Australasian Theory Symposium, CATS 2011
Pages105-110
Number of pages6
Publication statusPublished - 2011 Dec 1
EventTheory of Computing 2011 - 17th Computing: The Australasian Theory Symposium, CATS 2011 - Perth, WA, Australia
Duration: 2011 Jan 172011 Jan 20

Publication series

NameConferences in Research and Practice in Information Technology Series
Volume119
ISSN (Print)1445-1336

Other

OtherTheory of Computing 2011 - 17th Computing: The Australasian Theory Symposium, CATS 2011
CountryAustralia
CityPerth, WA
Period11/1/1711/1/20

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Hardware and Architecture
  • Information Systems
  • Software

Fingerprint Dive into the research topics of 'Energy-efficient threshold circuits computing MOD functions'. Together they form a unique fingerprint.

Cite this