arXiv subjects

Constantinos B. Papadias

Publications and source records attributed to Constantinos B. Papadias.

23 records · Page 2Linked to original sources

arXiv2014

Precoding for Multiuser MIMO Systems with Single-Fed Parasitic Antenna Arrays

Transmitter (TX) cooperation at various levels has been shown to increase the sum throughput of multiuser multiple-input multiple-output (MIMO) systems. In this paper we consider a K-user MIMO system where TXs have only global channel state knowledge. It has been theoretically shown that interference alignment (IA) achieves the K/2 degrees of freedom of this K-user MIMO interference channel. However, results on IA and all proposed transceiver techniques for this channel up to date, assume conventional antenna arrays at the transceivers with multiple radio-frequency (RF) chains, each connected to a different antenna element. To reduce the consequent hardware burden and power dissipation imposed by such arrays, we propose in this paper the utilization of compact single-RF electronically steerable parasitic (passive) array radiators (ESPARs) at the cooperating TXs. A signal model capable of capturing the characteristics of the considered antenna arrays is first described and then a general precoding design methodology for the tunable parasitic loads at the TXs' ESPARs is introduced. Specific precoding techniques and an indicative ESPAR design are presented for a 3-user 2x2 MIMO system with one ESPAR TX, and the obtained performance evaluation results show that the gains of TX cooperation are still feasible.

cs.IT↗

arXiv2014

Massive Antenna Arrays with Low Front-End Hardware Complexity: An Enabling Technology for the Emerging Small Cell and Distributed Network Architectures

This paper presents the current state-of-the-art of massive antenna array architectures with significant front-end hardware savings, as an enabler for future small and powerful cell nodes that will be able to carry massive MIMO technology. Radio frequency (RF) hardware architectures with a single power amplifier are reviewed, compared, and found superior to conventional MIMO implementations in terms of cost, dissipated heat, and physical size. This progress on the RF-side allows to merge the two competing cellular concepts of virtual and massive MIMO into a hybrid approach of remote radio heads with massive MIMO arrays.

cs.NI↗

arXiv2013

A Reconfigurable Distributed Algorithm for K-user MIMO Interference Networks

It is already well-known that interference alignment (IA) achieves the sum capacity of the K-user interference channel at the high interference regime. On the other hand, it is intuitively clear that when the interference levels are very low, a sum-rate scaling of K (as opposed to K/2 for IA) should be accessed at high signal-to-noise ratio values by simple ("myopic") single-link multiple-input multiple-output (MIMO) techniques such as waterfilling. Recent results have indicated that in certain low-to-moderate interference cases, treating interference as noise may in fact be preferable. In this paper, we present a distributed iterative algorithm for K-user MIMO interference networks which attempts to adjust itself to the interference regime at hand, in the above sense, as well as to the channel conditions. The proposed algorithm combines the system-wide mean squared error minimization with the waterfilling solution to adjust to the interference levels and channel conditions and maximize accordingly each user's transmission rate. Sum-rate computer simulations for the proposed algorithm over Ricean fading channels show that, in the interference-limited regime, the proposed algorithm reconfigures itself in order to achieve the IA scaling whereas, in the low-to-moderate interference regime, it leads itself towards interference-myopic MIMO transmissions.

cs.IT↗

arXiv2011

Interference Alignment: A one-sided approach

Interference Alignment (IA) is the process of designing signals in such a way that they cast overlapping shadows at their unintended receivers, while remaining distinguishable at the intended ones. Our goal in this paper is to come up with an algorithm for IA that runs at the transmitters only (and is transparent to the receivers), that doesn't require channel reciprocity, and that alleviates the need to alternate between the forward and reverse network as is the case in Distributed IA (Gomadam, Cadambe, Jafar 08'), thereby inducing significant overhead in certain environments where the channel changes frequently. Most importantly, our effort is focused on ensuring that this one-sided approach does not degrade the performance of the system w.r.t. Distributed IA (since it cannot improve it). As a first step, we model the interference in each receiver's desired signal as a function of the transmitters' beamforming vectors. We then propose a simple steepest descent (SD) algorithm and use it to minimize the interference in each receiver's desired signal space. We mathematically establish equivalences between our approach and the Distributed IA algorithm (Gomadam, Cadambe, Jafar 08') and show that our algorithm also converges to an alignment solution (when the solution is feasible).

cs.IT↗

arXiv2007

Space-time codes with controllable ML decoding complexity for any number of transmit antennas

We construct a class of linear space-time block codes for any number of transmit antennas that have controllable ML decoding complexity with a maximum rate of 1 symbol per channel use. The decoding complexity for $M$ transmit antennas can be varied from ML decoding of $2^{\lceil \log_2M \rceil -1}$ symbols together to single symbol ML decoding. For ML decoding of $2^{\lceil \log_2M \rceil - n}$ ($n=1,2,...$) symbols together, a diversity of $\min(M,2^{\lceil \log_2M \rceil-n+1})$ can be achieved. Numerical results show that the performance of the constructed code when $2^{\lceil \log_2M \rceil-1}$ symbols are decoded together is quite close to the performance of ideal rate-1 orthogonal codes (that are non-existent for more than 2 transmit antennas).

cs.IT↗