Journal of Computer Applications ›› 2012, Vol. 32 ›› Issue (11): 3121-3124.DOI: 10.3724/SP.J.1087.2012.03121

Previous Articles     Next Articles

Fast calculation of number of binary signed digit representations of an integer

LI Zhong1,2,PENG Dai-yuan2   

  1. 1. School of Computer and Information Engineering,Yibin University,Yibin Sichuan 644000,China
    2. School of Information Science and Technology,Southwest Jiaotong University,Chengdu Sichuan 610031,China
  • Received:2012-04-17 Revised:2012-06-15 Online:2012-11-12 Published:2012-11-01
  • Contact: LI Zhong
  • Supported by:
    A Project Supported by Scientific Reserch Fund of SiChuan Provincial Education Department

整数的带符号二进制表示数的快速计算

李忠1,2,彭代渊1   

  1. 1. 西南交通大学 信息科学与技术学院,成都 610031
    2. 宜宾学院 计算机与信息工程学院,四川 宜宾 644000
  • 通讯作者: 李忠
  • 作者简介:李忠(1963-),男,四川安岳人,副教授,博士,主要研究方向:密码学、信息安全;彭代渊(1955-),男,四川资阳人,教授,博士生导师, 博士,主要研究方向:密码学、信息安全、编码理论。
  • 基金资助:
    四川省教育厅重点科研资助项目(07ZA145)

Abstract: Binary Signed Digit (BSD) representation of an integer is widely used in computer arithmetic, cryptography and digital signal processing. An integer of length n bits can have several BSD representations. In this paper, the authors studied the properties of the number of BSD representation of an integer, and presented two improved nonrecursion algorithms. They can rapidly calculate the exact number of BSD representations of an integer of a certain length, and the storage requirements get reduced.

Key words: integer, binary signed digit representation, number of representation, recursion algorithm, nonrecursion algorithm

摘要: 整数的带符号数字表示广泛应用于计算机算术、密码学、数字信号处理等领域。一个长度为n比特的整数有多种带符号二进制表示。对整数的带符号二进制表示数的性质进行研究,给出了两个改进的非递归算法,所得算法能快速计算给定整数的给定长度的带符号二进制表示数,且降低了空间消耗。

关键词: 整数, 带符号二进制表示, 表示数, 递归算法, 非递归算法

CLC Number: