rfid

以“一主三从”主从多机通信系统为物理模型，研究应用马尔可夫链建立仿真算法及蒙特卡洛法建立了数学模型，通过将完整的系统元件化，并对每个元件创立各自的状态转移机模型，仿真运行状态，实现了对于这一通信系统的可靠性建模评估。(" One the main three from the" master-slave multi-communication system for the physical model to study the application of Markov chain Monte Carlo simulation algorithm and the mathematical model established through the will of a complete system components, and the creation of each component their respective state transition model, the simulation run, and the realization of a communication system for the assessment of the reliability of modeling.)

matlab编程基础 实例介绍解析 附有源码(matlab Programming examples with source code analysis)

Turbo码的编、译码算法对误码率的影响(Effect of Encoding and Decoding Algorithm of Turbo codes bit error rate)

说明：  matlab汉明码编译码以及误码率汉明码编译码以及误码率(Matlab Hamming code encoding and decoding and error rate)

许多工程软件需要用到复杂的数学算法。VC++能够形成各种用户界面， 并可以直接与系统及底层硬件交换数据。因此研究VC++和Matlab 的混合编程具有很大的实际意义。该文讨论了如何使用Matlab 的Complier 将*.m函数编译为动态链接库DLL， 提供给VC++调用的方法， 提供了一种VC++与Matlab 混合编程的快速实现。(Many engineering software need to use complex mathematical algorithms. VC++ can form a variety of user interface, and can directly exchange data systems and the underlying hardware. Therefore, VC++ and Matlab of mixed programming of great practical significance. The article discusses how to use Matlab' s Complier to*. m functions compiled as dynamic link library DLL, VC++ provided to the invoked method, provides a mixed VC++ and Matlab programming fast implementation.)

It consider spectrum estimation, using Marple s test case

简单的matlab教程，教会初学者matlab的基本应用，初步掌握matlab(Simple matlab tutorial)

gauss elimination method

本文件包含两个程序，实现一维和二维分形地面的模拟(This document contains two procedures to achieve a one-dimensional and two-dimensional simulation of the ground, Fractal)

LTSA[19] is based on the intuition that when a manifold is correctly unfolded, all of the tangent hyperplanes to the manifold will become aligned. It begins by computing the k-nearest neighbors of every point. It computes the tangent space at every point by computing the d-first principal components in each local neighborhood. It then optimizes to find an embedding that aligns the tangent spaces.