25.01.2014 Views

Implementation of Wallace Tree Multiplier Using Compressor

Implementation of Wallace Tree Multiplier Using Compressor

Implementation of Wallace Tree Multiplier Using Compressor

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Naveen Kr.Gahlan et al ,Int.J.Computer Technology & Applications,Vol 3 (3), 1194-1199<br />

ISSN:2229-6093<br />

Fig.6. (a) 5:2 compressor I/O diagram<br />

Fig.7(b) 6:2 compressor architecture<br />

Fig.6(b). RTL Schematic <strong>of</strong> 5:2 <strong>Compressor</strong><br />

3) 6:2 <strong>Compressor</strong><br />

The 6:2 compressor has 6 input bits and produces 2 sum<br />

output bits (out 0 and out 1 ), it also has a carry-in (C in0 ,<br />

C in1 ) and a carry-out (C out0 , C out1 ) bit (thus, the total number<br />

<strong>of</strong> input/output bits are 8 and 4); All input bits, including<br />

C in0 , have rank 0 and C in1 has rank 1 ; the two output bits<br />

have ranks 0 and 1 respectively, while C out0 has rank 1 and<br />

C out1 has rank 2 as shown in Fig<br />

Fig.7(c). RTL Schematic <strong>of</strong> 6:2 <strong>Compressor</strong><br />

4) 7:2 <strong>Compressor</strong><br />

The 7:2 compressor has 7 input bits and produces 2 sum<br />

output bits (out 0 and out 1 ), it also has a carry-in (C in0 ,<br />

C in1 ) and a carry-out (C out0 , C out1 ) bit (thus, the total number<br />

<strong>of</strong> input/output bits are 9 and 4); All input bits, including<br />

C in0 , have rank 0 and C in1 has rank 1 ; the two output bits<br />

have ranks 0 and 1 respectively, while C out0 has rank 1 and<br />

C out1 has rank 2 as shown in Fig<br />

Fig.7(a) 6:2 compressor I/O diagram<br />

Fig.8(a) 6:2 compressor I/O diagram<br />

IJCTA | MAY-JUNE 2012<br />

Available online@www.ijcta.com<br />

1197

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!