Peyman Siyari

Peyman Siyari

Auto-generated profile, based on publicly available information

Peyman Siyari

Department of Electrical and Computer Engineering, The University of Arizona, Tucson, AZ, USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 May 2020 in IEEE Transactions on Antennas and Propagation
Verified
Journal Article
Closed access
AKAdnan Kantemur
Adnan Kantemur
JTJinpil Tak
Jinpil Tak
PSPeyman Siyari
Peyman Siyari
AAAhmed H. Abdelrahman
Ahmed H. Abdelrahman
MKMarwan Krunz
Marwan Krunz
HXHao Xin
Hao Xin
A novel reconfigurable antenna covering an 11.5:1 bandwidth is designed and fabricated for cognitive radio applications. The proposed novel antenna has two independent paths to cover 430 MHz to 5 GHz frequency range. The first path is directly connected to an ultra-wide-band antenna, which covers 1–5 GHz operation frequency range. The second path, for the frequency range between 430 MHz and 1 GHz, goes through a dc-controlled varactor based matching network. The switching functionality between wideband (1 to 5 GHz) and reconfigurable region (430 MHz to 1 GHz) is realized by two discrete switches. The designed antenna has a simple structure and compact size of 60 mm × 100 mm. The proposed novel antenna has great potential for use in cognitive radio systems.

26 January 2017 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Open access
PSPeyman Siyari
Peyman Siyari
MKMarwan Krunz
Marwan Krunz
DNDiep Nguyen
Diep Nguyen
We consider joint optimization of artificial noise (AN) and information signals in a MIMO wiretap interference network, wherein the transmission of each link may be overheard by several MIMO-capable eavesdroppers. Each information signal is accompanied with AN, generated by the same user to confuse nearby eavesdroppers. Using a noncooperative game, a distributed optimization mechanism is proposed to maximize the secrecy rate of each link. The decision variables here are the covariance matrices for the information signals and ANs. However, the nonconvexity of each link's optimization problem (i.e., best response) makes conventional convex games inapplicable, even to find whether a Nash equilibrium (NE) exists. To tackle this issue, we analyze the proposed game using a relaxed equilibrium concept, called quasi-NE (QNE). Under a constraint qualification condition for each player's problem, the set of QNEs includes the NE of the proposed game. We also derive the conditions for the existence and uniqueness of the resulting QNE. It turns out that the uniqueness conditions are too restrictive, and do not always hold in typical network scenarios. Thus, the proposed game often has multiple QNEs, and convergence to a QNE is not always guaranteed. To overcome these issues, we modify the utility functions of the players by adding several specific terms to each utility function. The modified game converges to a QNE even when multiple QNEs exist. Furthermore, players have the ability to select a desired QNE that optimizes a given social objective (e.g., sum rate or secrecy sum rate). Depending on the chosen objective, the amount of signaling overhead as well as the performance of resulting QNE can be controlled. Simulations show that not only can we guarantee the convergence to a QNE, but also due to the QNE selection mechanism, we can achieve a significant improvement in terms of secrecy sum rate and power efficiency, especially in dense networks.

8 August 2019 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
PSPeyman Siyari
Peyman Siyari
HRHanif Rahbari
Hanif Rahbari
MKMarwan Krunz
Marwan Krunz
Carrier frequency offset (CFO) arises from the intrinsic mismatch between the oscillators of a wireless transmitter and the corresponding receiver, as well as their relative motion (i.e., Doppler effect). Despite advances in CFO estimation and tracking techniques, estimation errors are still present. Residual CFO creates a time-varying phase error, which degrades the decoder’s performance by increasing the symbol error rate. The impact is particularly visible in dense constellation maps (e.g., high-order QAM modulation), often used in modern wireless systems such as 5G NR, 802.11ax, and mmWave, as well as in physical security techniques, such as modulation obfuscation (MO). In this paper, we first derive the probability distribution function for the residual CFO under Gaussian noise. Using this distribution, we compute the maximum-likelihood demodulation boundaries for OFDM signals in a non-closed form. For modulation schemes with unequal-amplitude reference constellation points (e.g., 16-QAM and higher, APSK, etc.), the “optimal” boundaries have irregular shapes, and more importantly, they depend on the time since the last CFO correction instance, e.g., reception of frame preamble. To approximate the optimal boundaries and provide a practical (real-time) demodulation scheme, we explore machine learning techniques, specifically, support vector machine (SVM). Our SVM approach exhibits better accuracy and lower complexity in the test phase than other state-of-the-art machine-learning approaches. As a case study, we apply our CFO-aware demodulation to enhance the performance of a MO technique. Our analytical results show a gain of up to 3 dB over conventional demodulation schemes, which exceeds 3 dB in complete system simulations. Finally, we implement our scheme on USRPs and experimentally corroborate our analytic and simulation-based findings.

