Description: ) 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.
Platform: |
Size: 1024 |
Author:ria |
Hits:
Description: 信息论中变长编码的香农编码程序，大家可以互相学习-Variable-length coding in information theory Shannon coding procedures, we can learn from each other Platform: |
Size: 1024 |
Author:傅绍伟 |
Hits:
Description: 高通滤波器，带通滤波器，数字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 of Communication".
Shannon s entropy represents an absolute limit on the best possible lossless compression of any communication, under certain constraints: treating messages to be encoded as a sequence of independent and identically-distributed random variables, Shannon s source coding theorem shows that, in the limit, the average length of the shortest possible representation to encode the messages in a given alphabet is their entropy divided by the logarithm of the number of symbols in the target alphabet.
Platform: |
Size: 1024 |
Author:jeremy |
Hits:
Description: 这是关于LDPC信道编码模块设计的程序
打开源程序，先运行gengrate_h.m程序，陆续将码长设置为756bit，列重设置为3，行重设置为9。在Workspace中同时将H、A、B、C、D、E、Hget、Fget、g、Tget这是个变量选择另存为encode_in.mat 格式。再运行main_encode.m进行编码，主程序运行后，在当前目录下，自动生成编码结果文件“encode—out.mat”，这将作为下一次扩频调制仿真实验的的输入信号。最后分别查看Workspace中的变量s（编码前数据）和xyuan（编码后数据）的波形。
对比后，可以看出编码前的数据码片长度为504bit，编码后的码片数据长度为756bit。编码效率=编码前码片长度/编码后码片长度=2/3。-This is about the LDPC channel coding module design process
Open source, first run gengrate_h.m program, phasing out the code length is set to 756bit, column re-set to 3, line weight is set to 9. In the Workspace in the same time, H, A, B, C, D, E, Hget, Fget, g, Tget This is a variable select Save As encode_in.mat format. Then run main_encode.m encoding, the main program running in the current directory, the results of automatically generated code file "encode-out.mat", which will serve as the next simulation of the spread spectrum modulation input signal. Finally, the variables were View Workspace in s (before encoding data) and xyuan (encoded data) waveform.
After comparison, we can see the data before encoding chip length of 504bit, encoded data length of chip 756bit. Coded before coding efficiency = chip length/length of the encoded chip = 2/3. Platform: |
Size: 15360 |
Author:吴健 |
Hits:
Description: 基于MATLAB的例程 实现HUFFMAN编码算法 不定长编码 基于不同符号的概率分布-Variable-length coding based on the probability distribution of different symbols based on MATLAB routines to achieve HUFFMAN coding algorithm Platform: |
Size: 1024 |
Author:shadow |
Hits:
Description: The aim of this short workshop is to demonstrate the effectiveness of the JPEG encoding/decoding process using test data and test images. As explained in the lectures the major elements of the JPEG encoding process are the DCT, the non-uniform Quantisation matrix and variable run-length encoding.
Building an emulator of the JPEG encoding and decoding algorithm may appear a daunting task, but Matlab is well suited to such coding. Platform: |
Size: 93184 |
Author:jiang nan |
Hits:
Description: 哈夫曼编码，运用matlab实现，原代码非常直观而且易懂。(Huffman Coding, Encoding is a form of variable word length coding.) Platform: |
Size: 4096 |
Author:小宁宁
|
Hits:
Search - variable length coding matlab