… a unimodular perfect sequence of length pk , given a unimodular perfect sequence of length
ps … generalizes previously known “even,” “odd,” and “unified” constructions for length n = ps …

… limit the discussion to general unimodular sequences, but we note here that finite-alphabet
unimodular sequences, such as m-ary phase-shift keying sequences, can also be dealt with …

… ′ and ps (where p and p ′ are prime) were introduced and studied … unimodular perfect
sequences enjoy a similar set of equivalence properties: let x be a unimodular perfect sequence…

… Once the question of the existence of perfect sequences of unbounded lengths over the …
by Arasu and de Launey be extended to perfect arrays over the basic quaternions? In order to …

… sequence of length N whose autocorrelations are zero for all time lags. Such a sequence is
called a perfect sequence… many perfect sequences of the same length (see [18]). Denote this …

… and pick up the best sequence. Moreover, the computation time of CAN grows roughly as …
We use a randomly generated unimodular sequence to initialize both WeCAN and CA. To …

… designing unimodular sequence and receiving filters, and also unimodular complementary
sequences … constraint, the projection transformation can simply be selected as Ps(·) = ej arg(·) …

… ; for example, in the case of unimodular sequences mentioned above, we have … To
illustrate the above claim, we consider the design of a unimodular sequence (with ) of length …

… Two different constructions are used for unimodular perfect sequences: for lengths n = p =
5f +1 and n = p1p2 = (4Q+3)(4P +1), where p, p1,p2 are prime numbers and f,P,Q are integers. …

This paper considers unimodular sequence synthesis under similarity constraint for both the
continuous and discrete phase cases. A computationally efficient iterative algorithm for the …