[daala] daala Digest, Vol 24, Issue 4

[Timothy B. Terriberry]

I think what you have described is exactly how to do it. The value of 
the carry is always at most 1. Sorry I missed your question before.

Knight Kim wrote:
>    Hi, Timothy.
> 
> This is Knight.
> 
> Actually, I sent the same question before, but I didn't get the response.
>   -------------------------------------------------------------------
> The only thing I want to know is all about 'carry bits'.
> Is it possible for 'carry bits' to be bigger than '1' ?
> -------------------------------------------------------------------
> If it's not bigger than '1', the implementation of  HW entropy encoder 
> will be easier.
> I explained the situation a little more detail below.
> 
> Please, let me know any problem.
> 
> ========================================================================================
> 
> I looked into the PDF you attached.
> It looks like I used 5.1 method on previous codec developments.
> But it seems only 1 bit processing is allowed. Maybe it will affect 
> overall entropy performance.
> 
> I referenced google aom entropy encoder.
> This can process 1 symbol per cycle, like 5.2 in your doc, if you change 
> the 1bit shift expander to lshift_cnt.
> ---------------------------------------------
> lshift_cnt = 15 - get_msb(range);
> low = low << lshift_cnt;
> range = range << lshift_cnt;
> ---------------------------------------------
> 
> I am considering the carry process will be like below.
> Just count all 1s bytes, and then add carry at carry occurred position.
> Then reset the carry count, and monitor another all 1s byte.
> 
> image.png
> In order to satisfy this scenario, carry value should be '1' always.
> If it's bigger than '1', I cannot use this scenario. Maybe I have to 
> replace this with 5.1 on your doc.
> 
> Could you tell me what is the maximum number of carry value?
> Do you think the scenario ablove could work? or other way to supplement it?
> 
> Thank you.
> Knight.
> 
> 
> 
> 2020년 7월 29일 (수) 오후 9:00, <daala-request at xiph.org 
> <mailto:daala-request at xiph.org>>님이 작성:
> 
>     Send daala mailing list submissions to
>     daala at xiph.org <mailto:daala at xiph.org>
> 
>     To subscribe or unsubscribe via the World Wide Web, visit
>     http://lists.xiph.org/mailman/listinfo/daala
>     or, via email, send a message with subject or body 'help' to
>     daala-request at xiph.org <mailto:daala-request at xiph.org>
> 
>     You can reach the person managing the list at
>     daala-owner at xiph.org <mailto:daala-owner at xiph.org>
> 
>     When replying, please edit your Subject line so it is more specific
>     than "Re: Contents of daala digest..."
> 
> 
>     Today's Topics:
> 
>         1. Re: daala Digest, Vol 24, Issue 2 (Timothy B. Terriberry)
> 
> 
>     ----------------------------------------------------------------------
> 
>     Message: 1
>     Date: Tue, 28 Jul 2020 08:33:54 -0700
>     From: "Timothy B. Terriberry" <tterriberry at mozilla.com
>     <mailto:tterriberry at mozilla.com>>
>     To: daala at xiph.org <mailto:daala at xiph.org>
>     Subject: Re: [daala] daala Digest, Vol 24, Issue 2
>     Message-ID: <ab85706d-f764-7ef1-89c6-08e47e92a8f4 at xiph.org
>     <mailto:ab85706d-f764-7ef1-89c6-08e47e92a8f4 at xiph.org>>
>     Content-Type: text/plain; charset=UTF-8; format=flowed
> 
>     Knight Kim wrote:
>      > Thank you for your response.
>      > I am studying the PDF you sent.
>      > Could I ask you more if I have more questions?
> 
>     Of course. Happy to help.
> 
> 
>     ------------------------------
> 
>     Subject: Digest Footer
> 
>     _______________________________________________
>     daala mailing list
>     daala at xiph.org <mailto:daala at xiph.org>
>     http://lists.xiph.org/mailman/listinfo/daala
> 
> 
>     ------------------------------
> 
>     End of daala Digest, Vol 24, Issue 4
>     ************************************
> 
> 
> _______________________________________________
> daala mailing list
> daala at xiph.org
> http://lists.xiph.org/mailman/listinfo/daala
>