Results 81 to 90 of about 3,638,652 (319)
Performance Analysis of Optimum Zero-Forcing Beamforming with Greedy User Selection
, 2012 In this letter, an exact performance analysis is presented on the sum rate of zero-forcing beamforming with a greedy user scheduling algorithm in a downlink system.
Ozyurt, Serdar, Torlak, Murat
core +1 more source
FEBS Open Bio, EarlyView.Amino acids sequence of two different proteins with the same sequence (chameleon sequence—black boxes) represent in 3D structure of the proteins different secondary structures: HHHH—helical and BBB—Beta‐structural. The chains folded in water environment adopt different III‐order structures in which the chameleon fragments appear to adopt similar status
Irena Roterman +4 more
wiley +1 more source
A Scheduling Scheme for Improving the Performance and Security of MU-MIMO Systems
Sensors, 2022 For the receiver of multiple-input multiple-output (MIMO) systems, linear detectors are an interesting option due to their good performance and low complexity. Nevertheless, MIMO systems lose diversity in exchange for eliminating interference when linear
Henry Carvajal +5 more
doaj +1 more source
On the Uplink Throughput of Zero Forcing in Cell-Free Massive MIMO With Coarse Quantization [PDF]
IEEE Transactions on Vehicular Technology, 2018 The recently proposed cell-free massive multiple input multiple output (MIMO) architecture is studied for the uplink. In contrast to most previous works, joint detection is performed using global channel state information (CSI).
Dick Maryopi, M. Bashar, A. Burr
semanticscholar +1 more source
Aging and Cancer, EarlyView.ABSTRACT As global populations age, cancer is increasingly becoming a leading cause of morbidity and mortality among older adults, particularly in low‐ and middle‐income countries (LMICs). Despite accounting for the majority of new cancer cases and deaths, older individuals remain underrepresented in cancer research, clinical guidelines, and health ...
Ibrahim Bidemi Abdullateef +2 more
wiley +1 more source
A Short Proof for a Lower Bound on the Zero Forcing Number
Discussiones Mathematicae Graph Theory, 2020 We provide a short proof of a conjecture of Davila and Kenter concerning a lower bound on the zero forcing number Z(G) of a graph G. More specifically, we show that Z(G) ≥ (g − 2)(δ − 2) + 2 for every graph G of girth g at least 3 and minimum degree δ at
Fürst Maximilian, Rautenbach Dieter
doaj +1 more source
Upper bounds on the k-forcing number of a graph [PDF]
, 2014 Given a simple undirected graph $G$ and a positive integer $k$, the $k$-forcing number of $G$, denoted $F_k(G)$, is the minimum number of vertices that need to be initially colored so that all vertices eventually become colored during the discrete ...
Amos, David +3 more
core
Network Deployment for Maximal Energy Efficiency in Uplink with Zero-Forcing
, 2017 This work aims to design a cellular network for maximal energy efficiency (EE). In particular, we consider the uplink with multi-antenna base stations and assume that zero- forcing (ZF) combining is used for data detection with imperfect channel state ...
Björnson, Emil +3 more
core +1 more source
Cell-free massive MIMO: Zero forcing and conjugate beamforming receivers
Journal of Communications and Networks, 2019 In this paper, the uplink performance of cell-free massive multi-input multi-output (mMIMO) system with the zero-forcing (ZF) and conjugate beamforming (CB) receivers is investigated.
Yao Zhang +3 more
semanticscholar +1 more source
Downlink Spectral Efficiency of Cell-Free Massive MIMO with Full-Pilot Zero-Forcing [PDF]
IEEE Global Conference on Signal and Information Processing, 2018 Cell-free Massive multiple-input multiple-output (MIMO) ensures ubiquitous communication at high spectral efficiency (SE) thanks to increased macro-diversity as compared cellular communications.
Giovanni Interdonato +3 more
semanticscholar +1 more source