Low-Rank Adaptation (LoRA) enables efficient fine-tuning of large language models but suffers from catastrophic forgetting when learned updates interfere with the dominant singular directions that encode essential pre-trained knowledge. We propose Orthogonal Projection LoRA (OPLoRA), a theoretically grounded approach that prevents this interference through double-sided orthogonal projections. By decomposing frozen weights via SVD, OPLoRA constrains LoRA updates to lie entirely within the orthogonal complement of the top-k singular subspace using projections PL = I − Uk Ukᵀ and PR = I − Vk Vkᵀ. We prove that this construction exactly preserves the top-k singular triples, providing mathematical guarantees for knowledge retention. To quantify subspace interference, we introduce ρk, a metric measuring update alignment with dominant directions. Extensive experiments across commonsense reasoning, mathematics, and code generation demonstrate that OPLoRA significantly reduces forgetting while maintaining competitive task-specific performance on LLaMA-2 7B and Qwen2.5 7B, establishing orthogonal projection as an effective mechanism for knowledge preservation in parameter-efficient fine-tuning.

This paper investigates the fundamental information-theoretic limits for the control and sensing of noiseless linear dynamical systems subject to a broad class of nonlinear observations. We analyze the interactions between the control and sensing components by characterizing the minimum information flow required for stability. Specifically, we derive necessary conditions for mean-square observability and stabilizability, demonstrating that the average directed information rate from the state to the observations must exceed the intrinsic expansion rate of the unstable dynamics. Furthermore, to address the challenges posed by non-Gaussian distributions inherent to nonlinear observation channels, we establish sufficient conditions by imposing regularity assumptions, specifically log-concavity, on the system's probabilistic components. We show that under these conditions, the divergence of differential entropy implies the convergence of the estimation error, thereby closing the gap between information-theoretic bounds and estimation performance. By establishing these results, we unveil the fundamental performance limits imposed by the sensing layer, extending classical data-rate constraints to the more challenging regime of nonlinear observation models.

In this paper, we analyze the periodic transmission masks for MASked Modulation (MASM) in half-duplex integrated sensing and communication (ISAC), and derive their closed-form expected range-Doppler response $\mathbb{E}\{r(k,l,ν)\}$. We show that range sidelobes ($k\neq l$) are Doppler-invariant, extending the range-sidelobe optimality to the 2-D setting. For the range mainlobe ($k=l$), periodic masking yields sparse Doppler sidelobes: Cyclic difference sets (CDSs) (in particular Singer CDSs) are minimax-optimal in a moderately dynamic regime, while in a highly dynamic regime the Doppler-sidelobe energy is a concave function of the mask autocorrelation, revealing an inevitable tradeoff with mainlobe fluctuation.

Integrated sensing and communication (ISAC) enables numerous innovative wireless applications. Communication-centric design is a practical choice for the construction of the sixth generation (6G) ISAC networks. Continuous-wave-based ISAC systems, with orthogonal frequency-division multiplexing (OFDM) being a representative example, suffer from the self-interference (SI) problem, and hence are less suitable for long-range sensing. On the other hand, pulse-based half-duplex ISAC systems are free of SI, but are also less favourable for high-throughput communication scenarios. In this treatise, we propose MASked Modulation (MASM), a half-duplex ISAC waveform design scheme, which minimises a range blindness metric, termed as “mainlobe fluctuation”, given a duty cycle (proportional to communication throughput) constraint. In particular, MASM is capable of supporting high-throughput communication (∼50% duty cycle) under mild mainlobe fluctuation. Moreover, MASM can be flexibly adapted to frame-level waveform designs by operating on the slow-time scale. In terms of optimal transmit mask design, a set of masks is shown to beidealin the sense of sidelobe level and mainlobe fluctuation intensity.

Accurate radar cross section (RCS) modeling is crucial for characterizing target scattering and improving the precision of Integrated Sensing and Communication (ISAC) channel modeling. Existing RCS models are typically designed for specific target types, leading to increased complexity and lack of generalization. This makes it difficult to standardize RCS models for 3GPP ISAC channels, which need to account for multiple typical target types simultaneously. Furthermore, 3GPP models must support both system-level and link-level simulations, requiring the integration of large-scale and small-scale scattering characteristics. To address these challenges, this paper proposes a unified RCS modeling framework that consolidates these two aspects. The model decomposes RCS into three components: (1) a large-scale power factor representing overall scattering strength, (2) a small-scale angular-dependent component describing directional scattering, and (3) a random component accounting for variations across target instances. We validate the model through mono-static RCS measurements for UAV, human, and vehicle targets across five frequency bands. The results demonstrate that the proposed model can effectively capture RCS variations for different target types. Finally, the model is incorporated into an ISAC channel simulation platform to assess the impact of target RCS characteristics on path loss, delay spread, and angular spread, providing valuable insights for future ISAC system design.

