The Experts below are selected from a list of 4044 Experts worldwide ranked by ideXlab platform
J.l. Huertas - One of the best experts on this subject based on the ideXlab platform.
-
Efficient State Reduction methods for PLA-based sequential circuits
IEE Proceedings E - Computers and Digital Techniques, 1992Co-Authors: M.j. Avedillo, J.m. Quintana, J.l. HuertasAbstract:Experiences with heuristics for the State Reduction of finite-State machines are presented and two new heuristic algorithms described in detail. Results on machines from the literature and from the MCNC benchmark set are shown. The area of the PLA implementation of the combinational component and the design time are used as figures of merit. The comparison of such parameters, when the State Reduction step is included in the design process and when it is not, suggests that fast State-Reduction heuristics should be implemented within FSM automatic synthesis systems.
-
SMAS: a program for the concurrent State Reduction and State assignment of finite State machines
1991. IEEE International Sympoisum on Circuits and Systems, 1991Co-Authors: M.j. Avedillo, J.m. Quintana, J.l. HuertasAbstract:A State assignment algorithm for PLA-based machines which produces as assignment of nonnecessarily distinct and eventually incompletely specified codes is presented. In this approach, State Reduction and State assignment are concurrently dealt with, and a restricted State splitting technique is explored. The algorithm is particularly appropriate for machines with compatibility relations among States because the potentials of State merging are exploited during the State assignment step. The input to SMAS, the program implementing the algorithm, is a symbolic cover of the FSM. The output is a Boolean representation of both next State and output functions suitable to be minimized with ESPRESSO. The machines in the MCNC benchmark set are used to test the algorithm and to compare it with a well-known State assignment program.
-
New approach to the State Reduction in incompletely specified sequential machines
IEEE International Symposium on Circuits and Systems, 1990Co-Authors: M.j. Avedillo, J.m. Quintana, J.l. HuertasAbstract:An algorithm for the State Reduction of incompletely specified sequential machines is presented. The heuristic method does not need to generate any complete set of compatibles. Starting from the set of internal States in the given symbolic description of the finite State machine (FSM), the application of a sequence of transformations results in a description with a smaller number of States. Experimental results for a wide set of machines are included which prove the superiority of the algorithm.
-
A new method for the State Reduction of incompletely specified finite sequential machines
Proceedings of the European Design Automation Conference 1990. EDAC., 1990Co-Authors: M.j. Avedillo, J.m. Quintana, J.l. HuertasAbstract:A new method for the State Reduction of incompletely specified finite sequential machines is proposed. Fundamental theorem of minimization theory States that, given an incomplete State table, another State table specifying the same external behavior corresponds to each closed set of compatibility classes which covers all internal States of the given table. The new heuristic algorithm builds up a closed cover for a given State table selecting maximal compatibles (MCs) one by one until both covering and closure requirements are satisfied. Near-minimal solutions are also incrementally generated. The process is dynamic as the consequences of adding a particular MC are precisely determined. The new algorithm is designed for speed and has proven to be extremely valuable in situations where fast but good optimization is required. The algorithm has been programmed and results on a wide set of machines shown.
M.j. Avedillo - One of the best experts on this subject based on the ideXlab platform.
-
Efficient State Reduction methods for PLA-based sequential circuits
IEE Proceedings E - Computers and Digital Techniques, 1992Co-Authors: M.j. Avedillo, J.m. Quintana, J.l. HuertasAbstract:Experiences with heuristics for the State Reduction of finite-State machines are presented and two new heuristic algorithms described in detail. Results on machines from the literature and from the MCNC benchmark set are shown. The area of the PLA implementation of the combinational component and the design time are used as figures of merit. The comparison of such parameters, when the State Reduction step is included in the design process and when it is not, suggests that fast State-Reduction heuristics should be implemented within FSM automatic synthesis systems.
-
SMAS: a program for the concurrent State Reduction and State assignment of finite State machines
1991. IEEE International Sympoisum on Circuits and Systems, 1991Co-Authors: M.j. Avedillo, J.m. Quintana, J.l. HuertasAbstract:A State assignment algorithm for PLA-based machines which produces as assignment of nonnecessarily distinct and eventually incompletely specified codes is presented. In this approach, State Reduction and State assignment are concurrently dealt with, and a restricted State splitting technique is explored. The algorithm is particularly appropriate for machines with compatibility relations among States because the potentials of State merging are exploited during the State assignment step. The input to SMAS, the program implementing the algorithm, is a symbolic cover of the FSM. The output is a Boolean representation of both next State and output functions suitable to be minimized with ESPRESSO. The machines in the MCNC benchmark set are used to test the algorithm and to compare it with a well-known State assignment program.
-
New approach to the State Reduction in incompletely specified sequential machines
IEEE International Symposium on Circuits and Systems, 1990Co-Authors: M.j. Avedillo, J.m. Quintana, J.l. HuertasAbstract:An algorithm for the State Reduction of incompletely specified sequential machines is presented. The heuristic method does not need to generate any complete set of compatibles. Starting from the set of internal States in the given symbolic description of the finite State machine (FSM), the application of a sequence of transformations results in a description with a smaller number of States. Experimental results for a wide set of machines are included which prove the superiority of the algorithm.
-
A new method for the State Reduction of incompletely specified finite sequential machines
Proceedings of the European Design Automation Conference 1990. EDAC., 1990Co-Authors: M.j. Avedillo, J.m. Quintana, J.l. HuertasAbstract:A new method for the State Reduction of incompletely specified finite sequential machines is proposed. Fundamental theorem of minimization theory States that, given an incomplete State table, another State table specifying the same external behavior corresponds to each closed set of compatibility classes which covers all internal States of the given table. The new heuristic algorithm builds up a closed cover for a given State table selecting maximal compatibles (MCs) one by one until both covering and closure requirements are satisfied. Near-minimal solutions are also incrementally generated. The process is dynamic as the consequences of adding a particular MC are precisely determined. The new algorithm is designed for speed and has proven to be extremely valuable in situations where fast but good optimization is required. The algorithm has been programmed and results on a wide set of machines shown.
J.m. Quintana - One of the best experts on this subject based on the ideXlab platform.
-
Efficient State Reduction methods for PLA-based sequential circuits
IEE Proceedings E - Computers and Digital Techniques, 1992Co-Authors: M.j. Avedillo, J.m. Quintana, J.l. HuertasAbstract:Experiences with heuristics for the State Reduction of finite-State machines are presented and two new heuristic algorithms described in detail. Results on machines from the literature and from the MCNC benchmark set are shown. The area of the PLA implementation of the combinational component and the design time are used as figures of merit. The comparison of such parameters, when the State Reduction step is included in the design process and when it is not, suggests that fast State-Reduction heuristics should be implemented within FSM automatic synthesis systems.
-
SMAS: a program for the concurrent State Reduction and State assignment of finite State machines
1991. IEEE International Sympoisum on Circuits and Systems, 1991Co-Authors: M.j. Avedillo, J.m. Quintana, J.l. HuertasAbstract:A State assignment algorithm for PLA-based machines which produces as assignment of nonnecessarily distinct and eventually incompletely specified codes is presented. In this approach, State Reduction and State assignment are concurrently dealt with, and a restricted State splitting technique is explored. The algorithm is particularly appropriate for machines with compatibility relations among States because the potentials of State merging are exploited during the State assignment step. The input to SMAS, the program implementing the algorithm, is a symbolic cover of the FSM. The output is a Boolean representation of both next State and output functions suitable to be minimized with ESPRESSO. The machines in the MCNC benchmark set are used to test the algorithm and to compare it with a well-known State assignment program.
-
New approach to the State Reduction in incompletely specified sequential machines
IEEE International Symposium on Circuits and Systems, 1990Co-Authors: M.j. Avedillo, J.m. Quintana, J.l. HuertasAbstract:An algorithm for the State Reduction of incompletely specified sequential machines is presented. The heuristic method does not need to generate any complete set of compatibles. Starting from the set of internal States in the given symbolic description of the finite State machine (FSM), the application of a sequence of transformations results in a description with a smaller number of States. Experimental results for a wide set of machines are included which prove the superiority of the algorithm.
-
A new method for the State Reduction of incompletely specified finite sequential machines
Proceedings of the European Design Automation Conference 1990. EDAC., 1990Co-Authors: M.j. Avedillo, J.m. Quintana, J.l. HuertasAbstract:A new method for the State Reduction of incompletely specified finite sequential machines is proposed. Fundamental theorem of minimization theory States that, given an incomplete State table, another State table specifying the same external behavior corresponds to each closed set of compatibility classes which covers all internal States of the given table. The new heuristic algorithm builds up a closed cover for a given State table selecting maximal compatibles (MCs) one by one until both covering and closure requirements are satisfied. Near-minimal solutions are also incrementally generated. The process is dynamic as the consequences of adding a particular MC are precisely determined. The new algorithm is designed for speed and has proven to be extremely valuable in situations where fast but good optimization is required. The algorithm has been programmed and results on a wide set of machines shown.
Tao Jiang - One of the best experts on this subject based on the ideXlab platform.
-
solid State Reduction kinetics and mechanism of pre oxidized vanadium titanium magnetite concentrate
Transactions of Nonferrous Metals Society of China, 2014Co-Authors: Tao Jiang, Feng ChenAbstract:Abstract The solid-State Reduction kinetics of pre-oxidized vanadium-titanium magnetite concentrate was studied. The phase and microstructure of the Reduction product were characterized by XRD, SEM and EDS methods, based on which the mechanism of the solid-State Reduction was investigated. The results showed that using coal as reductant at 950-1100 °C, the solid-State Reduction of the pre-oxidized vanadium-titanium magnetite concentrate was controlled by interface chemical reaction and the apparent activation energy was 67.719 kJ/mol. The mineral phase transformation during the Reduction process can be described as follows: pre-oxidized vanadium-titanium magnetite concentrate → ulvospinel → ilmenite → FeTi 2 O 5 → (Fe n Ti 1- n )Ti 2 O 5 . M 3 O 5 -type (M can be Fe, Ti, Mg, Mn, etc) solid solutions would be formed during the Reduction process of the pre-oxidized vanadium-titanium magnetite concentrate at 1050 °C for 60 min. The poor reducibility of iron in M 3 O 5 solid solutions is the main reason to limit the Reduction property of pre-oxidized vanadium-titanium magnetite concentrate.
-
Solid-State Reduction kinetics and mechanism of pre-oxidized vanadium–titanium magnetite concentrate
Transactions of Nonferrous Metals Society of China, 2014Co-Authors: Tao Jiang, Feng ChenAbstract:Abstract The solid-State Reduction kinetics of pre-oxidized vanadium-titanium magnetite concentrate was studied. The phase and microstructure of the Reduction product were characterized by XRD, SEM and EDS methods, based on which the mechanism of the solid-State Reduction was investigated. The results showed that using coal as reductant at 950-1100 °C, the solid-State Reduction of the pre-oxidized vanadium-titanium magnetite concentrate was controlled by interface chemical reaction and the apparent activation energy was 67.719 kJ/mol. The mineral phase transformation during the Reduction process can be described as follows: pre-oxidized vanadium-titanium magnetite concentrate → ulvospinel → ilmenite → FeTi 2 O 5 → (Fe n Ti 1- n )Ti 2 O 5 . M 3 O 5 -type (M can be Fe, Ti, Mg, Mn, etc) solid solutions would be formed during the Reduction process of the pre-oxidized vanadium-titanium magnetite concentrate at 1050 °C for 60 min. The poor reducibility of iron in M 3 O 5 solid solutions is the main reason to limit the Reduction property of pre-oxidized vanadium-titanium magnetite concentrate.
-
Mechanism of vanadic titanomagnetite solid-State Reduction
Rare Metals, 2014Co-Authors: Tao JiangAbstract:The influence mechanism of vanadic titanomagnetite solid-State Reduction was studied in this paper. Optical microscopy (OM), scanning electron microscope (SEM), and X-ray diffraction (XRD) were used to characterize the structure and phases of the samples. The results show that the dense structure is not the reason that limits the reducibility of Panxi vanadic titanomagnetite. Metallization rate of 93 % was achieved when it was reduced at 1100 °C for 100 min. After pre-oxidation, Fe9TiO15 and Fe2O3 are the main phases of samples. Pre-oxidation could destroy the dense structure of vanadic titanomagnetite and increase the specific surface area of particles. However, reducibility of vanadic titanomagnetite is not improved obviously by pre-oxidation, with metallization rate increasing only 1 % under the same Reduction conditions, and the generated metallic iron grains are smaller. Phase transformation of vanadic titanomagnetite at different Reduction temperatures shows that the presence of FeTi2O5 is the main reason that limits the reducibility of Panxi vanadic titanomagnetite.
Lane P. Hughston - One of the best experts on this subject based on the ideXlab platform.
-
Quantum State Reduction
arXiv: Quantum Physics, 2016Co-Authors: Dorje C. Brody, Lane P. HughstonAbstract:We propose an energy-driven stochastic master equation for the density matrix as a dynamical model for quantum State Reduction. In contrast, most previous studies of State Reduction have considered stochastic extensions of the Schrodinger equation, and have introduced the density matrix as the expectation of the random pure projection operator associated with the evolving State vector. After working out properties of the Reduction process we construct a general solution to the energy-driven stochastic master equation. The solution is obtained by the use of nonlinear filtering theory and takes the form of a completely positive stochastic map.
-
Exactly solvable quantum State Reduction models with time-dependent coupling
Journal of Physics A, 2006Co-Authors: Dorje C. Brody, Irene C. Constantinou, James D C Dear, Lane P. HughstonAbstract:A closed-form solution to the energy-based stochastic Schrodinger equation with a time-dependent coupling is obtained. The solution is algebraic in character, and is expressed directly in terms of independent random data. The data consist of (i) a random variable H which has the distribution , where πi is the transition probability |ψ0|i|2 from the initial State |ψ0 to the Luders State |i with energy Ei, and (ii) an independent -Brownian motion, where is the physical probability measure associated with the dynamics of the Reduction process. When the coupling is time independent, it is known that State Reduction occurs asymptotically—that is to say, over an infinite time horizon. In the case of a time-dependent coupling, we show that if the magnitude of the coupling decreases sufficiently rapidly, then the energy variance will be reduced under the dynamics, but the State need not reach an energy eigenState. This situation corresponds to the case of a 'partial' or 'incomplete' measurement of the energy. We also construct an example of a model where the opposite situation prevails, in which complete State Reduction is achieved after the passage of a finite period of time.
-
Efficient simulation of quantum State Reduction
Journal of Mathematical Physics, 2002Co-Authors: Dorje C. Brody, Lane P. HughstonAbstract:The energy-based stochastic extension of the Schrodinger equation is a rather special nonlinear stochastic differential equation on Hilbert space, involving a single free parameter, that has been shown to be very useful for modeling the phenomenon of quantum State Reduction. Here we construct a general closed form solution to this equation, for any given initial condition, in terms of a random variable representing the terminal value of the energy and an independent Brownian motion. The solution is essentially algebraic in character, involving no integration, and is thus suitable as a basis for efficient simulation studies of State Reduction in complex systems.
-
Martingale models for quantum State Reduction
Journal of Physics A, 2001Co-Authors: Stephen L. Adler, Dorje C. Brody, Todd A. Brun, Lane P. HughstonAbstract:Stochastic models for quantum State Reduction give rise to statistical laws that are in most respects in agreement with those of quantum measurement theory. Here we examine the correspondence of the two theories in detail, making a systematic use of the methods of martingale theory. An analysis is carried out to determine the magnitude of the fluctuations experienced by the expectation of the observable during the course of the Reduction process and an upper bound is established for the ensemble average of the greatest fluctuations incurred. We consider the general projection postulate of L¨ uders applicable in the case of a possibly degenerate eigenvalue spectrum, and derive this result rigorously from the underlying stochastic dynamics for State Reduction in the case of both a pure and a mixed initial State. We also analyse the associated Lindblad equation for the evolution of the density matrix, and obtain an exact time-dependent solution for the State Reduction that explicitly exhibits the transition from a general initial density matrix to the L¨ uders density matrix. Finally, we apply Girsanov’s theorem to derive a set of simple formulae for the dynamics of the State in terms of a family of geometric Brownian motions, thereby constructing an explicit unravelling of the Lindblad equation.
