Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math

Topic: Arithmetic compression
Replies: 2   Last Post: Jul 22, 2014 11:09 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Ben Bacarisse

Posts: 1,572
Registered: 7/4/07
Re: Arithmetic compression
Posted: Jul 22, 2014 10:20 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

jonas.thornvall@gmail.com writes:

> Den tisdagen den 22:e juli 2014 kl. 14:06:40 UTC+2 skrev Ben Bacarisse:
>> jonas.thornvall@gmail.com writes:
>> <snip>

>> > I actually have a arithmetic circuit switch in mind that will save
>> > alot of digit compressing binary raw data rather then data types,
>> > roughly a third will be compressed.

>>
>> There are two keys things about any compression scheme: the set of
>> inputs that get compressed (and by how much), and the set of inputs that
>> expand (and by how much). The most useful schemes have frequently
>> occurring data in the first and rare data in the second.
>>

> It will a binary sequense of any length by a third.

What lengths will the sequences "", "0", "1", "00", "01", "10" and "11
become?

> And the most shocking it is recursively appliable, because it is
> arithmetic compressoin. So you could have two, three or four startbits
> telling how many rounds you applied.
>
> It is mindblowing.


In the words of Groucho Marx: "It sounds absurd, but don't let that fool
you; it *is* absurd".

--
Ben.



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.