Search:
Match:
3 results
Research Paper#Wireless Communication, ISAC, Resource Allocation🔬 ResearchAnalyzed: Jan 3, 2026 17:07

Efficient Resource Allocation for Wireless Powered ISAC

Published:Dec 31, 2025 12:03
1 min read
ArXiv

Analysis

This paper addresses the critical challenge of balancing energy supply, communication throughput, and sensing accuracy in wireless powered integrated sensing and communication (ISAC) systems. It focuses on target localization, a key application of ISAC. The authors formulate a max-min throughput maximization problem and propose an efficient successive convex approximation (SCA)-based iterative algorithm to solve it. The significance lies in the joint optimization of WPT duration, ISAC transmission time, and transmit power, demonstrating performance gains over benchmark schemes. This work contributes to the practical implementation of ISAC by providing a solution for resource allocation under realistic constraints.
Reference

“The paper highlights the importance of coordinated time-power optimization in balancing sensing accuracy and communication performance in wireless powered ISAC systems.”

PermalinkArXiv
Mathematics#Representation Theory, p-adic Hodge Theory🔬 ResearchAnalyzed: Jan 3, 2026 16:45

Extension Groups of Generalized Steinberg Representations

Published:Dec 30, 2025 15:07
1 min read
ArXiv

Analysis

This paper investigates extension groups between locally analytic generalized Steinberg representations of GL_n(K), motivated by previous work on automorphic L-invariants. The results have applications in understanding filtered (φ,N)-modules and defining higher L-invariants for GL_n(K), potentially connecting them to Fontaine-Mazur L-invariants.
Reference

“The paper proves that a certain universal successive extension of filtered (φ,N)-modules can be realized as the space of homomorphisms from a suitable shift of the dual of locally K-analytic Steinberg representation into the de Rham complex of the Drinfeld upper-half space.”

PermalinkArXiv
Research Paper#Optimization Algorithms🔬 ResearchAnalyzed: Jan 3, 2026 16:51

Single-Loop Algorithm for Composite Optimization

Published:Dec 30, 2025 08:09
1 min read
ArXiv

Analysis

This paper introduces and analyzes a single-loop algorithm for a complex optimization problem involving Lipschitz differentiable functions, prox-friendly functions, and compositions. It addresses a gap in existing algorithms by handling a more general class of functions, particularly non-Lipschitz functions. The paper provides complexity analysis and convergence guarantees, including stationary point identification, making it relevant for various applications where data fitting and structure induction are important.
Reference

“The algorithm exhibits an iteration complexity that matches the best known complexity result for obtaining an (ε₁,ε₂,0)-stationary point when h is Lipschitz.”

PermalinkArXiv