The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In bit patterned media (BPM), the medium is patterned into nanometer-sized magnetic islands where each island stores one bit. Although BPM samples of credible densities have been made, many problems remain, one of which is the synchronization of the write head switching position with respect to the targeted island. An accurate but efficient model has been developed to calculate the timing margin available...
A novel methodology for accurate and efficient static timing analysis is presented in this paper. The methodology is based on finding a frequency domain model for the gates which allows uniform treatment of the gates and interconnects. It is shown that despite the highly nonlinear overall gate model, a frequency domain model of the gate with the model parameters, gate moments, as functions of the...
This paper addresses adaptive channel estimation for time-varying mobile wireless channels with nonstationary statistics. We presents a reduced complexity adaptive channel estimator based on a set membership filtering approach known as the Optimal Bounding Ellipsoid (OBE) algorithm. To exploit time and frequency domain correlation properties of the channel in an efficient low-complexity way, we allow...
We take a complexity theoretic view of A. C. Yao's theory of communication complexity. A rich structure of natural complexity classes is introduced. Besides providing a more structured approach to the complexity of a variety of concrete problems of interest to VLSI, the main objective is to exploit the analogy between Turing machine (TM) and communication complexity (CC) classes. The latter provide...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.