Integrated sensing and communications (ISAC) is considered an innovative technology in sixth-generation (6G) wireless networks, where utilizing orthogonal frequency division multiplexing (OFDM) communication signals for sensing provides a cost-effective solution for implementing ISAC. However, the sensing performance of matched and mismatched filtering schemes can be significantly deteriorated due to the signaling randomness induced by finite-alphabet modulations with non-constant modulus, such as quadrature amplitude modulation (QAM) constellations. Therefore, improving sensing performance without significantly compromising communication capability (i.e., maintaining randomness), remains a challenging task. To that end, we propose a unified probabilistic constellation shaping (PCS) framework that is compatible with both matched and mismatched filtering schemes, by maximizing the communication rate while imposing constraints on mean square error (MSE) of sensing channel state information (CSI), power, and probability distribution. Specifically, the MSE of sensing CSI is leveraged to optimize sensing capability, which is illustrated to be a more comprehensive metric compared to the output SNR after filtering (SNRout) and integrated sidelobes ratio (ISLR). Additionally, the internal relationships among these three sensing metrics are explicitly analyzed. Building upon this, we further reveal that the normalized MSE can be interpreted as a penalty function version of the dynamic range, which is usually exploited to evaluate the behavior of delay-Doppler profiles. Finally, both simulations and field measurements validate the efficiency of proposed PCS approach in achieving a flexible S&C trade-off, as well as its credibility in enhancing 6G wireless transmission in real-world scenarios.

Motion state sensing is crucial in wireless communication systems employing Integrated Sensing and Communication (ISAC), with accurate target velocity estimation being central to its effectiveness. While waveform design for ISAC signals can enhance the sensing capability, most existing studies focus on single-target scenarios, with limited discussion on multi-target scenarios. This paper proposes a novel waveform design approach aiming for enhancing the multi-target sensing performance, under the prior knowledge that the Doppler difference between two hardly resolvable targets lies in a certain interval. In particular, we use the Ziv-Zakai Bound (ZZB) of Doppler difference to design the waveform for multi-target sensing, which effectively captures the ambiguity phenomenon. We first derive the expression of the Doppler difference ZZB, which reveals the connection between ZZB and the widely-used ambiguity function. Based on this expression, we propose an SNR-adaptive pulse modulation strategy that significantly improves the velocity estimation accuracy for multi-target scenarios. Numerical results demonstrate that the Doppler difference ZZB effectively reflects the multi-target Doppler frequency estimation performance of maximum aposterioriestimators.

This paper investigates an integrated sensing and communication (ISAC) system employing delay-Doppler (DD) signaling. The sensing performance of both random and deterministic signaling schemes is evaluated based on the expected squared ambiguity function (AF), for which closed-form expressions are derived by leveraging the Zak transform-based orthogonal time-frequency space (Zak-OTFS) modulation framework. Our analysis highlights a key difference between the two signaling types: DD domain ISAC (DD-ISAC) with deterministic signaling yields a roughly periodic AF with prominent peaks and low sidelobes between adjacent peaks, whereas DD-ISAC with random signaling using a Quadrature Phase-Shift Keying (QPSK) constellation exhibits low sidelobe values periodically without prominent peaks. Furthermore, we demonstrate that DD-ISAC enables a flexible trade-off between delay and Doppler sidelobe levels by adjusting the number of delay and Doppler bins. The analytical findings are explicitly validated through numerical simulations.

Accurate velocity sensing is crucial in Integrated Sensing and Communication (ISAC) systems, while most studies focus on single-target cases with limited attention to multi-target scenarios. This paper proposes a novel waveform design approach that enhances multi-target sensing performance by leveraging the Ziv-Zakai Bound (ZZB) of Doppler difference, effectively capturing the ambiguity phenomenon under the prior knowledge that the Doppler difference between two hardly resolvable targets lies in a certain interval. We first derive the ZZB for Doppler difference, which reveals the connection between ZZB and the widely-used ambiguity function. Based on this, an SNR-adaptive pulse modulation strategy is developed to enhance multi-target sensing accuracy. Numerical results confirm that the proposed Doppler difference ZZB effectively captures the estimation performance of maximum a posteriori estimators in multi-target scenarios.

While multi-step diffusion models have advanced both forward and inverse rendering, existing approaches often treat these problems independently, leading to cycle inconsistency and slow inference speed. In this work, we present Ouroboros, a framework composed of two single-step diffusion models that handle forward and inverse rendering with mutual reinforcement. Our approach extends intrinsic decomposition to both indoor and outdoor scenes and introduces a cycle consistency mechanism that ensures coherence between forward and inverse rendering outputs. Experimental results demonstrate state-of-the-art performance across diverse scenes while achieving substantially faster inference speed compared to other diffusion-based methods. We also demonstrate that Ouroboros can transfer to video decomposition in a training-free manner, reducing temporal inconsistency in video sequences while maintaining high-quality per-frame inverse rendering.

The memristor, an emerging non-volatile memory device, is well-suited for in-memory computing (IMC) due to its capability to simultaneously store data and perform logic operations. Majority (MAJ) logic is a type of expressive Boolean logic that performs well in logic synthesis. This paper proposes a novel MAJ logic implementation scheme to improve the latency of n-bit full adder (FA) from 6n+1 to 5n+1. Additionally, an approximate computing approach is introduced, yielding an n-bit approximate adder with a significantly reduced delay of 2n+1, at the cost of precision. Both exact and approximate adders were verified experimentally, and the error quality metrics of the approximate design were thoroughly evaluated. Furthermore, hybrid configurations combining exact and approximate adders were applied to image processing tasks, where the peak signal-to-noise ratio (PSNR) for most hybrid designs remained within an acceptable range (>30dB).

