We introduce a dynamically reconfigurable 2D filterbank that supports both real and complex-valued inputs, outputs, and filter coefficients. This general purpose filterbank allows for the efficient implementation of 2D filterbanks based on separable 2D FIR filters that support all possible combinations of input and output signals.The system relies on the use of dynamic reconfiguration of real/c...

For measuring technical efficiency relative to a log-linear technology, a generalized multiplicative directional distance function (GMDDF) is developed using the framework of multiplicative directional distance function (MDDF). Furthermore, a computational procedure is suggested for its estimation. The GMDDF serves as a comprehensive measure of efficiency in revealing Pareto-efficient targets a...

Given an input array of n real numbers, sorting with padding consists in writing those numbers in order in an array of size (1 +)n, thus leaving n entries empty. Only comparisons are allowed between the numbers to be sorted. We describe an algorithm that, with nk processors in the CRCW PRAM model, sorts the input array with padding o(1) using time O(log k n log (log k n) + loglog k). This impro...

Database Recovery is responsible for preserving the database consistency after a failure of any kind (transaction, system or media). Relevant information solely for recovery is saved in a log during normal transaction processing. To recover from a failure, basically two operations: undo and redo are applied with the help of the log on the last consistent state of the database. These two operati...

Any database management system may need some type of reorganization. However, reorganization typically requires taking a database off line, which can be unacceptable for a very large or highly available (24-hour) database. A solution is to reorganize on line (concurrently with users' reading and writing of data in the database). This paper describes a method for performing one type of reorganiz...

We present an algorithm that on input of an n-vertex m-edge weighted graph G and a value k, produces an incremental sparsifier Ĝ with n− 1+m/k edges, such that the condition number of G with Ĝ is bounded above by Õ(k log n), with probability 1− p. The algorithm runs in time Õ((m logn+ n log n) log(1/p)). As a result, we obtain an algorithm that on input of an n × n symmetric diagonally dominant...

We present an algorithm that on input of an n-vertex m-edge weighted graph G and a value k, produces an incremental sparsifier Ĝ with n− 1+m/k edges, such that the condition number of G with Ĝ is bounded above by Õ(k log n), with probability 1− p. The algorithm runs in time Õ((m logn+ n log n) log(1/p)). As a result, we obtain an algorithm that on input of an n × n symmetric diagonally dominant...

a log-domain current-mode true rms-to-dc converter based on a novel synthesis of a simplified current-mode low pass filter and a two-quadrant squarer/divider is presented. the circuit employs floating gate mos (fg-mos) transistors operating in weak inversion region. the converter features low power(<1.5uw), low supply voltage (0.9v), two quadrant input current, immunity from body effect, low ci...

1. O(n) expected time randomized algorithms are presented in [4, 5, 7]. They use hashing and assumes the floor function as a unit cost operation. 2. An O(n log log n) time deterministic algorithm is presented in [3] which uses hashing and assumes floor function as a unit cost operation. 3. In [1] an O(n) expected time randomized algorithm using the real-RAM model is presented. This algorithm as...