Codage de la source
Techniques de codage de la source par quantification, compression et expansion
Appliquez des techniques de codage de la source pour formater les signaux à l’aide de partitions représentatives et du mappage selon un livre de code spécifique. Ces différentes techniques ont recours à la quantification, la compression et l’expansion.
Fonctions
arithdeco | Decode binary code by arithmetic decoding |
arithenco | Encode sequence of symbols by arithmetic encoding |
compand | Source coding mu-law or A-law compressor or expander |
dpcmdeco | Decode using differential pulse code modulation |
dpcmenco | Encode using differential pulse code modulation |
dpcmopt | Optimize differential pulse code modulation parameters |
huffmandeco | Decode binary code by Huffman decoding |
huffmandict | Generate Huffman code dictionary for source with known probability model |
huffmanenco | Encode sequence of symbols by Huffman encoding |
lloyds | Optimize quantization parameters using Lloyd algorithm |
quantiz | Produce quantization index and quantized output value |
Objets
comm.DifferentialDecoder | Decode binary signal using differential decoding |
comm.DifferentialEncoder | Encode binary signal using differential coding |
Blocs
| A-Law Compressor | Implement A-law compressor for source coding |
| A-Law Expander | Implement A-law expander for source coding |
| Differential Decoder | Decode binary signal using differential coding |
| Differential Encoder | Encode binary signal using differential coding |
| Mu-Law Compressor | Implement µ-law compressor for source coding |
| Mu-Law Expander | Implement µ-law expander for source coding |
| Quantizing Decoder | Decode quantization index according to codebook |
| Quantizing Encoder | Quantize signal using partition and codebook |
Rubriques
- Quantization
Quantize data to improve signal sampling efficiency in communications systems.
- Differential Pulse Code Modulation
Use DPCM as a predictive quantization method.
- Compand a Signal
Make µ-law or A-law compressor and expander calculations.
- Huffman Coding
Compress data so that no codeword is a prefix of any other codeword in the dictionary by using Huffman coding and decoding.
- Arithmetic Coding
Compress data from sources with a small alphabet by using arithmetic coding and decoding.