Exploring the mutual benefit and reciprocity of sensing and communication (S&C) functions is fundamental to realizing deeper integration for integrated sensing and communication (ISAC) systems. This paper investigates a novel communication-assisted sensing (CAS) system within 6G perceptive networks, where the base station actively senses the targets through device-free wireless sensing and simultaneously transmits the estimated information to end-users. In such a CAS system, we first establish an optimal waveform design framework based on the rate-distortion (RD) and source-channel separation (SCT) theorems. After analyzing the relationships between the sensing distortion, coding rate, and communication channel capacity, we propose two distinct waveform design strategies in the scenario of target impulse response estimation. In the separated S&C waveforms scheme, we equivalently transform the original problem into a power allocation problem and develop a low-complexity one-dimensional search algorithm, shedding light on a notable power allocation tradeoff between the S&C waveform. In the dual-functional waveform scheme, we conceive a heuristic mutual information optimization algorithm for the general case, alongside a modified gradient projection algorithm tailored for the scenarios with independent sensing sub-channels. Additionally, we identify the presence of both subspace tradeoff and water-filling tradeoff in this scheme. Finally, we validate the effectiveness of the proposed algorithms through numerical simulations.

Sparsity-based joint active user detection and channel estimation (JADCE) algorithms are crucial in grant-free massive machine-type communication (mMTC) systems. The conventional compressed sensing algorithms are tailored for noncoherent communication systems, where the correlation between any two measurements is as minimal as possible. However, existing sparsity-based JADCE approaches may not achieve optimal performance in strongly coherent systems, especially with a small number of pilot subcarriers. To tackle this challenge, we formulate JADCE as a joint sparse signal recovery problem, leveraging the block-type row-sparse structure of millimeter-wave (mmWave) channels in massive multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems. Then, we propose an efficient difference-of-convex function algorithm (DCA) based JADCE algorithm with multiple measurement vector (MMV) frameworks, promoting the row-sparsity of the channel matrix. To mitigate the computational complexity further, we introduce a fast DCA-based JADCE algorithm via a proximal operator, which allows a low-complexity alternating direction multiplier method (ADMM) to resolve the optimization problem directly. Finally, simulation results demonstrate that the two proposed difference-of-convex (DC) algorithms achieve effective active user detection and accurate channel estimation compared with state-of-the-art compressed sensing based JADCE techniques.

This paper aims to answer a fundamental question in the area of Integrated Sensing and Communications (ISAC):What is the optimal communication-centric ISAC waveform for ranging?Towards that end, we first established a generic framework to analyze the sensing performance of communication-centric ISAC waveforms built upon orthonormal signaling bases and random data symbols. Then, we evaluated their ranging performance by adopting both the periodic and aperiodic auto-correlation functions (P-ACF and A-ACF), and defined the expectation of the integrated sidelobe level (EISL) as a sensing performance metric. On top of that, we proved that among all communication waveforms with cyclic prefix (CP), the orthogonal frequency division multiplexing (OFDM) modulation is the only globally optimal waveform that achieves the lowest ranging sidelobe for quadrature amplitude modulation (QAM) and phase shift keying (PSK) constellations, in terms of both the EISL and the sidelobe level at each individual lag of the P-ACF. As a step forward, we proved that among all communication waveforms without CP, OFDM is a locally optimal waveform for QAM/PSK in the sense that it achieves a local minimum of the EISL of the A-ACF. Finally, we demonstrated by numerical results that under QAM/PSK constellations, there is no other orthogonal communication-centric waveform that achieves a lower ranging sidelobe level than that of the OFDM, in terms of both P-ACF and A-ACF cases.

Integrated sensing and communications (ISAC) has emerged as a pivotal enabling technology for next-generation wireless networks. Despite the distinct signal design requirements of sensing and communication (S&C) systems, shifting the symbol-wise pulse shaping (SWiPS) framework from communication-only systems to ISAC poses significant challenges in signal design and processing This paper addresses these challenges by examining the ambiguity function (AF) of the SWiPS ISAC signal and introducing a novel pulse shaping design for single-carrier ISAC transmission. We formulate optimization problems to minimize the average integrated sidelobe level (ISL) of the AF, as well as the weighted ISL (WISL) while satisfying inter-symbol interference (ISI), out-of-band emission (OOBE), and power constraints. Our contributions include establishing the relationship between the AFs of both the random data symbols and signaling pulses, analyzing the statistical characteristics of the AF, and developing algorithmic frameworks for pulse shaping optimization using successive convex approximation (SCA) and alternating direction method of multipliers (ADMM) approaches. Numerical results are provided to validate our theoretical analysis, which demonstrate significant performance improvements in the proposed SWiPS design compared to the root-raised cosine (RRC) pulse shaping for conventional communication systems.

