Results 11 to 20 of about 3,656,389 (294)
RIS-Aided Zero-Forcing and Regularized Zero-Forcing Beamforming in Integrated Information and Energy Delivery [PDF]
IEEE Transactions on Wireless Communications, 2022 This paper considers a network of a multi-antenna array base station (BS) and a reconfigurable intelligent surface (RIS) to deliver both information to information users (IUs) and power to energy users (EUs). The RIS links the connection between the IUs and the BS as there is no direct path between the former and the latter.
Hongwen Yu +4 more
openaire +5 more sources
Probabilistic zero forcing on random graphs [PDF]
European Journal of Combinatorics, 2021 Zero forcing is a deterministic iterative graph coloring process in which vertices are colored either blue or white, and in every round, any blue vertices that have a single white neighbor force these white vertices to become blue. Here we study probabilistic zero forcing, where blue vertices have a non-zero probability of forcing each white neighbor ...
Sean English +2 more
openaire +5 more sources
arXiv.orgWe introduce randomized zero forcing (RZF), a stochastic color-change process on directed graphs in which a white vertex turns blue with probability equal to the fraction of its incoming neighbors that are blue. Unlike probabilistic zero forcing, RZF is governed by in-neighborhood structure and can fail to propagate globally due to directionality.
Jesse Geneson +4 more
openaire +3 more sources
Local Partial Zero-Forcing Combining for Cell-Free Massive MIMO Systems [PDF]
IEEE Transactions on Communications, 2021 Cell-free massive multiple-input multiple-output (MIMO) provides more uniform spectral efficiency (SE) for users (UEs) than cellular technology. The main challenge to achieve the benefits of cell-free massive MIMO is to realize signal processing in a ...
Jiayi Zhang +3 more
semanticscholar +1 more source
Impact of Channel Aging on Zero-Forcing Precoding in Cell-Free Massive MIMO Systems [PDF]
IEEE Communications Letters, 2021 In the context of cell-free massive multi-input multi-output (mMIMO), zero-forcing precoding (ZFP) requires the exchange of instantaneous channel state information and precoded data symbols via a fronthaul network.
Wei Jiang, H. Schotten
semanticscholar +1 more source
Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph [PDF]
Neutrosophic Sets and Systems, 2022 New setting is introduced to study dominating, resolving, coloring, Eulerian(Hamiltonian) neutrosophic path, n-Eulerian(Hamiltonian) neutrosophic path, zero forcing number, zero forcing neutrosophicnumber, independent number, independent neutrosophic ...
Henry Garrett
doaj +1 more source
GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED [PDF]
Journal of Algebraic Systems, 2021 A subset of the vertex set of a graph $G$ is called a zero forcing set if by considering them colored and, as far as possible, a colored vertex with exactly one non-colored neighbor forces its non-colored neighbor to get colored, then the whole vertices ...
M. Alishahi, E. Rezaei-Sani
doaj +1 more source
Connected zero forcing sets and connected propagation time of graphs [PDF]
Transactions on Combinatorics, 2020 The zero forcing number $Z(G)$ of a graph $G$ is the minimum cardinality of a set $S$ with colored (black) vertices which forces the set $V(G)$ to be colored (black) after some times.
Maryam Khosravi +2 more
doaj +1 more source
A lower bound on the failed zero-forcing number of a graph [PDF]
Involve. A Journal of Mathematics, 2022 Given a graph $G=(V,E)$ and a set of vertices marked as filled, we consider a color-change rule known as zero forcing. A set $S$ is a zero forcing set if filling $S$ and applying all possible instances of the color change rule causes all vertices in $V ...
Eric Ufferman, Nicolas Swanson
semanticscholar +1 more source