Results 31 to 40 of about 3,656,389 (294)
Optimization of the Receiving Orientation Angle for Zero-Forcing Precoding in VLC
We study the performance of linear zero-forcing (ZF) precoding in multiuser multiple-input single-output visible light communications (VLC) when we are able to select the receiving orientation angle (ROA) of each user. For radio-frequency communications,
Máximo Morales-Céspedes +2 more
semanticscholar +1 more source
In this paper, we study minimal (with respect to inclusion) zero forcing sets. We first investigate when a graph can have polynomially or exponentially many distinct minimal zero forcing sets. We also study the maximum size of a minimal zero forcing set $\overline{\operatorname{Z}}(G)$, and relate it to the zero forcing number $\operatorname{Z}(G ...
Brimkov, Boris, Carlson, Joshua
openaire +3 more sources
On zero forcing number of graphs and their complements [PDF]
The 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)\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 to a black vertex if it is the only white neighbor of a black vertex.
Linda Eroh, Cong X. Kang, Eunjeong Yi
openaire +3 more sources
Zero-Forcing-Based Downlink Virtual MIMO–NOMA Communications in IoT Networks [PDF]
To support massive connectivity and boost spectral efficiency for Internet of Things (IoT), a downlink scheme combining virtual multiple-input–multiple-output (MIMO) and nonorthogonal multiple access (NOMA) is proposed. All the single-antenna IoT devices
Zheng Shi +6 more
semanticscholar +1 more source
Signed zero forcing number and controllability for a networks system with a directed hypercube [PDF]
The controllability for complex network system is to find the minimum number of leaders for the network system to achieve effective control of the global networks.
Mou Gufang, Zhang Qiuyan
doaj +1 more source
Throttling for Zero Forcing and Variants [PDF]
17 pages, 4 ...
openaire +3 more sources
Zero-forcing in random regular graphs
The zero forcing process is an iterative graph colouring process in which at each time step a coloured vertex with a single uncoloured neighbour can force this neighbour to become coloured.
Deepak Bal +4 more
semanticscholar +1 more source
Improved Signal Detection Techniques for QOSTBC System in Fast Fading Channel
Most existing quasi-orthogonal space time block coding (QO-STBC) schemes have been developed relying on the assumption that the channel is flat or remains static during the length of the code word symbol periods to achieve an optimal antenna diversity ...
Jyoti Prasanna Patra, Poonam Singh
doaj +1 more source
Impulse noise is the major factor degrading the performance of the wireless system, imposing the need for the impulse noise mitigation strategy. Mainly, in the multiple-input multiple-output (MIMO) and orthogonal frequency-division multiplexing (OFDM ...
S. P. Girija, Rameshwar Rao
doaj +1 more source
Zero forcing in Benzenoid network
A set S of vertices in a graph G is called a dominating set of G if every vertex in V (G)\S is adjacent to some vertex in S. A set S is said to be a power dominating set of G if every vertex in the system is monitored by the set S following a set of rules for power system monitoring.
Anitha, J., Rajasingh, Indra
openaire +3 more sources