Traditional grid-based compressed sensing algorithms usually suffer from the base mismatch effect in channel estimation problems. To address this, we propose a novel gridless uplink/downlink (UL/DL) channel estimation strategy for millimeter wave (mmWave) massive multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems. By exploiting inherent sparsity in the angle-delay domain of the mmWave channel, we first formulate the UL channel estimation problem as a joint sparse signal recovery problem. Then, we introduce the reweighted atomic norm for enhancing angular resolution of the mmWave channel on continuous Fourier dictionaries; we suggest a novel reweighted atomic norm minimization (NRAM) algorithm to solve the channel estimation problem by leveraging the Hankel-Toeplitz block model with multiple measurement vectors (MMVs), and the original NRAM problem is approximated by the solution of a semi-definite programming (SDP) problem with structured sparsity, which is efficiently solved by a low-complexity alternating direction multiplier method (ADMM). Subsequently, in the frequency division duplex (FDD) system, we design a simplified DL channel estimation scheme by leveraging the angle-delay reciprocity of UL and DL channels. This scheme reconstructs the DL channel matrix using the angle and path delay estimated from the UL channel, along with the channel gain obtained through least squares (LS). Finally, simulation results validate that our proposed approach achieves superior channel estimation accuracy and reduces pilot overhead compared to conventional UL/DL channel estimation techniques.

Technology Computer Aided Design (TCAD) is a crucial step in the design and manufacturing of semiconductor devices. It involves solving physical equations that describe the behavior of semiconductor devices to predict various device parameters. Traditional TCAD methods, such as finite volume and finite element methods, discretize relevant physical equations to achieve numerical simulations of devices, significantly burdening the computation resources. For the first time, this paper proposes a novel method for TCAD simulation based on Physics-Informed Neural Networks (PINNs). We proposed multi-order differential neural network (MDNN), an improved Radial Basis Function Neural Network (RBFNN) model. By training MDNN, it achieves the couple solution of the Poisson equation and drift-diffusion equation under steady-state conditions, without the need for a pre-existing dataset. To the best of our knowledge, this marks the first instance of an ML-TCAD simulation that does not require any pre-existing data. For an example of PN junction diode, this method effectively simulates the basic physical characteristics of the device, with a self-consistent solution error of less than 1×10−5.

Radar systems typically employ well-designed deterministic signals for target sensing. In contrast to that, integrated sensing and communications (ISAC) systems have to use random signals to convey useful information, potentially causing sensing performance degradation. In this paper, we define a new sensing performance metric, namely, ergodic linear minimum mean square error (ELMMSE), accounting for the randomness of ISAC signals. Then, we investigate a data-dependent precoding scheme to minimize the ELMMSE, which attains the optimized sensing performance at the price of high computational complexity. To reduce the complexity, we present an alternative data-independent precoding scheme and propose a stochastic gradient projection (SGP) algorithm for ELMMSE minimization, which can be trained offline by locally generated signal samples. Finally, we demonstrate the superiority of the proposed methods by simulations.

Integrated sensing and communications (ISAC) has been recognized as a key component in the envisioned 6G communication systems. Understanding the fundamental performance tradeoff between sensing and communication functionalities is essential for designing practical cost-efficient ISAC systems. In this paper, we aim for augmenting the current understanding of the deterministic-random tradeoff (DRT) between sensing and communication, by analyzing the sensing-optimal operating point of the fundamental capacity-distortion region. We show that the DRT exists for generic sensing performance metrics that are in general not convex/concave in the ISAC waveform. Especially, we elaborate on a representative non-convex performance metric, namely the detection probability for target detection tasks.

In this paper, we introduce a novel communication-assisted sensing (CAS) framework that explores the potential coordination gains offered by the integrated sensing and communication technique. The CAS system endows users with beyond-line-of-the-sight sensing capabilities, supported by a dual-functional base station that enables simultaneous sensing and communication. To delve into the system's fundamental limits, we characterize the information-theoretic framework of the CAS system in terms of rate-distortion theory. We reveal the achievable overall distortion between the target's state and the reconstructions at the end-user, referred to as the sensing quality of service, within a special case where the distortion metric is separable for sensing and communication processes. As a case study, we employ a typical application to demonstrate distortion minimization under the ISAC signaling strategy, showcasing the potential of CAS in enhancing sensing capabilities.

Integrated sensing and communications (ISAC) has been deemed as one of the main usage scenarios in the 6G system. Before sensing and communication functionalities can be fully integrated on a unified platform sharing resources and waveforms, the two subsystems should occupy orthogonal degrees of freedom to avoid interference. In this paper, we consider the problem of optimizing the sensing performance in orthogonal frequency-division multiplexing (OFDM) systems, while meeting achievable communication rate constraints, by employing appropriate subcarrier allocation strategies. Typical relaxation-based solutions to such problems cannot guarantee that the communication performance constraint is met. To this end, we propose a computationally efficient subcarrier allocation method based on Lagrange relaxation, which produces solutions strictly satisfying the communication performance constraint. We further analyze the performance gap between the proposed method and the actual optimal solution, and show that it is negligible when the number of subcarriers is large.

