Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1104.1014

On Secrecy Rate Analysis of MIMO Wiretap Channels Driven by Finite-Alphabet Input

Shafi Bashar·Zhi Ding·Chengshan Xiao
View original source ↗Read source document ↗Export metadata ↓

Abstract

This work investigates the effect of finite-alphabet source input on the secrecy rate of a multi-antenna wiretap system. Existing works have characterized maximum achievable secrecy rate or secrecy capacity for single and multiple antenna systems based on Gaussian source signals and secrecy code. Despite the impracticality of Gaussian sources, the compact closed-form expression of mutual information between linear channel Gaussian input and corresponding output has led to broad application of Gaussian input assumption in physical secrecy analysis. For practical considerations, we study the effect of finite discrete-constellation on the achievable secrecy rate of multiple-antenna wire-tap channels. Our proposed precoding scheme converts the multi-antenna system into a bank of parallel channels. Based on this precoding strategy, we propose a decentralized power allocation algorithm based on dual decomposition for maximizing the achievable secrecy rate. In addition, we analyze the achievable secrecy rate for finite-alphabet inputs in low and high SNR cases. Our results demonstrate substantial difference in secrecy rate between systems given finite-alphabet inputs and systems with Gaussian inputs.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shafi Bashar, Zhi Ding, Chengshan Xiao. 2012-01-21. On Secrecy Rate Analysis of MIMO Wiretap Channels Driven by Finite-Alphabet Input. https://doi.org/10.1109/tcomm.2012.091212.110199

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

KEEP EXPLORING

Related papers

arXiv2026

Towards Faithful and Efficient Semantic Communication: An Ontological Approach

In this paper, an ontology-driven semantic communication (ODSC) framework is proposed for multi-view visual question answering (VQA) tasks. In the considered framework, multiple transmitters observe a scene, extract the semantic information (SI) with vision-language models (VLMs), and transmit the scene graphs to a receiver. Due to the completeness, heterogeneity, and uninterpretability of the VLMs, the extracted scene graphs are redundant, ambiguous, and inconsistent. To solve these problems, the transmitters and the receiver share an ontology-based knowledge base that predefines synonyms, inference rules, and consistency constraints. For each transmitter, the proposed ODSC framework removes the partial scene graph that can be inferred based on the inference rules. For the receiver, the proposed framework aligns the SI of different views based on the synonyms and detects the inconsistency among the views based on the constraints. A metric of multi-view VQA accuracy (MVA) is defined to evaluate the proposed framework. Simulation results show that, compared with transmitting the complete scene graphs, the proposed framework reduces the data size of the SI by up to 87.1% while improving the answering accuracy by 4.5%. Moreover, the proposed framework yields up to a 16.0% improvement in terms of the MVA compared with the SI filtering approaches.

cs.IT↗
arXiv2026

Second-Order Asymptotics for the Gaussian MAC on the Relative Interior of the Sum-Rate Face

We completely characterize the second-order coding rate region of the two-user Gaussian multiple-access channel at points in the relative interior of the sum-rate face, under maximal per-codeword power constraints. For any fixed average error probability $0 < \varepsilon < 1/2$, a nontrivial mixture of power splits reduces the sum-rate dispersion and strictly improves upon standard inner bounds based on a constant power split. Thus, a constant power split, although sufficient to attain the first-order capacity region, is insufficient for second-order optimality in this regime. Our achievability proof builds on the constant composition and coded time-sharing framework of Scarlett, Martinez, and Guillén i Fàbregas, with an optimization over admissible power splits. A matching second-order converse establishes the optimality of the resulting coded time-sharing strategy.

cs.IT↗
arXiv2026

Pinching-Antenna-Enabled ISAC: A Unified Architecture for Flexible Communication and Sensing

Integrated sensing and communication (ISAC) is a cornerstone of sixth-generation (6G) networks, yet conventional fixed-antenna systems lack the spatial adaptability to cope with dynamic users and targets. The emerging pinching antenna (PA) offers a flexible, low-cost solution by dynamically reconfiguring radiation points along waveguides, introducing large-scale spatial degrees of freedom. This article develops a unified architectural perspective for PA-enabled ISAC. We first discuss the unique advantages of PAs over existing flexible solutions, and then propose a PA-enabled ISAC framework that accommodates both uplink and downlink communication while being compatible with passive and active sensing targets. Within this framework, we identify representative application scenarios, discuss major design challenges, and highlight critical enabling techniques. A numerical case study demonstrates how PA reconfigurability affects the communication-sensing rate trade-off. We also outline open issues to guide further PA-ISAC research for future 6G networks.

cs.IT↗