arXiv subjects

Ming-Chun Lee

Publications and source records attributed to Ming-Chun Lee.

13 recordsLinked to original sources

arXiv2026

Fundamental Limits of MIMO-OTFS and MIMO-OFDM in High-Dynamics ISAC: An Antenna Array Architecture Perspective

This paper investigates the fundamental limits of MIMO-OTFS and MIMO-OFDM integrated sensing and communications (ISAC) systems in high-mobility environments, specifically comparing sparse arrays (SA) against conventional uniform linear arrays (ULA). High-dynamics scenarios, such as V2X and satellite networks, suffer from severe Doppler shifts and rapidly time-varying channels, necessitating robust modulation schemes and efficient array geometries. A unified theoretical analysis of ergodic channel capacity and the Cram\'{e}r$\unicode{x2013}$Rao bound (CRB) for angle estimation is provided. Utilizing the framework of stochastic majorization, the study reveals that SAs consistently outperform ULAs by creating a more $\unicode{x201C}$uniform$\unicode{x201D}$ spatial eigenvalue distribution, which decorrelates the multipath environment and increases communication capacity. For sensing, the paper proves that the angle CRB is inversely proportional to the array's second-order moment of antenna positions asymptotically, demonstrating that SAs achieve superior accuracy$\unicode{x2014}$improving by up to the square of the number of antennas$\unicode{x2014}$due to their increased physical aperture. Notably, the analysis shows that under relatively ideal conditions, MIMO-OTFS and MIMO-OFDM share similar fundamental limits for both capacity and angle estimation, suggesting that spatial geometry, rather than waveform, is the primary driver of fundamental performance gains in the spatial dimension.

cs.IT↗

arXiv2026

Implementation and Calibration of 3GPP-Compliant ISAC Channel Simulator

Integrated sensing and communication (ISAC) has emerged as a key technology for 6G systems. To support the development of ISAC systems, accurate channel modeling and simulation for performance evaluation is essential. Recently, 3GPP introduced a standardized ISAC channel model and its associated calibration procedure for this purpose. However, due to the complexity of the modeling methodology and the lack of fully explicit implementation details in the 3GPP reports, different implementations may lead to inconsistent or unsynchronized simulation results. To address this issue, in this work, we implement the 3GPP ISAC channel model simulator specified in TR 38.901 and conduct a comprehensive calibration analysis. We compare the simulation results with the reference results reported by companies in 3GPP and discuss several key implementation details to provide insights into the implementation and calibration of the simulator. To facilitate reproducibility and further research, the developed simulator, together with the relevant datasets and calibration results, has been released as an open-source project on GitHub.

eess.SP↗

arXiv2026

Design of APSK Constellations Approaching the Communication-Sensing Pareto Boundary for ISAC

We propose a semi-analytical design framework for amplitude phase shift keying (APSK) signaling for integrated sensing and communication (ISAC), focusing on i.i.d. uniform discrete input distributions for practicality and analytical tractability. First, we establish APSK design criteria in which communication performance is measured by the gap to capacity and linked to the minimum Euclidean distance, while sensing performance is characterized by the symbol-energy variance. Based on these criteria, we develop a structured APSK construction whose key parameters follow explicit scaling laws. Then we prove that this construction achieves a constant gap to capacity independent of the signal-to-noise ratio. Building upon this foundation, we further construct a parametric APSK family that bridges the communication-optimal and sensing-optimal designs, with the communication and sensing (C&S) tradeoff controlled by the number of rings and energy allocation among rings. Simulation results show that the resulting APSK family achieves C&S performance very close to the Pareto boundary achieved with time-independent, circularly symmetric, and otherwise unconstrained continuous input distributions.

cs.IT↗

arXiv2026

Digital and Hybrid Precoding and RF Chain Selection Designs for Energy Efficient Multi-User MIMO-OFDM ISAC Systems

Using multiple-input multiple-output (MIMO) with orthogonal frequency division multiplexing (OFDM) for integrated sensing and communication (ISAC) has attracted considerable attention in recent years. While most existing works focus on improving MIMO-OFDM ISAC performance, the impact of transmit power and radio-frequency (RF) circuit power consumption on energy efficiency (EE) remains relatively underexplored. To address this gap, this paper investigates joint precoding and RF chain selection for multi-user MIMO-OFDM ISAC systems, and develops energy-efficient designs for both fully digital and hybrid precoding architectures through the joint optimization of precoding and RF-chain activation. Specifically, we first formulate a novel EE maximization problem subject to sensing performance constraints. Then, efficient optimization algorithms are proposed for both architectures, together with analyses of their computational complexity and convergence behavior. Building on the proposed approaches, spectral efficiency-power consumption tradeoff designs are also provided. Simulation results demonstrate that, compared with existing schemes, the proposed approaches achieve significant improvements in the EE-sensing tradeoff for ISAC systems.

