Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0709.0259

Spectrum Sensing in Wideband OFDM Cognitive Radios

Chien-Hwa Hwang·Shih-Chang Chen
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, detection of the primary user (PU) signal in an orthogonal frequency division multiplexing (OFDM) based cognitive radio (CR) system is addressed. According to the prior knowledge of the PU signal known to the detector, three detection algorithms based on the Neyman-Pearson philosophy are proposed. In the first case, a Gaussian PU signal with completely known probability density function (PDF) except for its received power is considered. The frequency band that the PU signal resides is also assumed known. Detection is performed individually at each OFDM sub-carrier possibly interfered by the PU signal, and the results are then combined to form a final decision. In the second case, the sub-carriers that the PU signal resides are known. Observations from all possibly interfered sub-carriers are considered jointly to exploit the fact that the presence of a PU signal interferers all of them simultaneously. In the last case, it is assumed no PU signal prior knowledge is available. The detection is involved with a search of the interfered band. The proposed detector is able to detect an abrupt power change when tracing along the frequency axis.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chien-Hwa Hwang, Shih-Chang Chen. 2008-10-06. Spectrum Sensing in Wideband OFDM Cognitive Radios. https://arxiv.org/abs/0709.0259

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

KEEP EXPLORING

Related papers

arXiv2026

Secret key-distribution over networks with node-based adversarial errors

We study the multiple key-cast problem in network coding under active node-based adversaries. In multiple key-cast, a source generates independent secret keys to be securely and reliably delivered to designated terminal subsets. The network adversary can observe \(\ell_o\) nodes, inject additive or overwrite errors into \(\ell_e\) nodes, and simultaneously observe and corrupt \(\ell_{oe}\) nodes, while having full knowledge of the topology and coding operations. Adversarial models of similar nature, however, where corruption and eavesdropping is done on edges instead of nodes, have seen previous studies in the context of secure multicast network-coding. The work at hand builds on and extends these studies to address the challenges in node-based adversaries in the context of (multiple) key distribution. For single-source networks where every node is d-vertex connected from the source, we show that perfectly secure multiple key-cast under additive and overwrite error models is asymptotically achievable at the key-capacity of \(d-\ell_o-\ell_e-2\ell_{oe}\). We then extend our analysis to networks where only terminal nodes satisfy this connectivity requirement, while intermediate nodes may be only partially connected. For these topologies, we develop coding schemes that achieve secure and reliable multiple key-cast capacities determined by the source vertex-connectivity and additional structural properties of the network. Finally, we show that our results generalize to multi-source settings, ensuring perfect secrecy even if the adversary observes all but one source node, and establish that our constructions apply directly to secure multicast network coding and to network secret-sharing scenarios. As part of our studies, we improve the security guarantee of a central scheme in [Zhang et al., IEEE Trans. Comm., 2023] addressing parallel-edge networks, from weak-security to perfect-security.

cs.IT↗
arXiv2026

A Mathematical Theory of Pragmatic Information

We propose a mathematical theory of pragmatic information that connects communication, control, and decision-making. Its central notion is the isoteleia mapping, which formalizes equifinality: distinct semantic paths that lead to the same optimal action are treated as pragmatically equivalent. This mapping yields a three-tier hierarchy of syntactic, semantic, and pragmatic information, in which each successive abstraction removes distinctions that are irrelevant to the task. We then define pragmatic entropy, up/down pragmatic mutual information, channel capacity, and rate-distortion, and prove lossless source coding, channel coding, and rate-distortion theorems that extend Shannon's results. These measures quantify decision uncertainty, reliable transmission, and task-oriented compression at the level of terminal actions. We further introduce pragmatic value of information (VoI) and pragmatic cost of information (CoI) as decision-theoretic duals to rate-distortion and capacity, and develop a Lagrangian dual framework for cross-layer optimization. The resulting pragmatic efficiency bound $\mathcal{E}_p(λ)=\sup_R[Φ_p(R)-λ\mathrm{CoI}_p(R)]$ characterizes the maximum net utility attainable by a resource-constrained intelligent system under a given resource price, yielding a behavioral capacity that extends Shannon's symbol-level capacity to goal-directed action. Extensions to continuous messages provide closed-form expressions for Gaussian channels and sources, while dynamic settings are addressed through a Bellman equation for sequential decision-making. The framework supports task-oriented communication, networked control, autonomous systems, and embodied AI by shifting emphasis from symbol fidelity to the effectiveness of information in guiding actions. In this way, it offers a common language for systems that extract value from information under resource constraints.

cs.IT↗
arXiv2026

Exact Second-Order Asymptotics for Covert Communication over DMCs with Variational Distance Constraints

We determine the exact second-order asymptotics of covert communication over binary-input discrete memoryless channels when covertness is measured by variational distance. Previous work by Tahmasbi and Bloch [IEEE Trans. Inf. Theory, Apr. 2019] characterized the first-order asymptotics and derived achievability and converse bounds on the second-order term, but these bounds do not match. The gap arises from an additional penalty of order n^{1/4} in the achievability bound. We show that this penalty can be removed through a sharper analysis of the distribution of the warden's output induced by pulse-position modulation. Specifically, we express the variational distance through the Bhattacharyya coefficient of two distributions and the expectation of a continuous function of the log-likelihood ratio. Because the resulting expectation involves a continuous function rather than the probability of a likelihood-ratio event, an analysis of the characteristic function combined with a Gaussian smoothing argument reduces the approximation error from O(n^{-1/4}) (derived from the Berry--Esseen bound in prior work) to O(n^{-1/2}). With this better controlled approximation error, we manage to derive a matching achievability result to the existing converse result, thus establishing the exact second-order asymptotics.

cs.IT↗