Results 31 to 40 of about 26,712 (151)
Beamforming Design and Covert Performance Analysis for Full-Duplex Multiantenna System
Complexity, 2021 In this work, a wireless covert communication system with full-duplex (FD) multiantenna receiver is considered. In order to improve the convert performance of the wireless communication system in the FD mode, a scheme based on selection combining/zero ...
Ling Yang +5 more
doaj +1 more source
Minimum rank and zero forcing number for butterfly networks [PDF]
Journal of Combinatorial Optimization, 2018 The minimum rank of a simple graph $G$ is the smallest possible rank over all symmetric real matrices $A$ whose nonzero off-diagonal entries correspond to the edges of $G$. Using the zero forcing number, we prove that the minimum rank of the butterfly network is $\frac19\left[(3r+1)2^{r+1}-2(-1)^r\right]$ and that this is equal to the rank of its ...
Daniela Ferrero +4 more
openaire +4 more sources
On Zero Forcing Number of Functigraphs
, 2012 \emph{Zero forcing number}, $Z(G)$, of a graph $G$ is the minimum cardinality of a set $S$ of black vertices (whereas vertices in $V(G) \setminus S$ are colored white) such that $V(G)$ is turned black after finitely many applications of "the color-change rule": a white vertex is converted black if it is the only white neighbor of a black vertex.
Kang, Cong X., Yi, Eunjeong
openaire +2 more sources
Spreading in claw-free cubic graphs [PDF]
Opuscula MathematicaLet \(p \in \mathbb{N}\) and \(q \in \mathbb{N} \cup \lbrace \infty \rbrace\). We study a dynamic coloring of the vertices of a graph \(G\) that starts with an initial subset \(S\) of blue vertices, with all remaining vertices colored white.
Boštjan Brešar +2 more
doaj +1 more source
, 2017 A subset $S$ of initially infected vertices of a graph $G$ is called forcing if we can infect the entire graph by iteratively applying the following process. At each step, any infected vertex which has a unique uninfected neighbour, infects this neighbour. The forcing number of $G$ is the minimum cardinality of a forcing set in $G$.
Kalinowski, Thomas +2 more
openaire +2 more sources
Hybrid precoding based on distributed partially-connected structure for multiuser massive MIMO
Tongxin xuebao, 2022 For multiuser massive multiple-input multiple-output (MIMO) systems, to solve the problem of underutilized spatial resources caused by centralized partially-connected structure (PCS) and fixed-matching phase-control algorithm in conventional schemes, a ...
Lei ZHANG, Qin WANG
doaj +2 more sources
Compute-and-forward transmission scheme in cell-free massive MIMO systems
ICT Express, 2023 Cell-free massive multi-input-multi-output (MIMO) systems comprise a large number of distributed access points (APs) to serve a small number of user equipments (UEs). In this paper, compute-and-forward (CF) is investigated for uplink in cell-free massive
Hua Jiang, Linghong Kong, Sidan Du
doaj +1 more source
Achievable Rates for Full-Duplex Massive MIMO Systems Over Rician Fading Channels
IEEE Access, 2018 We study the uplink and downlink achievable rate of full-duplex large-scale multi-input multioutput (MIMO) systems with a base station (BS) and users over Rician fading channels, based on maximum ratio combining/maximum ratio transmission and zero ...
Juan Liu +4 more
doaj +1 more source
Failed Zero-Forcing Number in Neutrosophic Graphs
, 2022 New setting is introduced to study failed zero-forcing number and failed zero-forcing neutrosophic-number. Leaf-like is a key term to have these notions. Forcing a vertex to change its color is a type of approach to force that vertex to be zero-like.
+6 more sources
Failed Zero Forcing Numbers of Trees and Circulant Graphs
Theory and Applications of GraphsGiven 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