arXiv subjects

Namyoon Lee

Publications and source records attributed to Namyoon Lee.

103 records · Page 6Linked to original sources

arXiv2014

Index Coding with Coded Side-Information

This letter investigates a new class of index coding problems. One sender broadcasts packets to multiple users, each desiring a subset, by exploiting prior knowledge of linear combinations of packets. We refer to this class of problems as index coding with coded side-information. Our aim is to characterize the minimum index code length that the sender needs to transmit to simultaneously satisfy all user requests. We show that the optimal binary vector index code length is equal to the minimum rank (minrank) of a matrix whose elements consist of the sets of desired packet indices and side- information encoding matrices. This is the natural extension of matrix minrank in the presence of coded side information. Using the derived expression, we propose a greedy randomized algorithm to minimize the rank of the derived matrix.

cs.IT↗

arXiv2014

Spectral Efficiency Scaling Laws in Dense Random Wireless Networks with Multiple Receive Antennas

This paper considers large random wireless networks where transmit-and-receive node pairs communicate within a certain range while sharing a common spectrum. By modeling the spatial locations of nodes based on stochastic geometry, analytical expressions for the ergodic spectral efficiency of a typical node pair are derived as a function of the channel state information available at a receiver (CSIR) in terms of relevant system parameters: the density of communication links, the number of receive antennas, the path loss exponent, and the operating signal-to-noise ratio. One key finding is that when the receiver only exploits CSIR for the direct link, the sum of spectral efficiencies linearly improves as the density increases, when the number of receive antennas increases as a certain super-linear function of the density. When each receiver exploits CSIR for a set of dominant interfering links in addition to the direct link, the sum of spectral efficiencies linearly increases with both the density and the path loss exponent if the number of antennas is a linear function of the density. This observation demonstrates that having CSIR for dominant interfering links provides a multiplicative gain in the scaling law. It is also shown that this linear scaling holds for direct CSIR when incorporating the effect of the receive antenna correlation, provided that the rank of the spatial correlation matrix scales super-linearly with the density. Simulation results back scaling laws derived from stochastic geometry.

cs.IT↗

arXiv2014

Space-Time Physical-Layer Network Coding

A space-time physical-layer network coding (ST- PNC) method is presented for information exchange among multiple users over fully-connected multi-way relay networks. The method involves two steps: i) side-information learning and ii) space-time relay transmission. In the first step, different sets of users are scheduled to send signals over networks and the remaining users and relays overhear the transmitted signals, thereby learning the interference patterns. In the second step, multiple relays cooperatively send out linear combinations of signals received in the previous phase using space-time precoding so that all users efficiently exploit their side-information in the form of: 1) what they sent and 2) what they overheard in decoding. This coding concept is illustrated through two simple network examples. It is shown that ST-PNC improves the sum of degrees of freedom (sum-DoF) of the network compared to existing interference management methods. With ST-PNC, the sum-DoF of a general multi-way relay network without channel knowledge at the users is characterized in terms of relevant system parameters, chiefly the number of users, the number of relays, and the number of antennas at relays. A major implication of the derived results is that efficiently harnessing both transmit- ted and overheard signals as side-information brings significant performance improvements to fully-connected multi-way relay networks.

cs.IT↗

arXiv2014

Distributed Space-Time Interference Alignment with Moderately-Delayed CSIT

This paper proposes an interference alignment method with distributed and delayed channel state information at the transmitter (CSIT) for a class of interference networks. The core idea of the proposed method is to align interference signals over time at the unintended receivers in a distributed manner. With the proposed method, achievable trade-offs between the sum of degrees of freedom (sum-DoF) and feedback delay of CSI are characterized in both the X-channel and three-user interference channel to reveal the impact on how the CSI feedback delay affects the sum-DoF of the interference networks. A major implication of derived results is that distributed and moderately- delayed CSIT is useful to strictly improve the sum-DoF over the case of no CSI at the transmitter in a certain class of interference networks. For a class of X-channels, the results show how to optimally use distributed and moderately-delayed CSIT to yield the same sum-DoF as instantaneous and global CSIT. Further, leveraging the proposed transmission method and the known outer bound results, the sum-capacity of the two-user X-channel with a particular set of channel coefficients is characterized within a constant number of bits.

cs.IT↗

arXiv2014

Spectral Efficiency of Dynamic Coordinated Beamforming: A Stochastic Geometry Approach

