Comments on "Breaking the 2n-bit carry-propagation barrier in residue to binary conversion for the [2/sup n/-1, 2/sup n/, 2/sup n/+1] moduli set" and author's reply

In the above paper [see ibid., vol. 45, p. 998-1002, 1998] Bharadwaj et al, have suggested two changes for Piestrak's technique [1995]. It may be recalled that the first stage in Piestrak's converter contains two levels of 2n bit carry-save adders each comprising of 2n full adders since four inputs need to be added. Interestingly, Dhurkadas's modification [1998] of Pieshak' s technique reduces the four addends to three, thus needing one level of carry-save adders only. We would like to make some observations on this modification. The authors' reply is included.