Abstract
The cyclic autocorrelation function (CACF) is compared with the rapid transform (RT) in the speed of computation, the volume of transform, flexibility, number of distinct transforms and noise immunity. It is shown that except for the speed (slower than that of RT) and the volume (equal to that of RT), CACF is superior to RT in the other aspects. When the input patterns are binary sequences, the amplitude bounds on the CACF components are found out. It is also shown that in this case, the CACF components can assume only those values which when added to the length of the sequence result in a multiple of 4.
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.
