Abstract

SummaryBinary complementary pairs of sequences of lengths 2N10M26P posses some interesting properties for their application in signal detection in noisy channels. Nonetheless, they have not been broadly used because of their greater processing requirements as compared with binary complementary sequences with L = 2N. The present work introduces a new approach for generation and correlation of binary complementary pairs of sequences of length 2N10M26P that reduces the number of required operations. The proposed algorithm allows not only to optimize the number of arithmetic operations but also to correlate two orthogonal complementary pairs simultaneously with the use of a single architecture. Due to the fact that multilevel complementary sequences algorithms are used to generate and correlate binary complementary sequences of length 2N10M26P, the aforementioned algorithms are also improved. The proposal is theoretically proved and its arithmetic efficiency is assessed by comparing the number of operations with that of previously published architectures. Copyright © 2017 John Wiley & Sons, Ltd.

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 call

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.