Abstract
Work on using the Fermat number transform (FNT) for convolution and correlation has recently appeared in the literature, and it is known that by using the diminished-1 number scheme all the operations required for the FNT can be computed exactly. The paper presents a diminished-1 parallel multiplier that improves the overall speed of an FNT based convolver/ correlator. The multiplication algorithm used realises the diminished-1 product (A · B − 1) = (A · B) − 1. The work has also highlighted an error in the above algorithm when the data is equal to −1 and offers a method to overcome this problem.
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 callMore From: IEE Proceedings G (Electronic Circuits and Systems)
Disclaimer: 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.
