Adaptive detection with bounded steering vectors mismatch angle

We address the problem of detecting a signal of interest (SOI), using multiple observations in the primary data, in a background of noise with unknown covariance matrix. We consider a situation where the signal signature is not known perfectly, but its angle with a nominal and known signature is bounded. Furthermore, we consider a possible scaling inhomogeneity between the primary and the secondary noise covariance matrix. First, assuming that the noise covariance matrix is known, we derive the generalized-likelihood ratio test (GLRT), which involves solving a semidefinite programming problem. Next, we substitute the unknown noise covariance matrix for its estimate obtained from secondary data, to yield the final detector. The latter is compared with a detector that assumes a known signal signature

Vandermonde Frequency Division Multiplexing for Cognitive Radio

We consider a cognitive radio scenario where a primary and a secondary user wish to communicate with their corresponding receivers simultaneously over frequency selective channels. Under realistic assumptions that the secondary transmitter has no side information about the primary's message and each transmitter knows only its local channels, we propose a Vandermonde precoder that cancels the interference from the secondary user by exploiting the redundancy of a cyclic prefix. Our numerical examples show that VFDM, with an appropriate design of the input covariance, enables the secondary user to achieve a considerable rate while generating zero interference to the primary user.Comment: Submitted to Signal Processing Advances in Wireless Communications, 200

ON THE SECRECY CAPACITY OF FREQUENCY-SELECTIVE FADING CHANNELS : A PRACTICAL VANDERMONDE PRECODING

International audienceWe study the secrecy capacity of the frequency-selective wiretap channel. Assuming that a guard interval of L symbols is inserted to avoid the inter-block interference and these symbols are discarded at the receiver, the single-carrier frequency-selective channel is modeled as a multiple-input multiple-output Toeplitz matrix. For this special case of the MIMO wiretap channel and under the assumption of perfect channel knowledge at transmitter (CSIT), we propose a practical Vandermonde precoding scheme that transmits the confidential messages on the zeros of the eavesdropper channel. It is proved that this Vandermonde precoding achieves the full multiplexing gain offered by the frequencyselective wiretap channel in the high SNR regime. For a more realistic case where the transmitter only knows the legitime channel we consider the “mask beamforming” scheme where the artificial noise is sent on the zeros of the legitime channel via the Vandermonde precoding. This mask beamforming is shown to achieve the same multiplexing gain as the perfect CSIT

Network Coding with Multimedia Transmission and Cognitive Networking: An Implementation based on Software-Defined Radio

Network coding (NC) is considered a breakthrough to improve throughput, robustness, and security of wireless networks. Although the theoretical aspects of NC have been extensively investigated, there have been only few experiments with pure NC schematics. This paper presents an implementation of NC under a two-way relay model and extends it to two non-straightforward scenarios: (i) multimedia transmission with layered coding and multiple-description coding, and (ii) cognitive radio with Vandermonde frequency division multiplexing (VFDM). The implementation is in real time and based on software-defined radio (SDR). The experimental results show that, by combining NC and source coding, we can control the quality of the received multimedia content in an on-demand manner. Whereas in the VFDM-based cognitive radio, the quality of the received content in the primary receiver is low (due to imperfect channel estimation) yet retrievable. Our implementation results serve as a proof for the practicability of network coding in relevant applications

Network Coding with Multimedia Transmission and Cognitive Networking: An Implementation based on Software-Defined Radio

Network coding (NC) is considered a breakthrough to improve throughput, robustness, and security of wireless networks. Although the theoretical aspects of NC have been extensively investigated, there have been only few experiments with pure NC schematics. This paper presents an implementation of NC under a two-way relay model and extends it to two\ua0non-straightforward scenarios: (i) multimedia transmission with layered coding and multiple-description coding, and (ii) cognitive radio with Vandermonde frequency division multiplexing (VFDM). The implementation is in real time and based on software-defined radio (SDR). The experimental results show that, by combining NC and source coding, we can control the quality of the received multimedia content in an on-demand manner. Whereas in the VFDM-based cognitive radio, the quality of the received content in the primary receiver is low (due to imperfect channel estimation) yet retrievable. Our implementation results serve as a proof for the practicability of network coding in relevant applications

