svpw

薛定宇教授的ctrllab 好东西！直接运行ctrllab 即可 (Mr.Xue s ctrllab!run ctrllab directly !)

With rician channel model, both Line of Sight (LOS) and non Line of Sight(NLOS) components are simulated between transmitter and receiver. MATLAB provides built in function by name ricianchan as explained below along with rician matlab code

explain the coding and decoding of FEC

说明：  Matlab工具箱已经成为一个系列产品，Matlab主工具箱和各种工具箱（toolbox ）。(Matlab toolbox has become a series of products, Matlab toolbox and a variety of main toolbox (toolbox).)

使用ｍａｔｌａｂ计算交易价的ＶＷＡＰ。是程序化交易和算法交易的必备代码。(Matlab calculate the trading price of the VWAP. Program trading and algorithmic trading must code.)

移动机器人自主避障系统的设计方法多种多样，其中基于模糊控制的机器人避障系统主要是利用模糊逻辑控制器对机器人周围环境信息进行分析和判断，并规划出一条到达目标点的无碰撞路径。该方法有着占用资源小，反应迅速，并能应对相对复杂的外部环境。本文主要以基于模糊控制原理对移动机器人避障路径规划所作的相关研究为主要内容。(There are many ways on autonomous mobile robot obstacle avoidance system designing, which based on fuzzy control of robot obstacle avoidance system is to use the fuzzy logic control system to determine the environmental information around the robot, then plan out a route to the target point with collision-free path. This method has a small footprint, responsive and could be able to cope with relatively complex external environment. In this paper, the main content is fuzzy control theory based obstacle avoidance of mobile robot path planning by research.)

说明：  分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题，使用网格的方法有时更为简单。 [1] 通常，把全部可行解空间反复地分割为越来越小的子集，称为分支；并且对每个子集内的解集计算一个目标下界（对于最小值问题），这称为定界。在每次分枝后，凡是界限超出已知可行解集目标值的那些子集不再进一步分枝，这样，许多子集可不予考虑，这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)

C++ IIR filter module hided behind interfaces, coefitients format compatible with matlab SOI matices

用于计算非新发行的美式期权的定价，采用二叉树方法(To calculate the not newly-issued American option price using CRR BTM method)

Sequential Indicator Simulation