-
rstinvariant
rst invariant shape registartion
- 2010-07-01 14:21:37下载
- 积分：1
-
单神经元PID对非线性系统的matlab仿真
毕业论文程序，是单神经元PID对非线性系统的matlab仿真。(keyword:Single neuron、MATLAB、e second order system 、PID)
- 2015-01-21 13:56:52下载
- 积分：1
-
askd
基于matlab的ask调制模块，只需要调用，是具体调制过程，可以自己定义键控的进制(Ask modulation based on the matlab module, only need to call the process of modulation is specific to their own definition of the M-ary keying)
- 2009-05-02 16:55:27下载
- 积分：1
-
idbm
Description
Applies ideal binary mask to noise corrupted speech signal. The processing takes place within an FFT based short-time spectral analysis-modification-synthesis framework. The ideal binary mask is computed from an oracle (true) signal-to-noise ratio (SNR) through thresholding with local SNR criterion. The routine returns synthesized enhanced speech, the ideal binary mask and the true instantaneous spectral SNR.
- 2011-10-12 05:41:18下载
- 积分：1
-
optimised-forwarding-of-wsn-using-fuzzy-interface
optimised forwarding of wsn using fuzzy interface systms
- 2012-02-11 11:52:06下载
- 积分：1
-
r-25
IEEE research paper for m.tech students
- 2013-03-03 12:37:08下载
- 积分：1
-
dijkstra
this program shortpathes node using graph for decide short distance in networking
- 2009-12-16 09:09:42下载
- 积分：1
-
interpcontourlet(1)
MATLAB CODE FOR INTERPOLATION
- 2013-09-13 19:01:59下载
- 积分：1
-
Bakalarka-materialy
All about the digital modulations ASK, FSK, QPSK
- 2014-10-25 10:06:27下载
- 积分：1
-
huffman_coding
) Compression using huffman code
-with a number of bits k per code word
-provide huffman table
Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
() Compression using huffman code
-with a number of bits k per code word
-provide huffman table
Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
)
- 2009-04-04 22:16:39下载
- 积分：1
|
联系客服（QQ：3324461878）
