TY - JOUR
T1 - Some explicit formulae of naf and its left-to-right analogue based on booth encoding
AU - Han, Dong Guk
AU - Yi, Okyeon
AU - Takagi, Tsuyoshi
PY - 2013
Y1 - 2013
N2 - Non-Adjacent Form (NAF) is a canonical form of signed binary representation of integers. Joye-Yen proposed a left-to-right analogue of NAF (FAN). It is known that NAF and FAN can be generated by applying a sliding window method with width-2 to the Booth encoding in right-to-left and left-to-right direction, respectively. In this article, we derive some properties of Booth encoding such as pattern, classification, extension, adjacency, and length.
AB - Non-Adjacent Form (NAF) is a canonical form of signed binary representation of integers. Joye-Yen proposed a left-to-right analogue of NAF (FAN). It is known that NAF and FAN can be generated by applying a sliding window method with width-2 to the Booth encoding in right-to-left and left-to-right direction, respectively. In this article, we derive some properties of Booth encoding such as pattern, classification, extension, adjacency, and length.
UR - http://www.scopus.com/inward/record.url?scp=84891772666&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84891772666&partnerID=8YFLogxK
U2 - 10.14257/ijsia.2013.7.6.27
DO - 10.14257/ijsia.2013.7.6.27
M3 - Article
AN - SCOPUS:84891772666
SN - 1738-9976
VL - 7
SP - 269
EP - 274
JO - International Journal of Security and its Applications
JF - International Journal of Security and its Applications
IS - 6
ER -