It is anticipated that integrated sensing and communications (ISAC) would be one of the key enablers of next-generation wireless networks (such as beyond 5G (B5G) and 6G) for supporting a variety of emerging applications. In this paper, we provide a comprehensive review of the recent advances in ISAC systems, with a particular focus on their foundations, physical-layer system design, networking aspects and ISAC applications. Furthermore, we discuss the corresponding open questions of the above that emerged in each issue. Hence, we commence with the information theory of sensing and communications (S&C), followed by the information-theoretic limits of ISAC systems by shedding light on the fundamental performance metrics. Next, we discuss their clock synchronization and phase offset problems, the associated Pareto-optimal signaling strategies, as well as the associated super-resolution physical-layer ISAC system design. Moreover, we envision that ISAC ushers in a paradigm shift for the future cellular networks relying on network sensing, transforming the classic cellular architecture, cross-layer resource management methods, and transmission protocols. In ISAC applications, we further highlight the security and privacy issues of wireless sensing. Finally, we close by studying the recent advances in a representative ISAC use case, namely the multi-object multi-task (MOMT) recognition problem using wireless signals.

Fingerprint-based indoor localization holds great potential for the Internet of Things. Despite numerous studies focusing on its algorithmic and practical aspects, a notable gap exists in theoretical performance analysis in this domain. This paper aims to bridge this gap by deriving several lower bounds and approximations of mean square error (MSE) for fingerprint-based localization. These analyses offer different complexity and accuracy trade-offs. We derive the equivalent Fisher information matrix and its decomposed form based on a wireless propagation model, thus obtaining the Cramér-Rao bound (CRB). By approximating the Fisher information provided by constraint knowledge, we develop a constraint-aware CRB. To more accurately characterize nonlinear transformation and constraint information, we introduce the Ziv-Zakai bound (ZZB) and modify it for adapt deterministic parameters. The Gauss–Legendre quadrature method and the trust-region reflective algorithm are employed to make the calculation of ZZB tractable. We introduce a tighter extrapolated ZZB by fitting the quadrature function outside the well-defined domain based on the Q-function. For the constrained maximum likelihood estimator, an approximate MSE expression, which can characterize map constraints, is also developed. The simulation and experimental results validate the effectiveness of the proposed bounds and approximate MSE.

Adversarial attacks in the field of Natural Language Processing greatly undermine the effectiveness and safety of models, raising significant challenges when it comes to real-world implementation. The researchers suggested using detection methods to identify and reject hostile samples while maintaining the accuracy of the original model. Nevertheless, current detection methods depend on analyzing a single characteristic, resulting in restricted resilience and flexibility. To address these constraints, we proposed the Multiple Adversarial Features Detector (MAFD), an innovative detection technique that utilizes a wide range of adversarial features, such as segmented perplexity, word frequency, and probability distribution, to enhance the effectiveness of detecting adversarial examples. Our comprehensive experiments shows that MAFD outperforms existing advanced methods in terms of detection accuracy and displays significant robustness and adaptability when applied to various base detectors and attack scenarios. In addition, the design of MAFD facilitates the seamless integration of further adversarial features, hence enhancing its detection capabilities.

Sensing in Integrated Sensing and Communications (ISAC) systems with clock asynchronism between the transmitter and receiver poses significant challenges. Understanding the fundamental limits of sensing performance in such setups, which remain largely unknown, is crucial. This paper investigates the sensing performance bounds in the presence of clock asynchronism. In both single-carrier and multi-carrier models, we derive the Cramér-Rao bounds (CRB) for estimating dynamic channel path parameters including angle of arrival, delay, and complex gain sequence (CGS). Through mathematical analyses and numerical simulations, we conduct a comprehensive study on how these bounds depend on various system parameters and the impact of clock asynchronism. Our findings highlight the degradation of parameter estimation performance due to clock asynchronism and reveal low-accuracy zones for CGS estimation in strong-line-of-sight scenarios. Additionally, we observe asymptotic mitigation in performance degradation with larger bandwidth, providing valuable insights for system design and optimization.

In this paper, we shed light on the performance gain of integrated sensing and communications (ISAC) from the perspective of channel correlations between radar sensing and communication (S&C), namely ISAC subspace correlation. To begin with, we consider a multi-input multi-output (MIMO) ISAC system and reveal that the optimal ISAC signal is in the subspace spanned by the transmitted steering vectors of the sensing channel and the right singular matrix of the communication channel. By leveraging this result, we study a basic ISAC scenario with a single target and a single-antenna communication user, and derive the optimal waveform covariance matrix for minimizing the estimation error under a given communication rate constraint. To quantify the integration gain of ISAC systems, we define the subspace “correlation coefficient” to characterize the coupling effect between S&C channels. Finally, numerical results are provided to validate the effectiveness of the proposed approaches.

Integrated sensing and communications (ISAC) is recognized as a key enabling technology for future wireless networks. To shed light on the fundamental performance limits of ISAC systems, this paper studies the deterministic-random tradeoff between sensing and communications (S&C) from a rate-distortion perspective under vector Gaussian channels. We model the ISAC signal as a random matrix that carries information, whose realization is perfectly known to the sensing receiver, but is unknown to the communication receiver. We characterize the sensing mutual information conditioned on the random ISAC signal, and show that it provides a universal lower bound for distortion metrics of sensing. Furthermore, we prove that the distortion lower bound is minimized if the sample covariance matrix of the ISAC signal is deterministic. We then offer our understanding of the main results by interpreting wireless sensing as non-cooperative source-channel coding, and reveal the deterministic-random tradeoff of S&C for ISAC systems. Finally, we provide sufficient conditions for the achievability of the distortion bound by analyzing specific examples.

