Area complexity of merging (Q807018)

The paper under review deals with the VLSI area complexity for merging two sorted arrays of k-bit integers. First, a lower bound is established for this problem: \(\theta(m(\log n-\log m+1))\) if \(k\geq \log n\), \(A=\{\theta(\min \{2^ k,m\}(| k-\log m| +1))\) for \(k\leq \log n\), where m and n are the sizes of the arrays with \(m\leq n\). Then, two optimal circuits corresponding to the two cases are described.