3,617 research outputs found
Robust Transceiver Design Based on Interference Alignment for Multi-User Multi-Cell MIMO Networks with Channel Uncertainty
In this paper, we firstly exploit the inter-user interference (IUI) and
inter-cell interference (ICI) as useful references to develop a robust
transceiver design based on interference alignment for a downlink multi-user
multi-cell multiple-input multiple-output (MIMO) interference network under
channel estimation error. At transmitters, we propose a two-tier transmit
beamforming strategy, we first achieve the inner beamforming direction and
allocated power by minimizing the interference leakage as well as maximizing
the system energy efficiency, respectively. Then, for the outer beamformer
design, we develop an efficient conjugate gradient Grassmann manifold subspace
tracking algorithm to minimize the distances between the subspace spanned by
interference and the interference subspace in the time varying channel. At
receivers, we propose a practical interference alignment based on fast and
robust fast data projection method (FDPM) subspace tracking algorithm, to
achieve the receive beamformer under channel uncertainty. Numerical results
show that our proposed robust transceiver design achieves better performance
compared with some existing methods in terms of the sum rate and the energy
efficiency.Comment: 12 pages, 8 figure
Robust Reduced-Rank Adaptive Processing Based on Parallel Subgradient Projection and Krylov Subspace Techniques
In this paper, we propose a novel reduced-rank adaptive filtering algorithm
by blending the idea of the Krylov subspace methods with the set-theoretic
adaptive filtering framework. Unlike the existing Krylov-subspace-based
reduced-rank methods, the proposed algorithm tracks the optimal point in the
sense of minimizing the \sinq{true} mean square error (MSE) in the Krylov
subspace, even when the estimated statistics become erroneous (e.g., due to
sudden changes of environments). Therefore, compared with those existing
methods, the proposed algorithm is more suited to adaptive filtering
applications. The algorithm is analyzed based on a modified version of the
adaptive projected subgradient method (APSM). Numerical examples demonstrate
that the proposed algorithm enjoys better tracking performance than the
existing methods for the interference suppression problem in code-division
multiple-access (CDMA) systems as well as for simple system identification
problems.Comment: 10 figures. In IEEE Transactions on Signal Processing, 201
Underdetermined-order recursive least-squares adaptive filtering: The concept and algorithms
Published versio
R3MC: A Riemannian three-factor algorithm for low-rank matrix completion
We exploit the versatile framework of Riemannian optimization on quotient
manifolds to develop R3MC, a nonlinear conjugate-gradient method for low-rank
matrix completion. The underlying search space of fixed-rank matrices is
endowed with a novel Riemannian metric that is tailored to the least-squares
cost. Numerical comparisons suggest that R3MC robustly outperforms
state-of-the-art algorithms across different problem instances, especially
those that combine scarcely sampled and ill-conditioned data.Comment: Accepted for publication in the proceedings of the 53rd IEEE
Conference on Decision and Control, 201
Reduced-Rank STAP Schemes for Airborne Radar Based on Switched Joint Interpolation, Decimation and Filtering Algorithm
In this paper, we propose a reduced-rank space-time adaptive processing (STAP) technique for airborne phased array radar applications. The proposed STAP method performs dimensionality reduction by using a reduced-rank switched joint interpolation, decimation and filtering algorithm (RR-SJIDF). In this scheme, a multiple-processing-branch (MPB) framework, which contains a set of jointly optimized interpolation, decimation and filtering units, is proposed to adaptively process the observations and suppress jammers and clutter. The output is switched to the branch with the best performance according to the minimum variance criterion. In order to design the decimation unit, we present an optimal decimation scheme and a low-complexity decimation scheme. We also develop two adaptive implementations for the proposed scheme, one based on a recursive least squares (RLS) algorithm and the other on a constrained conjugate gradient (CCG) algorithm. The proposed adaptive algorithms are tested with simulated radar data. The simulation results show that the proposed RR-SJIDF STAP schemes with both the RLS and the CCG algorithms converge at a very fast speed and provide a considerable SINR improvement over the state-of-the-art reduced-rank schemes
- …