34 resultados para stochastic programming
Resumo:
This paper describes a two-step packing algorithm for LUT clusters of which the LUT input multipliers are depopulated. In the first step, a greedy algorithm is used to search for BLE locations and cluster inputs. If the greedy algorithm fails, the second step with network flow programming algorithm is employed. Numerical results illustrate that our two-step packing algorithm obtains better packing density than one-step greedy packing algorithm.
Resumo:
In this paper we present a methodology and its implementation for the design and verification of programming circuit used in a family of application-specific FPGAs that share a common architecture. Each member of the family is different either in the types of functional blocks contained or in the number of blocks of each type. The parametrized design methodology is presented here to achieve this goal. Even though our focus is on the programming circuitry that provides the interface between the FPGA core circuit and the external programming hardware, the parametrized design method can be generalized to the design of entire chip for all members in the FPGA family. The method presented here covers the generation of the design RTL files and the support files for synthesis, place-and-route layout and simulations. The proposed method is proven to work smoothly within the complete chip design methodology. We will describe the implementation of this method to the design of the programming circuit in details including the design flow from the behavioral-level design to the final layout as well as the verification. Different package options and different programming modes are included in the description of the design. The circuit design implementation is based on SMIC 0.13-micron CMOS technology.
Resumo:
The formal specification language LFC was designed to support formal specification acquisition. However, it is yet suited to be used as a meta-language for specifying programming language processing. This paper introduces LFC as a meta-language, and compares it with ASF+SDF, an algebraic specification formalism that can also be used to programming languages.
Resumo:
An analytic closed form for the second- order or fourth- order Markovian stochastic correlation of attosecond sum- frequency polarization beat ( ASPB) can be obtained in the extremely Doppler- broadened limit. The homodyne detected ASPB signal is shown to be particularly sensitive to the statistical properties of the Markovian stochastic light. fields with arbitrary bandwidth. The physical explanation for this is that the Gaussian- amplitude. field undergoes stronger intensity. fluctuations than a chaotic. field. On the other hand, the intensity ( amplitude). fluctuations of the Gaussian- amplitude. field or the chaotic. field are always much larger than the pure phase. fluctuations of the phase-diffusion field. The field correlation has weakly influence on the ASPB signal when the laser has narrow bandwidth. In contrast, when the laser has broadband linewidth, the ASPB signal shows resonant- nonresonant cross correlation, and the sensitivities of ASPB signal to three Markovian stochastic models increase as time delay is increased. A Doppler- free precision in the measurement of the energy- level sum can be achieved with an arbitrary bandwidth. The advantage of ASPB is that the ultrafast modulation period 900as can still be improved, because the energy- level interval between ground state and excited state can be widely separated.
Resumo:
Based on the phase-conjugation polarization interference between two two-photon processes, we theoretically investigated the attosecond scale asymmetry sum-frequency polarization beat in four-level system (FASPB). The field correlation has weak influence on the FASPB signal when the laser has narrow bandwidth. Conversely, when the laser has broadband linewidth, the FASPB signal shows resonance-nonresonance cross correlation. The two-photon signal exhibits hybrid radiation-matter detuning terahertz; damping oscillation, i.e., when the laser frequency is off resonance from the two-photon transition, the signal exhibits damping oscillation and the profile of the two-photon self-correlation signal also exhibits zero time-delay asymmetry of the maxima. We have also investigated the asymmetry of attosecond polarization beat caused by the shift of the two-photon self-correlation zero time-delay phenomenon, in which the maxima of the two two-photon signals are shifted from zero time-delay point to opposite directions. As an attosecond ultrafast modulation process, FASPB can be intrinsically extended to any level-summation systems of two dipolar forbidden excited states.
Resumo:
In this paper, as an extension of minimum unsatisfied linear relations problem (MIN ULR), the minimum unsatisfied relations (MIN UR) problem is investigated. A triangle evolution algorithm with archiving and niche techniques is proposed for MIN UR problem. Different with algorithms in literature, it solves MIN problem directly, rather than transforming it into many sub-problems. The proposed algorithm is also applicable for the special case of MIN UR, in which it involves some mandatory relations. Numerical results show that the algorithm is effective for MIN UR problem and it outperforms Sadegh's algorithm in sense of the resulted minimum inconsistency number, even though the test problems are linear.
Resumo:
Based on several facts of CSRrn, such as the layout of the ring, the lattice parameters, exiting Schottky noise diagnosis equipment and fund, the primary stochastic cooling design of CSRm has been carried out. The optimum cooling time and the optimum cooling bandwidth axe obtained through simulation using the cooling function. The results indicate that the stochastic cooling is quite a powerful cooling method for CSRm. The comparison of the cooling effects of stochastic cooling and electron cooling in CSR are also presented. We can conclude that the combination of the two cooling methods on CSRrn will improve the beam cooling rate and quality beam greatly.
Resumo:
Chinese Acad Sci, ISCAS Lab Internet Software Technologies