SearcharxivSearch

arXiv subjects

Yinghui Ye

Publications and source records attributed to Yinghui Ye.

At least 19 recordsLinked to original sources

Do Ambient Backscatter Communication Receivers Require Low-Noise Amplifiers?

In ambient backscatter communication (AmBC), strong direct interference from the ambient source poses a major challenge to reliable symbol detection. Although previous studies have shown that employing a low-noise amplifier (LNA) in conventional point-to-point communication improves symbol detection performance at low-to-moderate transmission power, it remains unclear whether this improvement also holds for AmBC. To respond it, in this work, we investigate the symbol detection performance of an AmBC receiver that is equipped with an LNA and adopts the energy detection (ED) to recover tag's information. Particularly, we first propose a new AmBC symbol detection framework that incorporates LNA parameters. On this basis, we derive the bit error rate (BER) of the ED and employ the deflection coefficient (DC) to demonstrate that the detection performance can be enhanced by the LNA at low-to-moderate ambient source transmission power. Then, we derive the near-optimal detection threshold to minimize the BER and propose a method to estimate the required parameters for this threshold by leveraging the tag's pilot symbols.

cs.IT

Symbol Detection in Ambient Backscatter Communications Under Residual Time Synchronization Errors

Ambient backscatter communications (AmBC), where a backscatter transmitter (BT) modulates and reflects ambient signals to a backscatter receiver (BR), have been deemed a low-power communication technology for the Internet of Things. Previous work on symbol detection in AmBC assumed perfect time synchronization (TS), which is unrealistic in practice. The residual TS errors (RTSE) cause \emph{partial sample mismatch}, degrading symbol detection performance. To address this, we propose a new AmBC symbol detection framework that incorporates the BT's current and adjacent symbols, as well as channel coefficients. Using energy detector (ED) as a case study, we derive both exact and approximate bit error rate (BER) expressions. Our results show that the ED's BER performance degrades significantly under RTSE, with the symbol detection threshold optimized under the assumption of perfect TS. We then derive a closed-form expression for a near-optimal symbol detection threshold that minimizes BER under RTSE. To estimate the required parameters for the detection threshold, we propose a novel method exploiting the attributes of the BR's received signal samples. The analytical results are verified by simulation results.

cs.IT

Symbol Detection in Multi-channel Multi-tag Ambient Backscatter Communication Under IQ Imbalance

Ambient backscatter communication (AmBC) offers low-cost and low-power connectivity for Internet of Things (IoT), where a backscatter tag (BT) modulates incident signals transmitted by an ambient radio frequency (RF) source and reflects them to its associated AmBC receiver. In multi-channel multi-tag AmBC, one of major challenges from the aspect of symbol detection is the image channel crosstalk, which is induced by the inevitable in-phase/quadrature (IQ) imbalance. To address this issue, in this paper, we study symbol detection in multi-channel multi-tag AmBC under IQ imbalance. Considering the differential encoding scheme at the BTs, we propose a novel symbol detection model that incorporates IQ imbalance parameters, the presence or absence of both the incident signal and the backscattered signal of the image channel. On this basis, considering an energy difference detector at the AmBC receiver, we derive the closed-form expressions for the bit error rate (BER) as well as the near-optimal detection threshold to minimize BER. However, calculating the near-optimal detection threshold requires prior information, such as the IQ imbalance parameters, the presence probability of the incident signal of the image channel and the backscattered signal of the image channel, the signal power of the ambient RF source, and the noise power, which are typically unknown to the AmBC receiver in practice. To eliminate the need for the prior information, we propose a threshold estimation method using the received samples. Numerical results indicate that under IQ imbalance, directly using the existing method leads to a significant degradation in BER performance. However, this degradation can be effectively mitigated by our derived detection threshold.

cs.IT

Performance Analysis of Single-Antenna Fluid Antenna Systems via Extreme Value Theory

