A modified redundant binary adder for efficient VLSI architecture

Signed digit representation is vital for implementation of fast arithmetic algorithm and efficient hardware realization. Redundant binary (RB) number representation is the most widely used technique for representation of signed digit number. Again RB representation has ability to provide carry propagation free addition. In this paper we have presented an efficient modified redundant binary (MRB) adder by revising computational rules for the first step of carry propagation free addition. In the proposed MRB computational rule, the intermediate sum and intermediate carry are obtained in terms of conventional (Posibits) and inverted encoding of Negabits (IEN) representation replacing the redundant digits. The proposed MRB adder is synthesized and simulated using Xilinx-ISE 14.4 software and implemented on vertex-4 FPGA device. The propagation delay and device utilization are obtained from synthesis report and are compared with conventional redundant binary adder. The synthesis report for this proposed adder shows it has significant improvement in terms of combinational delay and area. Therefore it may be useful for designing high performances VLSI architectures.

[1]  Earl E. Swartzlander,et al.  Computer Arithmetic , 1980 .

[2]  Hiroto Yasuura,et al.  High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree , 1985, IEEE Transactions on Computers.

[3]  Mircea Vladutiu,et al.  Computer Arithmetic , 2012, Springer Berlin Heidelberg.

[4]  James E. Robertson,et al.  Logical design of a redundant binary adder , 1978, 1978 IEEE 4th Symposium onomputer Arithmetic (ARITH).

[5]  Algirdas Avizienis,et al.  Signed-Digit Numbe Representations for Fast Parallel Arithmetic , 1961, IRE Trans. Electron. Comput..

[6]  Samir Palnitkar,et al.  Verilog HDL: a guide to digital design and synthesis , 1996 .

[7]  A. Avizeinis,et al.  Signed Digit Number Representations for Fast Parallel Arithmetic , 1961 .

[8]  Manoranjan Pradhan,et al.  Efficient hardware realization of signed arithmetic operation using IEN , 2015, 2015 IEEE Power, Communication and Information Technology Conference (PCITC).

[9]  Behrooz Parhami,et al.  Efficient realisation of arithmetic algorithms with weighted collection of posibits and negabits , 2012, IET Comput. Digit. Tech..

[10]  N. Takagi,et al.  A high-speed multiplier using a redundant binary adder tree , 1987 .

[11]  B. Parhami,et al.  Weighted bit-set encodings for redundant digit sets: theory and applications , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..