Abstract
The paper presents an algebraic analysis for the correctness of prefix-based adders. In contrast to using higher-order functions and rewriting systems previously, we harness first-order recursive equations for correctness proof. A new carry operator is defined in terms of a semi-group with the set of binary bits. Both sequential and parallel addition algorithms are formalized and analyzed. The formal analysis on some special prefix adder circuits demonstrates the effectiveness of our algebraic approach. This study lays an underpinning for further understanding on computer arithmetic systems.
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.
