Abstract. Non-Adjacent Form (NAF) is a canonical form of signed binary representation of integers. We present some explicit formulae of NAF and its left-to-right analogue (FAN) for randomly chosen n-bit integers. Interestingly, we prove that the zero-run l
aBinary
¯10000100001000110001¯20001000010001100010¯¯¯30010100101001010011¯40010000100011000100¯¯50010100101011110101
6010¯10010¯10010¯100110
70100¯10100¯10100¯10111
801000010001¯10001000
901001010011¯101¯11001¯¯100101001010111101010¯¯¯¯¯111010101101111011011¯¯¯121010010100101001100¯¯¯¯¯131010110011101111101¯¯¯141001010010100101110
151000¯11000¯11000¯11111
3Lemmas
Inthissection,wepreparesomelemmasrequiredtoproveourtheorems.
3.1SomePropertiesofBoothEncoding
Property1.Duetothede nitionofBoothencoding,thenumberofHammingweightofBooth(a)isalwayseven,iftheoriginalintegeraispositive.
Let 1¯1 kbeapatternofnonzerobitsinBoothencodingsuchthat
¯1(k-times)withoutconsideringzerobitsbetween1and¯1.1,1,¯1,1,...,1,¯
kk¯¯Let#[ 11 ]bethetotalnumberofstringswith 11 pattern.Forexam-
ple,inB(3)\{0},allelementsexcept1¯11¯1havethesamepattern 1¯1 2.Thus#[ 1¯1 2]=6and#[ 1¯1 4]=1.
Lemma1(PatternLemma).B(n)containsallpossiblerepresentationswith1 kpatternfor0≤k≤ n/2 . 1¯
Proof.For1≤k≤ n/2 ,
n+1,#[ 1¯1 0]=0 n+1,#[ 1¯1 k]=2k n+1,...#[ 1¯1 1]=2 n+1....#[ 1¯1 n/2 ]=2 n/2 k21
4
Some Explicit Formulae o... 暂无评价 14页 免费 Evolution of Electronic ... 暂无评价 9页 免费 NAF算法的改进 暂无评价 4页 2.00元 NaF 暂无评价 2页...
Some Explicit Formulae o... 暂无评价 14页 免费 Evolution of Electronic ... 暂无评价 9页 免费 NAF算法的改进 暂无评价 4页 2.00元 NaF 暂无评价 2页...
热门文档