Abstract
FFT is one main property in any sequence being used in general. To find this property of FFT for any given sequence, many transforms are being used. The major issues to be noticed in finding this property are the time and memory management. Two different algorithms are written for calculating FFT and Autocorrelation of any given sequence. Comparison is done between the two algorithms with respect to the memory and time managements and the better one is pointed. Comparison is between the two algorithms written, considering the time and memory as the only main constraints. Time taken by the two transforms in finding the fundamental frequency is taken. At the same time the memory consumed while using the two algorithms is also checked. Based on these aspects it is decided which algorithm is to be used for better results.
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.
