Related papers: Joint PIC and relay selection based on greedy tech…
This paper presents joint maximum signal-to-interference-plus-noise ratio (MSINR) and relay selection algorithms for distributed beamforming. We propose a joint MSINR and restricted greedy search relay selection (RGSRS) algorithm with a…
This chapter presents joint interference suppression and power allocation algorithms for DS-CDMA and MIMO networks with multiple hops and amplify-and-forward and decode-and-forward (DF) protocols. A scheme for joint allocation of power…
This paper presents novel algorithms for multi-target direction-of-arrival (DoA) estimation in array signal processing. Although the maximum likelihood estimator (MLE) asymptotically attains the Cram\'er-Rao bound, its exponential…
Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However most of the proposed solutions require distributed space-time coding…
Index modulation schemes for reconfigurable intelligent surfaces (RIS)-assisted systems are envisioned as promising technologies for fifth-generation-advanced and sixth-generation (6G) wireless communication systems to enhance various…
We propose a greedy minimum mean squared error (MMSE)-based antenna selection algorithm for amplify-and-forward (AF) multiple-input multiple-output (MIMO) relay systems. Assuming equal-power allocation across the multi-stream data, we…
In this paper, we consider the problem of multi-relay selection for multi-stream cooperative MIMO systems with $M$ relay nodes. Traditionally, relay selection approaches are primarily focused on selecting one relay node to improve the…
Distributed optimization is pivotal for large-scale signal processing and machine learning, yet communication overhead remains a major bottleneck. Low-rank gradient compression, in which the transmitted gradients are approximated by…
In this work, we consider the problem of multiuser scheduling for the downlink of cell-free massive multi-input multi-output networks with clustering. In particular, we develop a multiuser scheduling algorithm based on an enhanced greedy…
When solving PDEs, classical numerical solvers are often computationally expensive, while machine learning methods can suffer from spectral bias, failing to capture high-frequency components. Designing an optimal hybrid iterative…
This paper proposes a unified approach to joint adaptive parameter estimation and interference cancellation (IC) for direct sequence code-division-multiple-access (DS-CDMA) systems in multipath channels. A unified framework is presented in…
This paper considers base station cooperation (BSC) strategies for the uplink of a multi-user multi-cell high frequency reuse scenario where distributed iterative detection (DID) schemes with soft/hard interference cancellation algorithms…
Several modern applications involve huge graphs and require fast answers to reachability queries. In more than two decades since first proposals, several approaches have been presented adopting on-line searches, hop labelling or transitive…
Traditional random access schemes are designed based on the aggregate process of user activation, which is created on the basis of independent activations of the users. However, in Machine-Type Communications (MTC), some users are likely to…
In this work, we propose a dynamic buffer-aided distributed space-time coding (DSTC) scheme for cooperative direct-sequence code-division multiple access systems. We first devise a relay selection algorithm that can automatically select the…
Extensive research has been done to achieve better throughput and reliability in wireless networks, with focus on multiple-input multiple-output systems. Recently, cooperative networking techniques have been investigated to increase the…
Given a set ${\cal R}=\{R_1,R_2,..., R_n\}$ of $n$ randomly positioned axis parallel rectangles in 2D, the problem of computing the minimum clique cover (MCC) and maximum independent set (MIS) for the intersection graph $G({\cal R})$ of the…
In this paper multi-user detection techniques, such as Parallel and Serial Interference Cancellations (PIC & SIC), General Minimum Mean Square Error (GMMSE) and polynomial MMSE, for the downlink of a broadband Multi-Carrier Code Division…
We present a novel geographical routing scheme for spontaneous wireless mesh networks. Greedy geographical routing has many advantages, but suffers from packet losses occurring at the border of voids. In this paper, we propose a flexible…
The famous greedy randomized Kaczmarz (GRK) method uses the greedy selection rule on maximum distance to determine a subset of the indices of working rows. In this paper, with the greedy selection rule on maximum residual, we propose the…