eess.SP↗

arXiv2025

Robust and Resilient Networks with Integrated Sensing, Communication and Computation

Emerging applications such as networked robotics, intelligent transportation, smart factories, and virtual and augmented reality demand integrated perception and connectivity enabled by wireless communication. This has driven growing interests in integrated sensing, communication, and computation (ISCC) systems, with a primary focus on their efficient co-designs. However, as ISCC systems increasingly support critical applications, they must not only deliver high performance but also demonstrate robustness and resilience. In this context, robustness refers to a system's ability to maintain performance under uncertainties, while resilience denotes its capacity to sustain a minimum level of service in the face of major disruptions. To address this gap, this article presents an overview of ISCC systems from the perspectives of robustness and resilience under limited resources. First, key concepts related to these properties are introduced in the ISCC context. Subsequently, design approaches for realizing robust and resilient ISCC networks are discussed. Finally, the article concludes with the discussions of a case study and open research problems in this area.

cs.IT↗

arXiv2025

Scaling Law Tradeoff Between Throughput and Sensing Distance in Large ISAC Networks

In this paper, we investigate the fundamental tradeoff between communication and sensing performance of \emph{ad hoc} integrated sensing and communication (ISAC) wireless networks. Specifically, we consider that $n$ nodes are randomly located in an extended network with area $n$ and transmit ISAC signals. Under the pure path loss channel gain model and the condition that the transmission power scales according to the communication distance, we fully characterize the optimal scaling law tradeoff between throughput and sensing distance by proposing an achievable scheme and proving its converse. Our results can be interpreted as follows: by reducing the throughput by a factor of a function of $n$, the sensing range order improves according to the same function of $n$, raised to the power of the ratio between the path loss factors in communication and sensing. We prove that the same result also holds true for ISAC networks with random fading, despite the uncertainty on the connectivity and power level created by random fading. In addition, we show that the scaling law tradeoff cannot be improved by allowing the transmission power and communication distance to scale freely. To the best of our knowledge, this is the first work formally formulating and characterizing the communication and sensing performance scaling law tradeoff of \emph{ad hoc} ISAC networks.

cs.IT↗

arXiv2022

Optimal Delay-Outage Analysis for Noise-Limited Wireless Networks with Caching, Computing, and Communications -- Derivations and Proofs

Performance assessment and optimization for networks jointly performing caching, computing, and communication (3C) has recently drawn significant attention because many emerging applications require 3C functionality. However, studies in the literature mostly focus on the particular algorithms and setups of such networks, while their theoretical understanding and characterization has been less explored. To fill this gap, this paper conducts the asymptotic (scaling-law) analysis for the delay-outage tradeoff of noise-limited wireless edge networks with joint 3C. In particular, assuming the user requests for different tasks following a Zipf distribution, we derive the analytical expression for the optimal caching policy. Based on this, we next derive the closed-form expression for the optimum outage probability as a function of delay and other network parameters for the case that the Zipf parameter is smaller than 1. Then, for the case that the Zipf parameter is larger than 1, we derive the closed-form expressions for upper and lower bounds of the optimum outage probability. We provide insights and interpretations based on the derived expressions. Computer simulations validate our analytical results and insights.

cs.IT↗

arXiv2021

Throughput-Outage Scaling Behaviors for Wireless Single-Hop D2D Caching Networks with Physical Model -- Analysis and Derivations

Throughput-Outage scaling laws for single-hop cache-aided device-to-device (D2D) communications have been extensively investigated under the assumption of the protocol model. However, the corresponding performance under physical models has not been explored; in particular it remains unclear whether link-level power control and scheduling can improve the asymptotic performance. This paper thus investigates the throughput-outage scaling laws of cache-aided single-hop D2D networks considering a general physical channel model. By considering the networks with and without the equal-throughput assumption, we analyze the corresponding outer bounds and provide the achievable performance analysis. Results show that when the equal-throughput assumption is considered, using link-level power control and scheduling cannot improve the scaling laws. On the other hand, when the equal-throughput assumption is not considered, we show that the proposed double time-slot framework with appropriate link-level power control and scheduling can significantly improve the throughput-outage scaling laws, where the fundamental concept is to first distinguish links according to their communication distances, and then enhance the throughput for links with small communication distances.

cs.IT↗

arXiv2020

Optimal Throughput-Outage Analysis of Cache-Aided Wireless Multi-Hop D2D Networks -- Derivations of Scaling Laws

