CdenoiseGaussian

继 Discrete Cosine Transform: Algorithms, Advantages, Applications (K. R. Rao and P. Yip) 之后的一本关于离散余弦变换(DCT)的快速实现算法的最新专著. 本书第五章“Integer Discrete Cosine/Sine Transforms”关于DCT整数近似实现写的非常详细和精彩, 很方便大家编程实现. 值得一提的是本书的第一作者Vladimir Britanak 一直在从事DCT, 尤其是改进的离散余弦变换(MDCT)的快速算法的研究.(This book, which is written very carefully, is a new monograph of Discrete Cosine Transform (DCT).The fifth chapter about the Integer Discrete Cosine/Sine Transforms is especially wonderful. )

对输入的字符进行哈弗曼编码，生成编码表，计算压缩比等(haffman tree)

哈夫曼编码译码系统，设置发送者和接受者两个功能， 发送者的功能包括： ①输入待传送的字符信息； ②统计字符信息中出现的字符种类数和各字符出现的次数（频率）； ②根据字符的种类数和各自出现的次数建立哈夫曼树； ③利用以上哈夫曼树求出各字符的哈夫曼编码； ④将字符信息转换成对应的编码信息进行传送。 接受者的功能包括： ①接收发送者传送来的编码信息； ②利用上述哈夫曼树对编码信息进行翻译，即将编码信息还原成发送前的字符信息。 (Huffman decoding system, set the sender and the recipient of two functions, the sender' s features include: (1) input to be transmitted character information ② statistical character information, the number of types of characters and characters the number of occurrences (frequency create a Huffman tree) ② According to the number of types of characters and their respective number of occurrences ③ use the Huffman tree to find the characters Huffman coding ④ character information into the corresponding coding information for delivery. The recipient of the features include: (1) to receive the coded information to the sender transmission ② above Huffman tree coded information to be translated, is about to coded information to restore the character information before sending.)

霍夫曼编码，这是信息论方面很重要的一种编码方式，对学习信息论理论的人很重要！(Huffman code)

此EA是本人长期实战总结的一个稳定盈利的利器，现在在期适用交果良好。(This EA is my long-term combat summary of a stable profit tool, now in the application of good fruit.)

压缩感知的所有重构算法，包括OMP,ROMP,SAMP,StoMP等等算法。(All reconstruction algorithms of compressed sensing include OMP, ROMP, SAMP, StoMP and so on.)

哈夫曼文本压缩器，两个功能压缩文本文件和解压二进制文件。 内容为源代码，用编译器把源代码运行一遍，把需要压缩的txt文件放到和源代码同一个目录下，压缩名称输入 **.txt 压缩后的名称一定要写二进制格式的 例如 **.dat 只能解压用这个程序压缩后的文件。。 解压名 写 **.dat 解压后名称 **.txt(Huffman text compression, two text files compression and decompression functions binaries)

 用霍夫曼编码实现的简单的文本压缩解压缩C++源程序

输入两个正整数m和n，求其最大公约数和最小公倍数(Enter two positive integers m and n, can seek the common denominator and least common multiple)

混沌控制、混沌同步仿真程序混沌控制、混沌同步仿真程序(Chaos control, chaos synchronization simulation program)