Location-awareness is essential in various wireless applications. The capability of performing precise ranging is substantial in achieving high-accuracy localization. Due to the notorious ambiguity phenomenon, optimal ranging waveforms should be adaptive to the signal-to-noise ratio (SNR). In this letter, we propose to use the Ziv-Zakai bound (ZZB) as the ranging performance metric, as well as an associated waveform design algorithm having theoretical guarantee of achieving the optimal ZZB at a given SNR. Numerical results suggest that, in stark contrast to the well-known high-SNR design philosophy, the detection probability of the ranging signal becomes more important than the resolution in the low-SNR regime

Integrated Sensing and Communication (ISAC) is recognized as a promising technology for the next-generation wireless networks, which provides significant performance gains over individual sensing and communications (S&C) systems via the shared use of wireless resources. The characterization of the S&C performance tradeoff is at the core of the theoretical foundation of ISAC. In this paper, we consider a point-to-point (P2P) ISAC model under vector Gaussian channels, and propose to use the Cramér-Rao bound (CRB)-rate region as a basic tool for depicting the fundamental S&C tradeoff. In particular, we consider the scenario where a unified ISAC waveform is emitted from a dual-functional ISAC transmitter (Tx), which simultaneously communicates information to a communication receiver (Rx) and senses targets with the help of a sensing Rx. In order to perform both S&C tasks, the ISAC waveform is required to be random to convey communication information, with realizations being perfectly known at both the ISAC Tx and the sensing Rx as a reference sensing signal as in typical radar systems. In this context, we treat the ISAC waveform as a random but known nuisance parameter in the sensing signal model, and define a Miller-Chang type CRB for the analysis of the sensing performance. As the main contribution of this paper, we characterize the S&C performance at the two corner points of the CRB-rate region, namely,$P_{\mathrm{ SC}}$indicating the maximum achievable communication rate constrained by the minimum CRB, and$P_{\mathrm{ CS}}$indicating the minimum achievable CRB constrained by the maximum communication rate. In particular, we derive the high-SNR communication capacity at$P_{\mathrm{ SC}}$, and provide lower and upper bounds for the sensing CRB at$P_{\mathrm{ CS}}$. We show that these two points can be achieved by the conventional Gaussian signalling and a novel strategy relying on the uniform distribution over the set of semi-unitary matrices, i.e., the Stiefel manifold, respectively. Based on the above-mentioned analysis, we provide an outer bound and various inner bounds for the achievable CRB-rate regions. Our main results reveal a two-fold tradeoff in ISAC systems, consisting of the subspace tradeoff (ST) and the deterministic-random tradeoff (DRT) that depend on the resource allocation and data modulation schemes employed for S&C, respectively. Within this framework, we examine the state-of-the-art ISAC signalling strategies and study a number of illustrative examples, which are validated through numerical simulations.

To alleviate the explosive growth of data traffic caused by the increased use of smart devices, new transmission techniques are needed to increase the utilization of limited bandwidth resources and for providing high transmission rates in future wireless networks. On the other hand, due to their flexibility and autonomy, unmanned aerial vehicles (UAVs) are considered as a potential candidate to support ubiquitous connectivity and operate as flying base stations, where the deployment of UAVs can affect the quality of experience (QoE) of users. Hence, in this paper, we employ UAVs as aerial base stations to transmit data to ground users (GUs) via air to ground (A2G) communication links, where we show how content awareness can help improve the data rate. Specifically, we design two content-sharing (CS) data transmission schemes to improve the average data rate of the GUs. Additionally, two UAV deployment strategies, namely the fixed-point deployment scheme and traverse-search deployment scheme, are proposed based on the proposed CS transmission schemes. The simulation results demonstrate that our proposed data transmission schemes combined with their proposed deployment schemes outperform the traditional transmission scheme by 26 bits/s/Hz and 51 bits/s/Hz, respectively.

The black-box adversarial attack has attracted impressive attention for its practical use in the field of deep learning security. Meanwhile, it is very challenging as there is no access to the network architecture or internal weights of the target model. Based on the hypothesis that if an example remains adversarial for multiple models, then it is more likely to transfer the attack capability to other models, the ensemble-based adversarial attack methods are efficient and widely used for black-box attacks. However, ways of ensemble attack are rather less investigated, and existing ensemble attacks simply fuse the outputs of all the models evenly. In this work, we treat the iterative ensemble attack as a stochastic gradient descent optimization process, in which the variance of the gradients on different models may lead to poor local optima. To this end, we propose a novel attack method called the stochastic variance reduced ensemble (SVRE) attack, which could reduce the gradient variance of the ensemble models and take full advantage of the ensemble attack. Empirical results on the standard ImageNet dataset demonstrate that the proposed method could boost the adversarial transferability and outperforms existing ensemble attacks significantly. Code is available at https://github.com/JHL-HUST/SVRE.

