In this study, a wireless powered dual‐hop relay system, which consists of a source, a destination and a relay that is equipped with
Robust control of parameter‐dependent input delay linear parameter‐varying (LPV) systems via gain‐scheduled dynamic output‐feedback control is considered in this paper. The controller is designed to provide disturbance rejection in the context of the induced
- PAR ID:
- 10459203
- Publisher / Repository:
- Wiley Blackwell (John Wiley & Sons)
- Date Published:
- Journal Name:
- International Journal of Robust and Nonlinear Control
- Volume:
- 29
- Issue:
- 16
- ISSN:
- 1049-8923
- Page Range / eLocation ID:
- p. 5744-5764
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
( ) receiving antennas and finite energy storage, is considered. Antenna selection scheme is employed for the relay to harvest energy from the received signals, under which the ( ) strongest received signals are combined for information processing and the other copies of signals are used for energy harvesting. Considering Nakagami‐ m fading scenarios, the authors first derive the closed‐form expressions for the probability density function and the cumulative distribution function of the signal‐to‐noise ratio with generalised selection combining (GSC), and then the exact and asymptotic analytical expressions for outage probability are derived, respectively. Finally, simulation results are presented to verify the proposed analysis model. -
Abstract In this paper, we are interested in the following question: given an arbitrary Steiner triple system
on vertices and any 3‐uniform hypertree on vertices, is it necessary that contains as a subgraph provided ? We show the answer is positive for a class of hypertrees and conjecture that the answer is always positive. -
Abstract We prove that a WLD subspace of the space
consisting of all bounded, countably supported functions on a set Γ embeds isomorphically into if and only if it does not contain isometric copies of . Moreover, a subspace of is constructed that has an unconditional basis, does not embed into , and whose every weakly compact subset is separable (in particular, it cannot contain any isomorphic copies of ). -
The Cable equation is one of the most fundamental equations for modeling neuronal dynamics. In this article, we consider a high order compact finite difference numerical solution for the fractional Cable equation, which is a generalization of the classical Cable equation by taking into account the anomalous diffusion in the movement of the ions in neuronal system. The resulting finite difference scheme is unconditionally stable and converges with the convergence order of
in maximum norm, 1‐norm and 2‐norm. Furthermore, we present a fast solution technique to accelerate Toeplitz matrix‐vector multiplications arising from finite difference discretization. This fast solution technique is based on a fast Fourier transform and depends on the special structure of coefficient matrices, and it helps to reduce the computational work from required by traditional methods to without using any lossy compression, where and τ is the size of time step,and h is the size of space step. Moreover, we give a compact finite difference scheme and consider its stability analysis for two‐dimensional fractional Cable equation. The applicability and accuracy of the scheme are demonstrated by numerical experiments to support our theoretical analysis. -
Abstract It is proved that for every countable structure
and a computable successor ordinal α there is a countable structure which is ‐least among all countable structures such that is Σ‐definable in the αth jump . We also show that this result does not hold for the limit ordinal . Moreover, we prove that there is no countable structure with the degree spectrum for .