Technology Mapping for Circuit Optimization Using Content-Addressable Memory

The growing complexity of Field Programmable Gate Arrays (FPGA's) is leading to architectures with high input cardinality look-up tables (LUT's). This thesis describes a methodology for area-minimizing technology mapping for combinational logic, specifically designed for such FPGA architectures. This methodology, called LURU, leverages the parallel search capabilities of Content-Addressable Memories (CAM's) to outperform traditional mapping algorithms in both execution time and quality of results. The LURU algorithm is fundamentally different from other techniques for technology mapping in that LURU uses textual string representations of circuit topology in order to efficiently store and search for circuit patterns in a CAM. A circuit is mapped to the target LUT technology using both exact and inexact string matching techniques. Common subcircuit expressions (CSE's) are also identified and used for architectural optimization---a small set of CSE's is shown to effectively cover an average of 96% of the test circuits. LURU was tested with the ISCAS'85 suite of combinational benchmark circuits and compared with the mapping algorithms FlowMap and CutMap. The area reduction shown by LURU is, on average, 20% better compared to FlowMap and CutMap. The asymptotic runtime complexity of LURU is shown to be better than that of both FlowMap and CutMap

Optimal control design for robust fuzzy friction compensation in a robot joint

This paper presents a methodology for the compensation of nonlinear friction in a robot joint structure based on a fuzzy local modeling technique. To enhance the tracking performance of the robot joint, a dynamic model is derived from the local physical properties of friction. The model is the basis of a precompensator taking into account the dynamics of the overall corrected system by means of a minor loop. The proposed structure does not claim to faithfully reproduce complex phenomena driven by friction. However, the linearity of the local models simplifies the design and implementation of the observer, and its estimation capabilities are improved by the nonlinear integral gain. The controller can then be robustly synthesized using linear matrix inequalities to cancel the effects of inexact friction compensation. Experimental tests conducted on a robot joint with a high level of friction demonstrate the effectiveness of the proposed fuzzy observer-based control strategy for tracking system trajectories when operating in zero-velocity regions and during motion reversals

The Factorization method for three dimensional Electrical Impedance Tomography

The use of the Factorization method for Electrical Impedance Tomography has been proved to be very promising for applications in the case where one wants to find inhomogeneous inclusions in a known background. In many situations, the inspected domain is three dimensional and is made of various materials. In this case, the main challenge in applying the Factorization method consists in computing the Neumann Green's function of the background medium. We explain how we solve this difficulty and demonstrate the capability of the Factorization method to locate inclusions in realistic inhomogeneous three dimensional background media from simulated data obtained by solving the so-called complete electrode model. We also perform a numerical study of the stability of the Factorization method with respect to various modelling errors.Comment: 16 page

Preconditioning of Active-Set Newton Methods for PDE-constrained Optimal Control Problems

We address the problem of preconditioning a sequence of saddle point linear systems arising in the solution of PDE-constrained optimal control problems via active-set Newton methods, with control and (regularized) state constraints. We present two new preconditioners based on a full block matrix factorization of the Schur complement of the Jacobian matrices, where the active-set blocks are merged into the constraint blocks. We discuss the robustness of the new preconditioners with respect to the parameters of the continuous and discrete problems. Numerical experiments on 3D problems are presented, including comparisons with existing approaches based on preconditioned conjugate gradients in a nonstandard inner product