University of Surrey

Test tubes in the lab Research in the ATI Dance Research

A Multiplier-Free Generator for Polyphase Complete Complementary Codes

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

Full text not available from this repository.


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
Divisions : Faculty of Engineering and Physical Sciences > Electronic Engineering
Authors :
Das, Shibsankar
Budisin, Srdjan
Majhi, Sudhan
Guan, Yong Liang
Date : 4 December 2017
DOI : 10.1109/TSP.2017.2780050
Uncontrolled Keywords : Complementary sets of sequences (CSS); Complete complementary codes (CCC); Equivalent unitary matrix; Paraunitary matrix; DFT matrix; Multiplexer
Depositing User : Clive Harris
Date Deposited : 12 Sep 2018 15:19
Last Modified : 12 Sep 2018 15:19

Actions (login required)

View Item View Item


Downloads per month over past year

Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800