Hi everyone, I'm working on arithmetic compression. I am trying to compress the channel iut of the international standard. With my algorithm I have a compression ratio of 0.86 if I take the channel A iut with a modulation ofdm of 128 subcarriers.
NB: I send the exponential form of the complex numbers therefore of the angles comprised between 0 and 2pi.
Then my question is: would anyone have an idea to create an algorithm arithmetic enough powerful because mine gives results that do not bother me
Thank you dear Luay Shihad for this answer that I find a little broad compared to my question.I would just like to compress a matrix or vector of integers between 1 and 256. The matrix or the vector can take any size greater than 510. I can compress but the rate does not help. (15% or less)
Thank you dear Luay Shihab . I think this is very clear resume on the compression. Now I understand better the compression process.
So on practice or implementation. My idea is to implement arithmetic compression which is an entropy compression (lossless). My test vector is a vector of 500 elements for example. Each element can take the value from 1 to 256. In my vector there will necessarily redundancies. And I can do compression with an arithmetic algorithm: the one proposed by: " Arithmetic coding for data compression I. Witten, R. Neal am\nd J. Cleary Communication of the ACM, 1987 Volume 30 Number 6 "
It works well but I would like to know is that there would not be another method more effective? Which would make it possible to have one with the same vector a better compression.
Ps: if you are interested I can share the part of the code that I modified and implement.
thank you.
- Badges
- Science topic
- Similar topics
- Biological Science
- Bioecology
- Systems Ecology
- Landscape Ecology
- Connectivity