arXiv subjects

Taejoon Kim

Publications and source records attributed to Taejoon Kim.

65 records · Page 4Linked to original sources

arXiv2019

Sparse Subspace Decomposition for Millimeter Wave MIMO Channel Estimation

Millimeter wave multiple-input multiple-output (MIMO) communication systems must operate over sparse wireless links and will require large antenna arrays to provide high throughput. To achieve sufficient array gains, these systems must learn and adapt to the channel state conditions. However, conventional MIMO channel estimation can not be directly extended to millimeter wave due to the constraints on cost-effective millimeter wave operation imposed on the number of available RF chains. Sparse subspace scanning techniques that search for the best subspace sample from the sounded subspace samples have been investigated for channel estimation.However, the performance of these techniques starts to deteriorate as the array size grows, especially for the hybrid precoding architecture. The millimeter wave channel estimation challenge still remains and should be properly addressed before the system can be deployed and used to its full potential. In this work, we propose a sparse subspace decomposition (SSD) technique for sparse millimeter wave MIMO channel estimation. We formulate the channel estimation as an optimization problem that minimizes the subspace distance from the received subspace samples. Alternating optimization techniques are devised to tractably handle the non-convex problem. Numerical simulations demonstrate that the proposed method outperforms other existing techniques with remarkably low overhead.

eess.SP↗

arXiv2018

Two-stage Method for Millimeter Wave Channel Estimation

The millimeter wave is a promising technique for the next generation of mobile communication. The large antenna array is able to provide sufficient precoding gain to overcome the high pathloss at millimeter wave band. However, the accurate channel state information is the key for the precoding design. Unfortunately, the channel use overhead and complexity are two major challenges when estimating the channel with high-dimensional array. In this paper, we propose a two-stage approach which reduces the channel use overhead and the computational complexity. Specifically, in the first stage, we estimate the column subspace of the channel matrix. Based on the estimated column subspace, we design the training sounders to acquire the remaining coefficient matrix of the column subspace. By dividing the estimation task into two stages, the training sounders for the second stages are only targeted for the column subspace, which will save the channel uses and the computational complexity as well.

eess.SP↗

arXiv2018

Sum-rate Maximization in Sub-28 GHz Millimeter-Wave MIMO Interfering Networks

MIMO systems in the lower part of the millimeter-wave spectrum band (i.e., below 28 GHz) do not exhibit enough directivity and selectively, as their counterparts in higher bands of the spectrum (i.e., above 60 GHz), and thus still suffer from the detrimental effect of interference, on the system sum-rate. As such systems exhibit large numbers of antennas and short coherence times for the channel, traditional methods of distributed coordination are ill-suited, and the resulting communication overhead would offset the gains of coordination. In this work, we propose algorithms for tackling the sum-rate maximization problem, that are designed to address the above limitations. We derive a lower bound on the sum-rate, a so-called DLT bound (i.e., a difference of log and trace), shed light on its tightness, and highlight its decoupled nature at both the transmitters and receivers. Moreover, we derive the solution to each of the subproblems, that we dub non-homogeneous waterfilling (a variation on the MIMO waterfilling solution), and underline an inherent desirable feature: its ability to turn-off streams exhibiting low-SINR, and contribute to greatly speeding up the convergence of the proposed algorithm. We then show the convergence of the resulting algorithm, max-DLT, to a stationary point of the DLT bound. Finally, we rely on extensive simulations of various network configurations, to establish the fast-converging nature of our proposed schemes, and thus their suitability for addressing the short coherence interval, as well as the increased system dimensions, arising when managing interference in lower bands of the millimeter wave spectrum. Moreover, our results also suggest that interference management still brings about significant performance gains, especially in dense deployments.

cs.IT↗

arXiv2018

Low-Overhead Coordination in Sub-28 Millimeter-Wave Networks

