16 April 2018 in IEEE Signal Processing Letters
Interference during the uplink training phase significantly deteriorates the performance of a massive MIMO system. The impact of the interference can be reduced by exploiting second order statistics of the channel vectors, e.g., to obtain minimum mean squared error estimates of the channel. In practice, the channel covariance matrices have to be estimated. The estimation of the covariance matrices is also impeded by the interference during the training phase. However, the coherence interval of the covariance matrices is larger than that of the channel vectors. This allows us to derive methods for accurate covariance matrix estimation by appropriate assignment of pilot sequences to users in consecutive channel coherence intervals. To keep the computational complexity in check, we exploit common structure of the covariance matrices.
4 October 2024 in IEEE Wireless Communications Letters
This letter proposes a novel channel estimator based on dm, one of the currently top-rated generative models, with provable convergence to the mse-optimal estimator. A lightweight cnn with positional embedding of the snr information is designed to learn the channel distribution in the sparse angular domain. Combined with an estimation strategy that avoids stochastic resampling and truncates reverse diffusion steps that account for lower snr than the given pilot observation, the resulting dm estimator unifies low complexity and memory overhead. Numerical results exhibit better performance than state-of-the-art estimators.
21 May 2007 in IEEE Transactions on Signal Processing
We study computationally efficient spatial multiplexing transmission techniques aiming at high spectral efficiency. Two nonlinear transmission schemes based on the minimum mean-squared error criterion are considered in this paper: a detection scheme also known as V-BLAST and a precoding scheme called Tomlinson-Harashima precoding. The nonlinear techniques are known to be more powerful than simple linear filters, however, a large complexity overhead results. Initial proposals for the nonlinear schemes require the complexity proportional to N4 if the number of data streams is denoted by N. We propose to apply Cholesky factorization with symmetric permutation for finding a very simple and efficient algorithm that reduces the complexity by a factor of N. We conclude that the large performance advantage of the nonlinear detection and precoding schemes against their simple linear alternatives can be obtained without complexity overhead
6 June 2024 in IEEE Wireless Communications Letters
Reconfigurable intelligent surfaces (RISs) are an emerging technology for engineering the channels of future wireless communication systems. The vast majority of research publications on RIS are focussing on system-level optimization and are based on very simplistic models ignoring basic physical laws. There are only a few publications with a focus on physical modeling. Nevertheless, the widely employed model is still inconsistent with basic physical laws. We will show that even with a very simple abstract model based on isotropic radiators, ignoring any mismatch, mutual coupling, and losses, each RIS element cannot be modeled to simply reflect the incident signal by manipulating its phase only and letting the amplitude unchanged. We will demonstrate the inconsistencies with the aid of very simple toy examples, even with only one or two RIS elements. Based on impedance parameters, the problems associated with scattering parameters can be identified enabling a correct interpretation of the derived solutions.
12 January 2010 in IEEE Transactions on Signal Processing
Achieving the boundary of the capacity region in the multiple-input multiple-output (MIMO) broadcast channel requires the use of dirty paper coding (DPC). As practical nearly optimum implementations of DPC are computationally complex, purely linear approaches are often used instead. However, in this case, the problem of maximizing a weighted sum rate constitutes a nonconvex and, in most cases, also a combinatorial optimization problem. In this paper, we present two heuristic nearly optimum algorithms with reduced computational complexity. For this purpose, a lower bound for the weighted sum rate under linear zero-forcing constraints is used. Based on this bound, both greedy algorithms successively allocate data streams to users. In each step, the user is determined that is given an additional data stream such that the increase in weighted sum rate becomes maximum. Thereby, the data stream allocations and filters obtained in the previous steps are kept fixed and only the filter corresponding to the additional data stream is optimized. The first algorithm determines the receive and transmit filters directly in the downlink. The other algorithm operates in the dual uplink, from which the downlink transmit and receive filters can be obtained via the general rate duality leading to nonzero-forcing in the downlink. Simulation results reveal marginal performance losses compared to more complex algorithms.
21 May 2018 in IEEE Transactions on Signal Processing
We present a novel approach for low-complexity equalizer design well-suited for cellular massive MIMO systems. Our design allows to exploit the channel structure in terms of covariance matrices to improve the performance in the face of pilot-contamination, while basically keeping the complexity of a matched filter. This is achieved by restricting the equalizer to functions which are bilinear in the received data signals and the observations from a training phase. The proposed design generalizes several previous approaches to equalizer design for massive MIMO. We show by asymptotic analysis that with the proposed design the achievable rate grows without bound for growing numbers of antennas even in the presence of pilot-contamination. We demonstrate with numerical results that the proposed design is competitive with more complex approaches in a practical cellular setup.