Abstract
Schemes are developed whereby the number of arithmetic operations needed in a fast finite field transform employing factor-type algorithms are decreased by using a chord property of the intermediate variables. Noticeable improvements in both the Good and the Cooley-Tukey forms of fast algorithms are possible. A proof of the limited chord properties of the intermediate variable is included, and several numerical examples for comparison purposes are given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.