In this paper, the autocorrelations of maximal period Feedback with Carry Shift Register sequences （l-sequences） are discussed. For an l-sequence a with connection integer q = p^e（e ≥ 2） and period T = p^t-1（p- ...In this paper, the autocorrelations of maximal period Feedback with Carry Shift Register sequences （l-sequences） are discussed. For an l-sequence a with connection integer q = p^e（e ≥ 2） and period T = p^t-1（p- 1）, and for any integer i, 1 ≤ i ≤ e/2, by calculating the number of certain sets, it is shown that the autocorrelation of a with shift τ= kT/2p^i is Ca（τ） =（-1）^k-1 T/p^2i-1, where 1 ≤ k ≤ 2p^i - 1, and gcd（k,2p^i） = 1. This result shows there do exist some shifts such that the autocorrelations of l-sequences are high although most autocorrelations are low. Such result also holds for the decimations of l-sequences.展开更多
Distributed consensus problems for multiple Euler-Lagrange systems are addressed on the basis of event-triggered information in this study. Distributed consensus protocols are first designed in terms of two event-trig...Distributed consensus problems for multiple Euler-Lagrange systems are addressed on the basis of event-triggered information in this study. Distributed consensus protocols are first designed in terms of two event-triggered scenarios: a decentralized strategy and a distributed strategy. Sufficient conditions that guarantee the event-triggered consensus for multiple Euler-Lagrange systems are then presented, with the associated advantages of reducing controller update times. It is shown that the Zeno behavior of triggering time sequences is excluded for both strategies. Finally, multiple Euler-Lagrange systems that consist of six two-link manipulators are considered to illustrate the effectiveness of the proposed theoretical algorithms.展开更多
基金the 863 Project of China (No.2006AA01Z417) the National Natural Science Foundation of China (No.60673081).
文摘In this paper, the autocorrelations of maximal period Feedback with Carry Shift Register sequences （l-sequences） are discussed. For an l-sequence a with connection integer q = p^e（e ≥ 2） and period T = p^t-1（p- 1）, and for any integer i, 1 ≤ i ≤ e/2, by calculating the number of certain sets, it is shown that the autocorrelation of a with shift τ= kT/2p^i is Ca（τ） =（-1）^k-1 T/p^2i-1, where 1 ≤ k ≤ 2p^i - 1, and gcd（k,2p^i） = 1. This result shows there do exist some shifts such that the autocorrelations of l-sequences are high although most autocorrelations are low. Such result also holds for the decimations of l-sequences.
基金supported by the National Natural Science Foundation of China(Grant Nos.61225013&11332001)
文摘Distributed consensus problems for multiple Euler-Lagrange systems are addressed on the basis of event-triggered information in this study. Distributed consensus protocols are first designed in terms of two event-triggered scenarios: a decentralized strategy and a distributed strategy. Sufficient conditions that guarantee the event-triggered consensus for multiple Euler-Lagrange systems are then presented, with the associated advantages of reducing controller update times. It is shown that the Zeno behavior of triggering time sequences is excluded for both strategies. Finally, multiple Euler-Lagrange systems that consist of six two-link manipulators are considered to illustrate the effectiveness of the proposed theoretical algorithms.