This paper characterizes the performance of coordinated beamforming with dynamic clustering. A downlink model based on stochastic geometry is put forth to analyze the performance of such base station (BS) coordination strategy. Analytical expressions for the complementary cumulative distribution function (CCDF) of the instantaneous signal-to-interference ratio (SIR) are derived in terms of relevant system parameters, chiefly the number of BSs forming the coordination clusters, the number of antennas per BS, and the pathloss exponent. Utilizing this CCDF, with pilot overheads further incorporated into the analysis, we formulate the optimization of the BS coordination clusters for a given fading coherence. Our results indicate that (i) coordinated beamforming is most beneficial to users that are in the outer part of their cells yet in the inner part of their coordination cluster, and that (ii) the optimal cluster cardinality for the typical user is small and it scales with the fading coherence. Simulation results verify the exactness of the SIR distributions derived for stochastic geometries, which are further compared with the corresponding distributions for deterministic grid networks.

cs.IT↗

arXiv2013

Power Control for D2D Underlaid Cellular Networks: Modeling, Algorithms and Analysis

This paper considers a device-to-device (D2D) underlaid cellular network where an uplink cellular user communicates with the base station while multiple direct D2D links share the uplink spectrum. This paper proposes a random network model based on stochastic geometry and develops centralized and distributed power control algorithms. The goal of the proposed power control algorithms is two-fold: ensure the cellular users have sufficient coverage probability by limiting the interference created by underlaid D2D users, while also attempting to support as many D2D links as possible. For the distributed power control method, expressions for the coverage probabilities of cellular and D2D links are derived and a lower bound on the sum rate of the D2D links is provided. The analysis reveals the impact of key system parameters on the network performance. For example, the bottleneck of D2D underlaid cellular networks is the cross-tier interference between D2D links and the cellular user, not the D2D intra-tier interference. Numerical results show the gains of the proposed power control algorithms and accuracy of the analysis.

cs.IT↗

arXiv2013

Space-Time Interference Alignment and Degrees of Freedom Regions for the MISO Broadcast Channel with Periodic CSI Feedback

This paper characterizes the degrees of freedom (DoF) regions for the multi-user vector broadcast channel with periodic channel state information (CSI) feedback. As a part of the characterization, a new transmission method called space-time interference alignment is proposed, which exploits both the current and past CSI jointly. Using the proposed alignment technique, an inner bound of the sum-DoF region is characterized as a function of a normalized CSI feedback frequency, which measures CSI feedback speed compared to the speed of user's channel variations. One consequence of the result is that the achievable sum-DoF gain is improved significantly when a user sends back both current and outdated CSI compared to the case where the user sends back current CSI only. Then, a trade-off between CSI feedback delay and the sum-DoF gain is characterized for the multi-user vector broadcast channel in terms of a normalized CSI feedback delay that measures CSI obsoleteness compared to channel coherence time. A crucial insight is that it is possible to achieve the optimal DoF gain if the feedback delay is less than a derived fraction of the channel coherence time. This precisely characterizes the intuition that a small delay should be negligible.

cs.IT↗

arXiv2013

Multi-Way Information Exchange Over Completely-Connected Interference Networks with a Multi-Antenna Relay

This paper considers a fully-connected interference network with a relay in which multiple users equipped with a single antenna want to exchange multiple unicast messages with other users in the network by sharing the relay equipped with multiple antennas. For such a network, the degrees of freedom (DoF) are derived by considering various message exchange scenarios: a multi-user fully-connected Y channel, a two-pair two-way interference channel with the relay, and a two-pair two-way X channel with the relay. Further, considering distributed relays employing a single antenna in the two-way interference channel and the three-user fully-connected Y channel, achievable sum-DoF are also derived in the two-way interference channel and the three-user fully-connected Y channel. A major implication of the derived DoF results is that a relay with multiple antennas or multiple relays employing a single antenna increases the capacity scaling law of the multi-user interference network when multiple directional information flows are considered, even if the networks are fully-connected and all nodes operate in half-duplex. These results reveal that the relay is useful in the multi-way interference network with practical considerations.

cs.IT↗

arXiv2012

Not Too Delayed CSIT Achieves the Optimal Degrees of Freedom

Channel state information at the transmitter (CSIT) aids interference management in many communication systems. Due to channel state information (CSI) feedback delay and time-variation in the wireless channel, perfect CSIT is not realistic. In this paper, the CSI feedback delay-DoF gain trade-off is characterized for the multi-user vector broadcast channel. A major insight is that it is possible to achieve the optimal degrees of freedom (DoF) gain if the delay is less than a certain fraction of the channel coherence time. This precisely characterizes the intuition that a small delay should be negligeable. To show this, a new transmission method called space-time interference alignment is proposed, which actively exploits both the current and past CSI.

