[matlab例程] morlet

说明：morlet小波分析函数,用于MORLET小波分析的具体程序，不是自带的工具箱-function of morlet wavelet analysis
<火夫> 在 2025-06-07 上传 | 大小：1kb | 下载：0

[matlab例程] Freq_Test_Diff_M

说明：连续相位调制在不同进制下的频谱对比，以及与QPSK信号频谱的对比-PSD of CPM in different modulation aryM
<鼓鼓> 在 2025-06-07 上传 | 大小：1kb | 下载：1

[matlab例程] Soma

说明：This code solves a function using for and sum in the language MATLAB.
<Warney> 在 2025-06-07 上传 | 大小：1kb | 下载：0

[matlab例程] aa

说明：matlab语言，实现小波变换分解，代码清晰。容易理解。-MATLAB language, wavelet decomposition, clear code. Easy to understand.
<vera> 在 2025-06-07 上传 | 大小：1kb | 下载：0

[matlab例程] BCH-Code

说明：通过MATLAB仿真实现对编译码的纠错控制。-The error correction of encoding and decoding is realized by MATLAB simulation.
<xiaoshizi> 在 2025-06-07 上传 | 大小：1kb | 下载：0

[matlab例程] neural-network-1

说明：通过MATLAB仿真实现对神经网络的建模仿真-Through the MATLAB simulation, the modeling and Simulation of the neural network
<xiaoshizi> 在 2025-06-07 上传 | 大小：1kb | 下载：0

[matlab例程] neural-network-2

说明：通过MATLAB仿真实现对神经网络的建模仿真-60天。-Through the MATLAB simulation, the modeling and Simulation of the neural network-60 days
<xiaoshizi> 在 2025-06-07 上传 | 大小：1kb | 下载：0

[matlab例程] neural-network-3

说明：通过MATLAB仿真实现对风速预测的神经网络建模仿真-Through the MATLAB simulation, the modeling and Simulation of the neural network
<xiaoshizi> 在 2025-06-07 上传 | 大小：1kb | 下载：0

[matlab例程] TDSR-LATEST-CODE

说明：The reliable data delivery is a challenging task in Wireless Sensor Networks (WSNs) due to dynamic and unpredictable changing behaviors of nodes. The traditional cryptographic and authentication based schemes can’t be adopted due to their associated
<Dharmesh> 在 2025-06-07 上传 | 大小：1kb | 下载：0

[matlab例程] TAODV-LATEST-CODE

说明：The reliable data delivery is a challenging task in Wireless Sensor Networks (WSNs) due to dynamic and unpredictable changing behaviors of nodes. The traditional cryptographic and authentication based schemes can’t be adopted due to their associated
<Dharmesh> 在 2025-06-07 上传 | 大小：1kb | 下载：0

[matlab例程] dijkstra_short-path-algo

说明：Dijkstra s algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later.[1][2]
<Dharmesh> 在 2025-06-07 上传 | 大小：1kb | 下载：0

[matlab例程] hopbyhop-shortest-path

说明：Dijkstra thought about the shortest path problem when working at the Mathematical Center in Amsterdam in 1956 as a programmer to demonstrate capabilities of a new computer called ARMAC. His objective was to choose both a problem as well as an answer
<Dharmesh> 在 2025-06-07 上传 | 大小：1kb | 下载：0