Virtual Array for Dual Function MIMO Radar Communication Systems using OTFS Waveforms

A MIMO dual-function radar communication (DFRC) system transmitting orthogonal time frequency space (OTFS) waveforms is considered. A key advantage of MIMO radar is its ability to create a virtual array, achieving higher sensing resolution than the physical receive array. In this paper, we propose a novel approach to construct a virtual array for the system under consideration. The transmit antennas can use the Doppler-delay (DD) domain bins in a shared fashion. A number of Time-Frequency (TF) bins, referred to as private bins, are exclusively assigned to specific transmit antennas. The TF signals received on the private bins are orthogonal and thus can be used to synthesize a virtual array, which, combined with coarse knowledge of radar parameters (i.e., angle, range, and velocity), enables high-resolution estimation of those parameters. The introduction of $N_p$ private bins necessitates a reduction in DD domain symbols, thereby reducing the data rate of each transmit antenna by $N_p-1$. However, even a small number of private bins is sufficient to achieve significant sensing gains with minimal communication rate loss.

On the Security of Directional Modulation via Time Modulated Arrays Using OFDM Waveforms

In this paper, we investigate how secure the TMA OFDM system is, by looking at the transmitted signal from an the viewpoint of eavesdropper. First, we propose a novel, low-complexity scheme via which the eavesdropper could defy the scrambling in the received signal and recover the transmitted symbols. We show that the symbols which the eavesdropper sees along the OFDM subcarriers are linear mixtures of the source symbols, where the mixing coefficients are unknown to the eavesdropper. Independent component analysis (ICA) could be used to obtain the mixing matrix but there would be permutation and scaling ambiguities. We show that these ambiguities can be resolved by leveraging the structure of the mixing matrix and the characteristics of the TMA OFDM system. In particular, we construct a k-nearest neighbors (KNN)-based algorithm that exploits jointly the Toeplitz structure of the mixing matrix, knowledge of data constellation, and the rules for designing the TMA ON-OFF pattern to resolve the ambiguities. In general, resolving the ambiguities and recovering the symbols requires long data. Specifically for the case of the constant modulus symbols, we propose a modified ICA approach, namely the constant-modulus ICA (CMICA), that provides a good estimate of the mixing matrix using a small number of received samples. We also propose measures which the TMA could undertake in order to defend the scrambling. Simulation results are presented to demonstrate the effectiveness, efficiency and robustness of our scrambling defying and defending schemes. Complete abstract please see in the paper.

Sensor Selection via GFlowNets: A Deep Generative Modeling Framework to Navigate Combinatorial Complexity

The performance of sensor arrays in sensing and wireless communications improves with more elements, but this comes at the cost of increased energy consumption and hardware expense. This work addresses the challenge of selecting $k$ sensor elements from a set of $m$ to optimize a generic Quality-of-Service metric. Evaluating all $\binom{m}{k}$ possible sensor subsets is impractical, leading to prior solutions using convex relaxations, greedy algorithms, and supervised learning approaches. The current paper proposes a new framework that employs deep generative modeling, treating sensor selection as a deterministic Markov Decision Process where sensor subsets of size $k$ arise as terminal states. Generative Flow Networks (GFlowNets) are employed to model an action distribution conditioned on the state. Sampling actions from the aforementioned distribution ensures that the probability of arriving at a terminal state is proportional to the performance of the corresponding subset. Applied to a standard sensor selection scenario, the developed approach outperforms popular methods which are based on convex optimization and greedy algorithms. Finally, a multiobjective formulation of the proposed approach is adopted and applied on the sparse antenna array design for Integrated Sensing and Communication (ISAC) systems. The multiobjective variation is shown to perform well in managing the trade-off between radar and communication performance.

Optimized Waveform Design for OFDM-based ISAC Systems Under Limited Resource Occupancy

The sixth generation (6G) of wireless networks introduces integrated sensing and communication (ISAC), a technology in which communication and sensing functionalities are inextricably linked, sharing resources across time, frequency, space, and energy. Despite its popularity in communication, the orthogonal frequency division multiplexing (OFDM) waveform, while advantageous for communication, has limitations in sensing performance within an ISAC network. This paper delves into OFDM waveform design through optimal resource allocation over time, frequency, and energy, maximizing sensing performance while preserving communication quality. During quasi-normal operation, the Base Station (BS) does not utilize all available time-frequency resources, resulting in high sidelobes in the OFDM waveform's ambiguity function, as well as decreased sensing accuracy. To address these latter issues, the paper proposes a novel interpolation technique using matrix completion through the Schatten p quasi-normal approximation, which requires fewer samples than the traditional nuclear norm for effective matrix completion and interpolation. This approach effectively suppresses the sidelobes, enhancing the sensing performance. Numerical simulations confirm that the proposed method outperforms state-of-the-art frameworks, such as standard complaint resource scheduling and interpolation, particularly in scenarios with limited resource occupancy.

Waveform Design for OFDM-based ISAC Systems Under Resource Occupancy Constraint

