Results 271 to 280 of about 1,064,288 (288)

On sparse multimode zero forcing transceivers

2015 IEEE International Conference on Digital Signal Processing (DSP), 2015
This paper introduces sparse multimode zero forcing transceivers in which a combination of l 1 -norm minimization and the Farrow structure allows efficient low-cost channel equalization. Specifically, the Farrow structure (i) realizes multimode pulse shaping filters, and (ii) equalizes the amplitude distortion. The phase distortion is equalized using a
openaire   +1 more source

The Complexity of the Positive Semidefinite Zero Forcing

2014
The positive zero forcing number of a graph is a graph parameter that arises from a non-traditional type of graph colouring, and is related to a more conventional version of zero forcing. We establish a relation between the zero forcing and the fast-mixed searching, which implies some NP-completeness results for the zero forcing problem.
Shaun M. Fallat, Karen Meagher, Boting Yang   +2 more
openaire   +1 more source

The Performance of Zero Forcing DSL Systems

IEEE Signal Processing Letters, 2013
DSL systems use multi-channel processing to mitigate the electromagnetic coupling between the wires in a binder and provide high data rates to multiple users. In recent years, most multichannel processing for DSL had focused on zero-forcing (ZF) processing that was proven to be near optimal.
Itsik Bergel, Amir Leshem
openaire   +2 more sources

Zero forcing of generalized hierarchical products

Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sarah E. Anderson, Brenda K. Kroschel
openaire   +1 more source

On Zero Forcing Number of Permutation Graphs

2012
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)\!\setminus\!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 black if it is the only white neighbor of a black vertex.
openaire   +2 more sources

Failed zero forcing

Given a graph G, a set S ⊆ V (G) is called a zero forcing set if repeatedly applying the following colour change rule results in all vertices of G being coloured black: if a black vertex v has exactly one white neighbour u, then u becomes black. The zero forcing number Z(G) is the size of the smallest zero forcing set of G.
openaire   +1 more source

Force Application in Simulated Zero Gravity

Human Factors: The Journal of the Human Factors and Ergonomics Society, 1969
Utilizing zero-gravity simulation techniques, six subjects provided basic force exertion data under various conditions of personnel restraints, worksite geometry, and type and direction of forces to be exerted. All data reported were collected with subjects wearing Apollo suits pressurized to 3.5 psig.
openaire   +2 more sources

All Graphs With a Failed Zero Forcing Number of Two

Symmetry, 2021
Darren A Narayan
exaly  

Computational Approaches for Zero Forcing and Related Problems

European Journal of Operational Research, 2019
Illya V. Hicks, Boris Brimkov, Caleb C Fast   +2 more
exaly  

Effects of Vertex Degrees on the Zero-Forcing Number and Propagation Time of a Graph

Discrete Applied Mathematics, 2018
Illya V. Hicks, Caleb C Fast
exaly