Please use this identifier to cite or link to this item:
Title: A multiplier-free generator for polyphase complete complementary codes
Authors: Majhi, Sudhan
Liu, Zilong
Guan, Yong Liang
Das, Shibsankar
Budisin, Srdjan
Keywords: Engineering::Electrical and electronic engineering
Complementary Sets Of Sequences (CSS)
Complete Complementary Codes (CCC)
Issue Date: 2018
Source: Das, S., Budisin, S., Majhi, S., Liu, Z., & Guan, Y. L. (2018). A Multiplier-Free Generator for Polyphase Complete Complementary Codes. IEEE Transactions on Signal Processing, 66(5), 1184-1196. doi:10.1109/TSP.2017.2780050
Series/Report no.: IEEE Transactions on Signal Processing
Abstract: 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.
ISSN: 1053-587X
DOI: 10.1109/TSP.2017.2780050
Rights: © 2017 IEEE. All rights reserved.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:EEE Journal Articles

Citations 10

Updated on Sep 1, 2020

Citations 10

Updated on Mar 4, 2021

Page view(s)

Updated on Jun 25, 2022

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.