arXiv subjects
Publications and source records attributed to Sungyoon Cho.
In this article, we prove that a version of Tate conjectures for certain Deligne-Lusztig varieties implies the Kudla-Rapoport conjecture for unitary Shimura varieties with maximal parahoric level at unramified primes. Furthermore, we prove that the Kudla-Rapoport conjecture holds unconditionally for several new cases in any dimension.
Satellite-terrestrial integrated networks (STINs) are promising architecture for providing global coverage. In STINs, full frequency reuse between a satellite and a terrestrial base station (BS) is encouraged for aggressive spectrum reuse, which induces non-negligible amount of interference. To address the interference management problem in STINs, this paper proposes a novel distributed precoding method. Key features of our method are: i) a rate-splitting (RS) strategy is incorporated for efficient interference management and ii) the precoders are designed in a distributed way without sharing channel state information between a satellite and a terrestrial BS. Specifically, to design the precoders in a distributed fashion, we put forth a spectral efficiency decoupling technique, that disentangles the total spectral efficiency function into two distinct terms, each of which is dependent solely on the satellite's precoder and the terrestrial BS's precoder, respectively. Then, to resolve the non-smoothness raised by the RS strategy, we approximate the spectral efficiency expression as a smooth function by using the LogSumExp technique; thereafter we develop a generalized power iteration inspired optimization algorithm built based on the first-order optimality condition. Simulation results demonstrate that the proposed method offers considerable spectral efficiency gains compared to the existing methods.
In this paper, we prove that there are certain relations among representation densities and provide an efficient way to compute representation densities by using these relations. As an application, we compute some arithmetic intersection numbers of special cycles on unitary Shimura varieties and propose a conjecture on these.
In this paper, we reformulate conjectural formulas for the arithmetic intersection numbers of special cycles on unitary Shimura varieties with minuscule parahoric level structure in terms of weighted counting of lattices containing special homomorphisms.
In this paper, we formulate conjectural formulas for the arithmetic intersection numbers of special cycles on unitary Shimura varieties with minuscule parahoric level structure. Also, we prove that these conjectures are compatible with all known results.
In this paper, we study the basic locus in the fiber at $p$ of a certain unitary Shimura variety with a certain parahoric level structure. The basic locus $\widehat{\mathcal{M}^{ss}}$ is uniformized by a formal scheme $\mathcal{N}$ which is called Rapoport-Zink space. We show that the irreducible components of the induced reduced subscheme $\mathcal{N}_{red}$ of $\mathcal{N}$ are Deligne-Lusztig varieties and their intersection behavior is controlled by a certain Bruhat-Tits building. Also, we define special cycles in $\mathcal{N}$ and study their intersection multiplicities.
Interference alignment (IA) is a joint-transmission technique that achieves the capacity of the interference channel for high signal-to-noise ratios (SNRs). Most prior work on IA is based on the impractical assumption that perfect and global channel-state information(CSI) is available at all transmitters. To implement IA, each receiver has to feed back CSI to all interferers, resulting in overwhelming feedback overhead. In particular, the sum feedback rate of each receiver scales quadratically with the number of users even if the quantized CSI is fed back. To substantially suppress feedback overhead, this paper focuses on designing efficient arrangements of feedback links, called feedback topologies, under the IA constraint. For the multiple-input-multiple-output (MIMO) K-user interference channel, we propose the feedback topology that supports sequential CSI exchange (feedback and feedforward) between transmitters and receivers so as to achieve IA progressively. This feedback topology is shown to reduce the network feedback overhead from a cubic function of K to a linear one. To reduce the delay in the sequential CSI exchange, an alternative feedback topology is designed for supporting two-hop feedback via a control station, which also achieves the linear feedback scaling with K. Next, given the proposed feedback topologies, the feedback-bit allocation algorithm is designed for allocating feedback bits by each receiver to different feedback links so as to regulate the residual interference caused by the finite-rate feedback. Simulation results demonstrate that the proposed bit allocation leads to significant throughput gains especially in strong interference environments.