Cart (Loading....) | Create Account
Close category search window
 

A low-complexity correlation algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kuang-Fu Cheng ; Dept. of Electron. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Sau-Gee Chen

For the consideration of low power, and fast code acquisition, four new low-complexity correlation algorithms are proposed in this work. Among them, the one derived by combing the differential coding scheme and a fast filtering algorithm has the lowest complexity. The new algorithm reduces the direct N addition operations to 5N/16. As a result, close to 70% reduction is obtained. When compared with the fast correlation algorithm based on the differential coding scheme, which costs N/2 addition operations, close to 40% reduction is obtained. The new algorithm can be further combined with the sub-expression sharing techniques for a much significant complexity reduction. The proposed design is best suited for DSP realization.

Published in:

Circuits and Systems, 2003. ISCAS '03. Proceedings of the 2003 International Symposium on  (Volume:5 )

Date of Conference:

25-28 May 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.