In this paper, we present some contributions from our recent investigation. We address the open issue of interference coordination for sub-28 GHz millimeter-wave communication, by proposing fast-converging coordination algorithms, for dense multi-user multi-cell networks. We propose to optimize a lower bound on the network sum-rate, after investigating its tightness. The bound in question results in distributed optimization, requiring local information at each base station and user. We derive the optimal solution to the transmit and receive filter updates, that we dub non-homogeneous waterfilling, and show its convergence to a stationary point of the bound. We also underline a built-in mechanism to turn-off data streams with low-SINR, and allocate power to high-SNR streams. This "stream control" is a at the root of the fast-converging nature of the algorithm. Our numerical result conclude that low-overhead coordination offers large gains, for dense sub-$28$ GHz systems. These findings bear direct relevance to the ongoing discussions around 5G New Radio.

cs.IT↗

arXiv2016

On the Spatial Degrees of Freedom of Multicell and Multiuser MIMO Channels

We study the converse and achievability for the degrees of freedom of the multicellular multiple-input multiple-output (MIMO) multiple access channel (MAC) with constant channel coefficients. We assume L>1 homogeneous cells with K>0 users per cell where the users have M antennas and the base stations are equipped with N antennas. The degrees of freedom outer bound for this L-cell and K-user MIMO MAC is formulated. The characterized outer bound uses insight from a limit on the total degrees of freedom for the L-cell heterogeneous MIMO network. We also show through an example that a scheme selecting a transmitter and performing partial message sharing outperforms a multiple distributed transmission strategy in terms of the total degrees of freedom. Simple linear schemes attaining the outer bound (i.e., those achieving the optimal degrees of freedom) are explores for a few cases. The conditions for the required spatial dimensions attaining the optimal degrees of freedom are characterized in terms of K, L, and the number of transmit streams. The optimal degrees of freedom for the two-cell MIMO MAC are examined by using transmit zero forcing and null space interference alignment and subsequently, simple receive zero forcing is shown to provide the optimal degrees of freedom for L>1. By the uplink and downlink duality, the degrees of freedom results in this paper are also applicable to the downlink. In the downlink scenario, we study the degrees of freedom of L-cell MIMO interference channel exploring multiuser diversity. Strong convergence modes of the instantaneous degrees of freedom as the number of users increases are characterized.

cs.IT↗

arXiv2016

Subspace Estimation and Decomposition for Hybrid Analog-Digital Millimetre-Wave MIMO systems

In this work, we address the problem of channel estimation and precoding / combining for the so-called hybrid millimeter wave (mmWave) MIMO architecture. Our proposed channel estimation scheme exploits channel reciprocity in TDD MIMO systems, by using echoing, thereby allowing us to implement Krylov subspace methods in a fully distributed way. The latter results in estimating the right (resp. left) singular subspace of the channel at the transmitter (resp. receiver). Moreover, we also tackle the problem of subspace decomposition whereby the estimated right (resp. left) singular subspaces are approximated by a cascade of analog and digital precoder (resp. combiner), using an iterative method. Finally we compare our scheme with an equivalent fully digital case and conclude that a relatively similar performance can be achieved, however, with a drastically reduced number of RF chains - 4 ~ 8 times less (i.e., massive savings in cost and power consumption).

cs.IT↗

arXiv2016

Subspace Estimation and Decomposition for Large Millimeter-Wave MIMO systems

Channel estimation and precoding in hybrid analog-digital millimeter-wave (mmWave) MIMO systems is a fundamental problem that has yet to be addressed, before any of the promised gains can be harnessed. For that matter, we propose a method (based on the well-known Arnoldi iteration) exploiting channel reciprocity in TDD systems and the sparsity of the channel's eigenmodes, to estimate the right (resp. left) singular subspaces of the channel, at the BS (resp. MS). We first describe the algorithm in the context of conventional MIMO systems, and derive bounds on the estimation error in the presence of distortions at both BS and MS. We later identify obstacles that hinder the application of such an algorithm to the hybrid analog-digital architecture, and address them individually. In view of fulfilling the constraints imposed by the hybrid analog-digital architecture, we further propose an iterative algorithm for subspace decomposition, whereby the above estimated subspaces, are approximated by a cascade of analog and digital precoder / combiner. Finally, we evaluate the performance of our scheme against the perfect CSI, fully digital case (i.e., an equivalent conventional MIMO system), and conclude that similar performance can be achieved, especially at medium-to-high SNR (where the performance gap is less than 5%), however, with a drastically lower number of RF chains (4 to 8 times less).

