资源列表
LaserCommunicationSimulationSystem
- 建立GEO和LEO的轨道，并计算他们间方位角和俯仰角速度及加速度，多普勒频移等重要参数。-established GEO and LEO orbits, and calculate their azimuth and pitch between angular velocity and acceleration, Doppler frequency shift and other important parameters.
jpegcompress_decompress
- 自己做的简单的jpeg编码程序，支持1：1：1采样的baseline彩色jpeg，输入只能是24bit的BMP文件-doing a simple jpeg coding procedures, and supports 1:1 : a sampling of the baseline color jpeg, import 24bit is the only BMP file
jaguar2s
- 8-1024可变点数FFT/IFFT变换,VHDL语言设计, 仿真通过,可以很容易综合.-8-1024 points FFT / IFFT transform, VHDL design, simulation, can easily integrated.
dct_p
- 这是用VHDL语言(硬件描述语言)写的一个二维 8*8块的离散余弦变换(DCT)以及反变换(IDCT).全同步设计,低门数.可以用于多媒体及打印应用领域.-VHDL (hardware descr iption language) wrote a two-dimensional 8 * 8 discrete cosine transform (D CT) and the anti-transform (IDCT). fully synchronous design, low gate cou
Sigtest
- 此为使用VEE Pro开发的信号完整性分析软件，对高速串行信号分析有参考价值-here for the use of VEE Pro development of the signal integrity analysis software for high-speed serial signal analysis reference value
RadarAnalysisSoftware
- 此为使用VEE Pro开发的雷达信号分析软件，对仪器和雷达系统分析有参考价值-here for the use of VEE Pro development of the radar signal analysis software, the right equipment and radar analysis reference value
fencen
- 用分层实现遗传算法，高、低两个层次并行运行，自主选择种群规模、变异率及两层的交叉率，结果以文本方式输出。-layered with Genetic algorithms, low - and high-level parallel operations, choosing their own population size, mutation rate and the two-tier cross-rates, the results in text mode output.
duodianjiaocha
- 用多点交叉实现遗传算法，能够自主选择种群大小、变异率、交叉率以及染色体编码的输出，结果输出为文本。-with more cross-Genetic algorithm, can choose the size of population, the mutation rate, chromosome cross-rate encoding and output, the output text.
NRU
- 最近未使用页淘汰（NRU）算法或者时钟算法是实际使用的诸多页淘汰算法中的一种。本课程设计是使用C程序设计语言，在windows平台下对页淘汰（NRU）算法模拟，通过页淘汰（NRU）算法的模拟来进一步的加深对使用NRU算法的了解，及对C程序设计语言的使用。 关键词：页淘汰 NRU 时钟算法 -unused pages recently eliminated (NRU) algorithm or clock algorithm is practical use out of the many
fjdjf
- 用分支界限法解决的几个问题:包括0-1背包问题,最大团问题,电路布线问题,最大装载问题.作业最优处理问韪.-branch line with the law to solve several problems : including 0-1 knapsack problem, the largest group, circuit wiring problem, the greatest problem loading. Optimal handling operations Q premises
ShortPth
- 图论：最短路径算法实现 Graph.gph GraphBFS.h GraphM.h GraphOpr.h Queue.h sample.gph ShortPth.cpp ShortPth.dsp ShortPth.dsw ShortPth.ncb ShortPth.opt ShortPth.plg-graph theory : the shortest path algorithm Graph.gph GraphBFS.h GraphM.h Gra
mColor
- 图论：图的M着色问题 GraphM.h GraphOpr.h mColor.cpp mColor.dsp mColor.dsw mColor.h mColor.ncb mColor.opt mColor.plg test test.gph-graph theory : Figure M Coloring GraphM.h GraphOpr.h mColor.cpp mColo r.dsp mColor.dsw mColor.h mColor.ncb m