Results 31 to 40 of about 448,626 (277)
Topological and Graph-coloring Conditions on the Parameter-independent Stability of Second-order Networked Systems [PDF]
In this paper, we study parameter-independent stability in qualitatively heterogeneous passive networked systems containing damped and undamped nodes.
Bürger, Mathias +3 more
core +2 more sources
Adaptive Modulation for Orthogonal Frequency Division Multiplexing [PDF]
Orthogonal frequency division multiplexing (OFDM) is one of the promising technologies to improve the spectral efficiency, enhance system capacity and mitigate inter-symbol interference in the wireless communication system.
Maher K. Mahmood, Abbas Salman Hameed
doaj +1 more source
Exact MIMO Zero-Forcing Detection Analysis for Transmit-Correlated Rician Fading [PDF]
We analyze the performance of multiple input/multiple output (MIMO) communications systems employing spatial multiplexing and zero-forcing detection (ZF).
Blostein, Steven +5 more
core +1 more source
The k-forcing number of a graph is a generalization of the zero forcing number. In this note, we give a greedy algorithm to approximate the k-forcing number of a graph. Using this dynamic approach, we give corollaries which improve upon two theorems from
Yair Caro, Ryan Pepper
doaj +1 more source
The zero forcing polynomial of a graph
Zero forcing is an iterative graph coloring process, where given a set of initially colored vertices, a colored vertex with a single uncolored neighbor causes that neighbor to become colored.
Boyer, Kirk +7 more
core +1 more source
Beamforming design of sum rate optimization for MU-MISO scenario
This paper investigates the beamforming design based on perfect channel state information (CSI) in a multi-user downlink network.The base station (BS) is equipped with multiple antennas while each user is equipped with one antenna.The BS will communicate
ZHAO Pu, YU Hui, LUO Hanwen
doaj +1 more source
Rate Splitting With Finite Constellations: The Benefits of Interference Exploitation vs Suppression
Rate-Splitting (RS) has been shown recently to be a powerful approach for the design of non-orthogonal transmission, multiple access, and interference management strategies in multi-user multi-antenna systems.
Abdelhamid Salem +2 more
doaj +1 more source
Failed Zero Forcing Numbers of Trees and Circulant Graphs
Given a graph $G$, the zero forcing number of $G$, $Z(G)$, is the smallest cardinality of any set $S$ of vertices on which repeated applications of the forcing rule (described below) results in all vertices being in $S$.
Luis Gomez +4 more
doaj +1 more source
Rigid Linkages and Partial Zero Forcing
Connections between vital linkages and zero forcing are established. Specifically, the notion of a rigid linkage is introduced as a special kind of unique linkage and it is shown that spanning forcing paths of a zero forcing process form a spanning rigid linkage and thus a vital linkage.
Ferrero, Daniela +7 more
openaire +5 more sources
This paper considers a dynamical system described by a multidimensional state vector x. A component 'x' of x evolves according to 'dx/dt = f'(x). Equilibrium fluctuations are fluctuations of an equilibrium solution x('t') obtained when the system is in ...
Jin-Song von Storch
doaj +1 more source

