| 整数的带符号二进制表示数的快速计算 |
| |
| 引用本文： | 李忠,彭代渊.整数的带符号二进制表示数的快速计算[J].计算机应用,2012,32(11):3121-3124. |
| |
| 作者姓名： | 李忠 彭代渊 |
| |
| 作者单位： | 1. 西南交通大学 信息科学与技术学院，成都 6100312. 宜宾学院 计算机与信息工程学院，四川 宜宾 644000 |
| |
| 基金项目： | 四川省教育厅重点科研资助项目(07ZA145) |
| |
| 摘 要： | 整数的带符号数字表示广泛应用于计算机算术、密码学、数字信号处理等领域。一个长度为n比特的整数有多种带符号二进制表示。对整数的带符号二进制表示数的性质进行研究，给出了两个改进的非递归算法，所得算法能快速计算给定整数的给定长度的带符号二进制表示数，且降低了空间消耗。
|
| 关 键 词： | 整数 带符号二进制表示 表示数 递归算法 非递归算法 |
| 收稿时间： | 2012-04-17 |
| 修稿时间： | 2012-06-15 |
Fast calculation of number of binary signed digit representations of an integer |
| |
| LI Zhong,PENG Dai-yuan.Fast calculation of number of binary signed digit representations of an integer[J].journal of Computer Applications,2012,32(11):3121-3124. |
| |
| Authors: | LI Zhong PENG Dai-yuan |
| |
| Affiliation: | 1. School of Computer and Information Engineering,Yibin University,Yibin Sichuan 644000,China2. School of Information Science and Technology,Southwest Jiaotong University,Chengdu Sichuan 610031,China |
| |
| 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. |
| |
| Keywords: | integer binary signed digit representation number of representation recursion algorithm non recursion algorithm |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
