Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThresholds Optimization for One-Bit Feedback Multi-User Scheduling
120
0
0.0
(
0
)
Added by
Ahmed El Shafie
Publication date
2017
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We propose a new one-bit feedback scheme with scheduling decision based on the maximum expected weighted rate. We show the concavity of the $2$-user case and provide the optimal solution which achieves the maximum weighted rate of the users. For the general asymmetric M-user case, we provide a heuristic method to achieve the maximum expected weighted rate. We show that the sum rate of our proposed scheme is very close to the sum rate of the full channel state information case, which is the upper bound performance.
rate research
Read More
Flexible numerologies are being considered as part of designs for 5G systems to support vertical services with diverse requirements such as enhanced mobile broadband, ultra-reliable low-latency communications, and massive machine type communication. Different vertical services can be multiplexed in either frequency domain, time domain, or both. In this paper, we investigate the use of spatial multiplexing of services using MU-MIMO where the numerologies for different users may be different. The users are grouped according to the chosen numerology and a separate pre-coder and FFT size is used per numerology at the transmitter. The pre-coded signals for the multiple numerologies are added in the time domain before transmission. We analyze the performance gains of this approach using capacity analysis and link level simulations using conjugate beamforming and signal-to-leakage noise ratio maximization techniques. We show that the MU interference between users with different numerologies can be suppressed efficiently with reasonable number of antennas at the base-station. This feature enables MU-MIMO techniques to be applied for 5G across different numerologies.
Is it possible to obliviously construct a set of hyperplanes H such that you can approximate a unit vector x when you are given the side on which the vector lies with respect to every h in H? In the sparse recovery literature, where x is approximately k-sparse, this problem is called one-bit compressed sensing and has received a fair amount of attention the last decade. In this paper we obtain the first scheme that achieves almost optimal measurements and sublinear decoding time for one-bit compressed sensing in the non-uniform case. For a large range of parameters, we improve the state of the art in both the number of measurements and the decoding time.
This paper introduces a novel approach of utilizing the reconfigurable intelligent surface (RIS) for joint data modulation and signal beamforming in a multi-user downlink cellular network by leveraging the idea of backscatter communication. We present a general framework in which the RIS, referred to as modulating intelligent surface (MIS) in this paper, is used to: i) beamform the signals for a set of users whose data modulation is already performed by the base station (BS), and at the same time, ii) embed the data of a different set of users by passively modulating the deliberately sent carrier signals from the BS to the RIS. To maximize each users spectral efficiency, a joint non-convex optimization problem is formulated under the sum minimum mean-square error (MMSE) criterion. Alternating optimization is used to divide the original joint problem into two tasks of: i) separately optimizing the MIS phase-shifts for passive beamforming along with data embedding for the BS- and MIS-served users, respectively, and ii) jointly optimizing the active precoder and the receive scaling factor for the BS- and MIS-served users, respectively. While the solution to the latter joint problem is found in closed-form using traditional optimization techniques, the optimal phase-shifts at the MIS are obtained by deriving the appropriate optimization-oriented vector approximate message passing (OOVAMP) algorithm. Moreover, the original joint problem is solved under both ideal and practical constraints on the MIS phase shifts, namely, the unimodular constraint and assuming each MIS element to be terminated by a variable reactive load. The proposed MIS-assisted scheme is compared against state-of-the-art RIS-assisted wireless communication schemes and simulation results reveal that it brings substantial improvements in terms of system throughput while supporting a much higher number of users.
An energy-efficient opportunistic collaborative beamformer with one-bit feedback is proposed for ad hoc sensor networks over Rayleigh fading channels. In contrast to conventional collaborative beamforming schemes in which each source node uses channel state information to correct its local carrier offset and channel phase, the proposed beamforming scheme opportunistically selects a subset of source nodes whose received signals combine in a quasi-coherent manner at the intended receiver. No local phase-precompensation is performed by the nodes in the opportunistic collaborative beamformer. As a result, each node requires only one-bit of feedback from the destination in order to determine if it should or shouldnt participate in the collaborative beamformer. Theoretical analysis shows that the received signal power obtained with the proposed beamforming scheme scales linearly with the number of available source nodes. Since the the optimal node selection rule requires an exhaustive search over all possible subsets of source nodes, two low-complexity selection algorithms are developed. Simulation results confirm the effectiveness of opportunistic collaborative beamforming with the low-complexity selection algorithms.
In this paper, we consider an unmanned aerial vehicle (UAV) enabled relaying system where multiple UAVs are deployed as aerial relays to support simultaneous communications from a set of source nodes to their destination nodes on the ground. An optimization problem is formulated under practical channel models to maximize the minimum achievable expected rate among all pairs of ground nodes by jointly designing UAVs three-dimensional (3D) placement as well as the bandwidth-and-power allocation. This problem, however, is non-convex and thus difficult to solve. As such, we propose a new method, called iterative Gibbs-sampling and block-coordinate-descent (IGS-BCD), to efficiently obtain a high-quality suboptimal solution by synergizing the advantages of both the deterministic (BCD) and stochastic (GS) optimization methods. Specifically, our proposed method alternates between two optimization phases until convergence is reached, namely, one phase that uses the BCD method to find locally-optimal UAVs 3D placement and the other phase that leverages the GS method to generate new UAVs 3D placement for exploration. Moreover, we present an efficient method for properly initializing UAVs placement that leads to faster convergence of the proposed IGS-BCD algorithm. Numerical results show that the proposed IGS-BCD and initialization methods outperform the conventional BCD or GS method alone in terms of convergence-and-performance trade-off, as well as other benchmark schemes.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