Secured Communication over Frequency-Selective Fading Channels: a practical Vandermonde precoding

In this paper, we study the frequency-selective broadcast channel with confidential messages (BCC) in which the transmitter sends a confidential message to receiver 1 and a common message to receivers 1 and 2. In the case of a block transmission of N symbols followed by a guard interval of L symbols, the frequency-selective channel can be modeled as a N * (N+L) Toeplitz matrix. For this special type of multiple-input multiple-output (MIMO) channels, we propose a practical Vandermonde precoding that consists of projecting the confidential messages in the null space of the channel seen by receiver 2 while superposing the common message. For this scheme, we provide the achievable rate region, i.e. the rate-tuple of the common and confidential messages, and characterize the optimal covariance inputs for some special cases of interest. It is proved that the proposed scheme achieves the optimal degree of freedom (d.o.f) region. More specifically, it enables to send l <= L confidential messages and N-l common messages simultaneously over a block of N+L symbols. Interestingly, the proposed scheme can be applied to secured multiuser scenarios such as the K+1-user frequency-selective BCC with K confidential messages and the two-user frequency-selective BCC with two confidential messages. For each scenario, we provide the achievable secrecy degree of freedom (s.d.o.f.) region of the corresponding frequency-selective BCC and prove the optimality of the Vandermonde precoding. One of the appealing features of the proposed scheme is that it does not require any specific secrecy encoding technique but can be applied on top of any existing powerful encoding schemes.Comment: To appear in EURASIP journal on Wireless Communications and Networking, special issue on Wireless Physical Security, 200

Democratic Representations

Minimization of the $\ell_{\infty}$ (or maximum) norm subject to a constraint that imposes consistency to an underdetermined system of linear equations finds use in a large number of practical applications, including vector quantization, approximate nearest neighbor search, peak-to-average power ratio (or "crest factor") reduction in communication systems, and peak force minimization in robotics and control. This paper analyzes the fundamental properties of signal representations obtained by solving such a convex optimization problem. We develop bounds on the maximum magnitude of such representations using the uncertainty principle (UP) introduced by Lyubarskii and Vershynin, and study the efficacy of $\ell_{\infty}$-norm-based dynamic range reduction. Our analysis shows that matrices satisfying the UP, such as randomly subsampled Fourier or i.i.d. Gaussian matrices, enable the computation of what we call democratic representations, whose entries all have small and similar magnitude, as well as low dynamic range. To compute democratic representations at low computational complexity, we present two new, efficient convex optimization algorithms. We finally demonstrate the efficacy of democratic representations for dynamic range reduction in a DVB-T2-based broadcast system.Comment: Submitted to a Journa

Interference mitigation in feedforward opportunistic communications

This paper deals with scenario-aware, uncoordinated, and distributed signaling techniques in the context of feedforward opportunistic communications, that is, when the opportunistic transmitting node does not cooperate with any other node in a heterogeneous communication context. In this signaling technique, each network node individually follows a transmission strategy based on the locally sensed occupied and unused physical-layer network resources to minimize the induced interference onto other coexisting networks, taking into account the impact of the sensing errors and the locality of the sensing information. The paper identifies and characterizes critical invariance properties of the transmitted pulse shaping waveforms that guarantee the detectability of the feedforward transmitted signal by the uncoordinated receiving nodes, irrespective of the sensing signal space basis. The paper also shows that, under mild operating conditions, the proposed transmission scheme asymptotically defines efficient alternatives in the frequency domain, such as the circulant-shaping TDMA (CS-TDMA) modulation, and all of them admit a direct adaptation to frequency-selective channels. Numerical evaluation of the proposed schemes validates the provided theoretical models.This work has been supported by the Spanish Ministry of Science and Innovation through project RODIN (PID2019-105717RB-C22 / MCIN / AEI / 10.13039/501100011033) and fellowship FPI BES-2017-080071Peer ReviewedPostprint (author's final draft