This is a Switch simulation... with 4 types of switches... and also we have average simulation time over these 4 switches 1. No Queue 2. Input Queue 3. Input Queue with iterative 4. Output QUeue
标签： simulation switches average Switch
上传时间： 2017-05-20
上传用户：徐孺
program to solve a finite difference discretization of Helmholtz equation : (d2/dx2)u + (d2/dy2)u - alpha u = f using Jacobi iterative method. COMMENTS: OpenMP version 3: 1 PR outside the iteration loop, 4 Barriers Directives are used in this code to achieve paralleism. All do loops are parallized with default static scheduling.
标签： discretization difference Helmholtz equation
上传时间： 2014-01-11
上传用户：bruce5996
VHDL implementation of the twofish cipher for 128,192 and 256 bit keys. The implementation is in library-like form All needed components up to, including the round/key schedule circuits are implemented, giving the flexibility to be combined in different architectures (iterative, rolled out/pipelined etc). Manual in English is included with more details about how to use the components and/or how to optimize some of them. All testbenches are provided (tables, variable key/text, ECB/CBC monte carlo) for 128, 192 and 256 bit key sizes, along with their respective vector files.
标签： implementation twofish cipher VHDL
上传时间： 2017-06-25
上传用户：王小奇
matlab有限元网格划分程序 DistMesh is a simple MATLAB code for generation of unstructured triangular and tetrahedral meshes. It was developed by Per-Olof Persson (now at UC Berkeley) and Gilbert Strang in the Department of Mathematics at MIT. A detailed description of the program is provided in our SIAM Review paper, see documentation below. One reason that the code is short and simple is that the geometries are specified by Signed Distance Functions. These give the shortest distance from any point in space to the boundary of the domain. The sign is negative inside the region and positive outside. A simple example is the unit circle in 2-D, which has the distance function d=r-1, where r is the distance from the origin. For more complicated geometries the distance function can be computed by interpolation between values on a grid, a common representation for level set methods. For the actual mesh generation, DistMesh uses the Delaunay triangulation routine in MATLAB and tries to optimize the node locations by a force-based smoothing procedure. The topology is regularly updated by Delaunay. The boundary points are only allowed to move tangentially to the boundary by projections using the distance function. This iterative procedure typically results in very well-shaped meshes. Our aim with this code is simplicity, so that everyone can understand the code and modify it according to their needs. The code is not entirely robust (that is, it might not terminate and return a well-shaped mesh), and it is relatively slow. However, our current research shows that these issues can be resolved in an optimized C++ code, and we believe our simple MATLAB code is important for demonstration of the underlying principles. To use the code, simply download it from below and run it from MATLAB. For a quick demonstration, type "meshdemo2d" or "meshdemond". For more details see the documentation.
标签： matlab有限元网格划分程序
上传时间： 2015-08-12
上传用户：凛风拂衣袖
Computational models are commonly used in engineering design and scientific discovery activities for simulating complex physical systems in disciplines such as fluid mechanics, structural dynamics, heat transfer, nonlinear structural mechanics, shock physics, and many others. These simulators can be an enormous aid to engineers who want to develop an understanding and/or predictive capability for complex behaviors typically observed in the corresponding physical systems. Simulators often serve as virtual prototypes, where a set of predefined system parameters, such as size or location dimensions and material properties, are adjusted to improve the performance of a system, as defined by one or more system performance objectives. Such optimization or tuning of the virtual prototype requires executing the simulator, evaluating performance objective(s), and adjusting the system parameters in an iterative, automated, and directed way. System performance objectives can be formulated, for example, to minimize weight, cost, or defects; to limit a critical temperature, stress, or vibration response; or to maximize performance, reliability, throughput, agility, or design robustness. In addition, one would often like to design computer experiments, run parameter studies, or perform uncertainty quantification (UQ). These approaches reveal how system performance changes as a design or uncertain input variable changes. Sampling methods are often used in uncertainty quantification to calculate a distribution on system performance measures, and to understand which uncertain inputs contribute most to the variance of the outputs. A primary goal for Dakota development is to provide engineers and other disciplinary scientists with a systematic and rapid means to obtain improved or optimal designs or understand sensitivity or uncertainty using simulationbased models. These capabilities generally lead to improved designs and system performance in earlier design stages, alleviating dependence on physical prototypes and testing, shortening design cycles, and reducing product development costs. In addition to providing this practical environment for answering system performance questions, the Dakota toolkit provides an extensible platform for the research and rapid prototyping of customized methods and meta-algorithms
标签： Optimization and Uncertainty Quantification
上传时间： 2016-04-08
上传用户：huhu123456
一本讲述求解稀疏线性方程的迭代方法的外文书，阅读需要具有较强的英语能力
标签： Iterative Methods Systems Linear Sparse
上传时间： 2016-05-21
上传用户：通行天下
This book presents, in a unitary and novel perspective, some of the research work the authors have carried out over the last decade, along with several collaborators and students. The roots of this book can be traced back to the design of adaptive sequence detection algorithms for channels with parametric uncertainty. The explosion of turbo codes and iterative decoding around the middle of the Nineties has motivated the design of iterative (turbo and graph-based) detection algorithms.
标签： Communications Algorithms Detection Wireless for
上传时间： 2020-05-27
上传用户：shancjb
Wireless communications has become a field of enormous scientific and economic interest. Recent success stories include 2G and 3G cellular voice and data services (e.g., GSM and UMTS), wireless local area networks (WiFi/IEEE 802.11x), wireless broadband access (WiMAX/IEEE 802.16x), and digital broadcast systems (DVB, DAB, DRM). On the physical layer side, traditional designs typically assume that the radio channel remains constant for the duration of a data block. However, researchers and system designers are increasingly shifting their attention to channels that may vary within a block. In addition to time dispersion caused by multipath propagation, these rapidly time-varying channels feature frequency dispersion resulting from the Doppler effect. They are, thus, often referred to as being “doubly dispersive.”
标签： Time-Varying Channels
上传时间： 2020-06-01
上传用户：shancjb
