Results 31 to 40 of about 446,887 (277)
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
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
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
Exact MIMO Zero-Forcing Detection Analysis for Transmit-Correlated Rician Fading [PDF]
, 2014 We analyze the performance of multiple input/multiple output (MIMO) communications systems employing spatial multiplexing and zero-forcing detection (ZF).
Blostein, Steven +5 more
core +1 more source
Topological and Graph-coloring Conditions on the Parameter-independent Stability of Second-order Networked Systems [PDF]
, 2017 In this paper, we study parameter-independent stability in qualitatively heterogeneous passive networked systems containing damped and undamped nodes.
Bürger, Mathias +3 more
core +2 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
Tellus: Series A, Dynamic Meteorology and Oceanography, 2022 This paper considers a dynamical system described by a multidimensional state vector x. A component 'x' of x evolves according to 'dx/dt = f'(x). Equilibrium fluctuations are fluctuations of an equilibrium solution x('t') obtained when the system is in ...
Jin-Song von Storch
doaj +1 more source
Zero forcing in iterated line digraphs
, 2018 Zero forcing is a propagation process on a graph, or digraph, defined in linear algebra to provide a bound for the minimum rank problem. Independently, zero forcing was introduced in physics, computer science and network science, areas where line ...
Ferrero, Daniela +2 more
core +1 more source
Rigid Linkages and Partial Zero Forcing
The Electronic Journal of Combinatorics, 2019 Connections between vital linkages and zero forcing are established. Specifically, the notion of a rigid linkage is introduced as a special kind of unique linkage and it is shown that spanning forcing paths of a zero forcing process form a spanning rigid linkage and thus a vital linkage.
Ferrero, Daniela +7 more
openaire +5 more sources
The zero forcing polynomial of a graph
, 2018 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