Results 51 to 60 of about 3,638,652 (319)
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
Multi-Pair Two-Way Massive MIMO Relaying With Zero Forcing: Energy Efficiency and Power Scaling Laws
In this paper, we study a multi-pair two-way half-duplex decode-and-forward (DF) massive multiple-input multiple-output (MIMO) relaying system, in which multiple single-antenna user pairs can exchange information through a massive MIMO relay.
J. Qian, C. Masouros, M. Matthaiou
semanticscholar +1 more source
Energy Efficiency in Cell-Free Massive MIMO with Zero-Forcing Precoding Design [PDF]
We consider the downlink of a cell-free massive multiple-input multiple-output (MIMO) network, where numerous distributed access points (APs) serve a smaller number of users under time division duplex operation.
L. Nguyen, T. Duong, H. Ngo, K. Tourki
semanticscholar +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
Orthogonality in multibeam antennas is revisited. The difference between orthogonal beamforming and zero-forced beamforming is highlighted. The intriguing relation between orthogonality, reciprocity and losses is recapitulated.
Yanki Aslan +4 more
doaj +1 more source
Prior Zero Forcing for Cognitive Relaying
Relaying primary signals by cognitive base-stations (CBSs) can help the primary system and thus win CBSs a higher chance to transmit their own signals. For this purpose, conventional zero-forcing (CZF) beamforming is a straightforward solution where the primary and cognitive signals are transmitted from a multi-antenna CBS without causing interference ...
Song S.H., Hasna , Mazen, Letaief K.B.
openaire +3 more sources
Properties of a q-Analogue of Zero Forcing [PDF]
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
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
Zero forcing number, constrained matchings and strong structural controllability
The zero forcing number is a graph invariant introduced to study the minimum rank of the graph. In 2008, Aazami proved the NP-hardness of computing the zero forcing number of a simple undirected graph.
Delvenne, Jean-Charles, Trefois, Maguy
core +1 more source
Cluster Index Modulation for mmWave Communication Systems
In this study, a novel cluster index modulation (CIM) scheme, which is based on indexing the available clusters in the environment, is proposed for future mmWave communication systems.
Mahmoud Raeisi +3 more
doaj +1 more source