Integrated Sensing and Communication (ISAC) is one of the key pillars envisioned for 6G wireless systems. ISAC systems combine communication and sensing functionalities over a single waveform, with full resource sharing. In particular, waveform design for legacy Orthogonal Frequency Division Multiplexing (OFDM) systems consists of a suitable time-frequency resource allocation policy balancing between communication and sensing performance. Over time and/or frequency, having unused resources leads to an ambiguity function with high sidelobes that significantly affect the performance of ISAC for OFDM waveforms. This paper proposes an OFDM-based ISAC waveform design that takes into account communication and resource occupancy constraints. The proposed method minimizes the Cram\'er-Rao Bound (CRB) on delay and Doppler estimation for two closely spaced targets. Moreover, the paper addresses the under-sampling issue by interpolating the estimated sensing channel based on matrix completion via Schatten $p$-norm approximation. Numerical results show that the proposed waveform outperforms the state-of-the-art methods.

Time-Modulated Intelligent Reflecting Surface for Waveform Security

We consider an OFDM transmitter aided by an intelligent reflecting surface (IRS) and propose a novel approach to enhance waveform security by employing time modulation (TM) at the IRS side. By controlling the periodic TM pattern of the IRS elements, the system is designed to preserve communication information towards an authorized recipient and scramble the information towards all other directions. We introduce two modes of TM pattern control: the linear mode, in which we design common TM parameters for entire rows or columns of the IRS, and the planar mode, where we design TM parameters for each individual IRS unit. Due to the required fewer switches, the linear mode is easier to implement as compared to the planar mode. However, the linear model results in a beampattern that has sidelobes, over which the transmitted information is not sufficiently scrambled. We show that the sidelobes of the linear mode can be suppressed by exploiting the high diversity available in that mode.

Enhance Security of Time-Modulated Array-Enabled Directional Modulation by Introducing Symbol Ambiguity

In this paper, if the time-modulated array (TMA)-enabled directional modulation (DM) communication system can be cracked is investigated and the answer is YES! We first demonstrate that the scrambling data received at the eavesdropper can be defied by using grid search to successfully find the only and actual mixing matrix generated by TMA. Then, we propose introducing symbol ambiguity to TMA to defend the defying of grid search, and design two principles for the TMA mixing matrix, i.e., rank deficiency and non-uniqueness of the ON-OFF switching pattern, that can be used to construct the symbol ambiguity. Also, we present a feasible mechanism to implement these two principles. Our proposed principles and mechanism not only shed light on how to design a more secure TMA DM system theoretically in the future, but also have been validated to be effective by bit error rate measurements.

How secure is the time-modulated array-enabled ofdm directional modulation?

Time-modulated arrays (TMA) transmitting orthogonal frequency division multiplexing (OFDM) waveforms achieve physical layer security by allowing the signal to reach the legitimate destination undistorted, while making the signal appear scrambled in all other directions. In this paper, we examine how secure the TMA OFDM system is, and show that it is possible for the eavesdropper to defy the scrambling. In particular, we show that, based on the scrambled signal, the eavesdropper can formulate a blind source separation problem and recover data symbols and TMA parameters via independent component analysis (ICA) techniques. We show how the scaling and permutation ambiguities arising in ICA can be resolved by exploiting the Toeplitz structure of the corresponding mixing matrix, and knowledge of data constellation, OFDM specifics, and the rules for choosing TMA parameters. We also introduce a novel TMA implementation to defend the scrambling against the eavesdropper.

An IRS-Assisted Secure Dual-Function Radar-Communication System

In dual-function radar-communication (DFRC) systems the probing signal contains information intended for the communication users, which makes that information vulnerable to eavesdropping by the targets. We propose a novel design for enhancing the physical layer security (PLS) of DFRC systems, via the help of intelligent reflecting surface (IRS) and artificial noise (AN), transmitted along with the probing waveform. The radar waveform, the AN jamming noise and the IRS parameters are designed to optimize the communication secrecy rate while meeting radar signal-to-noise ratio (SNR) constrains. Key challenges in the resulting optimization problem include the fractional form objective, the SNR being a quartic function of the IRS parameters, and the unit-modulus constraint of the IRS parameters. A fractional programming technique is used to transform the fractional form objective of the optimization problem into more tractable non-fractional polynomials. Numerical results are provided to demonstrate the convergence of the proposed system design algorithm, and also show the impact of the power assigned to the AN on the secrecy performance of the designed system.

Enhanced Channel Estimation in mm-Wave MIMO Systems Leveraging Integrated Communication and Sensing

This paper tackles the challenge of wideband MIMO channel estimation within indoor millimeter-wave scenarios. Our proposed approach exploits the integrated sensing and communication paradigm, where sensing information aids in channel estimation. The key innovation consists of employing both spatial and temporal sensing modes to significantly reduce the number of required training pilots. Moreover, our algorithm addresses and corrects potential mismatches between sensing and communication modes, which can arise from differing sensing and communication propagation paths. Extensive simulations demonstrate that the proposed method requires 4x less pilots compared to the current state-of-the-art, marking a substantial advancement in channel estimation efficiency.