Integrated Sensing and Communication (ISAC) is recognized as a promising technology for the next-generation wireless networks. In this paper, we provide a general framework to reveal the fundamental tradeoff between sensing and communications (S&C), where a unified ISAC waveform is exploited to perform dual-functional tasks. In particular, we define the Cramér-Rao bound (CRB)-rate region to characterize the S&C tradeoff, and propose a pentagon inner bound of the region. We show that the two corner points of the CRB-rate region can be achieved by the conventional Gaussian waveform and a novel strategy corresponding to the uniform distribution over the Stiefel manifold, respectively. Moreover, we also offer our insights into transmission approaches achieving the boundary of the CRB-rate region, namely the Shannon-Fisher information flow.

Deep neural networks (DNNs) are widely used for neural modulation recognition (NMR) in the electronic field and have been shown to be vulnerable to adversarial examples for NMR. In the physical signal communication scenario, the adversarial signal transmitted by the adversary is affected by the channel, resulting in a random time delay with the original signal and causing decay on the attack performance. To ad-dress this issue, we propose the Position-Invariant adversarial attack Method (PIM) that generates the position-invariant adversarial signal by averaging the adversarial signals generated by shifted input signals to mitigate the channel effect on time delay. Our PIM can be easily integrated with other methods to achieve better results. Extensive experiments demonstrate that the proposed method could outperform all baselines for adversarial attacks on NMR under the time delay setting.

A line of work has shown that natural text processing models are vulnerable to adversarial examples. Correspondingly, various defense methods are proposed to mitigate the threat of textual adversarial examples, \textit{e.g.} adversarial training, input transformations, detection, \textit{etc}. In this work, we treat the optimization process for synonym substitution based textual adversarial attacks as a specific sequence of word replacement, in which each word mutually influences other words. We identify that we could destroy such mutual interaction and eliminate the adversarial perturbation by randomly substituting a word with its synonyms. Based on this observation, we propose a novel textual adversarial example detection method, termed \textit{Randomized Substitution and Vote} (RS&V), which votes the prediction label by accumulating the logits of $k$ samples generated by randomly substituting the words in the input text with synonyms. The proposed RS&V is generally applicable to any existing neural networks without modification on the architecture or extra training, and it is orthogonal to prior work on making the classification network itself more robust. Empirical evaluations on three benchmark datasets demonstrate that our RS&V could detect the textual adversarial examples more successfully than the existing detection methods while maintaining the high classification accuracy on benign samples.

Quantum phase estimation is an important component in diverse quantum algorithms. However, it suffers from spectral leakage, when the reciprocal of the record length is not an integer multiple of the unknown phase, which incurs an accuracy degradation. For the existing single-sample estimation scheme, window-based methods have been proposed for spectral leakage mitigation. As a further advance, we propose a dual-frequency estimator, which asymptotically approaches the Cramér-Rao bound, when multiple samples are available. Numerical results show that the proposed estimator outperforms the existing window-based methods, when the number of samples is sufficiently high.

Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices, where the quantum approximation optimization algorithm (QAOA) constitutes a promising candidate for demonstrating tangible quantum advantages based on NISQ devices. In this paper, we consider the maximum likelihood (ML) detection problem of binary symbols transmitted over a multiple-input and multiple-output (MIMO) channel, where finding the optimal solution is exponentially hard using classical computers. Here, we apply the QAOA for the ML detection by encoding the problem of interest into a level-$p$QAOA circuit having$2p$variational parameters, which can be optimized by classical optimizers. This level-$p$QAOA circuit is constructed by applying the prepared Hamiltonian to our problem and the initial Hamiltonian alternately in$p$consecutive rounds. More explicitly, we first encode the optimal solution of the ML detection problem into the ground state of a problem Hamiltonian. Using the quantum adiabatic evolution technique, we provide both analytical and numerical results for characterizing the evolution of the eigenvalues of the quantum system used for ML detection. Then, for level-1 QAOA circuits, we derive the analytical expressions of the expectation values of the QAOA and discuss the complexity of the QAOA based ML detector. Explicitly, we evaluate the computational complexity of the classical optimizer used and the storage requirement of simulating the QAOA. Finally, we evaluate the bit error rate (BER) of the QAOA based ML detector and compare it both to the classical ML detector and to the classical minimum mean squared error (MMSE) detector, demonstrating that the QAOA based ML detector is capable of approaching the performance of the classical ML detector.

Quantum error mitigation (QEM) is a class of promising techniques capable of reducing the computational error of variational quantum algorithms tailored for current noisy intermediate-scale quantum computers. The recently proposed permutation-based methods are practically attractive, since they do not rely on anya prioriinformation concerning the quantum channels. In this treatise, we propose a general framework termed as permutation filters, which includes the existing permutation-based methods as special cases. In particular, we show that the proposed filter design algorithm always converge to the global optimum, and that the optimal filters can provide substantial improvements over the existing permutation-based methods in the presence of narrowband quantum noise, corresponding to large-depth, high-error-rate quantum circuits.

Quantum error mitigation (QEM) is a class of promising techniques for reducing the computational error of variational quantum algorithms. In general, the computational error reduction comes at the cost of a sampling overhead due to the variance-boosting effect caused by the channel inversion operation, which ultimately limits the applicability of QEM. Existing sampling overhead analysis of QEM typically assumes exact channel inversion, which is unrealistic in practical scenarios. In this treatise, we consider a practical channel inversion strategy based on Monte Carlo sampling, which introduces additional computational error that in turn may be eliminated at the cost of an extra sampling overhead. In particular, we show that when the computational error is small compared to the dynamic range of the error-free results, it scales with the square root of the number of gates. By contrast, the error exhibits a linear scaling with the number of gates in the absence of QEM under the same assumptions. Hence, the error scaling of QEM remains to be preferable even without the extra sampling overhead. Our analytical results are accompanied by numerical examples.