In single-antenna fluid antenna systems (FASs), the transceiver dynamically selects the antenna port with the strongest instantaneous channel to enhance link reliability. However, deriving accurate yet tractable performance expressions under fully correlated fading remains challenging, primarily due to the absence of a closed-form distribution for the FAS channel. To address this gap, this paper develops a novel performance evaluation framework for FAS operating under fully correlated Rayleigh fading, by modeling the FAS channel through extreme value distributions (EVDs). We first justify the suitability of EVD modeling and approximate the FAS channel through the Gumbel distribution, with parameters expressed as functions of the number of ports and the antenna aperture size via the maximum likelihood (ML) criterion. Closed-form expressions for the outage probability (OP) and ergodic capacity (EC) are then derived. While the Gumbel model provides an excellent fit, minor deviations arise in the extreme-probability regions. To further improve accuracy, we extend the framework using the generalized extreme value (GEV) distribution and obtain closed-form OP and EC approximations based on ML-derived parameters. Simulation results confirm that the proposed GEV-based framework achieves superior accuracy over the Gumbel-based model, while both EVD-based approaches offer computationally efficient and analytically tractable tools for evaluating the performance of FAS under realistic correlated fading conditions.

cs.IT

Symbol Timing Synchronization and Signal Detection for Ambient Backscatter Communication

Ambient backscatter communication (AmBC) enables ambient Internet of Things (AIoT) devices to achieve ultra-low-power, low-cost, and massive connectivity. Most existing AmBC studies assume ideal synchronization between the backscatter device (BD) and the backscatter receiver (BR). However, in practice, symbol timing offset (STO) occurs due to both the propagation delay and the BR activation latency, which leads to unreliable symbol recovery at the BR. Moreover, the uncontrollable nature of the ambient radio frequency source renders conventional correlation-based synchronization methods infeasible in AmBC. To address this challenge, we investigate STO estimation and symbol detection in AmBC without requiring coordination from the ambient radio frequency source. Firstly, we design a specialized pilot sequence at the BD to induce sampling errors in the pilot signal. Furthermore, we propose a pilot-based STO estimator using the framework of maximum likelihood estimation (MLE), which can exploit the statistical variations in the received pilot signal. Finally, we integrate STO compensation into an energy detector and evaluate the bit error rate (BER) performance. Simulation results show that the proposed estimator achieves accurate STO estimation and effectively mitigates the BER performance degradation caused by STO.

cs.IT

Resource Allocation for Mutualistic Symbiotic Radio with Hybrid Active-Passive Communications

Mutualistic SR is a communication paradigm that offers high spectrum efficiency and low power consumption, where the SU transmits information by modulating and backscattering the PT's signal, enabling shared use of spectrum and power with PT. In return, the PT's performance can be enhanced by SU's backscattered signal, forming a mutualistic relationship. However, the low modulation rate causes extremely inferior transmission rates for SUs. To improve the SU transmission rate, this paper proposes a new mutualistic SR with HAPC to explore the tradeoff between BC and AC in terms of power consumption and transmission rate, enabling each SU to transmit signal via passive BC and AC alternatively. We propose two problems to maximize the total rate of all SUs under the fixed and dynamic SIC ordering, respectively. The fixed SIC ordering-based problem is to jointly optimize the SUs' reflection coefficients, the transmit power of each SU during AC, and the time allocation for each SU during BC and AC, subject to the energy causality constraint and the PT's transmission rate gain constraint. In addition to pondering the constraints involved in the fixed SIC ordering-based problem, the dynamic SIC ordering-based problem, which is a mixed integer programming one, further considers the SIC ordering constraint. The above two problems are solved by our proposed SCA-based and BCD-based iterative algorithms, respectively. Simulation results demonstrate that: 1) the proposed mutualistic SR system outperforms traditional designs in terms of the rates achieved by SUs under the same constraints; 2) the total rate of all SUs under the dynamic SIC ordering is larger than that of the fixed one when the PT's minimum rate gain is high, and becomes nearly identical when the PT's minimum rate gain is low.

cs.IT

Gaussian Copula-Based Outage Performance Analysis of Fluid Antenna Systems: Channel Coefficient- or Envelope-Level Correlation Matrix?

