Introduces Z-paraunitary matrices and a unifying construction for optimal Z-complementary code sets in coding theory.
A Radix-M Construction for Complementary Sets
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We extend the paraunitary (PU) theory for complementary pairs to comple- mentary sets and complete complementary codes (CCC) by proposing a new PU construction. A special, but very important case of complementary sets (and CC- C), based on standard delays, is analyzed in details and a new 'Radix-M generator' (RM-G) is presented. The RM-G can be viewed as a generalization of the Boolean generator for complementary pairs. An efficient correlator for standard complemen- tary sets and CCC is also presented. Finally, examples of polyphase, QAM and hexagonal PU sets of three sequences are given.
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
New Optimal $Z$-Complementary Code Sets from Matrices of Polynomials
Introduces Z-paraunitary matrices and a unifying construction for optimal Z-complementary code sets in coding theory.