On the negation-limited circuit complexity of sorting and inverting k-tonic sequences

  • Authors:

  • Takayuki Sato;Kazuyuki Amano;Akira Maruoka

  • Affiliations:

  • Dept. of Information Engineering, Sendai National College of Technology, Sendai, Japan;Dept. of Computer Science, Gunma University, Gunma, Japan;Graduate School of Information Sciences, Tohoku University, Sendai, Japan

  • Venue:
  • COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

A binary sequence x1, ..., xn is called k-tonic if it contains at most k changes between 0 and 1, i.e., there are at most k indices such that xi ≠xi+1. A sequence ¬x1, ..., ¬xn is called an inversion of x1, ..., xn. In this paper, we investigate the size of a negation-limited circuit, which is a Boolean circuit with a limited number of NOT gates, that sorts or inverts k-tonic input sequences. We show that if k = O(1) and t = O(loglogn), a k-tonic sequence of length n can be sorted by a circuit with t NOT gates whose size is O((n logn)/ 2ct) where c 0 is some constant. This generalizes a similar upper bound for merging by Amano, Maruoka and Tarui [4], which corresponds to the case k = 2. We also show that a k-tonic sequence of length n can be inverted by a circuit with O(k logn) NOT gates whose size is O(kn) and depth is O(k log2n). This reduces the size of the negation-limited inverter of size O(n logn) by Beals, Nishino and Tanaka [6] when k = o(logn). If k = O(1), our inverter has size O(n) and depth O(log2n) and contains O(logn) NOT gates. For this case, the size and the number of NOT gates are optimal up to a constant factor.