Gaussian copula has been employed to evaluate the outage performance of Fluid Antenna Systems (FAS), with the covariance matrix reflecting the dependence among multivariate normal random variables (RVs). While prior studies approximate this matrix using the channel coefficient correlation matrix from Jake's model, this work instead employs the channel envelope correlation matrix, motivated by the fact that the multivariate normal RVs are generated by transforming correlated channel envelopes. This raises an open question of whether using the coefficient- or envelope-level correlation matrix yields better accuracy in accessing FAS performance. Toward this end, this paper explores the benefits of using the envelope-level correlation matrix under fully correlated Nakagami-m fading, and develops a method for generating such fading channels for Monte Carlo simulations, which serve as a benchmark for validating the theoretical results. Simulation results confirm the effectiveness of the proposed channel modeling approach and demonstrate the superior accuracy of using the envelope-level correlation matrix, particularly in sparse port deployment and low-outage regime.

cs.IT

The volume comparison of symmetric spaces of non-compact type of rank 1

Motivated by Schoen's conjecture on the volume functional for closed hyperbolic manifolds, we generalize the volume comparison theorem of Hu, Ji, and Shi and establish a volume comparison theorem for rank 1 symmetric spaces of non-compact type under a scalar curvature condition. Furthermore, we prove a rigidity result. Our proof uses the normalized Ricci--DeTurck flow to analyze the asymptotic behavior of the volume functional and to derive monotonicity properties. This extends the classical volume comparison framework to symmetric spaces of non-compact type.

math.DG

Symbiotic Backscatter Communication: A Design Perspective on the Modulation Scheme of Backscatter Devices

Symbiotic Backscatter Communication (SBC) has emerged as a spectrum-efficient and low-power communication technology, where backscatter devices (BDs) modulate and reflect incident radio frequency (RF) signals from primary transmitters (PTs). While previous studies have assumed a circularly symmetric complex Gaussian (CSCG) distribution for the BD's signal, this assumption may not be practical because the high complexity of generating CSCG signals is not supported by the low-cost BD. In this paper, we address this gap by investigating SBC for two low-complexity modulation schemes, i.e., $M$-ary amplitude-shift keying (MASK) and $M$-ary phase-shift keying (MPSK), where BD's signals inherently deviate from CSCG distribution. Our goal is to derive the achievable rate of the PT and BD under the MASK/MPSK and to design MASK/MPSK modulation scheme for maximizing the PT's rate. Towards this end, we first derive the expressions of both the PT's rate and BD's rate. Theoretical results reveal that whether or not the BD improves the PT's rate depends on the phase of MASK/MPSK modulation, while the BD's rate is independent of this phase. We then formulate two optimization problems to maximize the PT's rate by adjusting the phase under the MASK and MPSK modulation schemes, respectively, and derive the optimal phases for each modulation scheme in closed forms. Simulation results demonstrate that the optimal phase of MASK/MPSK can ensure an improvement in the PT's rate, and reveal that a low-order ASK modulation is better than a low-order PSK for the BD in terms of improving PT's rate, especially when the direct link is not significantly weaker than the backscatter link in SBC.

cs.IT

Comparison of total $\sigma_k$-curvature

Volume comparison theorem is a type of fundamental results in Riemannian geometry. In this article, we extend the volume comparison result in \cite{Besse2008} to the comparison of total $\sigma_l$-curvature with respect to $\sigma_k$-curvature ($l<k$). In particular, we prove the comparison holds for metrics close to strictly stable positive Einstein metric with $l<\frac{n}{2}$. As for negative Einstein metrics, we prove a similar comparison result provided certain assumptions on sectional curvature holds for the manifold.

math.DG

Revolutionizing Symbiotic Radio: Exploiting Tradeoffs in Hybrid Active-Passive Communications

Symbiotic radio (SR), a novel energy- and spectrum-sharing paradigm of backscatter communications (BC), has been deemed a promising solution for ambient Internet of Things (A-IoT), enabling ultra-low power consumption and massive connectivity. However, A-IoT nodes utilizing BC suffer from low transmission rates, which may limit the applications of SR in A-IoT scenarios with data transmission requirements. To address this issue, in this article, we introduce hybrid active-passive communications (HAPC) into SR by exploiting tradeoffs between transmission rate and power consumption. We first present an overview of novel BC paradigms including ambient BC and SR. Then, a novel HAPC-enabled SR is proposed to enhance the transmission rate of A-IoT nodes. Furthermore, within this paradigm, we investigate the resource allocation scheme and present preliminary research results. Simulation results show that the transmission rate of A-IoT nodes in the proposed HAPC-enabled SR surpasses that in traditional SR. Finally, we discuss open issues related to HAPC-enabled SR.

