Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.compression > #2373

Re: Introduction to Dynamic Unary Encoding

Newsgroups comp.compression
Date 2014-06-11 00:56 -0700
References <f4b51cef-cdea-417c-9a35-3b100e09a599@googlegroups.com>
Message-ID <9a92306c-2d59-4eaf-99ef-b1eaaf91c2f3@googlegroups.com> (permalink)
Subject Re: Introduction to Dynamic Unary Encoding
From matrix29bear@gmail.com

Show all headers | View raw


On Tuesday, May 13, 2014 12:24:07 PM UTC-4, Ernst wrote:
> Introduction to Dynamic Unary Encoding.
> 
> 
> 
> http://arxiv.org/abs/1405.2846
> 
> 
> 
>  I would assume this is a welcome discovery to data compression folk.  I am very interested in what people think because I still have so much to learn.
> 
> 
> 
> Feel free to write to the email listed on the paper. 
> 
> 
> 
> 
> 
>  Ernst

    Not a lot of info beyond what you list here is shown in the document 
abstract.

    Unary Coding is, however, very optimal for BINARY BASE register 
functions (it doesn't have to run a decision tree) or anything very complex just allocate memory blocks for each bit toggled. 

    For example, if you have a register value that exceeds a UNSIGNED DOUBLE 
WORD.

http://en.wikipedia.org/wiki/Integer_%28computer_science%29

    Then using UNARY representation for a preceding WORD EXPANSION register 
allocation is greatly optimal.


    Assembly value WEXP which doubles the number of registers allocated per 
each 1 bit preceding UNARY WEXP value.

    Of course, if you want true simple conversion sizes between OS max bit 
lengths, then you'd make the word expansion register fit the lowest bit 
length then double up from there.

    For example, in an unsigned 8-bit max system, if you had a WEXP assembly 
value (which equals the max bit-word length of the system), preceding the 
8-bit Byte value, then that would require the system to allocated a fake 
register tree for those values.  Treating the temporary register values as 
simple allocated ram until processed.

    An assembly value of WEXP (8-bytes on an 8-byte max computer system) 
before an 8-bit UNSIGNED BYTE value would tell the system how many multiples 
of UNSIGNED 8-byte memory spaces to allocate for that particular value.

   IF the compiler finds WEXP value of 00000011 preceding a BYTE allocation 
of 01101111 then it allocates 2 extra unsigned bytes of memory space, giving 
a simulated register span of 3 times 8 bytes = 24 bits.  A WEXP value of 
00000111  would give you (8 *4) virtual 32-bit processing function on an 
8-bits max computing system.  If you have more than one WEXP assembly value 
in a row, then you simply allocate max-bit-value for system times those 
number of bits.  A WEXP value of 00000111 which precedes another value WEXP 
11111111 should create an error, but won't because the primary function is, 
"Every bit found in a WEXP value allocates a Max-bit-length value".

    A WEXP value of 10001001 is equal to a WEXP value of 11100000 is equal 
to a WEXP value of 00000111.  Bit orders matter not, just the amount of bits 
turned on for the value (which makes this automatically compatible with all 
ENDIAN systems).

    Note that a WEXP value preceding a memory allocation Assembly value 
results in Max-Memory bits allocated per bits found in the WEXP value.  In 
this way you can essentially allocate all of the system's memory at any time 
if required.  Obviously, you'd want to use yet another assembly code command 
to signify storage zones for WEXP values in regards to using system ram 
versus hard drive space or any other peripheral hooked up to the hardware. 
Doing so would vastly simplify virtual memory usage and allow rapid 
expansion allocations.

    This I came up with way back in 1996 as a simple bypass to hardware 
incompatibility issues. 

Back to comp.compression | Previous | NextPrevious in thread | Next in thread | Find similar | Unroll thread


Thread

Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-05-13 09:24 -0700
  Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-05-16 14:16 -0700
    Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-05-28 16:56 -0700
      Re: Introduction to Dynamic Unary Encoding "Skybuck Flying" <Windows7IsOK@DreamPC2006.com> - 2014-05-31 05:09 +0200
        Re: Introduction to Dynamic Unary Encoding "Skybuck Flying" <Windows7IsOK@DreamPC2006.com> - 2014-05-31 05:27 +0200
          Re: Introduction to Dynamic Unary Encoding "Skybuck Flying" <Windows7IsOK@DreamPC2006.com> - 2014-05-31 05:37 +0200
            Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-03 15:47 -0700
        Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-03 15:18 -0700
          Re: Introduction to Dynamic Unary Encoding "Skybuck Flying" <Windows7IsOK@DreamPC2006.com> - 2014-06-05 06:14 +0200
            Re: Introduction to Dynamic Unary Encoding "Skybuck Flying" <Windows7IsOK@DreamPC2006.com> - 2014-06-05 06:15 +0200
              Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-08 14:20 -0700
                Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-09 13:03 -0700
      Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-16 14:40 -0700
  Re: Introduction to Dynamic Unary Encoding jacko <jackokring@gmail.com> - 2014-05-29 17:54 -0700
    Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-03 13:52 -0700
  Re: Introduction to Dynamic Unary Encoding matrix29bear@gmail.com - 2014-06-11 00:56 -0700
    Re: Introduction to Dynamic Unary Encoding matrix29bear@gmail.com - 2014-06-11 03:38 -0700
      Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-11 13:23 -0700
      Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-11 13:37 -0700
        Re: Introduction to Dynamic Unary Encoding matrix29bear@gmail.com - 2014-06-11 18:39 -0700
          Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-13 12:10 -0700
            Re: Introduction to Dynamic Unary Encoding matrix29bear@gmail.com - 2014-06-13 16:30 -0700
        Re: Introduction to Dynamic Unary Encoding matrix29bear@gmail.com - 2014-06-11 19:12 -0700
  Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-13 12:07 -0700
    Re: Introduction to Dynamic Unary Encoding matrix29bear@gmail.com - 2014-06-13 16:14 -0700
      Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-16 12:38 -0700
  Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-09-04 19:30 -0700
  Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-12-14 18:58 -0800
  Re: Introduction to Dynamic Unary Encoding ernst@eberg.us - 2017-03-14 12:48 -0700

csiph-web