diff options
| author | rupak | 2020-01-21 19:05:09 +0530 |
|---|---|---|
| committer | rupak | 2020-01-21 19:05:09 +0530 |
| commit | d2f4d30ebcad7430e4f0495cae5c2b3a16be73ce (patch) | |
| tree | 8987d169ad87e930f137122a450c02dc5d13dcc5 /macros/arithenco.sci | |
| parent | 36aca8aaaee5cf8cb5452268fd07c0b558b000a3 (diff) | |
| download | FOSSEE-Communication-Systems-Toolbox-master.tar.gz FOSSEE-Communication-Systems-Toolbox-master.tar.bz2 FOSSEE-Communication-Systems-Toolbox-master.zip | |
Diffstat (limited to 'macros/arithenco.sci')
| -rw-r--r-- | macros/arithenco.sci | 15 |
1 files changed, 6 insertions, 9 deletions
diff --git a/macros/arithenco.sci b/macros/arithenco.sci index b596924..adcd50b 100644 --- a/macros/arithenco.sci +++ b/macros/arithenco.sci @@ -1,9 +1,9 @@ function [code] = arithenco(seq, count) // This function encodes the given sequence using aritmetic coding - +// // Syntax // CODE = ARITHENCO(SEQ, COUNT) - +// // Description // CODE = ARITHENCO(SEQ, COUNT) encodes the given sequence (SEQ) using arithmetic coding. // COUNT is vector whihc gives information about the source statistics (i.e. frequency of each symbol in the source alphabet) @@ -11,22 +11,19 @@ function [code] = arithenco(seq, count) // Source Alphabet is assumed to be {1,2,....N} where N is a positive integer // Therefore, sequence should be finite and positive // Length of the COUNT should match the length of the source alphabet - +// // Examples // counts = [40 1 9]; // len = 4; // seq = [1 3 2 1] // code = arithenco(seq,counts); // disp(code) - +// // Bibliography // Sayood, K., Introduction to Data Compression, Morgan Kaufmann, 2000, Chapter 4, Section 4.4.3. - -// See also -// arithdeco - +// // Authors -// Pola Lakshmi Priyanka, IIT Bombay// +// Pola Lakshmi Priyanka, IIT Bombay //*************************************************************************************************************************************// |