cs.IT

Safeguarding Next Generation Multiple Access Using Physical Layer Security Techniques: A Tutorial

Driven by the ever-increasing requirements of ultra-high spectral efficiency, ultra-low latency, and massive connectivity, the forefront of wireless research calls for the design of advanced next generation multiple access schemes to facilitate provisioning of these stringent demands. This inspires the embrace of non-orthogonal multiple access (NOMA) in future wireless communication networks. Nevertheless, the support of massive access via NOMA leads to additional security threats, due to the open nature of the air interface, the broadcast characteristic of radio propagation as well as intertwined relationship among paired NOMA users. To address this specific challenge, the superimposed transmission of NOMA can be explored as new opportunities for security aware design, for example, multiuser interference inherent in NOMA can be constructively engineered to benefit communication secrecy and privacy. The purpose of this tutorial is to provide a comprehensive overview on the state-of-the-art physical layer security techniques that guarantee wireless security and privacy for NOMA networks, along with the opportunities, technical challenges, and future research trends.

cs.IT

Map2Schedule: An End-to-End Link Scheduling Method for Urban V2V Communications

Urban vehicle-to-vehicle (V2V) link scheduling with shared spectrum is a challenging problem. Its main goal is to find the scheduling policy that can maximize system performance (usually the sum capacity of each link or their energy efficiency). Given that each link can experience interference from all other active links, the scheduling becomes a combinatorial integer programming problem and generally does not scale well with the number of V2V pairs. Moreover, link scheduling requires accurate channel state information (CSI), which is very difficult to estimate with good accuracy under high vehicle mobility. In this paper, we propose an end-to-end urban V2V link scheduling method called Map2Schedule, which can directly generate V2V scheduling policy from the city map and vehicle locations. Map2Schedule delivers comparable performance to the physical-model-based methods in urban settings while maintaining low computation complexity. This enhanced performance is achieved by machine learning (ML) technologies. Specifically, we first deploy the convolutional neural network (CNN) model to estimate the CSI from street layout and vehicle locations and then apply the graph embedding model for optimal scheduling policy. The results show that the proposed method can achieve high accuracy with much lower overhead and latency.

cs.NI

Is the Performance of NOMA-aided Integrated Sensing and Multicast-Unicast Communications Improved by IRS?

In this paper, we consider intelligent reflecting surface (IRS) in a non-orthogonal multiple access (NOMA)-aided Integrated Sensing and Multicast-Unicast Communication (ISMUC) system, where the multicast signal is used for sensing and communications while the unicast signal is used only for communications. Our goal is to depict whether the IRS improves the performance of NOMA-ISMUC system or not under the imperfect/perfect successive interference cancellation (SIC) scenario. Towards this end, we formulate a non-convex problem to maximize the unicast rate while ensuring the minimum target illumination power and multicast rate. To settle this problem, we employ the Dinkelbach method to transform this original problem into an equivalent one, which is then solved via alternating optimization algorithm and semidefinite relaxation (SDR) with Sequential Rank-One Constraint Relaxation (SROCR). Based on this, an iterative algorithm is devised to obtain a near-optimal solution. Computer simulations verify the quick convergence of the devised iterative algorithm, and provide insightful results. Compared to NOMA-ISMUC without IRS, IRS-aided NOMA-ISMUC achieves a higher rate with perfect SIC but keeps the almost same rate in the case of imperfect SIC.

cs.IT

Relay-Enabled Backscatter Communications: Linear Mapping and Resource Allocation

