In radar sensing and communications, designing Doppler resilient sequences (DRSs) with low ambiguity function for delay over the entire signal duration and Doppler shift over the entire signal bandwidth is an extremely difficult task. However, in practice, the Doppler frequency range is normally much smaller than the bandwidth of the transmitted signal, and it is relatively easy to attain quasi-synchronization for delays far less than the entire signal duration. Motivated by this observation, we propose a new concept called low ambiguity zone (LAZ) which is a small area of the corresponding ambiguity function of interest defined by the certain Doppler frequency and delay. Such an LAZ will reduce to a zero ambiguity zone (ZAZ) if the maximum ambiguity values of interest are zero. In this paper, we derive a set of theoretical bounds on periodic LAZ/ZAZ of unimodular DRSs with and without spectral constraints, which include the existing bounds on periodic global ambiguity function as special cases. These bounds may be used as theoretical design guidelines to measure the optimality of sequences against Doppler effect. We then introduce four optimal constructions of DRSs with respect to the derived ambiguity lower bounds based on some algebraic tools such as characters over finite field and cyclic difference sets.
9 August 2018 in Applicable Algebra in Engineering, Communication and Computing
Spectrally constrained sequences (SCSs) play an important role in modern communication and radar systems operating over non-contiguous spectrum. Despite numerous research attempts over the past years, very few works are known on the constructions of optimal SCSs with low cross-correlations. In this paper, we address such a major problem by introducing a unifying framework to construct unimodular SCS families using circular Florentine rectangles (CFRs) and interleaving techniques. By leveraging the uniform power allocation in the frequency domain for all the admissible carriers (a necessary condition for beating the existing periodic correlation lower bound of SCSs), we present a tighter correlation lower bound and show that it is achievable by our proposed SCS families including multiple SCS sets with zero correlation zone properties.
For an odd prime p and positive integers r, d such that 0 < d ≤ pr, a generic construction of d-ary sequence based on Euler quotients is presented in this paper. Compared with the known construction, in which the support set of the sequence is fixed and d is usually required to be a prime, the support set of the proposed sequence is flexible and d could be any positive integer less then pr in our construction. Furthermore, the linear complexity of the proposed sequence over prime field GF(q) with the assumption of qp-1 ≢ 1 mod p2 is determined. An algorithm of computing the linear complexity of the sequence is also given. Our results indicate that, with some constrains on the support set, the new sequences possess large linear complexities.
1 January 2022 in Advances in Mathematics of Communications
As numerous applications in wireless communications and radar sensing all rely on the finite and precious spectral resource, contiguous spectrum allocation schemes have become very difficult to continue nowadays. Spectrally constrained sequences (SCSs) are specially designed sequences which display low correlation sidelobes to effectively utilize the increasingly congested and fragmented spectrum. Recently, Liu et. al (IEEE Trans. Inf. Theory 64(4):2571-2582, 2018) proposed a lower bound of the maximal correlation for SCSs and constructed two classes of optimal SCSs by using Singer difference sets and perfect ternary sequences. For the application of SCSs, it is desirable that the spectrally constrained position should be as flexible as possible, and the correlation tolerance should be as small as possible. In this paper, we present some systematic constructions based on cyclotomy which generate some asymptotically optimal SCSs with respect to Liu's bound. The proposed constructions result in SCSs with new parameters and are more flexible in terms of the "position of the null constraint". In addition, we propose a framework which control the power of new SCSs while maintaining the correlation magnitudes by using cyclic algorithm-new (CAN) algorithm.
The cross-correlation distribution of constant multiple sequences of the d-ary generalized Legendre- Sidelnikov sequences is investigated via character sums. An upper on the cross-correlation values of the sequences is then presented. As a byproduct, the autocorrelation distribution of d-ary Sidelnikov sequence is completely determined, which is only known in a special case.