Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{144850,
        author = {EASAM. SWAPNA PRIYA SINDHUJA and A.HARI PRASAD  and P.ANIL KUMAR},
        title = {FLOATING-POINT BUTTERFLY ARCHITECTURE BASED ON CARRY SELECT ADDER REPRESENTATION WITH IMPROVEMENT IN SPEED COMPUTATION},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {4},
        number = {5},
        pages = {57-62},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=144850},
        abstract = {Fast Fourier transform (FFT) coprocessor, having a significant impact on the performance of communication systems, and in DSP processors has been a hot topic of research in recent years. The FFT function is consists of consecutive multiply add operations over complex numbers, dubbed as butterfly units. Applying floating-point (FP) arithmetic to FFT architectures, specifically butterfly units, has become more popular recently. It offloads compute-intensive tasks from general-purpose processors by dismissing FP concerns (e.g., scaling and overflow/underflow). However, the major downside of FP butterfly is its slowness in comparison with its fixed-point counterpart. This reveals the incentive to develop a high-speed FP butterfly architecture to mitigate FP slowness. This brief proposes a fast FP butterfly unit using a devised FP fused-dot-product-add (FDPA) unit, to compute AB±CD±E, based on binary-signed-digit (BSD) representation. The FP three-operand BSD adder and the FP BSD constant multiplier are the constituents of the proposed FDPA unit. A carry-limited BSD adder is proposed and used in the three-operand adder and the parallel BSD multiplier so as to improve the speed of the FDPA unit. Moreover, modified Booth encoding  technique is used to accelerate the BSD multiplier. The synthesis results show that the proposed FP butterfly architecture is  faster than previous counterparts but requires more area.},
        keywords = {Carry Select Adder (CSA) representation, butterfly unit, Fast Fourier Trans-form (FFT), Floating-Point (FP), three-operand addition.BSD (Binary significant digit) adder.},
        month = {},
        }