This paper is concerned with the analysis and optimization of the ground bounce in digital CMOS circuits. First, an analytical method for calculating the ground bounce is presented. The proposed method relies on accurate models of the short-channel MOS device and the chip-package interface parasitics. Next the effect of ground bounce on the propagation delay and the optimum tapering factor of a multistage buffer is discussed and a mathematical relationship for total propagation delay in the presence of the ground bounce is obtained. Effect of an on-chip decoupling capacitor on the ground bounce waveform and circuit speed is analyzed next and a closed form expression for the peak value of the differential-mode component of the ground bounce in terms of the on-chip decoupling capacitor is provided. Finally, a design methodology for controlling the switching times of the output drivers to minimize the ground bounce is presented. 相似文献
Although nanoelectronics won't replace CMOS for some time, research is needed now to develop the architectures, methods, and tools to maximally leverage nanoscale devices and terascale capacity. Addressing the complementary architectural and system issues involved requires greater collaboration at all levels. The effective use of nanotechnology calls for total system solutions 相似文献
The charged particle motion for certain configurations of oscillating magnetic fields can be simulated by a Volterra integro-differential equation of the second order with time-periodic coefficients. This paper investigates a simple and accurate scheme for computationally solving these types of integro-differential equations. To start the method, we first reduce the integro-differential equations to equivalent Volterra integral equations of the second kind. Subsequently, the solution of the mentioned Volterra integral equations is estimated by the collocation method based on the local multiquadrics formulated on scattered points. We also expand the proposed method to solve fractional integro-differential equations including non-integer order derivatives. Since the offered method does not need any mesh generations on the solution domain, it can be recognized as a meshless method. To demonstrate the reliability and efficiency of the new technique, several illustrative examples are given. Moreover, the numerical results confirm that the method developed in the current paper in comparison with the method based on the globally supported multiquadrics has much lesser volume computing.
Recently there has been a considerable increase in the number of different Key-Value stores, for supporting data storage and
applications on the cloud environment. While all these solutions try to offer highly available and scalable services on the
cloud, they are significantly different with each other in terms of the architecture and types of the applications, they try
to support. Considering three widely-used such systems: Cassandra, HBase and Voldemort; in this paper we compare them in terms
of their support for different types of query workloads. We are mainly focused on the range queries. Unlike HBase and Cassandra
that have built-in support for range queries, Voldemort does not support this type of queries via its available API. For this
matter, practical techniques are presented on top of Voldemort to support range queries. Our performance evaluation is based
on mixed query workloads, in the sense that they contain a combination of short and long range queries, beside other types
of typical queries on key-value stores such as lookup and update. We show that there are trade-offs in the performance of
the selected system and scheme, and the types of the query workloads that can be processed efficiently. 相似文献
Metallurgical and Materials Transactions A - Banding in commercial dual-phase steels, such as banded ferrite and pearlite or ferrite and martensite microstructures, is inherited from segregation... 相似文献
This contribution concerns variance analysis of linear multi-input single-output models when the inputs are temporally white but where different inputs may be correlated. An expression is provided for the variance of a linearly parametrized estimate of the frequency response function from one block, i.e. from one input to the output. In particular, this expression reveals that the variance increases in one block when the number of estimated parameters in another block is increased, but levels off when the number of parameters in the other block reaches the number of parameters in the block in question. It also quantifies exactly how correlation between inputs affects the resulting accuracy and a graphical representation is provided for this purpose. The results are applicable to parallel MISO Hammerstein models when the nonlinearities are known and generalize an existing variance expression for this type of model. 相似文献
We investigate two-party quantum teleportation through noisy channels for multi-qubit Greenberger–Horne–Zeilinger (GHZ) states and find which state loses less quantum information in the process. The dynamics of states is described by the master equation with the noisy channels that lead to the quantum channels to be mixed states. We analytically solve the Lindblad equation for \(n\)-qubit GHZ states \(n\in \{4,5,6\}\) where Lindblad operators correspond to the Pauli matrices and describe the decoherence of states. Using the average fidelity, we show that 3GHZ state is more robust than \(n\)GHZ state under most noisy channels. However, \(n\)GHZ state preserves same quantum information with respect to Einstein–Podolsky–Rosen and 3GHZ states where the noise is in \(x\) direction in which the fidelity remains unchanged. We explicitly show that Jung et al.’s conjecture (Phys Rev A 78:012312, 2008), namely “average fidelity with same-axis noisy channels is in general larger than average fidelity with different-axes noisy channels,” is not valid for 3GHZ and 4GHZ states. 相似文献
Factored Edge-Valued Binary Decision Diagrams form an extension to Edge-Valued Binary Decision Diagrams. By associating both an additive and a multiplicative weight with the edges, FEVBDDs can be used to represent a wider range of functions concisely. As a result, the computational complexity for certain operations can be significantly reduced compared to EVBDDs. Additionally, the introduction of multiplicative edge weights allows us to directly represent the so-called complement edges which are used in OBDDs, thus providing a one to one mapping of all OBDDs to FEVBDDs. Applications such as integer linear programming and logic verification that have been proposed for EVBDDs also benefit from the extension. We also present a complete matrix package based on FEVBDDs and apply the package to the problem of solving the Chapman-Kolmogorov equations. 相似文献