arXiv subjects

Namyoon Lee

Publications and source records attributed to Namyoon Lee.

At least 91 records · Page 5Linked to original sources

arXiv2018

Soft-Output Detection Methods for Sparse Millimeter Wave MIMO Systems with Low-Precision ADCs

The use of low-precision analog-to-digital converters (ADCs) is a low-cost and power-efficient solution for a millimeter wave (mmWave) multiple-input multiple-output (MIMO) system operating at sampling rates higher than a few Gsample/sec. This solution, however, can make significant frame-error-rates (FERs) degradation due to inter-subcarrier interference when applying conventional frequency-domain equalization techniques. In this paper, we propose computationally-efficient yet near-optimal soft-output detection methods for the coded mmWave MIMO systems with low-precision ADCs. The underlying idea of the proposed methods is to construct an extremely sparse inter-symbol-interference (ISI) channel model by jointly exploiting the delay-domain sparsity in mmWave channels and a high quantization noise caused by low-precision ADCs. Then we harness this sparse channel model to create a trellis diagram with a reduced number of states or a factor graph with very sparse edge connections. Using the reduced trellis diagram, we present a soft-output detection method that computes the log-likelihood ratios (LLRs) of coded bits by optimally combining the quantized received signals obtained from multiple receive antennas using a forward-and-backward algorithm. To reduce the computational complexity further, we also present a low-complexity detection method using the sparse factor graph to compute the LLRs in an iterative fashion based on a belief propagation algorithm. Simulations results demonstrate that the proposed soft-output detection methods provide significant FER gains compared to the existing frequency-domain equalization techniques in a coded mmWave MIMO system using one- or two-bit ADCs.

cs.IT↗

arXiv2018

On the Capacity of MISO Channels with One-Bit ADCs and DACs

A one-bit wireless transceiver is a promising communication architecture that not only can facilitate the design of mmWave communication systems but also can extremely diminish power consumption. The non-linear distortion effects by one-bit quantization at the transceiver, however, change the fundamental limits of communication rates. In this paper, the capacity of a multiple-input single-output (MISO) fading channel with one-bit transceiver is characterized in a closed form when perfect channel state information (CSI) is available at both a transmitter and a receiver. One major finding is that the capacity achieving transmission strategy is to uniformly use four multi-dimensional constellation points. The four multi-dimensional constellation points are optimally chosen as a function of the channel and the signal-to-noise ratio (SNR) among the channel input set constructed by a spatial lattice modulation method. As a byproduct, it is shown that a few-bit CSI feedback suffices to achieve the capacity. For the case when CSI is not perfectly known to the receiver, practical channel training and CSI feedback methods are presented, which effectively exploit the derived capacity-achieving transmission strategy.

cs.IT↗

arXiv2018

Dominant Channel Estimation via MIPS for Large-Scale Antenna Systems with One-Bit ADCs

In large-scale antenna systems, using one-bit analog-to-digital converters (ADCs) has recently become important since they offer significant reductions in both power and cost. However, in contrast to high-resolution ADCs, the coarse quantization of one-bit ADCs results in an irreversible loss of information. In the context of channel estimation, studies have been developed extensively to combat the performance loss incurred by one-bit ADCs. Furthermore, in the field of array signal processing, direction-of-arrival (DOA) estimation combined with one-bit ADCs has gained growing interests recently to minimize the estimation error. In this paper, a channel estimator is proposed for one-bit ADCs where the channels are characterized by their angular geometries, e.g., uniform linear arrays (ULAs). The goal is to estimate the dominant channel among multiple paths. The proposed channel estimator first finds the DOA estimate using the maximum inner product search (MIPS). Then, the channel fading coefficient is estimated using the concavity of the log-likelihood function. The limit inherent in one-bit ADCs is also investigated, which results from the loss of magnitude information.

cs.IT↗

arXiv2018

Spatial Lattice Modulation for MIMO Systems

