Topics Practices: Programming and Numerical Methods Practice 1: Introduction to C Practice 2: Cycles and functions First part cycles Part Two: Roles Practice 3 - Floating point arithmetic Practice 4 - Search for roots of functions Practice 5 - Numerical Integration Practice 6 - Arrangements and matrices Part One: Arrangements Part II: Matrices Practice 7 - Systems of linear equations Practice 8 - INTERPOLATION Practice 9 - Algorithm Design Techniques
标签： Practice Introduction Programming Practices
上传时间： 2013-12-16
上传用户：R50974
this application was developed in visual c# to draw the sequence of the data given by Lagrange INTERPOLATION algorithm
标签： application developed the Lagrange
上传时间： 2013-12-24
上传用户：dreamboy36
These codes require an ASCII input file interp.dat of the following form: N: Number of Polynomial INTERPOLATION Points (Small) First Sample (x1,y1) Second Sample (x2,y2) ... Nth Sample (xN,yN) N1: Number of Error Evaluation Points (Large) First Sample (x1,y1) Second Sample (x2,y2) ... N1th Sample (xN1,yN1)
标签： Polynomia following require Number
上传时间： 2017-09-21
上传用户：许小华
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
上传用户：凛风拂衣袖
The 4.0 kbit/s speech codec described in this paper is based on a Frequency Domain Interpolative (FDI) coding technique, which belongs to the class of prototype waveform INTERPOLATION (PWI) coding techniques. The codec also has an integrated voice activity detector (VAD) and a noise reduction capability. The input signal is subjected to LPC analysis and the prediction residual is separated into a slowly evolving waveform (SEW) and a rapidly evolving waveform (REW) components. The SEW magnitude component is quantized using a hierarchical predictive vector quantization approach. The REW magnitude is quantized using a gain and a sub-band based shape. SEW and REW phases are derived at the decoder using a phase model, based on a transmitted measure of voice periodicity. The spectral (LSP) parameters are quantized using a combination of scalar and vector quantizers. The 4.0 kbits/s coder has an algorithmic delay of 60 ms and an estimated floating point complexity of 21.5 MIPS. The performance of this coder has been evaluated using in-house MOS tests under various conditions such as background noise. channel errors, self-tandem. and DTX mode of operation, and has been shown to be statistically equivalent to ITU-T (3.729 8 kbps codec across all conditions tested.
标签： frequency-domain INTERPOLATION performance Design kbit_s speech coder based and of
上传时间： 2018-04-08
上传用户：kilohorse
1A/D转换器的分类与比较AD转换器（ADC）是模拟系统与数字系统接口的关键部件，长期以米一直被广泛应用于雷达、通信、电子对抗、声纳、卫星、导弹、测控系统、地震、医疗、仪器仪表、图像和音频等领域。随者计算机和通信产业的迅猛发展，进一步推动了ADC在便携式设备上的应用并使其有了长足进步，ADC正逐步向高速、高精度和低功耗的方向发展。通常，AD转换器具有三个基本功能：采样、量化和编码。如何实现这三个功能，决定了AD转换器的电路结构和工作性能。AD转换器的分类很多，按采样频率可划分为奈奎斯特采样ADC和过采样ADC，奈奎斯特采样ADC又可划分为高速ADC、中速ADC和低速ADC：按性能划分为高速ADC和高精度ADC：按结构划分为串行ADC、并行ADC和串并行ADC.在频率范围内还可以按电路结构细分为更多种类。中低速ADC可分为积分型ADC、过采样Sigma-Delta型 ADC、逐次逼近型ADC，Algonithmic ADC：高速ADC可以分为闪电式ADC、两步型ADC、流水线ADC、内插性ADC、折叠型ADC和时间交织型ADC，下面主要介绍几种常用的、应用最广泛的ADC结构，它们是：逐次比较式（SAR）ADC、快闪式（Flash）ADC、折叠插入式（Fol ding&INTERPOLATION）ADC、流水线式（Pipelined）ADC和-A型A/D转换器。
标签： adc
上传时间： 2022-06-23
上传用户：xsr1983