cs.IT↗

arXiv2011

Aligned Interference Neutralization and the Degrees of Freedom of the 2 User Interference Channel with Instantaneous Relay

It is well known that the classical 2 user Gaussian interference channel has only 1 degree of freedom (DoF), which can be achieved by orthogonal time division among the 2 users. It is also known that the use of conventional relays, which introduce a processing delay of at least one symbol duration relative to the direct paths between sources and destinations, does not increase the DoF of the 2 user interference channel. The use of instantaneous relays (relays-without-delay) has been explored for the single user point-to-point setting and it is known that such a relay, even with memoryless forwarding at the relay, can achieve a higher capacity than conventional relays. In this work, we show that the 2 user interference channel with an instantaneous relay, achieves 3/2 DoF. Thus, an instantaneous relay increases not only the capacity but also the DoF of the 2 user interference channel. The achievable scheme is inspired by the aligned interference neutralization scheme recently proposed for the 2X2X2 interference channel. Remarkably the DoF gain is achieved with memoryless relays, i.e., with relays that have no memory of past received symbols.

cs.IT↗

arXiv2010

Interference Alignment Through User Cooperation for Two-cell MIMO Interfering Broadcast Channels

This paper focuses on two-cell multiple-input multiple-output (MIMO) Gaussian interfering broadcast channels (MIMO-IFBC) with $K$ cooperating users on the cell-boundary of each BS. It corresponds to a downlink scenario for cellular networks with two base stations (BSs), and $K$ users equipped with Wi-Fi interfaces enabling to cooperate among users on a peer-to-peer basis. In this scenario, we propose a novel interference alignment (IA) technique exploiting user cooperation. Our proposed algorithm obtains the achievable degrees of freedom (DoF) of 2K when each BS and user have $M=K+1$ transmit antennas and $N=K$ receive antennas, respectively. Furthermore, the algorithm requires only a small amount of channel feedback information with the aid of the user cooperation channels. The simulations demonstrate that not only are the analytical results valid, but the achievable DoF of our proposed algorithm also outperforms those of conventional techniques.

cs.IT↗

arXiv2010

Interference Alignment with Limited Feedback on Two-cell Interfering Two-User MIMO-MAC

In this paper, we consider a two-cell interfering two-user multiple-input multiple-output multiple access channel (MIMO-MAC) with limited feedback. We first investigate the multiplexing gain of such channel when users have perfect channel state information at transmitter (CSIT) by exploiting an interference alignment scheme. In addition, we propose a feedback framework for the interference alignment in the limited feedback system. On the basis of the proposed feedback framework, we analyze the rate gap loss and it is shown that in order to keep the same multiplexing gain with the case of perfect CSIT, the number of feedback bits per receiver scales as $B \geq (M\!-1\!)\!\log_{2}(\textsf{SNR})+C$, where $M$ and $C$ denote the number of transmit antennas and a constant, respectively. Throughout the simulation results, it is shown that the sum-rate performance coincides with the derived results.

cs.IT↗

arXiv2010

Signal Space Alignment for an Encryption Message and Successive Network Code Decoding on the MIMO K-way Relay Channel

This paper investigates a network information flow problem for a multiple-input multiple-output (MIMO) Gaussian wireless network with $K$-users and a single intermediate relay having $M$ antennas. In this network, each user intends to convey a multicast message to all other users while receiving $K-1$ independent messages from the other users via an intermediate relay. This network information flow is termed a MIMO Gaussian $K$-way relay channel. For this channel, we show that $\frac{K}{2}$ degrees of freedom is achievable if $M=K-1$. To demonstrate this, we come up with an encoding and decoding strategy inspired from cryptography theory. The proposed encoding and decoding strategy involves a \textit{signal space alignment for an encryption message} for the multiple access phase (MAC) and \textit{zero forcing with successive network code decoding} for the broadcast (BC) phase. The idea of the \emph{signal space alignment for an encryption message} is that all users cooperatively choose the precoding vectors to transmit the message so that the relay can receive a proper encryption message with a special structure, \textit{network code chain structure}. During the BC phase, \emph{zero forcing combined with successive network code decoding} enables all users to decipher the encryption message from the relay despite the fact that they all have different self-information which they use as a key.

cs.IT↗