SHSong-Nam Hong

Song-Nam Hong

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Song-Nam Hong has a total of 4 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Demystifying the Scaling Laws of Dense Wireless Networks: No Linear Scaling in Practice

    by Song-Nam Hong, Giuseppe Caire

    We optimize the hierarchical cooperation protocol of Ozgur, Leveque and Tse, which is supposed to yield almost linear scaling of the capacity of a dense wireless network with the number of users $n$. Exploiting recent results on the optimality of "treating interference as noise" in Gaussian interference channels, we are able to optimize the achievable average per-link rate and not just its scaling law. Our optimized hierarchical cooperation protocol significantly outperforms the originally proposed scheme. On the negative side, we show that even for very large $n$, the rate scaling is far from linear, and the optimal number of stages $t$ is less than 4, instead of $t \rightarrow \infty$ as required for almost linear scaling. Combining our results and the fact that, beyond a certain user density, the network capacity is fundamentally limited by Maxwell laws, as shown by Francheschetti, Migliore and Minero, we argue that there is indeed no intermediate regime of linear scaling for dense networks in practice.

  • Open Access

    Full-Duplex Relaying with Half-Duplex Relays

    by Song-Nam Hong, Giuseppe Caire

    We consider "virtual" full-duplex relaying by means of half-duplex relays. In this configuration, each relay stage in a multi-hop relaying network is formed by at least two relays, used alternatively in transmit and receive modes, such that while one relay transmits its signal to the next stage, the other relay receives a signal from the previous stage. With such a pipelined scheme, the source is active and sends a new information message in each time slot. We consider the achievable rates for different coding schemes and compare them with a cut-set upper bound, which is tight in certain conditions. In particular, we show that both lattice-based Compute and Forward (CoF) and Quantize reMap and Forward (QMF) yield attractive performance and can be easily implemented. In particular, QMF in this context does not require "long" messages and joint (non-unique) decoding, if the quantization mean-square distortion at the relays is chosen appropriately. Also, in the multi-hop case the gap of QMF from the cut-set upper bound grows logarithmically with the number of stages, and not linearly as in the case of "noise level" quantization. Furthermore, we show that CoF is particularly attractive in the case of multi-hop relaying, when the channel gains have fluctuations not larger than 3dB, yielding a rate that does not depend on the number of relaying stages. In particular, we argue that such architecture may be useful for a wireless backhaul with line-of-sight propagation between the relays.

  • Open Access

    On Interference Networks over Finite Fields

    by Song-Nam Hong, Giuseppe Caire

    We present a framework to study linear deterministic interference networks over finite fields. Unlike the popular linear deterministic models introduced to study Gaussian networks, we consider networks where the channel coefficients are general scalars over some extension field $\FF_{p^m}$ (scalar $m$-th extension-field models), $m \times m$ diagonal matrices over $\FF_p$ ($m$-symbol extension ground-field models), and $m \times m$ general non-singular matrices (MIMO ground field models). We use the companion matrix representation of the extension field to convert $m$-th extension scalar models into MIMO ground-field models where the channel matrices have special algebraic structure. For such models, we consider the $2 \times 2 \times 2$ topology (two-hops two-flow) and the 3-user interference network topology. We derive achievability results and feasibility conditions for certain schemes based on the Precoding-Based Network Alignment (PBNA) approach, where intermediate nodes use random linear network coding (i.e., propagate random linear combinations of their incoming messages) and non-trivial precoding/decoding is performed only at the network edges, at the sources and destinations. Furthermore, we apply this approach to the scalar $2\times 2\times 2$ complex Gaussian IC with fixed channel coefficients, and show two competitive schemes outperforming other known approaches at any SNR, where we combine finite-field linear precoding/decoding with lattice coding and the Compute and Forward approach at the signal level. As a side result, we also show significant advantages of vector linear network coding both in terms of feasibility probability (with random coding coefficients) and in terms of coding latency, with respect to standard scalar linear network coding, in PBNA schemes.

  • Open Access

    Two-Unicast Two-Hop Interference Network: Finite-Field Model

    by Song-Nam Hong, Giuseppe Caire

    In this paper we present a novel framework to convert the $K$-user multiple access channel (MAC) over $\FF_{p^m}$ into the $K$-user MAC over ground field $\FF_{p}$ with $m$ multiple inputs/outputs (MIMO). This framework makes it possible to develop coding schemes for MIMO channel as done in symbol extension for time-varying channel. Using aligned network diagonalization based on this framework, we show that the sum-rate of $(2m-1)\log{p}$ is achievable for a $2\times 2\times 2$ interference channel over $\FF_{p^m}$. We also provide some relation between field extension and symbol extension.

  • Open Access

    Compute-and-Forward Strategies for Cooperative Distributed Antenna Systems

    by Song-Nam Hong, Giuseppe Caire

    We study a distributed antenna system where $L$ antenna terminals (ATs) are connected to a Central Processor (CP) via digital error-free links of finite capacity $R_0$, and serve $K$ user terminals (UTs). We contribute to the subject in the following ways: 1) for the uplink, we apply the "Compute and Forward" (CoF) approach and examine the corresponding system optimization at finite SNR; 2) For the downlink, we propose a novel precoding scheme nicknamed "Reverse Compute and Forward" (RCoF); 3) In both cases, we present low-complexity versions of CoF and RCoF based on standard scalar quantization at the receivers, that lead to discrete-input discrete-output symmetric memoryless channel models for which near-optimal performance can be achieved by standard single-user linear coding; 4) For the case of large $R_0$, we propose a novel "Integer Forcing Beamforming" (IFB) scheme that generalizes the popular zero-forcing beamforming and achieves sum rate performance close to the optimal Gaussian Dirty-Paper Coding. The proposed uplink and downlink system optimization focuses specifically on the ATs and UTs selection problem. We present low-complexity ATs and UTs selection schemes and demonstrate, through Monte Carlo simulation in a realistic environment with fading and shadowing, that the proposed schemes essentially eliminate the problem of rank deficiency of the system matrix and greatly mitigate the non-integer penalty affecting CoF/RCoF at high SNR. Comparison with other state-of-the art information theoretic schemes, such as "Quantize reMap and Forward" for the uplink and "Compressed Dirty Paper Coding" for the downlink, show competitive performance of the proposed approaches with significantly lower complexity.

  • Open Access

    Structured Lattice Codes for 2 \times 2 \times 2 MIMO Interference Channel

    by Song-Nam Hong, Giuseppe Caire

    We consider the 2\times 2\times 2 multiple-input multipleoutput interference channel where two source-destination pairs wish to communicate with the aid of two intermediate relays. In this paper, we propose a novel lattice strategy called Aligned Precoded Compute-and-Forward (PCoF). This scheme consists of two phases: 1) Using the CoF framework based on signal alignment we transform the Gaussian network into a deterministic finite field network. 2) Using linear precoding (over finite field) we eliminate the end-to-end interference in the finite field domain. Further, we exploit the algebraic structure of lattices to enhance the performance at finite SNR, such that beyond a degree of freedom result (also achievable by other means). We can also show that Aligned PCoF outperforms time sharing in a range of reasonably moderate SNR, with increasing gain as SNR increases.

  • Open Access

    Generalized Degrees of Freedom for Network-Coded Cognitive Interference Channel

    by Song-Nam Hong, Giuseppe Caire

    We study a two-user cognitive interference channel (CIC) where one of the transmitters (primary) has knowledge of a linear combination (over an appropriate finite field) of the two information messages. We refer to this channel model as Network-Coded CIC, since the linear combination may be the result of some linear network coding scheme implemented in the backbone wired network.In this paper, we characterize the generalized degrees of freedom (GDoF) for the Gaussian Network-Coded CIC. For achievability, we use the novel Precoded Compute-and-Forward (PCoF) and Dirty Paper Coding (DPC), based on nested lattice codes. As a consequence of the GDoF characterization, we show that knowing "mixed data" (linear combinations of the information messages) provides a {\em multiplicative} gain for the Gaussian CIC, if the power ratio of signal-to-noise (SNR) to interference-to-noise (INR) is larger than certain threshold. For example, when $\SNR=\INR$, the Network-Coded cognition yields a 100% gain over the classical Gaussian CIC.

  • Open Access

    Two Birds and One Stone: Gaussian Interference Channel with a Shared Out-of-Band Relay of Limited Rate

    by Peyman Razaghi, Song Nam Hong. Lei Zhou, Wei Yu, Giuseppe Caire

    The two-user Gaussian interference channel with a shared out-of-band relay is considered. The relay observes a linear combination of the source signals and broadcasts a common message to the two destinations, through a perfect link of fixed limited rate $R_0$ bits per channel use. The out-of-band nature of the relay is reflected by the fact that the common relay message does not interfere with the received signal at the two destinations. A general achievable rate is established, along with upper bounds on the capacity region for the Gaussian case. For $R_0$ values below a certain threshold, which depends on channel parameters, the capacity region of this channel is determined in this paper to within a constant gap of $\Delta=1.95$ bits. We identify interference regimes where a two-for-one gain in achievable rates is possible for every bit relayed, up to a constant approximation error. Instrumental to these results is a carefully-designed quantize-and-forward type of relay strategy along with a joint decoding scheme employed at destination ends. Further, we also study successive decoding strategies with optimal decoding order (corresponding to the order at which common, private, and relay messages are decoded), and show that successive decoding also achieves two-for-one gains asymptotically in regimes where a two-for-one gain is achievable by joint decoding; yet, successive decoding produces unbounded loss asymptotically when compared to joint decoding, in general.

  • Open Access

    Quantized Compute and Forward: A Low-Complexity Architecture for Distributed Antenna Systems

    by Song-Nam Hong, Giuseppe Caire

    We consider a low-complexity version of the Compute and Forward scheme that involves only scaling, offset (dithering removal) and scalar quantization at the relays. The proposed scheme is suited for the uplink of a distributed antenna system where the antenna elements must be very simple and are connected to a oint processor via orthogonal perfect links of given rate R0. We consider the design of non-binary LDPC codes naturally matched to the proposed scheme. Each antenna element performs individual (decentralized) Belief Propagation decoding of its own quantized signal, and sends a linear combination of the users' information messages via the noiseless link to the joint processor, which retrieves the users' messages by Gaussian elimination. The complexity of this scheme is linear in the coding block length and polynomial in the system size (number of relays).