Research Repository

A Multiplier-Free Generator for Polyphase Complete Complementary Codes

Das, Shibsankar and Budisin, Srdjan and Majhi, Sudhan and Liu, Zilong and Guan, Yong Liang (2018) 'A Multiplier-Free Generator for Polyphase Complete Complementary Codes.' IEEE Transactions on Signal Processing, 66 (5). pp. 1184-1196. ISSN 1053-587X

Full text not available from this repository. (Request a copy)


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.

Item Type: Article
Uncontrolled Keywords: Complementary sets of sequences (CSS), complete complementary codes (CCC), equivalent unitary matrix, pa-raunitary matrix, DFT matrix, multiplexer
Divisions: Faculty of Science and Health
Faculty of Science and Health > Computer Science and Electronic Engineering, School of
SWORD Depositor: Elements
Depositing User: Elements
Date Deposited: 16 Jul 2021 15:09
Last Modified: 23 Sep 2022 19:37

Actions (login required)

View Item View Item