Abstract
This paper presents a new approach to the problem of serial binary addition with feed-forward neural networks. It is shown that the serial binary addition, an important component to a number of applications such signal processing, of two n-bit operands with carry can be done by a feed-forward linear threshold gate based network with polynomially bounded weights, i.e. in the order of O(nk), associated with small delay and size. In particular, it is shown that the overall delay for the serial addition is k log n + n/k log n serial cycles, with the serial cycle comprising a neuron and a latch. The implementation cost of the proposal is in the order of O(log n), in terms of linear threshold gates, and in the order of O(log2n), in terms of latches. The fan-in is in the order of O(log n).
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.
