power_switching_power_supply_lib

Solving ODEs with Matlab: Instructor’s Manual L.F. Shampine and I. Gladwell Mathematics Department Southern Methodist University Dallas, TX 75275 S. Thompson Department of Mathematics & Statistics Radford University Radford, VA 24142

介绍MATLAB编程并且还有实例，供大家参考(Introduced and there are examples of MATLAB Programming)

说明：  BAM是一种两层的异联想，内容可寻址存储器组成的反馈网络。 分类：离散，连续 和自适应BAM等。 1987年和1988年由Kosko提出的BAM型。 网络运行是双向的。对网络的一端输入信号，则可在另一端得到输出，该输出又反馈回来，经过多次反复，直到网络达到稳态为止(BAM is a two-tier Heteroassociation, content addressable memory component of the feedback network. Classification : discrete, continuous and adaptive BAM other. In 1987 and 1988 by the BAM Kosko type. The operation of the network is a two-way. The network side input signal can be received at the other end output, the output feedback to come back again, repeatedly, until the network reached so far Steady)

FDTD的单向波传播,充分说明了FDTD的编程原理(FDTD one-way wave propagation, fully illustrated the principles of programming FDTD)

Fm modulation using the matlab code. find the modulated singnal and its frequency spectrum

已知语音文件求出其LPC系数后，调用a_lsf_conversion.m函数求其对应的LSF(Known find their voice files LPC coefficients, call a_lsf_conversion.m corresponding LSF function evaluation)

PROJECT REPORT on FUZZY based TEMPERATURE CONTROLLER

解决无优化问题的很有效的matlab程序，包括运行结果，希望可以多交流学习(Solve optimization problems without matlab very effective procedures, including operating results, hoping to learn more exchanges)

迭代法是解线性代数方程组的另一类方法，特别适用于解大型稀疏线性方程组。它的基本思想是针对求解问题预先设计好某种迭代格式，从而产生求解问题的近似解迭代序列，在迭代序列收敛于精确解的情况下，按精度要求取某个迭代值作为问题解的近似值。迭代法具有原始系数举证始终不变，算法简单，编写程序较方便，所需存储单元较少的优点。(iterative method was the linear algebraic equations of the other methods, particularly applicable to the large sparse linear equations. The basic idea is to solve the problem in advance against the design iteration some good format, thereby creating problems for the approximate solution of iterative sequence, the iterative sequence converges to the exact solution, precision demanded by a certain value as a question iterative solution approximation. Iteration with the original proof coefficient remains unchanged, the algorithm is simple, the preparation process more convenient, less required storage unit advantages.)

BER with binary convolution code