cs.IT↗

arXiv2014

Millimeter Wave MIMO Channel Tracking Systems

We consider channel/subspace tracking systems for temporally correlated millimeter wave (e.g., E-band) multiple-input multiple-output (MIMO) channels. Our focus is given to the tracking algorithm in the non-line-of-sight (NLoS) environment, where the transmitter and the receiver are equipped with hybrid analog/digital precoder and combiner, respectively. In the absence of straightforward time-correlated channel model in the millimeter wave MIMO literature, we present a temporal MIMO channel evolution model for NLoS millimeter wave scenarios. Considering that conventional MIMO channel tracking algorithms in microwave bands are not directly applicable, we propose a new channel tracking technique based on sequentially updating the precoder and combiner. Numerical results demonstrate the superior channel tracking ability of the proposed technique over independent sounding approach in the presented channel model and the spatial channel model (SCM) adopted in 3GPP specification.

cs.IT↗

arXiv2014

Closed-Loop Beam Alignment for Massive MIMO Channel Estimation

Training sequences are designed to probe wireless channels in order to obtain channel state information for block-fading channels. Optimal training sounds the channel using orthogonal beamforming vectors to find an estimate that optimizes some cost function, such as mean square error. As the number of transmit antennas increases, however, the training overhead becomes significant. This creates a need for alternative channel estimation schemes for increasingly large transmit arrays. In this work, we relax the orthogonal restriction on sounding vectors. The use of a feedback channel after each forward channel use during training enables closed-loop sounding vector design. A misalignment cost function is introduced, which provides a metric to sequentially design sounding vectors. In turn, the structure of the sounding vectors aligns the transmit beamformer with the true channel direction, thereby increasing beamforming gain. This beam alignment scheme for massive MIMO is shown to improve beamforming gain over conventional orthogonal training for a MISO channel.

cs.IT↗

arXiv2013

Millimeter Wave Beamforming for Wireless Backhaul and Access in Small Cell Networks

Recently, there has been considerable interest in new tiered network cellular architectures, which would likely use many more cell sites than found today. Two major challenges will be i) providing backhaul to all of these cells and ii) finding efficient techniques to leverage higher frequency bands for mobile access and backhaul. This paper proposes the use of outdoor millimeter wave communications for backhaul networking between cells and mobile access within a cell. To overcome the outdoor impairments found in millimeter wave propagation, this paper studies beamforming using large arrays. However, such systems will require narrow beams, increasing sensitivity to movement caused by pole sway and other environmental concerns. To overcome this, we propose an efficient beam alignment technique using adaptive subspace sampling and hierarchical beam codebooks. A wind sway analysis is presented to establish a notion of beam coherence time. This highlights a previously unexplored tradeoff between array size and wind-induced movement. Generally, it is not possible to use larger arrays without risking a corresponding performance loss from wind-induced beam misalignment. The performance of the proposed alignment technique is analyzed and compared with other search and alignment methods. The results show significant performance improvement with reduced search time.

cs.IT↗

arXiv2011

Spatial Degrees of Freedom of the Multicell MIMO Multiple Access Channel

We consider a homogeneous multiple cellular scenario with multiple users per cell, i.e., $K\geq 1$ where $K$ denotes the number of users in a cell. In this scenario, a degrees of freedom outer bound as well as an achievable scheme that attains the degrees of freedom outer bound of the multicell multiple access channel (MAC) with constant channel coefficients are investigated. The users have $M$ antennas, and the base stations are equipped with $N$ antennas. The found outer bound is general in that it characterizes a degrees of freedom upper bound for $K\geq 1$ and $L>1$ where $L$ denotes the number of cells. The achievability of the degrees of freedom outer bound is studied for two cell case (i.e., L=2). The achievable schemes that attains the degrees of freedom outer bound for L=2 are based on two approaches. The first scheme is a simple zero forcing with $M=Kβ+β$ and $N=Kβ$, and the second approach is null space interference alignment with $M=Kβ$ and $N=Kβ+β$ where $β>0$ is a positive integer.

cs.IT↗