Location:
Search - 9-2 encode
Search list
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.
Platform: |
Size: 17786 |
Author: 游弋人生 |
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: 1 - base64 decode
2 - url encode
3 - url decode
4 - md5 hash
5 - random str
6 - sha1 hash
7 - DES hash
8 - CRC32
9 - rot13 encode
10 - ASCII -> bin
11 - ASCII -> dec
12 - ASCII -> hex
13 - ASCII -> char()
14 - ASCII -> chr()..
15 - ASCII -> String.fromCharCode()
16 - bin -> ASCII
17 - dec -> ASCII
18 - hex -> ASCII
19 - char() -> ASCII
20 - chr() -> ASCII
21 - String.fromCharCode() -> ASCII
22 - bin -> dec
23 - bin -> hex
24 - dec -> bin
25 - dec -> hex
26 - hex -> bin
27 - hex -> dec
28 - cp1251(&cp1259) -> utf8
29 - /etc/passwd -> login login
30 - PHP crupt
31 - URL -> IFrame
32 - String lower
33 - String UPPER
34 - ASCII -> 0xHEX
35 - Simple html encrypt
36 - htmlspecialchars
37 - Full urlencode
38 - base64 decode && gzinflate
39 - gzdeflate && base64 encode-1- base64 decode
2- url encode
3- url decode
4- md5 hash
5- random str
6- sha1 hash
7- DES hash
8- CRC32
9- rot13 encode
10- ASCII-> bin
11- ASCII-> dec
12- ASCII-> hex
13- ASCII-> char()
14- ASCII-> chr()..
15- ASCII-> String.fromCharCode()
16- bin-> ASCII
17- dec-> ASCII
18- hex-> ASCII
19- char()-> ASCII
20- chr()-> ASCII
21- String.fromCharCode()-> ASCII
22- bin-> dec
23- bin-> hex
24- dec-> bin
25- dec-> hex
26- hex-> bin
27- hex-> dec
28- cp1251(&cp1259)-> utf8
29- /etc/passwd-> login login
30- PHP crupt
31- URL-> IFrame
32- String lower
33- String UPPER
34- ASCII-> 0xHEX
35- Simple html encrypt
36- htmlspecialchars
37- Full urlencode
38- base64 decode && gzinflate
39- gzdeflate && base64 encode
Platform: |
Size: 4096 |
Author: Ihar |
Hits:
Description: 用单片机对A-Z和0-9等字符进行编码，并传输给另一单片机译码-With the microcontroller on the characters such as AZ and 0-9 encode and decode transmitted to another MCU
Platform: |
Size: 2048 |
Author: 叶桂文 |
Hits:
Description: 1
声音选择
你可以选择TTS系统中不同的声音朗读
2
音量调节
你可以调整朗读音量
3
语速调节
你可以调节朗读语速
4
mp3或ogg
mp3是比较通用的格式，ogg则有更好的音质。依个人喜好选择
5
音质选择
你可以选择不同的录音音质。音质越高，文件越大。
Mp3：可以在0（最高音质）与9（最小文件）之间选择
Odd：可以在-2(最小文件）与10（最高音质）之间选择
6
压制后立刻朗读
*仅在以mp3格式录音时有效
7
界面语言自动选择
界面语言根据Windows语言设置自动选择英文或简体中文-1
Voice Choice
You can choose different voices in the system to read
2
Volume Adjustment
You can turn the volume up or down before read
3
Speed Adjustment
You can adjust the read speed before read
4
Alternative mp3 or ogg
You can choose mp3 or ogg format as your favourite
5
Speech Quality
You can specify the audio quality.
The higher quality you record in, the larger the file is.
For mp3, between 0 (high) and 9 (low)
For ogg, between –2 (low) and 10 (high)
6
Instantly read after encode
You can enable instant reading after encoding.
* Only available in mp3 format
7
Automatic language interface complies with Windows setting
The software choose English or Simplified Chinese interface automatically according to your Windows language Setting.
Platform: |
Size: 1402880 |
Author: 晓晨 |
Hits:
Description: iec61850-9-2报文组织程序，LINUX编译环境-iec61850-9-2 packets organizational procedures, LINUX build environment
Platform: |
Size: 15360 |
Author: 曹姓名 |
Hits:
Description: ffmpeg_rmvb
解决ffmpeg不能编码rmvb的问题
内有示例
能用于asp,net,php在线编码视频flv,mp4
支持wmv,mov,3gp,mp4,rm,rmvb,mpg,mp3等多各种频频格式-ffmpeg can not encode rmvb ffmpeg_rmvb solve the problem within the sample can be used in asp, net, php-line encoded video flv, mp4 support wmv, mov, 3gp, mp4, rm, rmvb, mpg, mp3 and other formats of various frequently
Platform: |
Size: 3936256 |
Author: kkjjkkjj |
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: Wav格式转成Wmv格式； Windows Media Encode 9使用-Wav format convert Wmv format Windows Media Encode 9 use
Platform: |
Size: 111616 |
Author: sds |
Hits:
Description: design a smallest sufficient set encoder and decoder to encode and decode a string of 2^16 flips of a bent coin with probabilities(p0=0.9,p1=0.1)
Platform: |
Size: 3072 |
Author: |
Hits:
Description: The JPEG compression scheme is divided into the following stages:
1. Transform the image into an optimal color space.
2. Adjust Aspect Ratio 16:9
3. Digitization Scheme 4:2:0.
4. Apply a Discrete Cosine Transform (DCT) to blocks of pixels, thus removing redundant image data.
5. Quantize each block of DCT coefficients using weighting functions optimized for the human eye.
6. Encode the resulting coefficients (image data) using a Huffman variable word-length algorithm to remove redundancies in the coefficients.
7. Byte Stuffing.
8. Header JFIF
9. JPG Data Store
Platform: |
Size: 792576 |
Author: ouchi |
Hits:
Description: Encode and decode Adobe AMF3 protocol data for Cocos2dx
Platform: |
Size: 39936 |
Author: mingzi |
Hits:
Description: 请注意以下说明: 1、本程序允许任何人免费使用。 2、本程序采用PHP+MYSQL架构编写。并且经过ZEND加密，所以运行环境需要有ZEND引擎支持。 3、需要售后服务的，请与本作者联系，联系方式见下方。-Please note the following: 1. This program allows anyone to use for free. 2, the program uses PHP+ MYSQL schema compilation. And after ZEND encryption, so the operating environment requires ZEND engine support. 3, need service, please contact the author, contact information, see below.
Platform: |
Size: 397312 |
Author: oyx |
Hits:
Description: 本程序是在Microsoft Visual C++ 2010版本上编写的，用C语言编写，通过算术算法的编码思想，实现将输入的源代码通过算术编码转化为二进制编码，并输出
（1）本程序仅限于输入的源代码为0-9这十个数字构成的，可以是这十个符号中的任意个符号构成，
（2）程序运行时需要输入要编码的原代码，源代码的个数不能超过十个
（3）输入完毕后即可显示经过编码后的二进制数-This procedure is written in Microsoft Visual C++ 2010 version, written in C language, through the arithmetic coding idea of the algorithm and realization of the input source by arithmetic coding is converted into binary encoding, and output
(1) this program is limited to the input source code 0-9, the ten Numbers can be any symbol in the ten symbols,
(2) the program is running need to input to encode the original code, source code, the number of no more than ten
(3) after the input can be displayed after encoding binary number
Platform: |
Size: 209920 |
Author: disusu |
Hits:
Description: 1) I：初始化（Initialization）。从终端读入字符集大小n，以及n个字符和n个权值，建立哈夫曼树，并将它存于文件hfmTree中。
2) E：编码（Encoding）。利用已建好的哈夫曼树（如不在内存，则从文件hfmTree中读入），对文件ToBeTran中的正文进行编码，然后将结果存入文件CodeFile中。
3) D：译码（Decoding）。利用已建好的哈夫曼树将文件CodeFile中的代码进行译码，结果存入文件TextFile中。(1) I: initialization (Initialization). From the terminal read into the character set size, N, and n characters and N weights, the establishment of Huffman tree, and save it in the file hfmTree.
2) E: coding (Encoding). Using the built Huffman tree (if not in memory, then read it from the file hfmTree), encode the text in the file ToBeTran, and then put the results in the file CodeFile.
3) D: decoding (Decoding). Huffman tree has been built using the file CodeFile code for decoding, the results stored in the file TextFile.)
Platform: |
Size: 586752 |
Author: 星恋*情殇
|
Hits: