Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1807.06112

Entropy and Energy Detection-based Spectrum Sensing over F Composite Fading Channels

Seong Ki Yoo·Simon L. Cotton·Paschalis C. Sofotasios·Sami Muhaidat·Osamah S. Badarneh·George K. Karagiannidis
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we investigate the performance of energy detection-based spectrum sensing over F composite fading channels. To this end, an analytical expression for the average detection probability is firstly derived. This expression is then extended to account for collaborative spectrum sensing, square-law selection diversity reception and noise power uncertainty. The corresponding receiver operating characteristics (ROC) are analyzed for different conditions of the average signal-to-noise ratio (SNR), noise power uncertainty, time-bandwidth product, multipath fading, shadowing, number of diversity branches and number of collaborating users. It is shown that the energy detection performance is sensitive to the severity of the multipath fading and amount of shadowing, whereby even small variations in either of these physical phenomena can significantly impact the detection probability. As a figure of merit to evaluate the detection performance, the area under the ROC curve (AUC) is derived and evaluated for different multipath fading and shadowing conditions. Closed-form expressions for the Shannon entropy and cross entropy are also formulated and assessed for different average SNR, multipath fading and shadowing conditions. Then the relationship between the Shannon entropy and ROC/AUC is examined where it is found that the average number of bits required for encoding a signal becomes small (i.e., low Shannon entropy) when the detection probability is high or when the AUC is large. The difference between composite and traditional small-scale fading is emphasized by comparing the cross entropy for Rayleigh and Nakagami-m fading. A validation of the analytical results is provided through a careful comparison with the results of some simulations.

Explore related subjects

eess.SPcs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Seong Ki Yoo, Simon L. Cotton, Paschalis C. Sofotasios, Sami Muhaidat, Osamah S. Badarneh, George K. Karagiannidis. 2018-07-16. Entropy and Energy Detection-based Spectrum Sensing over F Composite Fading Channels. https://arxiv.org/abs/1807.06112

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Scalable Long-Term Beamforming for Massive Multi-User MIMO

Fully digital massive multiple-input multiple-output (MIMO) systems with large numbers (1000+) of antennas offer capacity gains from spatial multiplexing and beamforming, but receivers that scale to these array dimensions face challenges in both channel estimation overhead and digital computation. Long-term beamforming addresses both by projecting the data onto a low-dimensional subspace that can be tracked at a slow time scale from the long-term channel parameters. In this setting, we show how to compute, in closed form, the projection matrix that maximizes a capacity upper bound, using a matrix inverse square root; the same projection is shown to maximize the mean post-projection signal-to-interference-plus-noise ratio (SINR) exactly. Computationally efficient methods are then presented for the matrix computation, realizable with matrix-matrix multiplies and hence amenable to systolic array implementations in hardware. Bounds on the SINR degradation are derived, and ray tracing simulations in a realistic rural uplink setting show a small loss relative to instantaneous minimum mean-square error (MMSE) beamforming when the covariance is accurately estimated. The efficient Gram-domain form of the instantaneous MMSE receiver applies the maximum-ratio combining reduction before an inverse whose dimension is the total number of streams. Against this baseline, the method estimates and refreshes beamforming coefficients three orders of magnitude less often and decouples the real-time path across users. With the conjugate-gradient solve and a rank-one projection, its total arithmetic cost is 2% higher at the ten-user operating point and lower above a stream-dimension crossover that we characterize.

eess.SP↗
arXiv2026

Curv-Tail: Lightweight Long-Tailed Encrypted Traffic Classification with Discrete Packet-Length Encoding and Lorentz Prototypes

Long-tailed encrypted traffic classification requires accurate recognition of infrequent classes under limited computational budgets. We propose Curv-Tail, a lightweight, end-to-end packet--byte framework trained without a separate pretraining stage. Mixed-resolution tokenization preserves exact packet-length identities within a bounded range and coarsens larger values to limit the vocabulary. An auxiliary objective predicts observed length tokens from contextual packet features before pooling, encouraging length-token retention beyond flow-level supervision. Compact temporal encoders process packet sequences and directional byte patches, and Lorentz prototypes with a shared learnable curvature magnitude classify their fused representation. On NUDT-Mobile and DataCon-Website under natural class frequencies, Curv-Tail achieves three-seed mean Tail-F1 scores of 85.70% and 46.30%, exceeding the strongest evaluated baselines by 2.91 and 1.89 percentage points, respectively. In 300-class profiling on an RTX 4090 with FP32 and batch size 256, Curv-Tail uses 98.48% fewer parameters and achieves 10.2 times the batch inference throughput of MM4Flow.

eess.SP↗
arXiv2026

Airborne Particle Communication Through Time-varying Diffusion-Advection Channels

Particle-based communication using diffusion and advection has emerged as an alternative signaling paradigm recently. While most existing studies assume constant flow conditions, real macro-scale environments such as atmospheric winds exhibit time-varying behavior. In this work, airborne particle communication under time-varying advection is modeled as a linear time-varying (LTV) channel, and a closed-form, time-dependent channel impulse response is derived using the method of moving frames. Based on this formulation, the channel is characterized through its power delay profile, leading to the definition of channel dispersion time as a physically meaningful measure of channel memory and a guideline for symbol duration selection. System-level simulations under directed, time-varying wind conditions show that waveform design is critical for performance, enabling multi-symbol modulation using a single particle type when dispersion is sufficiently controlled. To quantify waveform distortion and guide the design of orthogonal signaling waveforms, the Orthogonality Loss Ratio (OLR) is introduced as a structural metric. The results demonstrate that time-varying diffusion-advection channels can be systematically modeled and engineered using communication-theoretic tools, providing a realistic foundation for particle-based communication in complex flow environments.

eess.SP↗