This paper proposes spatial lattice modulation (SLM), a spatial modulation method for multipleinput-multiple-output (MIMO) systems. The key idea of SLM is to jointly exploit spatial, in-phase, and quadrature dimensions to modulate information bits into a multi-dimensional signal set that consists oflattice points. One major finding is that SLM achieves a higher spectral efficiency than the existing spatial modulation and spatial multiplexing methods for the MIMO channel under the constraint ofM-ary pulseamplitude-modulation (PAM) input signaling per dimension. In particular, it is shown that when the SLM signal set is constructed by using dense lattices, a significant signal-to-noise-ratio (SNR) gain, i.e., a nominal coding gain, is attainable compared to the existing methods. In addition, closed-form expressions for both the average mutual information and average symbol-vector-error-probability (ASVEP) of generic SLM are derived under Rayleigh-fading environments. To reduce detection complexity, a low-complexity detection method for SLM, which is referred to as lattice sphere decoding, is developed by exploiting lattice theory. Simulation results verify the accuracy of the conducted analysis and demonstrate that the proposed SLM techniques achieve higher average mutual information and lower ASVEP than do existing methods.

cs.IT↗

arXiv2017

One-Bit Sphere Decoding for Uplink Massive MIMO Systems with One-Bit ADCs

This paper presents a low-complexity near-maximum-likelihood-detection (near-MLD) algorithm called one-bit-sphere-decoding for an uplink massive multiple-input multiple-output (MIMO) system with one-bit analog-to-digital converters (ADCs). The idea of the proposed algorithm is to estimate the transmitted symbol vector sent by uplink users (a codeword vector) by searching over a sphere, which contains a collection of codeword vectors close to the received signal vector at the base station in terms of a weighted Hamming distance. To reduce the computational complexity for the construction of the sphere, the proposed algorithm divides the received signal vector into multiple sub-vectors each with reduced dimension. Then, it generates multiple spheres in parallel, where each sphere is centered at the sub-vector and contains a list of sub-codeword vectors. The detection performance of the proposed algorithm is also analyzed by characterizing the probability that the proposed algorithm performs worse than the MLD. The analysis shows how the dimension of each sphere and the size of the sub-codeword list are related to the performance-complexity tradeoff achieved by the proposed algorithm. Simulation results demonstrate that the proposed algorithm achieves near-MLD performance, while reducing the computational complexity compared to the existing MLD method.

cs.IT↗

arXiv2017

Feedback Design for Multi-Antenna K-tier Heterogeneous Downlink Cellular Networks

We characterize the ergodic spectral efficiency of a non-cooperative and a cooperative type of K-tier heterogeneous networks with limited feedback. In the non-cooperative case, a multi-antenna base station (BS) serves a single-antenna user using maximum-ratio transmission based on limited feedback. In the cooperative case, a BS coordination set is formed by using dynamic clustering across the tiers, wherein the intra-cluster interference is mitigated by using multi-cell zero-forcing also based on limited feedback. Modeling the network based on stochastic geometry, we derive analytical expressions for the ergodic spectral efficiency as a function of the system parameters. Leveraging the obtained expressions, we formulate feedback partition problems and obtain solutions to improve the ergodic spectral efficiency. Simulations show the spectral efficiency improvement by using the obtained feedback partitions. Our major findings are as follows: 1) In the non-cooperative case, the feedback is only useful in a particular tier if the mean interference is small enough. 2) In the cooperative case, allocating more feedback to stronger intra-cluster BSs is efficient. 3) In both cases, the obtained solutions do not change depending on instantaneous signal-to-interference ratio.

cs.IT↗

arXiv2017

Uplink Multiuser Massive MIMO Systems with Low-Resolution ADCs: A Coding-Theoretic Approach

