Abstract
Instead of using the truth look-up table residue arithmetic, a technique for multiplying two N-bit negabinary numbers, modulo (−2) N −1 with digital partitioning, is introduced for optical computing. Both numbers are decomposed into k-bit bytes, and the product is obtained by the cyclic convolution of the sequences of the bytes. The operation with respect to other moduli can be performed similarly. The algorithm has such features as smaller computational complexity, ease of implementation, the ability to handle bipolar numbers without signs, and simple pre- and post-processing. As a proof-of-principle experiment, an optical correlator is used to perform the multiplication in parallel. The experimental results are given.
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.
