The multidelay parallel (MDP) technique is a multidelay logic simulation algorithm that uses no timing wheel, or any other event-sorting mechanism, Instead, wide bit-fields containing net-values for several different ...
详细信息
The multidelay parallel (MDP) technique is a multidelay logic simulation algorithm that uses no timing wheel, or any other event-sorting mechanism, Instead, wide bit-fields containing net-values for several different times are used to resolve out-of-order events, Bit-parallel operations are performed to simulate;gates at the required times, The MDP technique was originally designed to be implemented in hardware, but the current software version of the algorithm has proven to be competitive with conventional event-driven multidelay simulation, Two versions of the MDP technique are presented in this paper, fixed alignment and variable alignment, The fixed alignment algorithm provides bit-fields that are wide enough to capture any event that could occur during the simulation of an input vector, while the variable alignment algorithm uses a minimum-width bit field which is just wide enough to capture those events that could occur at an individual step in the simulation, A prototype hardware design is discussed briefly.
Unlike conventional CMOS circuits, nano-crossbar arrays have considerably high defect rates. Multiple-type defects randomly occur both on crosspoint switches and wires that substantially complicates the design phase o...
详细信息
Unlike conventional CMOS circuits, nano-crossbar arrays have considerably high defect rates. Multiple-type defects randomly occur both on crosspoint switches and wires that substantially complicates the design phase of the circuits with an elimination of systematic design choices. In order to overcome this problem, a logic mapping methodology is presented in this paper. A fast heuristic algorithm using pre-mapping logic morphing, defect oriented adaptive sorting, matching with Hadamard multiplication, and backtracking is introduced. The proposed algorithm covers both crosspoint defects including stuck-open and stuck-closed types and wire defects including bridging and broken types. Effects of stuck-closed defects, mostly disregarded in the literature, are studied in depth. In simulations, an industrial benchmark suit is used for obtaining runtime and success rate values of the proposed algorithm in comparison with those of the existing algorithms in the literature. A relative accuracy evaluation is also given in comparison with exact mapping techniques. Finally, the steps of the algorithm that are based on pre-mapping and heuristic matching techniques, are separately justified with experimental results.
There are numerous examples of systems which have discrete models that randomly vary with time and experience switchings between different models after a random sojourn time. In some situations, the switching probabil...
详细信息
There are numerous examples of systems which have discrete models that randomly vary with time and experience switchings between different models after a random sojourn time. In some situations, the switching probabilities depend on the sojourn time. Such a switching process, discussed in this note, is a class of semi-Markov processes and is encountered in target tracking, systems subject to failures, and also in the socioeconomic environment. In such a system, knowledge of the sojourn time is needed for the computation of the conditional transition probabilities. It is shown in this note how one can infer the transition probabilities via the evaluation of the conditional distribution of the sojourn time. Subsequently, using the conditional sojourn time distribution for dynamic systems with imperfect observations and changing structures (models), a recursive state estimation for such systems is presented.
The author examines the project of Louis Couffignal concerning an electronic calculating machine. This project was supported by the Centre National de la Recherche Scientifique. Couffignal was aware of the American an...
详细信息
The author examines the project of Louis Couffignal concerning an electronic calculating machine. This project was supported by the Centre National de la Recherche Scientifique. Couffignal was aware of the American and British projects concerning computers but he wanted to profoundly differentiate his project from them. He rejected the place of the memory in the new machines. Couffignal's machine was never finished and this failure caused a delay in computing science in France.
The ability to retrieve rain-rate profiles from a dual-wavelength spaceborne radar system operating at 13.6 and 35 GHz is analyzed. The fundamental problem of extracting either the attenuation and/or the reflectivity ...
详细信息
The ability to retrieve rain-rate profiles from a dual-wavelength spaceborne radar system operating at 13.6 and 35 GHz is analyzed. The fundamental problem of extracting either the attenuation and/or the reflectivity from the backscatter echo, which contains both contributions, is addressed. Three algorithms, the backscatter, the attenuation coefficient, and the dual-wavelength methods, are examined. These algorithms are tested using four rain-rate profiles derived from radar measurements. In particular, measured (true) values are compared with calculated (retrieved) rain rates applying the algorithms with superimposed uncertainties assuming a suggested spaceborne dual-wavelength radar system. Error values of rain rates are determined where these values reflect failure of the assumptions utilized in the derivation of the algorithms, rain backscatter noise, and instrument noise.< >
Using a state-space approach, a new algorithm for designing MIMO orthogonal digital filters is developed. The algorithm consists of three parts: (i) orthogonal embedding, (ii) transformation of the embedded orthogonal...
详细信息
Using a state-space approach, a new algorithm for designing MIMO orthogonal digital filters is developed. The algorithm consists of three parts: (i) orthogonal embedding, (ii) transformation of the embedded orthogonal transition matrix to the alpha-extended upper Hessenberg form, and (iii) factorization of this new form into Givens (planar) rotations. Appropriately interconnecting the rotors leads to the pipelined orthogonal filter structure. As a consequence of our approach, for the SISO case, an essentially orthogonal structure is obtained for the inverse filter;only one of the Givens rotors gets replaced by a hyperbolic rotor.
The network planning problem of placing replicated servers with QoS constraints is considered. Each server site may consist of multiple server types with varying capacities and each site can be placed in any location ...
详细信息
The network planning problem of placing replicated servers with QoS constraints is considered. Each server site may consist of multiple server types with varying capacities and each site can be placed in any location among those belonging to a given set. Each client can be served by more than one location as long as the round-trip delay of data requests satisfies predetermined upper bounds. Our main focus is to minimize the cost of using the servers and utilizing the link bandwidth, while serving requests according to their delay constraint. This is an NP-hard problem. A pseudopolynomial and a polynomial algorithm that provide guaranteed approximation factors with respect to the optimal for the problem at hand are presented.
The method of fitting an autoregressive (AR) process to a multichannel time series was extended from the full-rank case over the degenerate-rank case in the previous papers [5], [6], and the autoregressive (AR) model\...
详细信息
The method of fitting an autoregressive (AR) process to a multichannel time series was extended from the full-rank case over the degenerate-rank case in the previous papers [5], [6], and the autoregressive (AR) model\\hat{H}_{n}(z)was constructed to fit the first givenn + 1data of an autocorrelation sequence. The notion of random processes of asymptotically constant rank will be introduced in the degenerate-rank case. We shall show that the sequence of the AR models\\{ \\hat{H}_{n}(z)\\}converges forn \\rightarrow \\inftyto a generating functionH(z)of an original process uniformly on every closed disk|z| \\leq \\rho < 1, if the original process is of asymptotically constant rank. We shall also show that the sequence of the integrated power spectra\\{ \\hat{S}_{n}(e^{j \\omega})\\}of the AR processes converges a.e. forn \\rightarrow \\inftyto the integrated power spectrumS(e^{j \\omega}of an original process even in the degenerate-rank case.
This note is concerned with performance prediction of multiple-target tracking systems, particularly in data-rich, high-target-density environments. Two simple but useful expressions are described: i) the exponential ...
详细信息
This note is concerned with performance prediction of multiple-target tracking systems, particularly in data-rich, high-target-density environments. Two simple but useful expressions are described: i) the exponential law for predicting average probability of correct data association, and ii) the linear-times-exponential law for calculating the effective measurement error variances with possible data misassociation. Estimation of two key multiple-target tracking performance measures, i.e., track purity and track accuracy, are then derived using these two laws.
暂无评论