This paper considers an uplink multiuser massive multiple-input-multiple-output (MIMO) system with low-resolution analog-to-digital converters (ADCs), in which K users with a single-antenna communicate with one base station (BS) with Nr antennas. In this system, we present a novel multiuser MIMO detection framework that is inspired by coding theory. The key idea of the proposed framework is to create a code C of length 2Nr over a spatial domain. This code is constructed by a so-called auto-encoding function that is not designable but is completely described by a channel transformation followed by a quantization function of the ADCs. From this point of view, we convert a multiuser MIMO detection problem into an equivalent channel coding problem, in which a codeword of C corresponding to users' messages is sent over 2Nr parallel channels, each with different channel reliability. To the resulting problem, we propose a novel weighted minimum distance decoding (wMDD) that appropriately exploits the unequal channel reliabilities. It is shown that the proposed wMDD yields a non-trivial gain over the conventional minimum distance decoding (MDD). From coding-theoretic viewpoint, we identify that bit-error-rate (BER) exponentially decreases with the minimum distance of the code C, which plays a similar role with a condition number in conventional MIMO systems. Furthermore, we develop the communication method that uses the wMDD for practical scenarios where the BS has no knowledge of channel state information. Finally, numerical results are provided to verify the superiority of the proposed method.

cs.IT↗

arXiv2017

Degrees of Freedom and Achievable Rate of Wide-Band Multi-cell Multiple Access Channels With No CSIT

This paper considers a $K$-cell multiple access channel with inter-symbol interference. The primary finding of this paper is that, without instantaneous channel state information at the transmitters (CSIT), the sum degrees-of-freedom (DoF) of the considered channel is $\frac{β-1}βK$ with $β\geq 2$ when the number of users per cell is sufficiently large, where $β$ is the ratio of the maximum channel-impulse-response (CIR) length of desired links to that of interfering links in each cell. Our finding implies that even without instantaneous CSIT, \textit{interference-free DoF per cell} is achievable as $β$ approaches infinity with a sufficiently large number of users per cell. This achievability is shown by a blind interference management method that exploits the relativity in delay spreads between desired and interfering links. In this method, all inter-cell-interference signals are aligned to the same direction by using a discrete-Fourier-transform-based precoding with cyclic prefix that only depends on the number of CIR taps. Using this method, we also characterize the achievable sum rate of the considered channel, in a closed-form expression.

cs.IT↗

arXiv2017

Uplink Multiuser Massive MIMO Systems with One-Bit ADCs: A Coding-Theoretic Viewpoint

This paper investigates an uplink multiuser massive multiple-input multiple-output (MIMO) system with one-bit analog-to-digital converters (ADCs), in which $K$ users with a single-antenna communicate with one base station (BS) with $n_r$ antennas. In this system, we propose a novel MIMO detection framework, which is inspired by coding theory. The key idea of the proposed framework is to create a non-linear code $\Cc$ of length $n_r$ and rate $K/n_r$ using the encoding function that is completely characterized by a non-linear MIMO channel matrix. From this, a multiuser MIMO detection problem is converted into an equivalent channel coding problem, in which a codeword of the $\Cc$ is sent over $n_r$ parallel binary symmetric channels, each with different crossover probabilities. Levereging this framework, we develop a maximum likelihood decoding method, and show that the minimum distance of the $\Cc$ is strongly related to a diversity order. Furthermore, we propose a practical implementation method of the proposed framework when the channel state information is not known to the BS. The proposed method is to estimate the code $\Cc$ at the BS using a training sequence. Then, the proposed {\em weighted} minimum distance decoding is applied. Simulations results show that the proposed method almost achieves an ideal performance with a reasonable training overhead.

cs.IT↗

arXiv2016

MIMO Systems With Low-Resolution ADCs: Linear Coding Approach

This paper considers a multiple-input multiple-output (MIMO) system with low-resolution analog-to-digital converters (ADCs). In this system, the paper presents a new MIMO detection approach using coding theory. The principal idea of the proposed approach is to transform a non-linear MIMO channel to a linear MIMO channel by leveraging both a $p$-level quantizer and a lattice code where $p\geq 2$. After transforming to the linear MIMO channel with the sets of finite input and output elements, efficient MIMO detection methods are proposed to attain both diversity and multiplexing gains by using algebraic coding theory. In particular, using the proposed methods, the analytical characterizations of achievable rates are derived for different MIMO configurations. One major observation is that the proposed approach is particularly useful for a large MIMO system with the ADCs that use a few bits.

cs.IT↗

arXiv2016

Interference-Free OFDM: Rethinking OFDM for Interference Networks with Inter-Symbol Interference

