搜索资源列表
exm07052_1
- 本例演示：1、画两个同心圆，其中一个半径由独立输入宗量定义，另一个由变长度输入宗量的第一个元素定义，可以用任何指定的色彩线形绘制；2、变长度输入输出宗量在程序中的构成和使用；3、变长度输入输出宗量的对外使用表现-the cases demonstrated : a painting of two concentric circles, with a radius of independent input variables defined Another variable length from
231226
- 空间后方交汇求解相机外方位元素，变量如下 ％ x，y 控制点像点坐标 ％ X，Y，Z 控制点空间坐标 ％f焦距 ％X0，Y0，Z0，a，b，c六个外方位元素 ％x0，y0，-f内方位元素：光心坐标 ％cha，chb，chc：外方位角元素改正数 ％count 记录迭代次数 ％R 旋转矩阵 ％A 线性化的偏导系数矩阵 ％L 常数项矩阵 ％M0 外方位元素矩阵 ％M1 外方位元素改正数矩阵-meeting space for rear camera po
MATLAB
- 产生长度为1000的标准正太分布的随机信号，画出时域波形及频谱； 采用u=255的非均匀PCM编码，每符号为8bit，画输入-输出关系图； 计算信号量化噪声比（SQNR）； 信道误码率为10-3； 解码，并画出u律反变换后的信号时域波形及频谱。 扩展要求： 采用均匀PCM、量化级数可变、信道误码率可变。 - have a standard len
blind4qamvs
- 这是一个恒模算法和变长恒模算法收敛性比较的程序.-This is a constant modulus algorithm and variable-length constant modulus algorithm to compare the convergence process.
filter1
- 高通滤波器，带通滤波器，数字FIR滤波器-The Shannon entropy is a measure of the average information content one is missing when one does not know the value of the random variable. The concept was introduced by Claude E. Shannon in his 1948 paper "A Mathematical Theory
zuiduanlujing
- 求解带可变权值的最短路径问题，如铁路、公路不同的路段组合运输费问题。注：公路的运输费用与路长成正比，铁路的运输费与路段的累积有关-Solving the shortest path variable weight problems, such as railway, road sections of different combination of transportation charges. Note: The cost of road transport and road length i
simple-kalmanf
- 卡夫曼编码，用于图像图形处理，是可变字长编码(VLC)的一种-Kafu Man coding for image and graphics processing, a variable word length coding (VLC) of a
fir_lin_phase_lowpass_min_order
- Designs a linear phase FIR lowpass filter such that it: - minimizes the filter order - has a constraint on the maximum passband ripple - has a constraint on the maximum stopband attenuation -This is a quasiconvex problem and can be solved
BlowfishEncryption
- Blowfish Algorithm is a Feistel Network, iterating a simple encryption function 16 times. The block size is 64 bits, and the key can be any length up to 448 bits. Although there is a complex initialization phase required before any encryption can
huffmn
- In computer science and information theory, Huffman coding is an entropy encoding algorithm used for lossless data compression. The term refers to the use of a variable-length code table for encoding a source symbol (such as a character in a file) wh
MPPTresearch
- 介绍最大功率点追踪的变步长的算法和原理。-Describes the maximum power point tracking algorithm and variable step length principle.
adaptse1
- 利用MATLAB实现变长自适应滤波，实现语音增强的功能-MATLAB realize the use of variable length adaptive filtering, realize the function of speech enhancement
boxsurface
- 将整个空间进行划分，变成无数的小空间，其中小空间的长度可变。-The entire space is divided into numerous small space, wherein the variable length of the small space.
huffman
- 哈夫曼编码(Huffman Coding)是一种编码方式，哈夫曼编码是可变字长编码(VLC)的一种。Huffman于1952年提出一种编码方法，该方法完全依据字符出现概率来构造异字头的平均长度最短的码字，有时称之为最佳编码，一般就叫作Huffman编码（有时也称为霍夫曼编码）。-Huffman coding (Huffman Coding) is an encoding, Huffman coding is a variable length coding (VLC) one. A Huffma
huffman
- HUFFMAN Builds a variable-length Huffman code for a symbol source. CODE = HUFFMAN(P) returns a Huffman code as binary strings in cell array CODE for input symbol probability vector P. Each word in CODE corresponds to a symbol whose probabili
Huffman
- 基于MATLAB的例程 实现HUFFMAN编码算法 不定长编码 基于不同符号的概率分布-Variable-length coding based on the probability distribution of different symbols based on MATLAB routines to achieve HUFFMAN coding algorithm
变步长扰动观察法
- 利用S函数实现的变步长电导增量法，需要和模型结合(The variable step length conductance increment method realized by S function needs to be combined with the model)
huffman_encode
- huffan编码是一种无前缀变长码。对于给定熵的信源，huffan编码能得到最小平均码长。(Huffan coding is a variable length code without prefix. For the source of the given entropy, the huffan code can get the minimum average code length.)
Crypt-Loki97-master
- Loki97 is 128-bit block cipher that accepts a variable-length key. It was designed by Lawrie Brown, Josef Pieprzyk, and Jennifer Seberry. Loki97 was one of the 15 candidates for the AES. BONUS The C file, _loki97.c, is a standalone Loki97 i
mcrypt-2.6.8
- Loki97 is 128-bit block cipher that accepts a variable-length key. It was designed by Lawrie Brown, Josef Pieprzyk, and Jennifer Seberry. Loki97 was one of the 15 candidates for the AES.