Relay-enabled backscatter communication (BC) is an intriguing paradigm to alleviate energy shortage and improve throughput of Internet-of-Things (IoT) devices. Most of the existing works focus on the resource allocation that considered the unequal and continuous time allocation for both source-relay and relay-destination links. However, the continuous time allocation may be infeasible since in practice, the time allocation shall be carried out in integral multiple of the subframe duration unit. In this article, we study a discrete time scheme from the perspective of frame structure, where one transmission block is divided into two phases and the linear mapping is employed as a re-encoding method to determine the number of subframes for both phases and the power allocation for each subframe in a relay-enabled BC system. Based on this, we derive an accurate system-throughput expression and formulate a mixed-integral non-convex optimization problem to maximize the system throughput by jointly optimizing the power reflection coefficient (PRC) of the IoT node, the power allocation of the hybrid access point (HAP) and the linear mapping matrix, and solve it via a three-step approach. Accordingly, we propose a low complexity iterative algorithm to obtain the throughput maximization-based resource allocation solution. Numerical results analyze the performance of our proposed algorithm, verify the superiority of our proposed scheme, and evaluate the impacts of network parameters on the system throughput.

cs.IT

Power Beacon Energy Consumption Minimization in Wireless Powered Backscatter Communication Networks

Internet-of-Things (IoT) networks are expected to support the wireless connection of massive energy limited IoT nodes. The emerging wireless powered backscatter communications (WPBC) enable IoT nodes to harvest energy from the incident radio frequency signals transmitted by a power beacon (PB) to support their circuit operation, but the energy consumption of the PB (a potentially high cost borne by the network operator) has not been sufficiently studied for WPBC. In this paper, we aim to minimize the energy consumption of the PB while satisfying the throughput requirement per IoT node by jointly optimizing the time division multiple access (TDMA) time slot duration and backscatter reflection coefficient of each IoT node and the PB transmit power per time slot. As the formulated joint optimization problem is non-convex, we transform it into a convex problem by using auxiliary variables, then employ the Lagrange dual method to obtain the optimal solutions. To reduce the implementation complexity required for adjusting the PB's transmit power every time slot, we keep the PB transmit power constant in each time block and solve the corresponding PB energy consumption minimization problem by using auxiliary variables, the block coordinated decent method and the successive convex approximation technique. Based on the above solutions, two iterative algorithms are proposed for the dynamic PB transmit power scheme and the static PB transmit power scheme. The simulation results show that the dynamic PB transmit power scheme and the static PB transmit power scheme both achieve a lower PB energy consumption than the benchmark schemes, and the former achieves the lowest PB energy consumption.

cs.IT

FlexEdge: Digital Twin-Enabled Task Offloading for UAV-Aided Vehicular Edge Computing

Integrating unmanned aerial vehicles (UAVs) into vehicular networks have shown high potentials in affording intensive computing tasks. In this paper, we study the digital twin driven vehicular edge computing networks for adaptively computing resource management where an unmanned aerial vehicle (UAV) named FlexEdge acts as a flying server. In particular, we first formulate an energy consumption minimization problem by jointly optimizing UAV trajectory and computation resource under the practical constraints. To address such a challenging problem, we then build the computation offloading process as a Markov decision process and propose a deep reinforcement learning-based proximal policy optimization algorithm to dynamically learn the computation offloading strategy and trajectory design policy. Numerical results indicate that our proposed algorithm can achieve quick convergence rate and significantly reduce the system energy consumption.

cs.NI

Rate Splitting Multiple Access Aided Mobile Edge Computing in Cognitive Radio Networks

In this paper, we investigate rate splitting multiple access (RSMA) aided mobile edge computing (MEC) in a cognitive radio network. We propose a RSMA scheme that enables the secondary user to offload tasks to the MEC server utilizing dynamic rate splitting without deteriorating the primary user's offloading. The expressions for the optimal rate splitting parameters that maximize the achievable rate for the secondary user and successful computation probability of the proposed RSMA scheme are derived in closed-form. We formulate a problem to maximize successful computation probability by jointly optimizing task offloading ratio and task offloading time and obtain the optimal solutions in closed-form. Simulation results clarify that the proposed RSMA scheme achieves a higher successful computation probability than the existing non-orthogonal multiple access scheme.

cs.IT