-
FemLorentzFit
Feeding antennas with proper signals can be difficult. The signal is often described as a voltage, and voltages are not well defined in electromagnetic wave formulations. There are several tricks to model voltage generators in such situations, and one is the magnetic frill. This model shows the basic steps of defining a magnetic frill voltage generator for a dipole antenna, and it also compares the resulting antenna impedance with known results.
- 2009-05-14 22:11:37下载
- 积分：1
-
ICA2
Independent Component Analysis for 2 media files, matlab code
- 2009-06-16 22:36:37下载
- 积分：1
-
work
说明： STATCOM电流补偿，可以实现很多无功补偿的功能(Current compensation)
- 2020-06-05 09:54:25下载
- 积分：1
-
ISP
利用模拟退火法解决ＩＳＰ问题，压缩包有相关说明，验证数据，不再另行说明(ISP using simulated annealing method to solve the problem, compressed with instructions, validate data, no further description)
- 2011-02-13 14:01:14下载
- 积分：1
-
tftb
matlab时频分析工具包，包含短时傅里叶变换，WV，小波等多种工具(Time-Frequency Analysis Toolbox)
- 2013-01-30 11:24:34下载
- 积分：1
-
reshu
This is a code for periodic impusive noise in ofdm based power line communications. It is implemented in matlab.
- 2014-02-03 13:25:10下载
- 积分：1
-
fadingmsk
通信原理实验matlab仿真中衰落环境下的最小频移键控(Matlab simulation of communication theory experiment fading environment Minimum Shift Keying)
- 2010-12-08 18:12:09下载
- 积分：1
-
cengcifenxifa
层次分析法，对事物尽心主顾复制很好的评价事物的方法(Analytic Hierarchy Process evaluation of the things conscientious patrons copy good things)
- 2013-03-29 16:21:06下载
- 积分：1
-
MATLAB calculate
利用MATALB进行制冷循环的热力学计算。(Thermodynamic calculation of refrigeration cycle.)
- 2018-08-17 11:38:32下载
- 积分：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
