Abstract
The main existence conditions for pseudo Mersenne and pseudo Fermat number transforms defined in a ring submultiple of a pseudo Mersenne or pseudo Fermat number are defined. The computational complexity of various multiplication-free number theoretic transforms (NTT's) used for implementing digital filters is evaluated. It is shown that Fermat number transforms (FNT's) with root \sqrt{2} and some complex pseudo Mersenne and pseudo Fermat number transforms with root 1 + j yield optimum processing efficiency and allow significant computational savings over direct filter evaluation.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
