...
首页> 外文期刊>IEEE Transactions on Circuits and Systems. II, Express Briefs >Comments on “Comments on `A systematic approach for design ofdigit serial signal processing architectures'”
【24h】

Comments on “Comments on `A systematic approach for design ofdigit serial signal processing architectures'”

机译:关于“关于“数字串行信号处理架构设计的系统方法”的评论”的评论

获取原文
获取原文并翻译 | 示例
           

摘要

In the above paper, [see ibid., vol. 47, p. 369-70, 2000] thenauthors have modified the nonrestoring square root algorithmn(Q=√A) and its architecture [see ibid., vol. 38, p.358-75, 1991]nto give correct results. They claimed that the partial remainder (PR)nshould be kept as is rather than eliminating its MSB at each step of thenalgorithm. Since two bits of A are appended to PR at each step of thenalgorithm, length of kth PR will be 2k rather than k+1 as in thenalgorithm of [1]. They also suggested that k of 0's to be appended tonthe left of the MSB of the radicand to keep its length as that of PR. Asna result, k-1 CAS cells are added to the kth row of the architecture. Innthis comment, it will be shown that most of the additional CAS cells arenredundant where only one added CAS cell per each row is enough toncompute the correct square root
机译:在以上论文中,[参见同上,第第47页369-70,2000]然后,作者修改了非还原平方根算法n(Q =√A)及其体系结构[请参见同上,第1卷。 38,p.358-75,1991]给出正确的结果。他们声称应保留部分余数(PR),而不是在算法的每个步骤中都消除其最高有效位。由于在算法的每一步都将A的两位附加到PR,因此第k个PR的长度将为2k,而不是如[1]的算法中的k + 1。他们还建议将k的0附加在radicand的MSB的左侧,以保持其长度与PR的长度相同。结果,将k-1个CAS单元添加到架构的第k行。 Innthis评论,将显示大多数附加的CAS单元都是多余的,其中每行仅添加一个CAS单元足以计算正确的平方根

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号