Results 41 to 50 of about 1,017,243 (285)
A Modified Grouped Linear ZF Algorithm Using Different Modulation Schemes for MIMO Systems [PDF]
Engineering and Technology Journal, 2012 A new algorithm for a group iterative linear Zero-Forcing (ZF) receiver formultiple-input multiple-output (MIMO) systems is proposed in this paper. Theproposed algorithm merges between the group linear ZF receiver and V-Blastalgorithms, where the signals
Ahmed Gh. Wadday +2 more
doaj +1 more source
Maximum nullity and zero forcing of circulant graphs
Special Matrices, 2020 The zero forcing number of a graph has been applied to communication complexity, electrical power grid monitoring, and some inverse eigenvalue problems.
Duong Linh +4 more
doaj +1 more source
Adaptive Modulation for Orthogonal Frequency Division Multiplexing [PDF]
Engineering and Technology Journal, 2012 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
A lower bound on the zero forcing number [PDF]
Discrete Applied Mathematics, 2018 In this note, we study a dynamic vertex coloring for a graph $G$. In particular, one starts with a certain set of vertices black, and all other vertices white. Then, at each time step, a black vertex with exactly one white neighbor forces its white neighbor to become black.
Randy Davila +2 more
openaire +4 more sources
Variations of zero forcing and power domination [PDF]
, 2022 Zero forcing is a propagation process on a graph that turns white vertices into blue vertices. In this process, an initial set of vertices in a graph $G$ are chosen to be blue and all others are colored white, then a color-change rule is iteratively ...
Alameda, Joseph
core
Theory and Applications of Graphs, 2015 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
0034 | Zero Forcing Number in Neutrosophic Graphs
, 2022 In this book, some notions are introduced about “Zero Forcing Number in Neutrosophic Graphs.” Three chapters are devised as “Common Notions”, “Modified Notions” and “Extended Notions”. Three manuscripts are cited as the references of these chapters which
Henry Garrett
core +1 more source
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
Beamforming design of sum rate optimization for MU-MISO scenario
上海师范大学学报. 自然科学版, 2015 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
IEEE Open Journal of the Communications Society, 2021 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