Description: A good ebook for those who want to be an archtecher, it will help you how to manager a more efficient coding. Platform: |
Size: 191023 |
Author:king |
Hits:
Description: 这是一个对bmp格式文件图象读取的源程序,可以用它高效实现编码,注释详细，可读性好.-this is a bmp format of the source image reader, can be used to achieve efficient coding Notes detailed and readable. Platform: |
Size: 4658 |
Author:黄宾 |
Hits:
Description: 这是一个对bmp格式文件图象读取的源程序,可以用它高效实现编码,注释详细，可读性好.-this is a bmp format of the source image reader, can be used to achieve efficient coding Notes detailed and readable. Platform: |
Size: 4096 |
Author:黄宾 |
Hits:
Description: MPEG MDCT的一些文章
A design on the vector-processor of MDCT-IMDCT algorithm for digital audio；A fast algorithm of integer MDCT for lossless audio coding-MPEG MDCT articles A design on the vector-processor of MDCT-IMDCT algorithm for digital audio A fast algorithm of integer MDCT for lossless audio coding Platform: |
Size: 5156864 |
Author:dingying |
Hits:
Description: A good ebook for those who want to be an archtecher, it will help you how to manager a more efficient coding. Platform: |
Size: 190464 |
Author:king |
Hits:
Description: 赫夫曼编码与译码
本程序完全采用链式存储结构，用户在输入字符流后（无字符限制，无长度限制）（以EOF结束，即crtl+z），即可自动统计出现的字符，建立赫夫曼树，输出各字符的赫夫曼编码，翻译用户输入的字符流输出到文件中（output.txt)，最后进行译码，输出字符流。
可供学习《数据结构》（清华大学出版社）(P146赫夫曼编码）、《数据结构课程设计》（机械工业出版社）（P87赫夫曼编码的应用）时参考，本程序不同于书中的顺序存储结构，效率更高-Huffman encoding and decoding of this procedure completely chain storage structure, the user in the input stream of characters (no character limit, no length limit) (to EOF end, that is, crtl+ Z), will automatically appear and Statistics characters the establishment of Huffman tree, output of the Huffman coding of the characters, translate user input character stream output to a file (output.txt), the final decoding, the output character stream. For learning data structure (Tsinghua University Press) (P146 Huffman coding), Data Structure Course Design (Mechanical Industry Press) (P87 Application of Huffman coding) reference, this procedure is different from the book in the order in storage structures, efficient Platform: |
Size: 3072 |
Author:XY Z |
Hits:
Description: 迄今为止见过的最方便的huffman编码，效率很高
一个外国人写的，很具有研究价值
Constructing a Huffman Tree according to the number of times each symbol appears in the data stream:
1) Create an array of N nodes, representing N possible symbols (ranging between 0 and N-1).
2) Set the value of each node to the number of times that its symbol appears in the data stream.
3) Create a Minimum-Heap of N nodes.
4) Add every node whose value is greater than zero to the heap.
5) Extract the best two nodes in the heap.
6) Create a parent node whose children are the two extracted nodes.
7) Add the parent node to the heap.
8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap).
9) Extract the last node in the heap.
The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.
The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.-So far seen the most convenient huffman coding, efficient write a foreigner, I have research value Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes , representing N possible symbols (ranging between 0 and N-1) .2) Set the value of each node to the number of times that its symbol appears in the data stream.3) Create a Minimum-Heap of N nodes.4) Add every node whose value is greater than zero to the heap.5) Extract the best two nodes in the heap.6) Create a parent node whose children are the two extracted nodes.7) Add the parent node to the heap.8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap) .9) Extract the last node in the heap.The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream. Platform: |
Size: 17408 |
Author:游弋人生 |
Hits:
Description: This thesis devoted to several efficient VLSI architecture design issues in errorcorrecting
coding, including finite field arithmetic, (Generalized) Low-Density Parity-
Check (LDPC) codes, and Reed-Solomon codes.-This thesis is devoted to several efficient VLSI architecture design issues in errorcorrecting
coding, including finite field arithmetic, (Generalized) Low-Density Parity-
Check (LDPC) codes, and Reed-Solomon codes. Platform: |
Size: 1072128 |
Author:MicroSam |
Hits:
Description: 流媒体 Scalable Video Coding 可分级视频编码 会议论文 清华大学课程指定阅读文献-An Overview of Scalable Video Streaming.pdf
An Efficient Complexity-Scalable Video Transcoder with Mode Refinement.pdf
Improved Interlayer Prediction for Scalable Video Coding.pdf
……
Platform: |
Size: 5180416 |
Author:张健 |
Hits:
Description: 这是一个霍夫曼编码解码的源程序,可以用它高效实现霍夫曼解码编码,注释详细,可读性好.压缩包止包括源程序文件,再vc中运行.
-This is a source of Hoffman codec, you can use it to achieve efficient coding Huffman decoding, notes in detail, better readability. Compressed packet including the source file only, and then run vc. Platform: |
Size: 25600 |
Author:yxj |
Hits:
Description: 现代通信系统书籍仿真程序，不错的程序
供初学习者使用-The Slepian-Wolf (SW) cooperation proposed in [1] is probably the first practical cooperative
scheme that implements the idea of compress-and-forward. Through the exploitation of efficient
distributed source coding (DSC) technology, the authors of [1] demonstrate the effectiveness of
Slepian-Wolf cooperation in combating inter-user channel outage in wireless environment. In this
paper, we discuss the general framework of Slepian-Wolf cooperation using the two most popular
DSC technologies: the binning/syndrome approach and the parity approach. We show that the
latter is particularly useful in SW cooperation, since it is conceptually simpler, provides certain
performance advantages, and enables any (system) linear channel code to be readily exploited.
Examples using convolutional codes, low-density generator-matrix codes and low-density paritycheck
codes are demonstrated and practical algorithms for estimating the source-relay correlation
and for decoding the compound packets Platform: |
Size: 9216 |
Author:史志举 |
Hits:
Description: 现代通信系统书籍底八章仿真程序，很好的程序，初学习这很好的教材-The Slepian-Wolf (SW) cooperation proposed in [1] is probably the first practical cooperative
scheme that implements the idea of compress-and-forward. Through the exploitation of efficient
distributed source coding (DSC) technology, the authors of [1] demonstrate the effectiveness of
Slepian-Wolf cooperation in combating inter-user channel outage in wireless environment. In this
paper, we discuss the general framework of Slepian-Wolf cooperation using the two most popular
DSC technologies: the binning/syndrome approach and the parity approach. We show that the
latter is particularly useful in SW cooperation, since it is conceptually simpler, provides certain
performance advantages, and enables any (system) linear channel code to be readily exploited.
Examples using convolutional codes, low-density generator-matrix codes and low-density paritycheck
codes are demonstrated and practical algorithms for estimating the source-relay correlation
and for decoding the compound packets Platform: |
Size: 9216 |
Author:史志举 |
Hits:
Description: 现代通信原理第九章程序代码，不错的程序，初学习者很好的程序-The Slepian-Wolf (SW) cooperation proposed in [1] is probably the first practical cooperative
scheme that implements the idea of compress-and-forward. Through the exploitation of efficient
distributed source coding (DSC) technology, the authors of [1] demonstrate the effectiveness of
Slepian-Wolf cooperation in combating inter-user channel outage in wireless environment. In this
paper, we discuss the general framework of Slepian-Wolf cooperation using the two most popular
DSC technologies: the binning/syndrome approach and the parity approach. We show that the
latter is particularly useful in SW cooperation, since it is conceptually simpler, provides certain
performance advantages, and enables any (system) linear channel code to be readily exploited.
Examples using convolutional codes, low-density generator-matrix codes and low-density paritycheck
codes are demonstrated and practical algorithms for estimating the source-relay correlation
and for decoding the compound packets Platform: |
Size: 7168 |
Author:史志举 |
Hits:
Description: This a source code for sparse coding algorithm:
Reference:
Efficient sparse coding algorithms
Honglak Lee, Alexis Battle, Raina Rajat and Andrew Y. Ng. In NIPS 19, 2007.
-This is a source code for sparse coding algorithm:
Reference:
Efficient sparse coding algorithms
Honglak Lee, Alexis Battle, Raina Rajat and Andrew Y. Ng. In NIPS 19, 2007.
Platform: |
Size: 39936 |
Author:Richard |
Hits:
Description: 结合自己的工作经历，介绍了文件名、缩进排版、注释、声明、语句、编程惯例、及如何高效的编码等-In conjunction with their work experience, he describes the file name of indentation, comments, statements, statement, programming practices, and how efficient coding Platform: |
Size: 53248 |
Author:王先生 |
Hits:
Search - efficient coding