论文信息 - Comments on "Decomposition of complex multipliers using polynomial encoding"

Comments on "Decomposition of complex multipliers using polynomial encoding"

A special carry-free circuit for the evaluation of conditions of the type A+B=K is proposed by Cortadella and Llaberia (1992), and its usefulness for reducing the negative effects of conditional branches in pipelined architectures is noted. It is shown that the same advantages are offered by another equally simple circuit based on carry-save redundant numbers and (3, 2)-counters. This alternative circuit has other potential applications and much of it may in fact be already present in some ALU's. >

Behrooz Parhami | B. Parhami

[1] Michael J. Flynn,et al. Introduction to Arithmetic for Digital Systems Designers , 1995 .

[2] Jordi Cortadella,et al. Evaluation of A + B = K Conditions Without Carry Propagation , 1992, IEEE Trans. Computers.

[3] Thanos Stouraitis,et al. Decomposition of Complex Multipliers Using Polynomial Encoding , 1992, IEEE Trans. Computers.

[4] Behrooz Parhami,et al. Generalized Signed-Digit Number Systems: A Unifying Framework for Redundant Number Representations , 1990, IEEE Trans. Computers.

[5] Behrooz Parhami,et al. On the Implementation of Arithmetic Support Functions for Generalized Signed-Digit Number Systems , 1993, IEEE Trans. Computers.