A hardware architecture for the implementation of Multi-Step Look-Ahead Sigma-Delta Modulators (SLA SDMs) is presented. MSLA SDMs offer superior performance than conventional single-bit SDMs for a multitude of applica...
详细信息
ISBN:
(纸本)9781538648810
A hardware architecture for the implementation of Multi-Step Look-Ahead Sigma-Delta Modulators (SLA SDMs) is presented. MSLA SDMs offer superior performance than conventional single-bit SDMs for a multitude of applications relying on single-bit signal representation. However, traditional look-ahead SDMs have very high algorithmic complexity and their hardware implementation does not allow for real-time operation. MSLA SDMs overcome this problem by transforming the minimization problem associated with traditional look-ahead SDMs. A proof-of-concept FPGA implementation of a specific MSLA SDM is discussed and compared to a conventional single-bit SDM in terms of performance and hardware complexity. It is demonstrated that MSLA SDMs are a viable alternative to conventional single-bit SDMs when better performance with moderate additional hardware complexity are required.
This paper proposed a Boolean expression simplification method with reduced complexity. To avoid bulky size of the truth table for multiple input combinational circuits, a reduced truth table is proposed here and this...
详细信息
ISBN:
(纸本)9781538619315
This paper proposed a Boolean expression simplification method with reduced complexity. To avoid bulky size of the truth table for multiple input combinational circuits, a reduced truth table is proposed here and this methodology is able to reduce its present size. This paper discusses about the generation of minterms from the SOP form of the Boolean expression. Here any input system is described as SOP form and represented by a matrix. This paper shows the effectiveness for reducing the computational complexity for Boolean expression simplification.
This study describes a novel spectral LED-based tunable light source used for customized lighting solutions, especially for the reconstruction of CIE (Commission Internationale de l'Eclairage) standard illuminants...
详细信息
This study describes a novel spectral LED-based tunable light source used for customized lighting solutions, especially for the reconstruction of CIE (Commission Internationale de l'Eclairage) standard illuminants. The light source comprises 31 spectral bands ranging from 400 to 700 nm, an integrating cube and a control board with a 16-bit resolution. A minimization algorithm to calculate the weighting values for each channel was applied to reproduce illuminants with precision. The differences in spectral fitting and colorimetric parameters showed that the reconstructed spectra were comparable to the standard, especially for the D65, D50, A and E illuminants. Accurate results were also obtained for illuminants with narrow peaks such as fluorescents (F2 and F11) and a high-pressure sodium lamp (HP1). In conclusion, the developed spectral LED-based light source and the minimization algorithm are able to reproduce any CIE standard illuminants with a high spectral and colorimetric accuracy able to advance available custom lighting systems useful in the industry and other fields such as museum lighting.
The article presents a study on gas phase heats of formation or enthalpy that deals with the heat necessary to form a molecule from its standard state elements. Topics include atom correction terms, minimization algor...
详细信息
The article presents a study on gas phase heats of formation or enthalpy that deals with the heat necessary to form a molecule from its standard state elements. Topics include atom correction terms, minimization algorithm, density functional theory, semi-empirical method, and average absolute error. Also included are topics like standard deviations, and coordination number.
In this paper, we analyse the convergence rate of the sequence of objective function values of a primal-dual proximal-point algorithm recently introduced in the literature for solving a primal convex optimization prob...
详细信息
In this paper, we analyse the convergence rate of the sequence of objective function values of a primal-dual proximal-point algorithm recently introduced in the literature for solving a primal convex optimization problem having as objective the sum of linearly composed infimal convolutions, nonsmooth and smooth convex functions and its Fenchel-type dual one. The theoretical part is illustrated by numerical experiments in image processing.
We provide two weakly convergent algorithms for finding a zero of the sum of a maximally monotone operator, a cocoercive operator, and the normal cone to a closed vector subspace of a real Hilbert space. The methods e...
详细信息
We provide two weakly convergent algorithms for finding a zero of the sum of a maximally monotone operator, a cocoercive operator, and the normal cone to a closed vector subspace of a real Hilbert space. The methods exploit the intrinsic structure of the problem by activating explicitly the cocoercive operator in the first step, and taking advantage of a vector space decomposition in the second step. The second step of the first method is a Douglas-Rachford iteration involving the maximally monotone operator and the normal cone. In the second method, it is a proximal step involving the partial inverse of the maximally monotone operator with respect to the vector subspace. Connections between the proposed methods and other methods in the literature are provided. Applications to monotone inclusions with finitely many maximally monotone operators and optimization problems are examined.
Model-based methods to the tracking of an articulated hand in a video sequence could be divided in two categories. The first one, called stochastic methods, uses stochastic filters such as kalman or particle ones. The...
详细信息
ISBN:
(纸本)9788086943886
Model-based methods to the tracking of an articulated hand in a video sequence could be divided in two categories. The first one, called stochastic methods, uses stochastic filters such as kalman or particle ones. The second category, named deterministic methods, defines a dissimilarity function to measure how well the hand model is aligned with the hand images of a video sequence. This dissimilarity function is then minimized to achieve the hand tracking. Two well-known problems are related to the minimization algorithms. The first one is that of local minima. The second problem is that of computing time required to reach the solution. These problems are compounded with the large number of degrees of freedom (DOF) of the hand (around 26). The choice of the function to be minimized and that of the minimization process can be an answer to these problems. In this paper two major contributions are presented. The first one defines a new dissimilarity function, which gives better results for hand tracking than other well-known functions like the directed chamfer or hausdorff distances. The second contribution proposes a minimization process that operates in two steps. The first one provides the global parameters of the hand, i.e. position and orientation of the palm, whereas the second step gives the local parameters of the hand, i.e. finger joint angles. Operating in two stages, the proposed two-step algorithm reduces the complexity of the minimization problem. Indeed, it seems more robust to local minima than a one-step algorithm and improves the computing time needed to get the desired solution.
The network system reliability research contains a number of problems, such as: Reliability analysis and reliability design, reliability, maintenance and a lot of problems so on. The calculation of reliability of the ...
详细信息
ISBN:
(纸本)9783038353140
The network system reliability research contains a number of problems, such as: Reliability analysis and reliability design, reliability, maintenance and a lot of problems so on. The calculation of reliability of the network is the important area of network reliability analysis, State enumeration method and principle of a class, don't pay the product and method, the factor decomposition method is a classic accurate algorithm of computing network reliability. Due to the difficulty of precise calculation, in the method, appeared and bound method, Monte carol method, the reliability of the approximate algorithm. Compared with the accurate algorithm, approximate algorithm is still under development. So far, no recognized classic algorithms, so the method to improve calculation accuracy, reduce the complexity of the target of the researchers.
An optimization of an analytical problem with nine variables is executed to find the optimal Permanent Magnet(PM) generator for a tidal turbine. A gradient based solver is used to find the minimum cost of active mater...
详细信息
ISBN:
(纸本)9781479943883
An optimization of an analytical problem with nine variables is executed to find the optimal Permanent Magnet(PM) generator for a tidal turbine. A gradient based solver is used to find the minimum cost of active materials for the given design specifications. The MATLAB function fmincon is used, and the possible minimization algorithms available for this function are compared. As these solvers are only able to find a local minimum, a search is performed trying to find other minimas, both using a MultiStart procedure and using a Genetic algorithm (GA). Losses are calculated for windings, stator laminations and rotor magnets and solid steel, and a constraint is put on efficiency. The cost effect of varying this constraint is investigated. Optimizations are done with both weight and material cost as objective function, and the different resulting designs are presented.
This paper addresses the cryptanalysis of three chaos-based secure communication schemes recently proposed by Yu et al. [2007]. Attacks with adaptive observers designed by the dynamical minimization algorithm are assu...
详细信息
This paper addresses the cryptanalysis of three chaos-based secure communication schemes recently proposed by Yu et al. [2007]. Attacks with adaptive observers designed by the dynamical minimization algorithm are assumed. Considering Kerckhoff's principle, i.e. assuming that the basic structure of a cryptosystem is known but some user-specified parameters remain in secret, it is demonstrated that the covered messages in all these schemes can be estimated and hence their securities are challenged.
暂无评论