文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Some Explicit Formulae of NAF and its Left-to-Right Analogue
侵权投诉

Some Explicit Formulae of NAF and its Left-to-Right Analogue

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

–Booth(a),Naf(a),andFan(a)denotetheBoothencoding,NAF,andFANrepresentationofthearespectively. nintegeri Booth(a):=i2withβi∈{ 1,0,1}, ni=0βi Naf(a):= i=0νi2withνi∈{ 1,0,1},n Fan(a)=i=0φi2iwithφi∈{ 1,0,1}.–B(n):={Booth(a)|0≤a≤2n 1}. CaseB(n):={Booth(a)withβn=0|0≤a≤2n 1}.

1)|0≤a≤2n 1}. Case(n):={Booth(a)with(βn,βn 1)=(1,¯

Case(n):={Booth(a)with(βn,βn 1)=(1,0)|0≤a≤2n 1}.–N(n):={Naf(a)|0≤a≤2n 1}.

–F(n):={Fan(a)|0≤a≤2n 1}.

–κn=2ifnisoddandκn=1ifniseven.

–εnisthenegligiblefunctioninn,namelyforeveryconstantc≥0thereexistsanintegerncsuchthat|εn|≤1/ncforalln≥nc.

2.2BoothEncoding,NAFandFAN

TheBoothencoding[Boo51]ofanintegerisde nedasfollows:

De nition1(BoothEncoding[OSS+04]).Then-bitBoothencodingisann-bitsignedbinaryrepresentationthatsatis esthefollowingtwoconditions:

1.Signsofadjacentnonzerobits(withoutconsideringzerobits)areopposite.

2.Themostnonzerobitandtheleastnonzerobitare1and¯1,respectively,unlessallbitsarezero.

In[OSS+04],theyshowedasimpleconversionmethodfromann-bitbinarystringto(n+1)-bitBoothencoding.Givenanintegera,theBoothencodingofaisobtainedby

Booth(a)=2a a,

where standsforabitwisesubtraction.

Thenon-adjacentform(NAF)alsorepresentsanintegerinsignedform.Sincethereisnosuccessivenonzerobitsintherepresentation,NAFisastandardtech-niqueforcomputingexponentiations[IEEE].Accordingto[HKP+04,OSS+04],NAFcanbeinterpretedasacombinationoftheBoothencodingandaright-to-leftslidingwindowmethodwithwidth-2.Forexample,foraninteger13,wehaveBooth(13)=10¯11¯1.ThenwedivideBooth(13)(asastring)intowidth-2windowsfromrighttoleft:01,0¯1,1¯1(theleftmost0waspadded),andconvert¯¯¯101.11to01and11to01,ifexist.ThuswehaveNaf(13)=10¯

FANwasintroducedasaleft-to-rightanalogueofNAF[JY00].Infact,FANcanbealsointerpretedasacombinationoftheBoothencodingandaleft-to-rightslidingwindowmethodwithwidth-2.Forexample,again,wedividetheBoothencodingBooth(13)=10¯11¯1intowidth-2windowsfromlefttoright:10,¯11,¯10(therightmost0waspadded).Then,similarlytoNAF,convert1¯1to01and¯11to0¯1,ifexist.ThuswehaveFan(13)=100¯1¯1.NotethatFANcanhavesuccessivenonzerobitsunlikeNAF.

Table1showsNAF,FAN,Booth,andnon-signedbinaryrepresentationsofsomepositiveintegers.

3

上一页第3页

你可能喜欢

热门文档

相关文档

  • Amalgamating NAF and NAI

    Some Explicit Formulae o... 暂无评价 14页 免费 Evolution of Electronic ... 暂无评价 9页 免费 NAF算法的改进 暂无评价 4页 2.00元 NaF 暂无评价 2页...

  • Amalgamating NAF and NAI

    Some Explicit Formulae o... 暂无评价 14页 免费 Evolution of Electronic ... 暂无评价 9页 免费 NAF算法的改进 暂无评价 4页 2.00元 NaF 暂无评价 2页...

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email