pith. sign in

arxiv: 1808.10400 · v1 · pith:XS7T73YPnew · submitted 2018-08-30 · 💻 cs.IT · math.IT

A Radix-M Construction for Complementary Sets

classification 💻 cs.IT math.IT
keywords complementarysetsconstructiongeneratorpairspresentedradix-mrm-g
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. New Optimal $Z$-Complementary Code Sets from Matrices of Polynomials

    cs.IT 2019-06 unverdicted novelty 6.0

    Introduces Z-paraunitary matrices and a unifying construction for optimal Z-complementary code sets in coding theory.