-
计算作图的源程序
计算作图的源程序-calculated mapping of the source
- 2022-06-11 22:14:30下载
- 积分：1
-
傅里叶变换是信号处理中最常用的算法，实现…
傅立叶变换是信号处理时最常用的算法之一，实现时域与频域之间的转换，对人们研究各种信号非常有用，本程序利用VC实现快速傅立叶变换算法-Fourier transform signal processing is the most commonly used algorithm, achieving time-domain and frequency domain between the conversion of the people look very useful signal, the procedure used VC Fast Fourier Transform algorithm
- 2023-07-10 08:25:03下载
- 积分：1
-
C实现RS编码
用C实现RS码纠错仿真
RS码的编码程序 编码效率高，且经实际验证符合RS纠错码的要求-RS code using C realize simulation RS
error correction code encoding procedure coding efficient and practical
to verify compliance with the requirements of RS error-correcting codes
- 2023-05-05 14:10:03下载
- 积分：1
-
OFDM源代码仿真
有关OFDM的源代码，非常非常有用
- 2022-05-08 13:57:33下载
- 积分：1
-
本程序采用循环单链表的算法来解决约瑟夫环问题：建立一个循环单链表，按顺序查找指定结点，找到后删除，最后打印删除的编号序列。
本程序采用循环单链表的算法来解决约瑟夫环问题：建立一个循环单链表，按顺序查找指定结点，找到后删除，最后打印删除的编号序列。- This procedure uses circulates Shan Lianbiao algorithm to solve
the Joseph link problem: Establishes to circulate Shan Lianbiao,
assigns the point according to the smooth search, after found deletes,
finally prints the serial number sequence which deletes.
- 2022-05-30 07:29:42下载
- 积分：1
-
霍夫曼编解码算法
霍夫曼编解码算法-Huffman decoding algorithms
- 2022-03-19 14:59:31下载
- 积分：1
-
非线性放大器对发射信号的影响，与调制方式密切相关。不同的调制方式，所得到的时域波形是不同的，如用于欧洲移动通信的GSM制式，该制式采用了高斯滤波的最小偏移键控（...
非线性放大器对发射信号的影响，与调制方式密切相关。不同的调制方式，所得到的时域波形是不同的，如用于欧洲移动通信的GSM制式，该制式采用了高斯滤波的最小偏移键控（GMSK），是一种相位平滑变化的恒定包络的调制方式，因此可以用非线性放大器来放大，不存在包络失真问题，也不会因为频谱再生而干扰邻近信道。
-Non-linear amplifier on the transmit signal of the impact is closely related with the modulation method. Different modulation methods, the resulting time-domain waveforms are different, such as for the European GSM mobile communications standard, the standard use of Gaussian minimum shift keying filter (GMSK), is a smooth change in the phase constant envelope modulation, so you can use non-linear amplifier to amplify, there is no envelope distortion, nor because of spectral regrowth and adjacent-channel interference.
- 2022-01-31 04:18:00下载
- 积分：1
-
A program to demonstrate the optimization process of ant colony optimization for...
A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.
- 2022-02-19 22:51:42下载
- 积分：1
-
youhuasuanfa
这时一道关于优化算法的题目，本人费劲周折终成大果！拿来分享！-youhuasuanfa
- 2022-01-28 09:43:03下载
- 积分：1
-
用双点弦截法计算f(x)=0
用双点弦截法计算f(x)=0-Two-point cut-off method string f (x) = 0
- 2022-03-26 14:23:10下载
- 积分：1
|
联系客服（QQ：3324461878）