Cache-aided wireless device-to-device (D2D) networks have demonstrated promising performance improvement for video distribution compared to conventional distribution methods. Understanding the fundamental scaling behavior of such networks is thus of paramount importance. However, existing scaling laws for multi-hop networks have not been found to be optimal even for the case of Zipf popularity distributions (gaps between upper and lower bounds are not constants); furthermore, there are no scaling law results for such networks for the more practical case of a Mandelbrot-Zipf (MZipf) popularity distribution. We thus in this work investigate the throughput-outage performance for cache-aided wireless D2D networks adopting multi-hop communications, with the MZipf popularity distribution for file requests and users distributed according to Poisson point process. We propose an achievable content caching and delivery scheme and analyze its performance. By showing that the achievable performance is tight to the proposed outer bound, the optimal scaling law is obtained. Furthermore, since the Zipf distribution is a special case of the MZipf distribution, the optimal scaling law for the networks considering Zipf popularity distribution is also obtained, which closes the gap in the literature.

cs.IT↗

arXiv2020

Individual Preference Aware Caching Policy Design in Wireless D2D Networks

Cache-aided wireless device-to-device (D2D) networks allow significant throughput increase, depending on the concentration of the popularity distribution of files. Many studies assume that all users have the same preference distribution; however, this may not be true in practice. This work investigates whether and how the information about individual preferences can benefit cache-aided D2D networks. We examine a clustered network and derive a network utility that considers both the user distribution and channel fading effects into the analysis. We also formulate a utility maximization problem for designing caching policies. This maximization problem can be applied to optimize several important quantities, including throughput, energy efficiency (EE), cost, and hit-rate, and to solve different tradeoff problems. We provide a general approach that can solve the proposed problem under the assumption that users coordinate, then prove that the proposed approach can obtain the stationary point under a mild assumption. Using simulations of practical setups, we show that performance can improve significantly with proper exploitation of individual preferences. We also show that different types of tradeoffs exist between different performance metrics and that they can be managed through caching policy and cooperation distance designs.

cs.NI↗

arXiv2020

Robust Non-Coherent Beamforming for FDD Downlink Massive MIMO

Designing beamforming techniques for the downlink (DL) of frequency division duplex (FDD) massive MIMO is known to be a challenging problem due to the difficulty of obtaining channel state information (CSI). Indeed, since the uplink-downlink bands are disjoint, the system cannot rely on channel reciprocity to estimate the channel from uplink (UL) pilots as in time division duplexing (TDD) system. Still, in this paper, we propose original designs for robust beamformers that do not require any feedback from the users and only rely on the transmission of UL pilots. The price to pay is that the beamformer is non-coherent in the sense that it does not leverage full knowledge of the phase of each multipath component. A large variety of novel designs are proposed under different criterion and partial phase knowledge.

eess.SP↗

arXiv2019

Performance of Caching-Based D2D Video Distribution with Measured Popularity Distributions

On-demand video accounts for the majority of wireless data traffic. Video distribution schemes based on caching combined with device-to-device (D2D) communications promise order-of-magnitude greater spectral efficiency for video delivery, but hinge on the principle of `concentrated demand distributions.' This paper presents, for the first time, the analysis and evaluations of the throughput--outage tradeoff of such schemes based on measured cellular demand distributions. In particular, we use a dataset with more than 100 million requests from the BBC iPlayer, a popular video streaming service in the U.K., as the foundation of the analysis and evaluations. We present an achievable scaling law based on the practical popularity distribution, and show that such scaling law is identical to those reported in the literature. We find that also for the numerical evaluations based on a realistic setup, order-of-magnitude improvements can be achieved. Our results indicate that the benefits promised by the caching-based D2D in the literature could be retained for cellular networks in practice.

cs.NI↗

arXiv2019

Throughput-Outage Analysis and Evaluation of Cache-Aided D2D Networks with Measured Popularity Distributions

Caching of video files on user devices, combined with file exchange through device-to-device (D2D) communications is a promising method for increasing the throughput of wireless networks. Previous theoretical investigations showed that throughput can be increased by orders of magnitude, but assumed a Zipf distribution for modeling the popularity distribution, which was based on observations in {\em wired} networks. Thus the question whether cache-aided D2D video distribution can provide in practice the benefits promised by existing theoretical literature remains open. To answer this question, we provide new results specifically for popularity distributions of video requests of mobile users. Based on an extensive real-world dataset, we adopt a generalized distribution, known as Mandelbrot-Zipf (MZipf) distribution. We first show that this popularity distribution can fit the practical data well. Using this distribution, we analyze the throughput--outage tradeoff of the cache-aided D2D network and show that the scaling law is identical to the case of Zipf popularity distribution when the MZipf distribution is sufficiently skewed, implying that the benefits previously promised in the literature could indeed be realized in practice. To support the theory, practical evaluations using numerical experiments are provided, and show that the cache-aided D2D can outperform the conventional unicasting from base stations.

cs.IT↗