搜索资源列表
十字链表数据结构
- 数据结构中关于十字链表的实现，十字链表可以很好的对稀疏矩阵进行效率很高的存储和计算。比如在通信纠错编码的ldpc编译码中就要用到这种数据结构-data structure on the realization of Chain Cross, Cross List can be good for sparse matrix highly efficient storage and computing. For example, in communications-correction coding
numerial
- c语言数值算法，不是我本人设计。但确实很高效，编码习惯也很好-c language numerical algorithm is not my design. It is indeed very efficient, very good coding habits
wbs
- 这里给出的源代码huffman.zip用8种不同的方式实现了Huffman编码算法。这些代码意在演示不同Huffman算法的实现原理，比较算法执行效率的差别，但并没有针对实际应用环境的需求，做更多的空间或效率优化。所有代码以C++语言编写，为了更容易地实现各种数据结构，代码中大量应用了标准C++库和模板技术。——总之，这些代码的作用在于示例和演示；如果大家想把这些代码应用在实际应用中，可能还需要做进一步的调整和优化。-given here, the source code huffman.zip
file_cut
- LZW压缩算法（VC++实现）：比Huffman编码更有效、比算法编码更快捷的压缩算法。-LZW compression algorithm (VC++ to achieve): more than Huffman coding is more effective, more efficient than the algorithm for encoding the compression algorithm.
TestLzw
- LZW压缩算法（VC++实现）：比Huffman编码更有效、比算法编码更快捷的压缩算法。-LZW compression algorithm (VC++ to achieve): more than Huffman coding is more effective, more efficient than the algorithm for encoding the compression algorithm.
PTIDR_FILE_COMPRESSION
- 为减少测试数据存储量,提出一种有效的新型测试数据压缩编码———PTIDR 编码,并构建了基于该编码的 压缩P解压缩方案1 PTIDR 编码能够取得比FDR ,EFDR , Alternating FDR 等编码更高的压缩率,其解码器也较简单、 易实现,且能有效地降低硬件开销1 与Selective Huffman , CDCR 编码相比,PTIDR 编码能够得到较高的压缩率面积 开销比1 特别地,在差分测试集中0 的概率满足p ≥017610 时,PTIDR 编码能取得比FDR 编码
peaktransformcode
- Peak transform. Reference: Peak Transform for Efficient Image Representation and Coding
2009_An_Improved_SPIHT_Algorithm_Based_on_Pixel_Do
- 基于像素域的改進的SPIHT算法:分層樹的集分割算法是一種簡單、有效的嵌入式零樹編碼算法.在算法的基礎上提出了一種基于空域的改進方法.首先將圖像的偶數裂像素減去相鄰兩奇數列的均值,形成分裂圖像.然后將分裂圖像的奇數列提取出來作為主圖像,將偶數列提取出來作為幅圖像.最后將主幅圖像以合適的權值分別進行壓縮-Pixel-based domain improved SPIHT algorithm: the set partitioning in hierarchical tree algorithm i
adaptive_huffman
- 自适应的霍夫曼编码是一种扩展的熵编码方法，取得了更高的编码效果。这是几种自适应霍夫曼编码的实现方法。希望对大家有用。-adaptive huffman coding is an extended coding method ,which can get more efficient compression ratio. this is kinds of adaptive huffman coding methods. i hope it will be useful for people who
Traversalalgo
- Codes". Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code (sometimes called "prefix-free codes") (that is, the bit string representing some particular symbol is never a prefix of th
Huffman_coding_(Java)
- Given an arbitrary set of symbols (the english alphabet is the example that will be used here), Huffman coding is a way of creating the most efficient (smallest) binary code for that set of symbols. It exploits the fact that in most data some symbols
adaptive_arithmetic
- 自适应算术编码，一种有效的算术编码，可以下载试试看-Adaptive arithmetic coding, an efficient arithmetic coding
code
- 编程经验的总结，教导我们如何编写高效无错的优质代码，包括编码习惯以及程序检错等-Programming and experience to teach us how to write high-quality and efficient error-free code, including coding practices, and procedures for error detection, etc.
HARDTPC
- Hard decision TPC coding sceme.
MatlabDemo
- SPIHT matlab code (without Arithmatic coding stage) Descr iption MATLAB implementation of SPIHT (without Arithmatic coding stage) Ref. Amir Said and William A. Pearlman, "A New Fast and Efficient Image Codec Based on Set Part
LPC
- LPC编码用于语音编码，能很好的帮助理解语音编码，具有很好的编码效果-LPC coding using in speeching coding,can research very good efficient,it is so good for studying
Huffman-coding
- 霍夫曼无失真变长编码源代码！强势推荐！超高效率！-Hoffman lossless variable-length encoded source code! A strong recommendation! Ultra-efficient.
fast_sc
- 一个非常有效的稀疏编码的matlab代码，并附有作者的论文，希望可以帮助需要的人。(An efficient sparse coding algorithm and its original paper. We aim to help authors make their ideas spread.)
fast_sc_r2
- efficient sparse coding, fast feature sign search algorithm, convex optimization
feature_sign
- matlab快速稀疏编码 论文来源 Honglak Lee Alexis Battle Rajat Raina Andrew Y. Ng Computer Science Department Stanford University Stanford, CA 94305(Feature sign search Efficient sparse coding algorithms Honglak Lee Alexis Battle Rajat Raina Andrew Y.