This paper considers a $K$-user single-input-single-output interference channel with inter-symbol interference (ISI), in which the channel coefficients are assumed to be linear time-invariant with finite-length impulse response. The primary finding of this paper is that, with no channel state information at a transmitter (CSIT), the sum-spectral efficiency can be made to scale linearly with $K$, provided that the desired links have longer impulse response than do the interfering links. This linear gain is achieved by a novel multi-carrier communication scheme which we call \textit{interference-free orthogonal frequency division multiplexing (IF-OFDM)}. Furthermore, when a transmitter is able to learn CSIT from its paired receiver only, a higher sum-spectral efficiency can be achieved by a two-stage transmission method that concatenates IF-OFDM and vector coding based on singular value decomposition with water-filling power allocation. A major implication of the derived results is that separate encoding across subcarriers per link is sufficient to linearly increase the sum-spectral efficiency with $K$ in the interference channel with ISI. Simulation results support this claim.

cs.IT↗

arXiv2016

Scaling Laws for Ergodic Spectral Efficiency in MIMO Poisson Networks

In this paper, we examine the benefits of multiple antenna communication in random wireless networks, the topology of which is modeled by stochastic geometry. The setting is that of the Poisson bipolar model introduced in [1], which is a natural model for ad-hoc and device-to-device (D2D) networks. The primary finding is that, with knowledge of channel state information between a receiver and its associated transmitter, by zero-forcing successive interference cancellation, and for appropriate antenna configurations, the ergodic spectral efficiency can be made to scale linearly with both 1) the minimum of the number of transmit and receive antennas, 2) the density of nodes and 3) the path-loss exponent. This linear gain is achieved by using the transmit antennas to send multiple data streams (e.g. through an open-loop transmission method) and by exploiting the receive antennas to cancel interference. Furthermore, when a receiver is able to learn channel state information from a certain number of near interferers, higher scaling gains can be achieved when using a successive interference cancellation method. A major implication of the derived scaling laws is that spatial multiplexing transmission methods are essential for obtaining better and eventually optimal scaling laws in multiple antenna random wireless networks. Simulation results support this analysis.

cs.IT↗

arXiv2016

On the Optimal Feedback Rate in Interference-Limited Multi-Antenna Cellular Systems

We consider a downlink cellular network where multi-antenna base stations (BSs) transmit data to single-antenna users by using one of two linear precoding methods with limited feedback: (i) maximum ratio transmission (MRT) for serving a single user or (ii) zero forcing (ZF) for serving multiple users. The BS and user locations are drawn from a Poisson point process, allowing expressions for the signal- to-interference coverage probability and the ergodic spectral efficiency to be derived as a function of system parameters such as the number of BS antennas and feedback bits, and the pathloss exponent. We find a tight lower bound on the optimum number of feedback bits to maximize the net spectral efficiency, which captures the overall system gain by considering both of downlink and uplink spectral efficiency using limited feedback. Our main finding is that, when using MRT, the optimum number of feedback bits scales linearly with the number of antennas, and logarithmically with the channel coherence time. When using ZF, the feedback scales in the same ways as MRT, but also linearly with the pathloss exponent. The derived results provide system-level insights into the preferred channel codebook size by averaging the effects of short-term fading and long-term pathloss.

cs.IT↗

arXiv2016

Cooperative Base Station Coloring for Pair-wise Multi-Cell Coordination

This paper proposes a method for designing BS clusters and cluster patterns for pair-wise BS coordination. The key idea is that each BS cluster is formed by using the 2nd-order Voronoi region, and the BS clusters are assigned to a specific cluster pattern by using edge-coloring for a graph drawn by Delaunay triangulation. The main advantage of the proposed method is that the BS selection conflict problem is prevented, while selected users are guaranteed to communicate with their two closest BSs in any irregular BS topology. With the proposed coordination method, analytical expressions for the rate distribution and the ergodic spectral efficiency are derived as a function of relevant system parameters in a fixed irregular network model. In a random network model with a homogeneous Poisson point process, a lower bound on the ergodic spectral efficiency is characterized. Through system level simulations, the performance of the proposed method is compared with that of conventional coordination methods: dynamic clustering and static clustering. Our major finding is that, when users are dense enough in a network, the proposed method provides the same level of coordination benefit with dynamic clustering to edge users.

