Comments on "Comments on "A systematic approach for design of digit serial signal processing architectures

In the above paper, [see ibid., vol. 47, p. 369-70, 2000] the authors have modified the nonrestoring square root algorithm (Q=/spl radic/A) and its architecture [see ibid., vol. 38, p.358-75, 1991] to give correct results. They claimed that the partial remainder (PR) should be kept as is rather than eliminating its MSB at each step of the algorithm. Since two bits of A are appended to PR at each step of the algorithm, length of kth PR will be 2k rather than k+1 as in the algorithm of [1]. They also suggested that k of 0's to be appended to the left of the MSB of the radicand to keep its length as that of PR. As a result, k-1 CAS cells are added to the kth row of the architecture. In this comment, it will be shown that most of the additional CAS cells are redundant where only one added CAS cell per each row is enough to compute the correct square root.