Results 101 to 110 of about 3,638,652 (319)
Degrees of Freedom of the 3-User Rank-Deficient MIMO Interference Channel
, 2014 We provide the degrees of freedom (DoF) characterization for the $3$-user $M_T\times M_R$ multiple-input multiple-output (MIMO) interference channel (IC) with \emph{rank-deficient} channel matrices, where each transmitter is equipped with $M_T$ antennas ...
Guan, Yong Liang +4 more
core +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective People with epilepsy (PWE) may experience cognitive deficits but fail to undergo formal evaluation. This study compares cognitive status between PWE and healthy controls in the West African Republic of Guinea. Methods A cross‐sectional, case–control study was conducted in sequential recruitment phases (July 2024–July 2025) at Ignace ...
Maya L. Mastick +14 more
wiley +1 more source
Five‐Year Disease Progression in Synuclein Seeding Positive Sporadic Parkinson's Disease
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To provide a comprehensive description of disease progression in synuclein seeding assay (SAA) positive sporadic Parkinson Disease participants, using Neuronal Synuclein Disease integrated biological and functional impairment staging framework.
Paulina Gonzalez‐Latapi +19 more
wiley +1 more source
Zero Forcing Sets for Graphs [PDF]
, 2013 For any simple graph $G$ on $n$ vertices, the (positive semi-definite) minimum rank of $G$ is defined to be the smallest possible rank among all (positive semi-definite) real symmetric $n\times n$ matrices whose entry in position $(i,j)$, for $i\neq j$, is non-zero if $ij$ is an edge in $G$ and zero otherwise. Also, the (positive semi-definite) maximum
openaire +3 more sources
Downlink Assisted Uplink Zero Forcing for TDD Multiuser MIMO Systems
EURASIP Journal on Wireless Communications and Networking, 2009 This paper proposes practical coordinated linear transmit-receive processing schemes for the uplink (UL) of multiuser multiple-input multiple-output (MIMO) systems in the time division duplex (TDD) mode.
Komulainen Petri +3 more
doaj +2 more sources
Recognizable Languages of k-Forcing Automata
Mathematical and Computational ApplicationsIn this study, we show that automata theory is also a suitable tool for analyzing a more complex type of the k-forcing process. First, the definition of k-forcing automata is presented according to the definition of k-forcing for graphs.
Marzieh Shamsizadeh +3 more
doaj +1 more source
Functional Split of Zero-Forcing Based Massive MIMO for Fronthaul Load Reduction
IEEE Access, 2018 The evolution towards centralized radio access network (C-RAN) for 5G is driven by the need for improved network performance and reduced total-cost-of-ownership (TCO). In C-RAN, physically separated remote radio units (RRUs) and baseband units (BBUs) are
Yezi Huang +3 more
doaj +1 more source
Investigating Performance Zero-Forcing of Source Weighting Matrix in MIMO Relay Communication [PDF]
, 2015 In this paper, we study the zero forcing (ZF) algorithm fora two hop multiple-input multiple-output (MIMO) relaycommunication system consisting of one source node, onerelay node, and one destination node.
Arungla\u27bi, R. (Rismawaty) +1 more
core
Irredundance has been studied in the context of dominating sets, via the concept of private neighbor. Here irredundance of zero forcing sets is introduced via the concept of a private fort and the upper and lower zero forcing irrdedundance numbers $\mbox{ZIR}(G)$ and $\mbox{zir}(G)$ are defined.
Curtis, Bryan A. +2 more
openaire +2 more sources
Grundy domination and zero forcing in Kneser graphs
Ars Math. Contemp., 2019 In this paper, we continue the investigation of different types of (Grundy) dominating sequences. We consider four different types of Grundy domination numbers and the related zero forcing numbers, focusing on these numbers in the well-known class of ...
B. Brešar, Tim Kos, P. Torres
semanticscholar +1 more source