-
SPREAD_SPECTRUM_COMMUNICATIONS_HANDBOOK
扩频通信技术教程
这是一本关于CDMA扩频技术的经典书籍,国内曾经出版过英文影印版。
【原书作者】: Marvin K. Simon, Jim K. Omura, Robert A. Scholtz, Barry K. Levitt
【ISBN 】: 0071382151
【页数 】:1248
【出版社】 : McGraw-Hill Professional 1 edition
【出版日期】:September 26, 2001(Spread-spectrum communication technology tutorial This is a classic on the CDMA spread spectrum technology, books, photocopies of the domestic version was published in English. 】 【Original author: Marvin K. Simon, Jim K. Omura, Robert A. Scholtz, Barry K. Levitt】 【ISBN: 0071382151 【Pages】: 1248 【Press】: McGraw-Hill Professional 1 edition 【Publishing Date】: September 26, 2001)
- 2010-06-07 17:45:10下载
- 积分:1
-
geezOCRFinal_D
an optical character recognition using matlab programming language for a single amharic character
- 2012-05-27 03:03:19下载
- 积分:1
-
Counter1s
counter number one to nine after 1s
- 2014-10-22 15:54:51下载
- 积分:1
-
45665991Edgedetectionandcontourtracking(3)
edge detection for an image
- 2009-05-17 18:45:53下载
- 积分:1
-
Matlab_GUI
第七章 GUIDE入门
7.1 概述
7.2 图形句柄入门
7.3 GUIDE工具入门
7.4 创建图形用户界面外观
7.5 图形用户界面编程
7.6 常用的图形界面函数
7.7 本章小结
(Chapter VII GUIDE overview 7.2 Introduction 7.1 Introduction 7.3 GUIDE handle graphics tools to create entry-7.4 Appearance 7.5 graphical user interface graphical user interface programming 7.6 graphical interface function commonly used in this chapter 7.7 Summary)
- 2008-07-27 22:04:28下载
- 积分:1
-
newtonbianchidu
牛顿下山法和变尺度发法,很好的,愿和大家一起努力!(Newton descent method and variable fat law, good, willing to work with everyone!)
- 2010-05-18 12:23:20下载
- 积分:1
-
Root-MUSIC_doa
无噪情况下root_MUSIC算法关于DOA的估计(Noise-free case root_MUSIC on DOA estimation algorithm)
- 2011-09-18 10:39:31下载
- 积分:1
-
Floyd
说明: 求解最短路问题,求解图论中任意两点间最短距离(Solving the Shortest Path Problem)
- 2020-06-17 17:40:02下载
- 积分:1
-
M
说明: 字典树的基本功能是用来查询某个单词(前缀)在所有单词中出现次数的一种数据结构,它的插入和查询复杂度都为O(len),Len为单词(前缀)长度,但是它的空间复杂度却非常高,如果字符集是26个字母,那每个节点的度就有26个,典型的以空间换时间结构。(The basic function of the dictionary tree data structure is used to query a number of times a word (prefix) appears in all the words, which insertion and query complexity are O (len), Len is a word (prefix) length, but its space complexity is very high, if the character set is 26 letters, and that the degree of each node will have 26, the typical structure of space for time.)
- 2013-11-29 14:28:52下载
- 积分:1
-
viterbi
cnv_encd.m 卷积编码程序
viterbi.m 卷积译码程序
其它的是viterbi.m中用到的子函数(cnv_encd.m convolution coding procedures viterbi.m other convolution decoding process is used in viterbi.m Functions)
- 2013-11-29 19:58:05下载
- 积分:1