On optimal binary signed digit representations of integers  

作　　者：WU Ting ZHANG Min DU Huan-qiang WANG Rong-bo College of Computer Science, Hangzhou Dianzi University, Hangzhou 310018, China 

出　　处：《Applied Mathematics(A Journal of Chinese Universities)》2010年第3期331-340,共10页高校应用数学学报（英文版）（B辑）

基　　金：Supported by Chinese National Basic Research Program(2007CB807902)

摘　　要：Binary signed digit representation （BSD-R） of an integer is widely used in computer arithmetic, cryptography and digital signal processing. This paper studies what the exact number of optimal BSD-R of an integer is and how to generate them entirely. We also show which kinds of integers have the maximum number of optimal BSD-Rs.Binary signed digit representation （BSD-R） of an integer is widely used in computer arithmetic, cryptography and digital signal processing. This paper studies what the exact number of optimal BSD-R of an integer is and how to generate them entirely. We also show which kinds of integers have the maximum number of optimal BSD-Rs.

关 键 词：Optimal binary signed digit representation non-oxljacent form Fibonacci numbers. 

分 类 号：TN918.1[电子电信—通信与信息系统]