Network localization is capable of providing accurate and ubiquitous position information for numerous wireless applications. This paper studies the accuracy of cooperative network localization in large-scale wireless networks. Based on a decomposition of the equivalent Fisher information matrix (EFIM), we develop a random-walk-inspired approach for the analysis of EFIM, and propose a position information routing interpretation of cooperative network localization. Using this approach, we show that in large lattice and stochastic geometric networks, when anchors are uniformly distributed, the average localization error of agents grows logarithmically with the reciprocal of anchor density in an asymptotic regime. The results are further illustrated using numerical examples.

Hybrid Transmit Precoding (TPC) is one of the most compelling solutions for millimeter wave (mmWave) multiple-input multiple output (MIMO) systems. However, most attention has been focused on narrow-band scenarios. Hence, we dedicate our efforts to the design of hybrid TPC for wideband mmWave MIMO systems, where the beam squint dramatically affects the system performance. We firstly show that the channel matrices of the different subcarriers possess distinct subspaces in case of high bandwidths, hence traditional hybrid TPC schemes suffer from an eroded performance. Therefore, we propose novel hybrid TPC schemes exploiting the full channel state information (CSI), which project all frequencies to the central frequency and construct the common analog TPC matrix for all subcarriers. Moreover, we propose several low-complexity array-vector based hybrid TPC schemes. The high-complexity manifold optimization based hybrid TPC method and the fully digital TPC operating with and without considering beam squint are provided as benchmarks. Our extensive numerical simulations show that the proposed hybrid TPC schemes are capable of achieving similar performance to the excessive-complexity fully digital TPC, when the bandwidth tends to 0.5 GHz and always outperform the traditional hybrid TPC schemes.

As the enabling technologies move up to the mmWave and even to the TeraHertz bands for the next-generation wireless systems, the signal processing of high-bandwidth orthogonal frequency division multiplexing (OFDM) becomes increasingly power-thirsty, owing to the following OFDM deficiencies: (1) the high peak-to-average power ratio (PAPR); (2) the bandwidth efficiency loss due to the cyclic prefix (CP) overhead; (3) the sensitivity to carrier frequency offset; (4) the complex out-of-band (OOB) filtering. Over the past six decades, a variety of waveforms have been developed in order to mitigate these deficiencies, which are generally achieved at the cost of compromising some of OFDM’s beneficial properties, such as its subcarrier (SC) orthogonality, its high throughput and its straighforward adoption to multiple-input multiple-output (MIMO) systems. Against this background, we propose a new waveform termed as multi-band discrete Fourier transform spread-OFDM with index modulation (MB-DFT-S-OFDM-IM), where the component multi-carrier techniques are conceived to constructively function together in order to mitigate the OFDM deficiencieswithout compromising the beneficial OFDM properties. More explicitly, first of all, the PAPR is reduced by the DFT-precoding. Secondly, thanks to the IM design, MB-DFT-S-OFDM-IM is capable of achieving a high throughput that is strictly equal to or higher than the OFDM throughput. Thirdly, MB-DFT-S-OFDM-IM achieves a beneficial frequency diversity gain, which leads to a higher tolerance to carrier frequency offset. Fourthly, the OOB filters are placed in each sub-band before DFT, so that the SC orthogonality remains intact, which is unique to the proposed MB-DFT-S-OFDM-IM structure. Last but not least, we extend the proposed MB-DFT-S-OFDM-IM to support a variety of MIMO schemes, where the IM philosophy is integrated with the space-, time- and frequency-domains within a singleunifiedplatform.

Wireless networks are growing in the value of application in many areas, in which accurate clock synchronization is required when tasks are performed in a collaborative fashion among nodes. Especially, cooperative synchronization techniques lead to significant performance improvement compared with traditional methods. However, the correlation among agents renders the performance analysis of cooperative network synchronization difficult. In this paper, we introduce the concept of information coupling intensity to the analysis of interaction between agents. Our approach enables us to derive closed-form asymptotic expressions under specific network topologies, and relate them to various network parameters.

Location-aware wireless networks can provide precise location information in harsh environments, however, which is only possible when all nodes are well-functioning. In this paper, we propose algorithms and analyze the performance limits for both non-cooperative and cooperative localization networks in the presence of ranging outliers. Especially, we show that the localization performance can be boosted by using the cooperative outlier detection scheme. An algorithm based on expectation-maximization is proposed for non-cooperative localization networks, while a variational message passing-based algorithm is proposed for the cooperative counterparts. Performance limits are investigated using Cramér-Rao lower bound. Further inspection on the performance limits confirms the performance gain from the cooperative detection scheme. Stochastic geometric analysis is also carried out to account for the stochastic nature of wireless networks, as well as to provide simpler expressions and additional insights. Simulation results corroborate the analytical results, and show that both of the proposed algorithms are capable of attaining the corresponding performance limits at a significantly reduced computational cost compared with existing algorithms.