A multiplier-free generator for polyphase complete complementary codes

• Main Authors: Majhi, Sudhan, Liu, Zilong, Guan, Yong Liang, Das, Shibsankar, Budisin, Srdjan
• Other Authors: School of Electrical and Electronic Engineering
• Format: Article
• Language: English
• Published: 2019
• Subjects: Engineering::Electrical and electronic engineering; Complementary Sets Of Sequences (CSS); Complete Complementary Codes (CCC)
• Online Access: https://hdl.handle.net/10356/85317; http://hdl.handle.net/10220/49211
• Institution: Nanyang Technological University

Complementary sets of sequences (CSS) and complete complementary codes (CCC) have found numerous applications in wireless communications and radar sensing owing to their perfect aperiodic correlation properties. In this paper, we first present a new algorithm for generating polyphase CSS and CCC based on paraunitary (PU) matrices which uses equivalent forms of unimodular unitary matrices. Then, we propose a multiplier-free implementation of this generator based on multiplexers and read-only memories (ROMs). Our proposed algorithm generalizes the previous PU generator for complementary pairs by Budišin and Spasojević. Some previous algorithms for CSS and CCC can also be derived from our CCC generator as special cases. In addition, we give the enumeration formula and show that the number of generated sequences is significantly higher compared to previous works.