23 November 2018 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
PSPeyman Siyari
Peyman Siyari
MKMarwan Krunz
Marwan Krunz
DNDiep Nguyen
Diep Nguyen
We consider a multi-link interference network that is tapped by an external eavesdropper. To conceal information from the eavesdropper, legitimate links are equipped with transmitter-based friendly jamming (TxFJ) and receiver-based friendly jamming (RxFJ). Each link seeks to maximize its secrecy rate by determining the best power assignment (PA) for the information, TxFJ, and RxFJ signals. Joint optimization of these parameters is a non-convex problem. Hence, we seek sub-optimal solutions. Specifically, we find a lower bound on the allocated power to TxFJ above which positive secrecy is achievable for a given link. Once positive secrecy is achieved, the secrecy rate becomes monotonically increasing in the power at the transmitter (Alice). Therefore, the rest of Alice's power is allocated to the information signal. Despite its sub-optimality, such an approach precludes the possibility of employing successive interference cancellation by the eavesdropper. The RxFJ PA of a link is adjusted using an on-off PA that depends only on the link's local channel state information (CSI). With every link following such a strategy, we model this interaction as a non-cooperative game. We derive sufficient conditions for the uniqueness of the resulting Nash equilibrium. We then propose an algorithm to implement the PA game. Lastly, we relax knowledge of eavesdropper's CSI (E-CSI) and propose a framework that is robust to unknown E-CSI. Our results indicate that this robust framework performs close to when E-CSI is fully known to legitimate links. Moreover, empirically it is shown that the secrecy sum-rate scales with the power budget of transmitters.

17 April 2023 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
MKMarwan Krunz
Marwan Krunz
PSPeyman Siyari
Peyman Siyari
We investigate signaling and linear precoding designs for secure downlink communications in a multiuser MIMO (MU-MIMO) network. The network is tapped by an external eavesdropper (Eve) who is equipped with a large number of antennas. In addition to the transmission of several (unicast) information signals to downlink users (Bobs), the transmitter (Alice) generates friendly jamming (FJ), aiming to prevent Eve from decoding Alice’s signals. To mitigate both multiuser interference (MUI) and FJ on Bobs, MU-MIMO systems often rely on zero-forcing (ZF) precoders. A condition for the application of such precoders is that the network must be underloaded , i.e., Alice has more antennas than all Bobs combined. For overloaded scenarios, ZF-based precoding cannot guarantee nullification of both MUI and FJ at legitimate receivers. Accordingly, we propose a combined signaling-and-precoding scheme that can also be applied to an overloaded MU-MIMO network. In an underloaded scenario, our technique is shown to impose a more stringent antenna requirement on Eve than a classical ZF-based precoding, i.e., Eve must utilize more antennas if she is to successfully eavesdrop on Alice’s transmissions. Although our scheme is comparable to antenna selection (AS) approaches in terms of Eve’s antenna requirement, it incurs much less delay and complexity by avoiding frequent on/off switching of the RF chains at Bobs. For underloaded scenarios, we provide security analysis that establishes the conditions under which our scheme is superior to the ZF scheme. Using computer simulations, we validate the advantages of our design and contrast it with ZF and AS schemes in terms of the symbol error rate, the EVM, and the achievable rate in both underloaded and overloaded scenarios.

1 April 2016
Verified
Conference Paper
Closed access
PSPeyman Siyari
Peyman Siyari
MKMarwan Krunz
Marwan Krunz
DNDiep Nguyen
Diep Nguyen
In this paper, we expand the scope of PHY-layer security by investigating TX-based friendly jamming (FJ) for the wiretap channel in multi-link settings. For the single-link scenario, creating a TX-based FJ is an effective and practical method in improving the secrecy rate. In a multi-link setting, several information signals must be transmitted simultaneously. Thus, the design must guarantee that the FJ signal of a given transmitter does not interfere with unintended but legitimate receivers. Under the assumption of exact knowledge of the eavesdropping channel, we first propose a distributed price-based approach to improve the secrecy sum-rate of a two-link network with one eavesdropper while satisfying an information-rate constraint for both link. Simulations show that price-based FJ control outperforms greedy FJ, and is close to the performance of a centralized approach. Next, we propose a method based on mixed strategic games that can offer robust solutions to the distributed secrecy sum-rate maximization problem under the assumption of an unknown eavesdropping channel. Lastly, we use simulations to show that in addition to outperforming the greedy approach, our robust optimization also satisfies practical network considerations. In particular, the transmission time for the robust optimization can be determined flexibly to match the channel's coherence time.