[编程文档] BFSKcoherentFromInternet

说明：BFSK 相关解调，与非相关解调不同！性能要好3dB-BFSK demodulator related, non-related demodulation different!
<巴山竹> 在 2025-06-03 上传 | 大小：1kb | 下载：0

[编程文档] Chinese-versionPOP3-protocol

说明：它是一个POP3的RFC文档，详细地阐述了pop3协议中命令请求与响应的交互过程-It is a POP3 RFC document, described in detail in the POP3 protocol command request and response interaction process
<ctx> 在 2025-06-03 上传 | 大小：5kb | 下载：0

[编程文档] HM9270

说明：HM9270双音多频接收解码器详细资料,适用于电话语音解码应用.-HM9270 dual-tone multi-frequency receiver decoder details, applies to telephone speech decoding applications.
<李浩苒> 在 2025-06-03 上传 | 大小：125kb | 下载：0

[编程文档] Doc1

说明：通信系统的物理层仿真之不同信道下的BPSK仿真-BPSK simulation under simulation of the physical layer of the communication system different channel
<崔新洲> 在 2025-06-03 上传 | 大小：716kb | 下载：0

[编程文档] NS2-Installation-under-Ubuntu

说明：详细介绍在Ubuntu下安装NS2.33的过程，在前人总结的经验基础上，加入自己安装过程时的问题和解决办法。-The detailed introduction installed in Ubuntu NS2.33 process in the previous lessons learned based on the problems and solutions when their own installation process.
<zl> 在 2025-06-03 上传 | 大小：1.11mb | 下载：0

[编程文档] vcPP

说明：这是一个VC++的教学PPT，有需要的可以看看，内容涉及前面的一大部分-This is a VC++ teaching PPT, need to look at, covers a large part of the previous
<王卫平> 在 2025-06-03 上传 | 大小：1.51mb | 下载：0

[编程文档] Ad-Hoc-Network-Routing-Protocol

说明：基于多跳分簇的Ad Hoc网络路由协议研究-Ad Hoc Network Routing Protocol-based multi-hop clustering
<李荣伟> 在 2025-06-03 上传 | 大小：1.07mb | 下载：0

[编程文档] php5

说明：php手册，方便开发时查看忘记活不熟的php功能。-php manual, facilitate the development of view forget to live undercooked php function.
<赵明> 在 2025-06-03 上传 | 大小：5.54mb | 下载：0

[编程文档] GPS

说明：GPS定位测试，模拟多颗星数测试。欢迎下载。-GPS positioning test analog multi-Stars number test. Welcome to download.
<lyman> 在 2025-06-03 上传 | 大小：835kb | 下载：0

[编程文档] steiner-tree

说明：information abt other type of stener trees-information abt other type of stener trees
<aa> 在 2025-06-03 上传 | 大小：10kb | 下载：0

[编程文档] 2-3-tree

说明：n computer science, a 2-3 tree is a type of data structure, a tree where every node with children (internal node) has either two children (2-node) and one data element or three children (3-nodes) and two data elements. Nodes on the outside of the tree (leaf nodes) have no children and one or two data elements-n computer science, a 2-3 tree is a type of data structure, a tree where every node with children (internal node) has either two children (2-node) and one data element or three children (3-nodes) and two data elements. Nodes on the outside of the tree (leaf nodes) have no children and one or two data elements
<aa> 在 2025-06-03 上传 | 大小：15kb | 下载：0

[编程文档] red

说明：n computer science, an AVL tree is a self-balancing binary search tree, and it was the first such data structure to be invented.[1] In an AVL tree, the heights of the two child subtrees of any node differ by at most one if at any time they differ by more than one, rebalancing is done to restore this property-n computer science, an AVL tree is a self-balancing binary search tree, and it was the first such data structure to be invented.[1] In an AVL tree, the heights of the two child subtrees of any node differ by at most one if at any time they differ by more than one, rebalancing is done to restore this property
<aa> 在 2025-06-03 上传 | 大小：27kb | 下载：0