A new comparator based on the parallelprefix (PP) tree is presented. The improvement is utilized in both of algorithmic-level and cell-elements. First the PP algorithm of comparator is improved and then a novel "...
详细信息
A new comparator based on the parallelprefix (PP) tree is presented. The improvement is utilized in both of algorithmic-level and cell-elements. First the PP algorithm of comparator is improved and then a novel "XNOR-AND" circuit is presented to use in proposed comparator. According to modified PP, two comparators are presented with similar comparator algorithm and different circuits in pre-encoder steps. The pre-layout and post-layout simulations of all circuits are performed in 65 nm and 180 nm standard CMOS technologies. Simulations of 16, 32 and 64-bit comparators in TT-corner of 180 nm show that the improvement of PDP of proposedl(-proposed2) than conventional comparator are 35.62%(51.23%), 35.25%(49.80%) and 31.54%(45.37%), respectively. Also, the second proposed comparator circuit is investigated in Arithmetic Logic Unit (ALU). According to the simulation results, the improvement of PDP of ALU with proposed2 comparator than ALU with conventional comparator in 180 nm standard CMOS technology is 14.62%.
We have proposed a modified Carry Select Adder (CSLA) structure which uses a parallelprefix structure with Binary to Excess 1 converter (BEC). The proposed adder has been compared with Conventional, BEC, Brent Kung (...
详细信息
We have proposed a modified Carry Select Adder (CSLA) structure which uses a parallelprefix structure with Binary to Excess 1 converter (BEC). The proposed adder has been compared with Conventional, BEC, Brent Kung (BK), Ladner Fischer (LF) and Kogge Stone (KS) based CSLA in terms of area, power consumption and performance. The proposed CSLA shows a significant decrease in the area and power compared to KS based CSLA. Particularly, the proposed CSLA structure exhibit significant improvement in speed by 54.41%, 7.95%, 7.82% to Conventional CSLA, 65.75%, 24.65%, 21.61% to BECCSLA, 50.79%, 13.83%, 9.30% to BK-CSLA, 43.12%, 8.99%, 5.35% to LF-CSLA, 44.64%, 10.50%, 6.30% to KS-CSLA for 4 bit, 8 bit and 16 bit respectively. All the CSLA structures are designed using Verilog HDL, simulations and synthesis have been performed in Cadence tool using 0.18 tm CMOS technology. (C) 2018 The Authors. Published by Elsevier B.V.
We have proposed a modified Carry Select Adder (CSLA) structure which uses a parallelprefix structure with Binary to Excess – 1 converter (BEC). The proposed adder has been compared with Conventional, BEC, Brent – ...
详细信息
We have proposed a modified Carry Select Adder (CSLA) structure which uses a parallelprefix structure with Binary to Excess – 1 converter (BEC). The proposed adder has been compared with Conventional, BEC, Brent – Kung (BK), Ladner – Fischer (LF) and Kogge – Stone (KS) based CSLA in terms of area, power consumption and performance. The proposed CSLA shows a significant decrease in the area and power compared to KS based CSLA. Particularly, the proposed CSLA structure exhibit significant improvement in speed by 54.41%, 7.95%, 7.82% to Conventional CSLA, 65.75%, 24.65%, 21.61% to BEC-CSLA, 50.79%, 13.83%, 9.30% to BK-CSLA, 43.12%, 8.99%, 5.35% to LF-CSLA, 44.64%, 10.50%, 6.30% to KS-CSLA for 4 bit, 8 bit and 16 bit respectively. All the CSLA structures are designed using Verilog HDL, simulations and synthesis have been performed in Cadence tool using 0.18 µm CMOS technology.
Floating point comparison is a fundamental arithmetic operation in DSP processor. The high dynamic range of floating point comparators find wide applications in sorting data problem, DSP algorithms etc. High performan...
详细信息
Floating point comparison is a fundamental arithmetic operation in DSP processor. The high dynamic range of floating point comparators find wide applications in sorting data problem, DSP algorithms etc. High performance with optimum area is a major concern for the practical implementation of these comparators. Another major concern with respect to the floating point numbers is the invalid numbers. Thus a separate module is required to handle the invalid numbers. In the present work, a double precision floating point comparator design is proposed for efficient floating point comparison. This comparator takes full advantage of the parallel prefix tree architecture. It first compares the most significant bit and proceeds towards least significant bit only when the compared bits are equal. Representation of floating point numbers is based on IEEE 754 standard. The double precision floating point comparator is modelled using Verilog HDL and synthesized in Xilinx ISE 14.6 targeting Virtex 5 and Cadence encounter tool. The results show that the new comparator architecture is efficient in handling all the invalid floating point numbers.
In recent years, floating point numbers are widely adopted due to its good robustness against quantization errors and high dynamic range capabilities. In this paper, a novel single-precision floating point comparator ...
详细信息
ISBN:
(纸本)9781479970759
In recent years, floating point numbers are widely adopted due to its good robustness against quantization errors and high dynamic range capabilities. In this paper, a novel single-precision floating point comparator design is proposed. A parallel prefix tree structure is literally the back bone of this comparator design. This is designed using Verilog code, simulated and synthesised using CADENCE ENCOUNTER tool with TSMC 180nm technology. The proposed comparator fully supports single precision floating-point comparisons, as defined in the IEEE 754 standard. The proposed floating point comparator design exploits the advantages of structural reusability. Cadence Encounter synthesis for a 32-b floating point comparator shows a worst case input-output delay of 3.014 ns and a total power dissipation of 91.8 mu W using 0.18-mu m TSMC technology. The replacement of NOR-NAND gate using OR gate in the decision module incurs the improvement in the performance which thereby outperforms the existing design.
Arbitration among various clients, requesting multiple resources simultaneously in high throughput system, needs multiple requests selection in single cycle. A new technique for implementation of arbiter, which select...
详细信息
ISBN:
(纸本)9781479986415
Arbitration among various clients, requesting multiple resources simultaneously in high throughput system, needs multiple requests selection in single cycle. A new technique for implementation of arbiter, which selects up to two active request is proposed in this paper. 2 selector circuits are designed by modification of existing parallel prefix tree structures for architecture. Design maintains fairness among active requests by updating pointers according to grant selection algorithm presented. Simulation of design and comparison with previously work is done in terms of area and timing results.
暂无评论