Results 21 to 30 of about 3,656,389 (294)
Low-Complexity Zero-Forcing Precoding for XL-MIMO Transmissions [PDF]
European Signal Processing Conference, 2021 Deploying antenna arrays with an asymptotically large aperture will be central to achieving the theoretical gains of massive MIMO in beyond-5G systems.
Lucas N. Ribeiro +2 more
semanticscholar +1 more source
An Inverse Approach for Finding Graphs with a Failed Zero Forcing Number of k
Mathematics, 2023 For a 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 results in all vertices being included in S.
Chirag Kaudan +2 more
doaj +1 more source
Regularized Zero-Forcing Aided Hybrid Beamforming for Millimeter-Wave Multiuser MIMO Systems
IEEE Transactions on Wireless Communications, 2023 This paper considers hybrid beamforming consisting of analog beamforming (ABF) coupled with digital baseband beamforming (DBF) which is designed for multi-user (MU) multiple input multiple output (MIMO) millimeter-wave (mmWave) communications. ABF uses a
Hongwen Yu +4 more
semanticscholar +1 more source
Cell-Free Massive MIMO: Joint Maximum-Ratio and Zero-Forcing Precoder With Power Control
IEEE Transactions on Communications, 2021 Cell-free massive multiple-input multiple-output (MIMO) system is a promising architecture for next generation wireless systems by deploying a very large number of distributed access points (APs), which simultaneously serve a smaller number of user ...
Liutong Du +4 more
semanticscholar +1 more source
Constructions of cospectral graphs with different zero forcing numbers [PDF]
The Electronic Journal of Linear Algebra, 2021 Several researchers have recently explored various graph parameters that can or cannot be characterized by the spectrum of a matrix associated with a graph.
A. Abiad +5 more
semanticscholar +1 more source
Properties of a q-Analogue of Zero Forcing [PDF]
Graphs and Combinatorics, 2020 Zero forcing is a combinatorial game played on a graph where the goal is to start with all vertices unfilled and to change them to filled at minimal cost. In the original variation of the game there were two options. Namely, to fill any one single vertex at the cost of a single token; or if any currently filled vertex has a unique non-filled neighbor ...
Steve Butler +8 more
openaire +4 more sources
Fuzzy Forcing Set on Fuzzy Graphs [PDF]
Journal of Mahani Mathematical Research, 2019 The investigation of impact of fuzzy sets on zero forcing set is the main aim of this paper. According to this, results lead us to a new concept which we introduce it as Fuzzy Zero Forcing Set (FZFS). We propose this concept and suggest a polynomial time
Layia Aliahmadipour, Saeedeh Rashidi
doaj +1 more source
On the Zero Forcing Number and Spectral Radius of Graphs
Electronic Journal of Combinatorics, 2022 In this paper, we determine the graphs (respectively, trees) with maximum spectral radius among all graphs (respectively, trees) with zero forcing number at most $k$.
Wenqian Zhang +3 more
semanticscholar +1 more source
Forcing Parameters in Fully Connected Cubic Networks
Mathematics, 2022 Domination in graphs has been extensively studied and adopted in many real life applications. The monitoring electrical power system is a variant of a domination problem called power domination problem.
Yongsheng Rao +4 more
doaj +1 more source
Local Partial Zero-Forcing Precoding for Cell-Free Massive MIMO [PDF]
IEEE Transactions on Wireless Communications, 2019 Cell-free Massive MIMO (multiple-input multiple-output) is a promising distributed network architecture for 5G-and-beyond systems. It guarantees ubiquitous coverage at high spectral efficiency (SE) by leveraging signal co-processing at multiple access ...
Giovanni Interdonato +3 more
semanticscholar +1 more source