Abstract
Binary and ternary adders are frequently used to speed-up many digital signal processing (DSP) operations like multiplication, compression, filtering, convolution, etc. FPGA realization of these circuits uses a combination of look-up tables (LUTs) and carry-chains. Alternatively, inbuilt operators and parameterizable IP cores provide an efficient means of implementing these circuits. However, the realization is not optimal in the sense that the full potential of the underlying resources is not utilized. In this paper, we use technology-dependent approaches to restructure the Boolean networks corresponding to these circuits. The restructured networks are then mapped optimally onto the FPGA fabric using minimum possible resources. Our analysis shows a subsequent speed-up in the performance of these circuits when compared to different conventional and existing approaches.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
