Results 131 to 140 of about 3,661 (180)
Some of the next articles are maybe not open access.
Efficient computation of effective SINR
2012 46th Annual Conference on Information Sciences and Systems (CISS), 2012In this paper we analyze the link-to-system interface for MIMO-OFDM system level simulations and propose a computationally efficient method for calculation of the effective SINR. The accuracy of the proposed fast approximation of the effective SINR is evaluated both analytically with error bound estimation and by simulated BLER performance comparison ...
Alexandra Oborina +3 more
openaire +1 more source
Distributed beamformer design under mixed SINR balancing and SINR-target-constraints
2015 IEEE International Conference on Digital Signal Processing (DSP), 2015This work outlines how mixed quality-of-service (QoS) optimization in multi-cell coordinated beamforming (MCBF) can be effectively implemented using distributed algorithms. An alternating direction method of multipliers (ADMM) based algorithm has been adopted to provide distributed beamformer design based on the joint signal-to-interference-plus-noise ...
Bokamoso Basutli +1 more
openaire +1 more source
Anaerobe, 2019 Clostridioides difficile is a Gram-positive, anaerobic bacterium. It is known that C. difficile is one of the major causes of antibiotic associated diarrhea. The enhanced antibiotic resistance observed in C. difficile is the result of highly resistant spores produced by the bacterium.
Revathi Govind +1 more
exaly +4 more sources
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019
We develop randomized distributed algorithms for many of the most fundamental communication problems in the wireless SINR model, including (multi-message) broadcast, local broadcast, coloring, MIS, and aggregation. The complexity of the algorithms is optimal up to polylogarithmic preprocessing time. It shows -- contrary to expectation -- that the plain
Magnús M. Halldórsson, Tigran Tonoyan
openaire +1 more source
We develop randomized distributed algorithms for many of the most fundamental communication problems in the wireless SINR model, including (multi-message) broadcast, local broadcast, coloring, MIS, and aggregation. The complexity of the algorithms is optimal up to polylogarithmic preprocessing time. It shows -- contrary to expectation -- that the plain
Magnús M. Halldórsson, Tigran Tonoyan
openaire +1 more source
2014 IEEE Wireless Communications and Networking Conference (WCNC), 2014
We propose a coordinated multicell beamformer design method based on the signal-to-interference-plus-noise ratios (SINRs) balancing technique within the context of mixed quality of services (QoS). Instead of attaining an overall balance of SINRs to all users in all cells, the proposed algorithm allows a specific subset of users in each cells to achieve
Yu Wu +2 more
openaire +1 more source
We propose a coordinated multicell beamformer design method based on the signal-to-interference-plus-noise ratios (SINRs) balancing technique within the context of mixed quality of services (QoS). Instead of attaining an overall balance of SINRs to all users in all cells, the proposed algorithm allows a specific subset of users in each cells to achieve
Yu Wu +2 more
openaire +1 more source
Maximum SINR beamforming for correlated sources
1995 International Conference on Acoustics, Speech, and Signal Processing, 2002We consider the signal-to-interference plus noise ratio (SINR) performance of several beamforming algorithms, taking particular account of the contribution of sources correlated with the desired signal. In addition, we derive an optimal method that maximizes SINR by combining with the desired signal estimate any components of the interference ...
Jiankan Yang, A. Lee Swindlehurst
openaire +1 more source
Distributed Node Coloring in the SINR Model
2010 IEEE 30th International Conference on Distributed Computing Systems, 2010Given a palette P of at most ξ colors, and a parameter d, a (d,ξ)-coloring of a graph is an assignment of a color from the palette P to every node in the graph such that any two nodes at distance at most d have different colors. We prove that for every n-node unit disk graph with maximum degree Δ, there exists a distributed algorithm computing a (1,O(Δ)
Derbel, Bilel, Talbi, El-Ghazali
openaire +2 more sources
Structure and algorithms in the SINR wireless model
ACM SIGACT News, 2010The signal-to-interference & noise ratio (SINR) model is one of the most commonly studied physical (or fading channel) models for wireless networks. We survey some recent studies aiming at achieving a better understanding of the SINR model and its structural properties and developing efficient design algorithms and communication protocols for it.
Zvi Lotker, David Peleg
openaire +1 more source
Distributed power control in the SINR model
2011 Proceedings IEEE INFOCOM, 2011The power control problem for wireless networks in the SINR model requires determining the optimal power assignment for a set of communication requests such that the SINR threshold is met for all receivers. If the network topology is known to all participants, then it is possible to compute an optimal power assignment in polynomial time.
Zvi Lotker +3 more
openaire +1 more source
Downlink SINR distribution in a heterogeneous cellular wireless network with max-SINR connectivity
2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2011Recent results [1], [2] on the distribution of the downlink SINR in heterogeneous wireless networks assume that the serving base station (BS) for a given user (UE) location is either (a) the BS that is geographically nearest to the UE location [1], or (b) the one that has the highest received power at the UE location [2].
openaire +1 more source