cs.IT↗

arXiv2016

MAP Support Detection for Greedy Sparse Signal Recovery Algorithms in Compressive Sensing

A reliable support detection is essential for a greedy algorithm to reconstruct a sparse signal accurately from compressed and noisy measurements. This paper proposes a novel support detection method for greedy algorithms, which is referred to as "\textit{maximum a posteriori (MAP) support detection}". Unlike existing support detection methods that identify support indices with the largest correlation value in magnitude per iteration, the proposed method selects them with the largest likelihood ratios computed under the true and null support hypotheses by simultaneously exploiting the distributions of sensing matrix, sparse signal, and noise. Leveraging this technique, MAP-Matching Pursuit (MAP-MP) is first presented to show the advantages of exploiting the proposed support detection method, and a sufficient condition for perfect signal recovery is derived for the case when the sparse signal is binary. Subsequently, a set of iterative greedy algorithms, called MAP-generalized Orthogonal Matching Pursuit (MAP-gOMP), MAP-Compressive Sampling Matching Pursuit (MAP-CoSaMP), and MAP-Subspace Pursuit (MAP-SP) are presented to demonstrate the applicability of the proposed support detection method to existing greedy algorithms. From empirical results, it is shown that the proposed greedy algorithms with highly reliable support detection can be better, faster, and easier to implement than basis pursuit via linear programming.

cs.IT↗

arXiv2016

Coded Compressive Sensing: A Compute-and-Recover Approach

In this paper, we propose \textit{coded compressive sensing} that recovers an $n$-dimensional integer sparse signal vector from a noisy and quantized measurement vector whose dimension $m$ is far-fewer than $n$. The core idea of coded compressive sensing is to construct a linear sensing matrix whose columns consist of lattice codes. We present a two-stage decoding method named \textit{compute-and-recover} to detect the sparse signal from the noisy and quantized measurements. In the first stage, we transform such measurements into noiseless finite-field measurements using the linearity of lattice codewords. In the second stage, syndrome decoding is applied over the finite-field to reconstruct the sparse signal vector. A sufficient condition of a perfect recovery is derived. Our theoretical result demonstrates an interplay among the quantization level $p$, the sparsity level $k$, the signal dimension $n$, and the number of measurements $m$ for the perfect recovery. Considering 1-bit compressive sensing as a special case, we show that the proposed algorithm empirically outperforms an existing greedy recovery algorithm.

cs.IT↗

arXiv2015

Advanced Interference Management Technique: Potentials and Limitations

Interference management has the potential to improve spectrum efficiency in current and next generation wireless systems (e.g. 3GPP LTE and IEEE 802.11). Recently, new paradigms for interference management have emerged to tackle interference in a general class of wireless networks: interference shaping and interference exploitation. Both approaches offer better performance in interference-limited communication regimes than traditionally thought possible. This article provides a high-level overview of several different interference shaping and exploitation techniques for single-hop, multi-hop, and multi-way network architectures. Graphical illustrations that explain the intuition behind each strategy are provided. The article concludes with a discussion of practical challenges associated with adopting sophisticated interference management strategies in the future.

cs.IT↗

arXiv2015

Retrospective Interference Alignment for Two-Cell Uplink MIMO Cellular Networks with Delayed CSIT

In this paper, we propose a new retrospective interference alignment for two-cell multiple-input multiple-output (MIMO) interfering multiple access channels (IMAC) with the delayed channel state information at the transmitters (CSIT). It is shown that having delayed CSIT can strictly increase the sum-DoF compared to the case of no CSIT. The key idea is to align multiple interfering signals from adjacent cells onto a small dimensional subspace over time by fully exploiting the previously received signals as side information with outdated CSIT in a distributed manner. Remarkably, we show that the retrospective interference alignment can achieve the optimal sum-DoF in the context of two-cell two-user scenario by providing a new outer bound.

cs.IT↗