Updated README todo
This commit is contained in:
parent
37cd21957a
commit
cd3bdb0bf8
@ -42,9 +42,8 @@ Based on an expected distribution of deltas that have to be transmitted, an effi
|
|||||||
|
|
||||||
## TODO
|
## TODO
|
||||||
|
|
||||||
- All currently implemented bitstream encoders are rather naive. We know that lead values from the N1 only have 10-bit precision, but the WAV file provides us with 32-bit floats. All my bitstream encoders are also based on 32-bit floats; discretizing back into the 10-bit space would be a low-hanging fruit for ~3.2x compression.
|
- Our flagship bitstream encoder builds an optimal huffman tree assuming the deltas are binomially distributed. Should be updated when we know a more precise approx of the delta dist.
|
||||||
- Since we merely encode the remaining delta, we can go even more efficient by constructing something along the lines of a Huffman tree.
|
- All trained models stick mostly suck. Im not beating a compression ratio of ~2x (not counting bitstream encoder). Probably a bug somewhere in our code?
|
||||||
- All trained models stick mostly suck. Im not beating a compression ratio of ~2x (not counting bitstream encoder)
|
|
||||||
|
|
||||||
## Installation
|
## Installation
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user