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.
| Original language | English |
|---|---|
| Article number | 8141906 |
| Pages (from-to) | 1184-1196 |
| Number of pages | 13 |
| Journal | IEEE Transactions on Signal Processing |
| Volume | 66 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - Mar 1 2018 |
| Externally published | Yes |
Bibliographical note
Publisher Copyright:© 1991-2012 IEEE.
ASJC Scopus Subject Areas
- Signal Processing
- Electrical and Electronic Engineering
Keywords
- Complementary sets of sequences (CSS)
- complete complementary codes (CCC)
- DFT matrix
- equivalent unitary matrix
- multiplexer
- paraunitary matrix