154 papers
This paper proposes a novel Bayesian framework that fuses monostatic and bistatic multipath measurements to achieve robust, high-accuracy low-altitude environment mapping under non-ideal surface conditions, overcoming the limitations of existing approaches that rely solely on bistatic specular reflections.
This paper proposes a stochastic geometry framework using both Poisson and beta-Ginibre point processes to analyze downlink EMF exposure and introduce a new Radiated Energy per Bit Transmitted metric, demonstrating that beta-GPP offers a more accurate model for real-world 5G multi-connectivity networks and highlighting the importance of energy-aware deployment strategies for sustainability.
This paper demonstrates that a specific polynomial-time decision problem, defined by causal token traversal constraints, inherently requires linear time to execute and cannot be accelerated by parallel computation, thereby revealing a fundamental gap between logical parallelism and causal executability that places the problem outside the classical complexity class.
This paper proposes a joint subcarrier assignment and power allocation framework for bistatic OFDM-based ISAC systems that maximizes communication data rate while satisfying delay sensing accuracy constraints, revealing that sensing subcarriers should be allocated only when their Fisher information gain outweighs the communication rate loss.
This paper addresses the performance degradation caused by fiber Kerr nonlinearity in high-power optical satellite uplinks by developing a realistic system model and proposing low-complexity digital signal processing techniques, including constellation shaping via a look-up table and nonlinear phase rotation, which collectively increase the maximum acceptable link loss by up to 6 dB while enabling adaptive rate tuning.
This paper derives a discrete-time channel model for optical communications with intensity modulation and direct detection affected by laser relative intensity noise, revealing that signal-dependent noise with memory causes achievable information rates to saturate with dense constellations when the receiver ignores this memory.
This paper introduces SGRAND-ISI and its practical ORBGRAND variants, which leverage error bursts and sequence reliability to extend the GRAND decoding paradigm to linear Gaussian intersymbol interference channels, achieving near-optimal performance with significantly lower complexity than existing memory-aware alternatives.
This paper establishes the optimal loss exponent for context-sensitive binary hypothesis testing of i.i.d. observations under a multiplicative weight function by characterizing it as a weighted Chernoff information derived from the maximization of a log-normalizer within an exponential family of weighted geometric mixtures.
This paper investigates the capacity of single-source multicasting in networks with restricted adversaries, demonstrating that classical bounds are insufficient and requiring joint code design, while providing exact capacity results, improved lower bounds, and new generalizations for specific network families.
This paper proposes a coupling-aware wideband reconfigurable holographic surface (RHS) model and a Jacobian-aided WMMSE-based joint beamforming framework to maximize multi-user sum rate by effectively mitigating mutual coupling effects while satisfying practical power constraints, with its validity confirmed through Meep simulations and numerical experiments.
This paper establishes a new sharp three-term inequality linking differential Rényi entropy, Rényi divergence, and Rényi cross-entropy for probability density functions, demonstrating that equality holds when one density is an escort of the other and using this result to derive further sharp bounds involving various informational functionals like absolute moments and Fisher information.
This paper proposes the combinatorial data augmentation-guided NLoS detection (CDA-ND) algorithm, which generates NLoS evidence vectors from multilateration-based location clusters to enable both hard and soft NLoS detection modes, significantly improving 6G positioning accuracy in indoor factory environments by reducing mean absolute error by up to 66%.
This paper proposes Hadamard-NOMA, a robust downlink non-orthogonal multiple access scheme that leverages the Hadamard Transform at the source level to mitigate fading and channel state information imperfections, achieving significant bit error rate improvements over existing T-NOMA and Usman-NOMA schemes.
This paper establishes that Tensor-Based Modulation (TBM) is a geometrically uniform coded modulation scheme derived from a non-binary linear block code over , demonstrating its algebraic structure through explicit generator matrix derivation and validating its robustness in both single-user and multi-user wireless channels.
This paper investigates BCH and LCD cyclic codes of length over finite fields by analyzing cyclotomic cosets to determine code dimensions, improve minimal distance bounds, establish conditions for dually-BCH codes when is odd, and enumerate all LCD cyclic codes, with some constructed codes proven to be optimal.
This paper presents a finite-blocklength analysis for Ordered Reliability Bits GRAND (ORBGRAND) by deriving a random-coding union bound and characterizing its decoding metrics to establish a second-order achievable-rate expansion with a normal approximation, thereby quantifying its performance at short-to-moderate blocklengths where prior results were limited to asymptotic regimes.
This paper demonstrates that for a stationary binary Markov source under Hamming distortion, the centered single-letter -tilted sum is an affine transformation of the occupation count, thereby enabling the derivation of its exact finite-blocklength distribution, closed-form variance, and distortion-independent cumulants via a $2 \times 2$ transfer matrix.
This paper proposes a novel movable antenna approach for two-layer rate-splitting multiple access (RSMA) systems that employs a two-loop iterative algorithm to jointly optimize beamforming, user clustering, common rate allocation, and antenna positions, thereby significantly enhancing user fairness compared to existing benchmark schemes.
This paper establishes an upper bound and a simple single-error decoder for analog error-correcting codes with unit-norm columns, and constructs a new family of such codes with constant redundancy three that achieves a smaller height profile than existing MDS constructions.
This paper proposes an efficient algorithm for minimizing total squared rate deviation in parallel Gaussian channels under a sum-power constraint by deriving a closed-form solution using the Lambert W function and a one-dimensional bisection method, which outperforms classical waterfilling and general-purpose solvers in both speed and target-tracking accuracy.