期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2015
卷号：3
期号：5
DOI：10.15680/ijircce.2015.0305078
出版社：S&S Publications
摘要：LOW-POWER, area-efficient, and high-performance VLSI systems are increasingly used in portableand mobile devices, multi standard wireless receivers, and biomedical instrumentation. An adder is the maincomponent of an arithmetic unit. A complex digital signal processing (DSP) system involves several adders. Anefficient adder design essentially improves the performance of a complex DSP system. A ripple carry adder (RCA) usesa simple design, but carry propagation delay (CPD) is the main concern in this adder. Carry look-ahead and carry select(CS) methods have been suggested to reduce the CPD of adders. A conventional carry select adder (CSLA) is an RCAconfiguration that generates a pair of sum words and output carry bits corresponding the anticipated input-carry (cin = 0and 1) and selects one out of each pair for final-sum and final output-carry . A conventional CSLA has less CPD thanan RCA, but the design is not attractive since it uses a dual RCA. In the existing designs, logic is optimized withoutgiving any consideration to the data dependence. In this paper, we prepared an analysis on logic operations occupied inconventional and BEC-based CSLAs to study the data dependence and to identify redundant logic operations. Based onthis study, we have planned a new logic formulation for the CSLA. The major contribution in this paper is logicformulation based on data dependence and optimized carry generator (CG) and carry select unit Based on the proposedlogic formulation, we have found a capable logic design for CSLA. Due to better logic units, the projected CSLAinvolves significantly less ADP than the existing CSLAs. We have shown that the SQRT-CSLA using the proposedCSLA design involves nearly 32% less ADP than that of the corresponding SQRT-CSLA.
关键词：XOR gate; Carry Select Adder; FPGA; Digital Signal Processing; BEC.
