大学将学习一门课程，一个过程的数值分析将D。

 ；

资源描述在cyclone 4上实现了OFDM算法，载波数64个，信源位1.024Mbit/s的PN9伪随机序列，首先4bit一组通过符号映射模块映射城16qam符号，每64个符号一组作IFFT运算，运算结果串行输出，通过数字上变频输出到DA输出

fpga乘法器使用例程。详细介绍了dsp48A的使用方法。非常不错的代码。

The main topic covered is frequency control in power systems. The needed models are derived and the primary and secondary frequency control are studied. A detailed model of the synchronous machine, based on Park’s transformation, is also included. The excitation and voltage control of synchronous machines are briefly described. An overview of load models are also given

一个矩阵相乘的c语言代码-a matrix multiplication code in C Language

自己编写的，TSP问题的各种近似算法，有最近邻策略，最短链接策略-I have written, TSP approximation algorithm for a variety of issues, there are nearest-neighbor strategy, the shortest link strategy

应用背景主要是对手写字体进行识别，首先训练手写字体库，可在官网下载手写字体库。对样本库中的样本进行训练，进而识别多种手写字体，主要针对0--9这10个数字，可以准确进行识别。关键技术主要采用C和OPENCV混合编程，提取样本HOG特征，运用SVM分类器对样本进行分类识别。获得训练分类器后，可以自己手写一个0--9中的任意字体，放入分类器中进行识别。

Goldbach s conjecture： Goldbach(哥德巴赫)曾经提出了一个这样的猜想： 对于2000 以内的正偶数都能够分解为两个素数之和。 要求： 该题是一个猜想，我们不去证明它，而是通过编程序来验证 该猜想是否正确。 输入： 用户从键盘任意输入一个自然数。 输出： 给出满足猜想的两个自然数。-Goldbach conjecture : Goldbach (Goldbach) had raised such a guess : 2000 within the can is even divided into two prime numbers and. Requirements : The title is a guess, we do not prove it, but through programmed to verify the guess is correct. Input : arbitrary user input from the keyboard to a natural number. Output : meet guess is the natural number two.

一个对点列进行线性拟合的例子-Points out a linear fitting example

用C语言实现的乘法器-C language Multiplier