12 April 2022 in IEEE Transactions on Wireless Communications
We consider uplink multiuser multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) communication. The transmit (Tx) side of the envisaged system consists of several single-antenna users or/and several multiple-antenna users. At the receive side, a multiple-antenna access point employs compressive sensing techniques to estimate the channel impulse response from the preamble portion of the observed packets. The traditional approach is that of orthogonal pilot allocation: during a short training period, each OFDM subcarrier is assigned exclusively to a single Tx antenna. In this case, the channel state information can conveniently be acquired on a per Tx antenna basis. To the best of our knowledge, all related research imposes that all Tx antennas are allocated the same amount of pilots (which must then be tailored for the most extreme channel conditions). However, in the considered system, Tx antennas may experience totally different channel conditions. Under these circumstances, the use of a fixed number of pilots per Tx antenna results in a lot of unnecessary overhead. To tackle this problem, our work addresses the design of efficient algorithms for adaptive orthogonal pilot allocation. The following design principles are applied: orthogonal pilot allocation, constant-modulus modulation, minimum measurement matrix mutual coherence optimization, and the condition that the number of pilot subcarriers allocated to each Tx antenna is adjusted to the channel conditions experienced by that Tx antenna. The paper tackles the problem of determining the optimal number of pilot subcarriers as well as the optimal positions of the pilots. To facilitate adaptive operation, we propose a reduced-complexity method to determine the optimal pilot positions. The performance of our algorithms is demonstrated by means of computer simulations, using both theoretical channel models and results from our own channel measurement campaign.
20 April 2021 in IEEE Transactions on Communications
A novel coding strategy is proposed for a broadcast setting with two transmitter (TX) antennas and two single-antenna receivers (RX). The strategy consists of using space-time block coding to send a common message (to be decoded by both RXs) across the two TX antennas, while each TX antenna also sends a private message to one of the RXs. The relative weight of the private and common messages from each TX antenna is tuned to maximize the instantaneous achievable sum-rate of the channel. Closed-form expressions for the optimal weight factors are derived. In terms of the generalized degrees of freedom (GDoF) metric, the new scheme is able to achieve the sum-GDoF with finite precision channel state information at the transmitter (CSIT) of the two user broadcast channel. Moreover, as opposed to the existing rate-splitting schemes, the proposed scheme yields instantaneous achievable rates that are independent of the channel phases. This property is instrumental for link adaptation when only magnitude CSIT is available. Our numerical results indeed demonstrate the superiority of the scheme for the 2-user setting in case of magnitude CSIT. Extension to a more general K-user scenario is briefly discussed.
30 September 2024 in IEEE Transactions on Information Forensics and Security
TETarek N. M. M. Elwakeel
Physical-layer authentication (PLA) mechanisms exploit signals exchanged at the physical layer of communication systems to confirm the sender of a received message. In this paper, we propose a novel challenge-response PLA (CR-PLA) mechanism for a cellular system that leverages the reconfigurability property of a reconfigurable intelligent surface (RIS) (under the control of the verifier) in an authentication mechanism. In CR-PLA, the verifier base station (BS) sets a random RIS configuration, which remains secret to the intruder, and then checks that the resulting estimated channel is modified correspondingly. In fact, for a message sent by an attacker in a different location than the legitimate user equipment (UE), the BS will estimate a different channel and the message will be rejected as fake. Such a solution reduces the communication and computational overhead with respect to higher-layer cryptographic authentication. We derive the maximum a-posteriori attack when the attacker observes a correlated channel and the reconfigurable intelligent surface (RIS) has many elements, and the attacker transmits to Bob either directly or through the RIS. Using a generalized likelihood ratio test to test the authenticity at the base station (BS), we derive approximate expressions of the false alarm and misdetection probabilities when both the BS and the UE have a single antenna each, while the RIS has a large number of elements. We also evaluate the trade-off between security and communication performance, since choosing a random RIS configuration reduces the data rate. Moreover, we investigate the impact of various parameters (e.g., the RIS randomness, the number of RIS elements, and the operating signal-to-noise ratio) on security and communication performance.
15 February 2019 in IEEE Transactions on Communications
5 January 2023 in IEEE Access
Hybrid precoders, consisting of an analog hardware-constrained part operating at radio frequency (RF) and a digital part operating at baseband, reduce the RF implementation complexity and power consumption of multi-antenna transceivers, at the expense of some rate loss compared to an all-digital precoder. The analog and digital parts of the hybrid precoder are commonly designed by performing a constrained matrix decomposition (MD) of the all-digital precoder, which aims to minimize the Euclidean distance between the matrices corresponding to the hybrid and the all-digital precoder. In contrast, in this contribution we determine the zero-forcing (ZF) hybrid precoder that directly maximizes the weighted sumrate of a MU-MISO-OFDM communication system, taking into account various hardware constraints on the analog part. The resulting maximum rate serves as a useful benchmark for comparison with other ZF hybrid precoders. In a multi-carrier massive MIMO scenario, the rate-maximizing ZF precoders show a considerable performance advantage over MD-type hybrid precoders, indicating that the latter precoders are far from optimum. This contribution also investigates the trade-off between performance and computational complexity. Because of the iterative nature of the rate-maximizing ZF hybrid precoders, their superior performance comes with a large computational complexity. When this complexity cannot be afforded, one should revert to the MD-type precoders, at the expense of a considerable performance penalty; among the MD-type precoders, the non-iterative ones have only a slightly worse performance but a significantly smaller computational complexity, in comparison with the iterative ones.