This paper presents a new algorithm to compute correlation in digital domain by transforming correlation formula into a calculation form based on a first-order moment. As a result, the arbitrary-length digital correlation can be implemented efficiently through rapidly computing the first-order moment in this new correlation formula. It is acknowledged that correlation’s computation performance depends on its multiplication complexity, so we introduce and improve an algorithm of first-order moment to implement correlation without multiplication and through an iterative procedure. Also, a systolic array without multiplier is designed for correlation’s hardware implementation according to the proposed algorithm. The comparisons with some algorithms have proven this algorithm’s efficiency
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.