中文
相关论文

相关论文: Optimal Signaling for Secure Communications over G…

200 篇论文

This paper presents novel numerical approaches to finding the secrecy capacity of the multiple-input multiple-output (MIMO) wiretap channel subject to multiple linear transmit covariance constraints, including sum power constraint, per…

信息论 · 计算机科学 2021-07-09 Anshu Mukherjee , Björn Ottersten , Le-Nam Tran

A pioneering secure transmission scheme is proposed, which harnesses movable antennas (MAs) to optimize antenna positions for augmenting the physical layer security. Particularly, an MA-enabled secure wireless system is considered, where a…

信号处理 · 电气工程与系统科学 2023-12-22 Zhenqiao Cheng , Nanxi Li , Jianchi Zhu , Xiaoming She , Chongjun Ouyang , Peng Chen

In this paper, we investigate the information-theoretic security by modeling a cognitive radio wiretap channel under quality-of-service (QoS) constraints and interference power limitations inflicted on primary users (PUs). We initially…

信息论 · 计算机科学 2014-02-06 Sami Akin

The use of multi-antenna arrays in both transmission and reception has been shown to dramatically increase the throughput of wireless communication systems. As a result there has been considerable interest in characterizing the ergodic…

信息论 · 计算机科学 2007-07-16 Aris L. Moustakas , Steven H. Simon

The secrecy capacity of a discrete memoryless Gaussian Wire-Tap Channel when the input is from a finite complex constellation is studied. It is shown that the secrecy capacity curves of a finite constellation plotted against the SNR, for a…

信息论 · 计算机科学 2010-10-07 G. D. Raghava , B. Sundar Rajan

We determine the capacity-achieving input covariance matrices for coherent block-fading correlated MIMO Rician channels. In contrast with the Rayleigh and uncorrelated Rician cases, no closed-form expressions for the eigenvectors of the…

信息论 · 计算机科学 2007-07-13 Julien Dumont , Philippe Loubaton , Samson Lasaulce

We consider a wiretap multiple-input multiple-output multiple-eavesdropper (MIMOME) channel, where agent Alice aims at transmitting a secret message to agent Bob, while leaking no information on it to an eavesdropper agent Eve. We assume…

信息论 · 计算机科学 2014-04-15 Francesco Renna , Nicola Laurenti , Stefano Tomasin

The common approach of designing a communication device is to maximize a well-defined objective function, e.g., the channel capacity and the cut-off rate. We propose easy-to-implement solutions for Gaussian channels that approximate the…

信息论 · 计算机科学 2016-03-24 Qian Yu

We study the optimality of linear precoding for the two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel (BC) with confidential messages. Secret dirty-paper coding (SDPC) is optimal under an input covariance…

信息论 · 计算机科学 2013-04-18 Ali Fakoorian andA. Lee Swindlehurst

The operational capacity of Gaussian MIMO channels with memory was obtained by Brandenburg and Wyner in [9] under certain mild assumptions on the channel impulse response and its noise covariance matrix, which essentuially require channel…

信息论 · 计算机科学 2022-05-11 Sergey Loyka , Charalambos D. Charalambous

In this paper we address a sum secrecy rate maximization problem for a multi-carrier and MIMO communication system. We consider the case that the receiver is capable of full-duplex (FD) operation and simultaneously sends jamming signal to a…

信息论 · 计算机科学 2018-02-19 Tianyu Yang , Omid Taghizadeh , Rudolf Mathar

In this paper, we introduce two new achievable schemes for the fading multiple access wiretap channel (MAC-WT). In the model that we consider, we assume that perfect knowledge of the state of all channels is available at all the nodes in a…

信息论 · 计算机科学 2010-10-29 Raef Bassily , Sennur Ulukus

This paper investigates beamforming schemes designed to minimize the symbol error probability (SEP) for an authorized user while guaranteeing that the likelihood of an eavesdropper correctly recovering symbols remains below a predefined…

信号处理 · 电气工程与系统科学 2025-04-08 Nam Nguyen , An Vuong , Thuan Nguyen , Thinh Nguyen

We consider a secure communication over a two-user Gaussian interference channel, where each transmitter sends a confidential message to its legitimate receiver. For this setting, we identify a regime where the simple scheme of using…

信息论 · 计算机科学 2018-11-01 Jinyuan Chen

This paper studies the effectiveness of relaying for interference mitigation in an interference-limited communication scenario. We are motivated by the observation that in a cellular network, a relay node placed at the cell edge observes a…

信息论 · 计算机科学 2019-03-20 S. Arvin Ayoughi , Wei Yu

Non-orthogonal communication is a promising technique for future wireless networks (e.g., 6G and Wi-Fi 7). In the vector channel model, designing efficient non-orthogonal communication schemes amounts to the following extremum problem: \[…

度量几何 · 数学 2021-05-11 Gergely Ambrus , Bo Bai , Jianfeng Hou

Unmanned aerial vehicles (UAVs) are foreseen to constitute promising airborne communication devices as a benefit of their superior channel quality. But UAV-to-ground (U2G) communications are vulnerable to eavesdropping. Hence, we conceive a…

信息论 · 计算机科学 2022-07-12 Zhong Zheng , Xinyao Wang , Zesong Fei , Qingqing Wu , Bin Li , Lajos Hanzo

We consider a complex Gaussian wiretap channel with finite-resolution analog-to-digital converters (ADCs) at both the legitimate receiver and the eavesdropper. For this channel, we show that a positive secrecy rate is always achievable as…

信息论 · 计算机科学 2020-06-02 Seung-Hyun Nam , Si-Hyeon Lee

It is known that circularly symmetric Gaussian signals are the optimal input signals for the partial decode-and-forward (PDF) coding scheme in the Gaussian multiple-input multiple-output (MIMO) relay channel, but there is currently no…

信息论 · 计算机科学 2019-11-15 Christoph Hellings , Patrick Gest , Thomas Wiegart , Wolfgang Utschick

We analyze the effect of squeezing the channel in binary communication based on Gaussian states. We show that for coding on pure states, squeezing increases the detection probability at fixed size of the strategy, actually saturating the…

量子物理 · 物理学 2009-11-07 Matteo G. A. Paris