Ali Kuhestani 0001

dblp:145/5355-1 · DBLP profile ↗
← Back
24ranked-venue papers
9as first author
9since 2021 · last 2025
0000-0003-0725-3230ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 21 · 8 first-author · 8 since 2021Security and privacy · 3 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2025 Adaptive transmission for two-way relaying optical wireless communications
Ali Kuhestani 0001, Sina Ghasemi-Sami, Moslem Forouzesh
Wirel. Networks2
2024 A Novel Group Secret Key Generation: Performance Analysis and Secrecy Improvement
abstract
Mutual random phase injection can be considered an appropriate solution for tackling the low key generation rate issue in physical layer key generation schemes. In this paper, the confidentiality of a phase-based group secret key generation scheme has been analyzed by employing a geometric secrecy approach in a static environment. Accordingly, we exploit this approach to achieve some common randomness quantities in our group model. For this purpose, the process of key generation is defined for a star topology. Next, both vulnerability and secrecy regions are identified. To address the challenge of security vulnerability in non-proximity areas due to the spatial correlation in static environments with dominant line-of-sight (LoS), multiple carrier frequencies have been employed at the channel probing stage to enhance the secrecy regions. Finally, the key error probability is provided not only to establish an appropriate evaluation of the quality of the generated keys but also to show the efficiency of our proposed scheme in comparison with previous works.
Mahyar Ghasedi, Paeiz Azmi, MohammadReza Yari, Ali Kuhestani 0001, Hamid Saeedi
WCNC4
2024 Reconfigurable-Intelligent-Surface-Assisted Secret Key Generation Under Spatially Correlated Channels in Quasi-Static Environments
abstract
Physical-layer key generation (PLKG) can significantly enhance the security of classic encryption schemes by efficiently providing secret keys in resource-limited network like the Internet of Things (IoT). However, reaching a high key generation rate (KGR) is challenging in applications like smart home or remote area sensing with quasi-static channels. Recently, exploiting reconfigurable intelligent surface (RIS) to induce randomness in quasi-static wireless channels has received significant research interest. However, the inherent spatial correlation among the RIS elements is rarely studied, which can alter the optimum physical-layer key generation (PLKG) approach in terms of KGR and randomness in the key sequence. Specifically, for the first time, in this contribution, we take into account a spatially correlated RIS, which intends to enhance the KGR in a quasi-static medium. Novel closed-form analytical expressions for KGR are derived for the two cases of random phase shift (RPS) and our proposed equal phase shift (EPS) in the RIS elements. We also analyze the correlation between the channel samples to ensure the randomness of the generated secret key sequence. It is shown that the EPS scheme can effectively exploit the inherent spatial correlation between the RIS elements and it leads to a higher KGR compared to the widely used RPS strategy. We further formulate an optimization problem in which we determine the optimal portion of time dedicated to direct and indirect channel estimation, which has never been addressed in previous studies. We show the accuracy and the fast convergence of our sequential convex programming (SCP)-based algorithm and discuss the various parameters affecting spatially correlated RIS-assisted PLKG.
Vahid Shahiri, Hamid Behroozi, Ali Kuhestani 0001, Kai-Kit Wong
IEEE Internet Things J.3
2024 A machine learning multi-hop physical layer authentication with hardware impairments
Zahra Ezzati Khatab, Abbas Mohammadi 0002, Vahid Pourahmadi, Ali Kuhestani 0001
Wirel. Networks4
2023 Simultaneous Secure and Covert Transmissions Against Two Attacks Under Practical Assumptions
abstract
In practice, Internet of Things (IoT) applications may face two different hostile attacks, i.e., overhearing the broadcasted data and detecting the presence of data communication. Previous works have assumed that only one of these attacks is present in the network and have addressed these attacks separately. In this article, we investigate the security of a simple but practical IoT-based point-to-point communication which is facing with the above-mentioned two attacks under some realistic assumptions. In other words, we aim to protect the data against two adversary nodes, namely Eve (who tries to capture the broadcasted data) and warden Willie (who tries to detect the presence of data communication between legitimate nodes). To tackle these attacks, we jointly employ the information-theoretic security and covert communication techniques. To hide information from Willies, we force the source to transmit its message in the selected time slot and the multiple-antennas cooperative jammer to inject jamming during all time slots contentiously which leads to deceive Eves and Willies jointly. To enhance the performance of this security design, we formulate an optimization problem, with the goal of maximizing the secrecy rate subject to power constraints at the source and jammer, while satisfying a covert communication requirement. Since the mentioned optimization problem is nonconvex, we propose an algorithm to solve it. Then, to obtain further insights, we extend our proposed system model to noncolluding and colluding Willies. Next, we study a practical communication scenario, where the source has uncertainty about Willie’s location and knows the channel state information (CSI) of Eves imperfectly. Our numerical results highlight that a more accurate estimation of Willie’s location has a more positive efficacy on the secrecy performance compared to the case with more accuracy of Eves’ CSI estimation.
Moslem Forouzesh, Farid Samsami Khodadad, Paeiz Azmi, Ali Kuhestani 0001
IEEE Internet Things J.4
2022 On the Physical Layer Security of Untrusted Millimeter Wave Relaying Networks: A Stochastic Geometry Approach
abstract
The physical layer security (PLS) of millimeter wave (mmWave) communication systems is investigated, where the secure source-to-destination communication is assisted by an untrusted relay selected from a group of them and there are also several passive eavesdroppers (Eves) in the network. In the considered system model, while the distributions of the untrusted relays and Eves follow a homogeneous Poisson Point Process (PPP). To maximize the instantaneous secrecy rate, a novel joint relay selection and power allocation (JRP) method is developed where the destination and source aim for jamming the reception of both the untrusted relays and passive Eves. New expressions of the optimal power allocation (OPA) are derived for both non-colluding Eves (NCE) and colluding Eves (CE). Subsequently, by considering the impact of potential blockages, new closed-form equations are derived for analyzing the system’s ergodic secrecy rate (ESR) and secrecy outage probability (SOP) for transmission over fading mmWave channels. Finally, numerical examples are provided for demonstrating the superiority of our proposed JRP method over the relevant benchmarks found in the literature. Interestingly, the ESR increases with the density of untrusted relays for both the NCE and CE scenarios, which is a benefit of the improved probability of selecting a relay with a stronger second-hop channel. Furthermore, in the low transmit power regime, employing relatively low mmWave frequencies achieves better ESR, while in the high transmit power regime, high mmWave frequencies provide higher ESR.
Mohammad Ragheb, Sayed Mostafa Safavi Hemami, Ali Kuhestani 0001, Derrick Wing Kwan Ng, Lajos Hanzo
IEEE Trans. Inf. Forensics Secur.3
2021 Joint Information-Theoretic Secrecy and Covert Communication in the Presence of an Untrusted User and Warden
abstract
In this article, we investigate joint information-theoretic secrecy and covert communication in a single-input-multioutput (SIMO) system where a transmitter (Alice) is communicating with two legitimate users (Bob and Carol). We consider that an untrusted user and a warden node are also present in the network attempting to attack the secure and covert communications to Bob and Carol, respectively. Specifically, Bob requires secure communications such that his messages from Alice are not decoded by the untrusted user, while Carol requires covert communications such that her messages from Alice are not detected by the warden. To do so, we consider that Alice transmits Carol's messages during selected time slots to hide them from the warden while also transmitting Bob's messages in each time slot contentiously. We formulate an optimization problem with the aim of maximizing the average rate subject to a covert communication requirement and a secure communications constraint. Since the proposed optimization problem is nonconvex, we utilize successive convex approximation to obtain a tractable solution. Moreover, we extend our proposed system model to multiple antenna Alice scenario and find beamforming vectors so that the average sum rate is maximized. Furthermore, we consider practical assumptions that Alice has imperfect knowledge of the warden's location and imperfect channel state information (CSI) of Bob and Carol. Our numerical examples highlight that the imperfect CSI at Carol has a more detrimental impact on the average rate compared to imperfect CSI at Bob.
Moslem Forouzesh, Paeiz Azmi, Ali Kuhestani 0001, Phee Lep Yeoh
IEEE Internet Things J.3
2021 A Lightweight Secure and Resilient Transmission Scheme for the Internet of Things in the Presence of a Hostile Jammer
abstract
In this article, we propose a lightweight security scheme for ensuring both information confidentiality and transmission resiliency in the Internet-of-Things (IoT) communication. A single-antenna transmitter communicates with a half-duplex single-antenna receiver in the presence of a sophisticated multiple-antenna-aided passive eavesdropper and a multiple-antenna-assisted hostile jammer (HJ). A low-complexity artificial noise (AN) injection scheme is proposed for drowning out the eavesdropper. Furthermore, for enhancing the resilience against HJ attacks, the legitimate nodes exploit their own local observations of the wireless channel as the source of randomness to agree on shared secret keys. The secret key is utilized for the frequency hopping (FH) sequence of the proposed communication system. We then proceed to derive a new closed-form expression for the achievable secret key rate (SKR) and the ergodic secrecy rate (ESR) for characterizing the secrecy benefits of our proposed scheme, in terms of both information secrecy and transmission resiliency. Moreover, the optimal power sharing between the AN and the message signal is investigated with the objective of enhancing the secrecy rate. Finally, through extensive simulations, we demonstrate that our proposed system model outperforms the state-of-the-art transmission schemes in terms of secrecy and resiliency. Several numerical examples and discussions are also provided to offer further engineering insights.
Mehdi Letafati, Ali Kuhestani 0001, Kai-Kit Wong, Mohammad Jalil Piran
IEEE Internet Things J.2
2021 Can a multi-hop link relying on untrusted amplify-and-forward relays render security?
Milad Tatar Mamaghani, Ali Kuhestani 0001, Hamid Behroozi
Wirel. Networks2
2020 Physical Layer Secrecy and Transmission Resiliency of Device-to-Device Communications
abstract
In this paper, by taking into account the requirements of information secrecy and transmission resiliency, we present a comprehensive scheme enabling secure device-to-device (D2D) networks, where a single-antenna transmitter communicates with a half-duplex single-antenna receiver in the presence of a passive eavesdropper and an adversary jammer. Motivated by physical layer security techniques, artificial noise injection scheme is proposed to ensure communication secrecy. To improve the resiliency against jamming attack, the D2D nodes utilize the frequency hopping technique. Under this system model, we examine the achievable ergodic secrecy rate (ESR) by deriving a new closed-form expression. Furthermore, the optimal power allocation between the artificial noise and data signal is studied for maximizing the ESR. Numerical examples and discussions are provided to depict the efficiency of our proposed scheme compared with the state-of-the-arts.
Mehdi Letafati, Ali Kuhestani 0001, Derrick Wing Kwan Ng, Mohammad Reza Ahmadi Beshkani
GLOBECOM2
2020 Covert Communication and Secure Transmission Over Untrusted Relaying Networks in the Presence of Multiple Wardens
abstract
In this paper, we address the problem of joint covert communication and secure transmission in untrusted relaying networks when multiple wardens exist in the network. We first consider a system model consisting of one source, one untrusted amplify-and-forward relay, one destination, and one warden. For covert communications, our aim is to prevent the warden from detecting the presence of communications via the source-relay-destination link. For secure transmission, our aim is to prevent the untrusted relay from decoding the source signal. To satisfy these requirements, we propose that the destination and the source inject jamming signals during the source-to-relay and relay-to-destination transmission phases, respectively. For the considered system model, we propose a power allocation strategy to maximize the secrecy rate and satisfy the covert requirements in both of the phases. Given that the proposed optimization problem is non-convex, we employ the successive convex approximation (SCA) approach to derive a tractable solution. To obtain further insights, we generalize our analytical results to consider multiple untrusted relays and multiple wardens. We focus on two scenarios of non-colluding and colluding wardens. Our results highlight that as the number of relays increases, the achievable secrecy rate increases while the average detection error probability decreases. This is a novel observation of a fundamental trade-off between covert requirement and secrecy performance.
Moslem Forouzesh, Paeiz Azmi, Ali Kuhestani 0001, Phee Lep Yeoh
IEEE Trans. Commun.3
2020 Three-Hop Untrusted Relay Networks With Hardware Imperfections and Channel Estimation Errors for Internet of Things
abstract
Cooperative relaying can be introduced as a promising approach for data communication in the Internet of Things (IoT), where the source and the destination may be placed far away. In this paper, by taking a variety of realistic hardware imperfections (HWIs) and channels estimation errors (CEEs) into account, the secrecy performance of a three-hop cooperative network with a source, a destination and two consecutive amplify-and-forward (AF) relays is investigated. The relays are considered to be untrusted, i.e., while they are mandatory helpers for data transmission, they may overhear the received signals. We adopt the artificial noise injection scheme, to keep the source message secret from being captured by the untrusted relays. Given this system model, a novel closed-form expression is obtained in the high signal-to-noise ratio (SNR) regime for the ergodic secrecy rate (ESR) performance over Nakagami-m fading. Our simulation results highlight that the secrecy performance of the system is improved when the tolerable HWIs are distributed beneficially across the transmission and reception radio-frequency (RF) front-ends of each node. Our work reveals that unlike the ideal case, the realistic scenario of non-ideal hardware with CEEs faces with the secrecy rate ceiling. Finally, under a constraint on the total energy consumption which is applicable for battery-limited IoT equipment, we maximize the achievable secrecy rate. Our results highlight the importance of the destination's jamming cooperation and the first relay's role on the secrecy performance.
Mehdi Letafati, Ali Kuhestani 0001, Hamid Behroozi
IEEE Trans. Inf. Forensics Secur.2
2020 Jamming-Resilient Frequency Hopping-Aided Secure Communication for Internet-of-Things in the Presence of an Untrusted Relay
abstract
In this paper, we propose a light-weight jamming-resistant scheme for the Internet-of-Things (IoT) in 5G networks to ensure high-quality communication in a two-hop cooperative network. In the considered system model, a source communicates with a destination in the presence of an untrusted relay and a powerful multi-antenna adversary jammer. The untrusted relay is an authorized necessary helper who may wiretap the confidential information. Meanwhile, the jammer is an external attacker who tries to damage both the training and transmission phases. Different from traditional frequency hopping spread spectrum (FHSS) techniques that require a pre-determined pattern between communicating nodes, in our scheme, the source and destination enjoy the local observations of the two-hop channels. Then they exploit the measured channel as the source of common randomness to generate shared secret keys. By collecting multiple time slots into a frame, the sequence of channels observed in each frame is utilized to specify the adopted FHSS sequence in the next frame. Based on the derived FHSS sequence from the key generation phase, the source starts to transmit its message supporting by the the destination-assisted cooperative jamming (DACJ) technique which prevents the untrusted relay from discovering the secret message. For the mentioned system model, we present new closed-form expressions for characterizing the achievable secret key rate (SKR) and ergodic secrecy rate (ESR) to highlight the efficiency of our proposed scheme compared to the state-of-the-art. We next determine the optimal power allocation (OPA) between the pilot and data transmission phases that maximizes the ESR performance while escaping from jamming attack. Finally, several numerical examples and discussions are presented to gain engineering insights behind the studied communication scenario.
Mehdi Letafati, Ali Kuhestani 0001, Hamid Behroozi, Derrick Wing Kwan Ng
IEEE Trans. Wirel. Commun.2
2020 Characterization of untrusted relaying networks in the presence of an adversary jammer
Hamed Saedi, Abbas Mohammadi 0002, Ali Kuhestani 0001
Wirel. Networks3
2018 Optimal Power Allocation and Secrecy Sum Rate in Two-Way Untrusted Relaying Networks With an External Jammer
abstract
In this paper, we examine the secrecy performance of two-way relaying between a large-scale multiple antenna base station (BS) and a single antenna mobile user (MU) in the presence of a multiple antenna external jammer. We consider the untrusted relaying scenario, where an amplify-and-forward relay is both a necessary helper and a potential eavesdropper to the BS and MU transmissions. With the aim of maximizing the instantaneous secrecy sum rate, we derive new closed-form solutions for the optimal power allocation (OPA) under the following three scenarios: 1) without jamming (WoJ) where the jammer is not activated; 2) friendly jamming (FJ) where the jamming signal is known a priori at the BS and MU; and 3) Gaussian noise jamming (GNJ) where the jamming signal is unknown at the BS and MU. Based on our OPA solutions, new closed-form expressions are derived for the ergodic secrecy sum rate (ESSR) with Rayleigh fading channels. Furthermore, we characterize the high signal-to-noise ratio slope and power offset of the ESSR to provide a fundamental comparison of the WoJ, FJ, and GNJ scenarios. Based on our analysis, we propose a simple relay selection criterion for the scenario when the BS and MU are assisted by multiple untrusted relays. Numerical examples are presented to demonstrate the impact of the jammer's location, number of antennas and the advantage of the proposed relay selection criterion on the secrecy performance. Our findings highlight that similar to the trusted relaying scenario, the ESSR of all three secure transmission scenarios improve as the number of untrusted relays increases. Moreover, we highlight an interesting insight that the OPA for the GNJ scenario results in the same ESSR performance as the OPA for the WoJ scenario.
Ali Kuhestani 0001, Abbas Mohammadi 0002, Phee Lep Yeoh
IEEE Trans. Commun.1
2018 Joint Relay Selection and Power Allocation in Large-Scale MIMO Systems With Untrusted Relays and Passive Eavesdroppers
abstract
In this paper, a joint relay selection and power allocation (JRP) scheme is proposed to enhance the physical layer security of a cooperative network, where a multiple antennas source communicates with a single-antenna destination in the presence of untrusted relays and passive eavesdroppers (Eves). The objective is to protect the data confidentially while concurrently relying on the untrusted relays as potential Eves to improve both the security and reliability of the network. To realize this objective, we consider cooperative jamming performed by the destination while the JRP scheme is implemented. With the aim of maximizing the instantaneous secrecy rate, we derive a new closed-form solution for the optimal power allocation and propose a simple relay selection criterion under two scenarios of non-colluding Eves (NCE) and colluding Eves (CE). For the proposed scheme, a new closed-form expression is derived for the ergodic secrecy rate (ESR) and the secrecy outage probability as security metrics, and a new closed-form expression is presented for the average symbol error rate as a reliability measure over Rayleigh fading channels. We further explicitly characterize the high signal-to-noise ratio slope and power offset of the ESR to highlight the impacts of system parameters on the ESR. In addition, we examine the diversity order of the proposed scheme to reveal the achievable secrecy performance advantage. Finally, the secrecy and reliability diversity-multiplexing tradeoff of the optimized network are provided. Numerical results highlight that the ESR performance of the proposed JRP scheme for NCE and CE cases is increased with respect to the number of untrustworthy relays.
Ali Kuhestani 0001, Abbas Mohammadi 0002, MohammadAli Mohammadi
IEEE Trans. Inf. Forensics Secur.1
2018 Optimal Power Allocation by Imperfect Hardware Analysis in Untrusted Relaying Networks
abstract
By taking a variety of realistic hardware imperfections into consideration, we propose an optimal power allocation (OPA) strategy to maximize the instantaneous secrecy rate of a cooperative wireless network comprised of a source, a destination, and an untrusted amplify-and-forward relay. We assume that either the source or the destination is equipped with a large-scale multiple antennas' system, while the rest are equipped with a single antenna. To prevent the untrusted relay from intercepting the source message, the destination sends an intended jamming noise to the relay, which is referred to as destination-based cooperative jamming. Given this system model, novel closed-form expressions are presented in the high signal-to-noise ratio regime for the ergodic secrecy rate and the secrecy outage probability. We further improve the secrecy performance of the system by optimizing the associated hardware design. The results reveal that by beneficially distributing the tolerable hardware imperfections across the transmission and reception radio-frequency front ends of each node, the system's secrecy rate may be improved. The engineering insight is that equally sharing the total imperfections at the relay between the transmitter and the receiver provides the best secrecy performance. Numerical results illustrate that the proposed OPA together with the most appropriate hardware design significantly increases the secrecy rate.
Ali Kuhestani 0001, Abbas Mohammadi 0002, Kai-Kit Wong, Phee Lep Yeoh, Muhammad R. A. Khandaker
IEEE Trans. Wirel. Commun.1
2017 Optimal Power Allocation and Secrecy Sum Rate in Two-Way Untrusted Relaying
abstract
In this paper, we examine the secrecy performance of two-way relaying between a multiple antenna base station (BS) and a single antenna mobile user (MU) in the presence of a multiple antenna friendly jammer (FJ). We consider the untrusted relaying scenario where an amplify-and-forward relay is both a necessary helper and a potential eavesdropper. To maximize the instantaneous secrecy sum rate, we derive new closed-form solutions for the optimal power allocation (OPA) between the BS and MU under the scenario of relaying with friendly jamming (WFJ). Based on the OPA solution, new closed-form expressions are derived for the ergodic secrecy sum rate (ESSR) with Rayleigh fading channel. Furthermore, we explicitly determine the high signal-to-noise ratio slope and power offset of the ESSR to highlight the benefits of friendly jamming. Numerical examples are provided to demonstrate the impact of the FJ's location and number of antennas on the secrecy performance.
Ali Kuhestani 0001, Phee Lep Yeoh, Abbas Mohammadi 0002
GLOBECOM1
2017 Secure Two-Way Communication via a Wireless Powered Untrusted Relay and Friendly Jammer
abstract
In this paper, we propose a self-dependent two-way secure communication where two sources exchange confidential messages via a wireless powered untrusted amplify-and-forward (AF) relay and friendly jammer (FJ). By adopting the time switching (TS) architecture at the relay, the data transmission is accomplished in three phases: Phase I) Energy harvesting by the untrusted relay and the FJ through non-information transmissions from the sources, Phase II) Information transmission by the sources and jamming transmissions from the FJ to reduce information leakage to the untrusted relay; and Phase III) Forwarding the scaled version of the received signal from the untrusted relay to the sources. For the proposed system, we derive a new closed-form lower bound expression for the ergodic secrecy sum rate (ESSR). Numerical examples are provided to demonstrate the impacts of different system parameters such as energy harvesting time, transmit signal-to-noise ratio (SNR) and the relay/FJ location on the secrecy performance. The numerical results illustrate that the proposed network with friendly jamming (WFJ) outperforms traditional one-way communication and the two-way without friendly jamming (WoFJ) policy.
Milad Tatar Mamaghani, Abbas Mohammadi 0002, Phee Lep Yeoh, Ali Kuhestani 0001
GLOBECOM4
2016 Destination-based cooperative jamming in untrusted amplify-and-forward relay networks: resource allocation and performance study
abstract
In this study, the authors study the problem of secure transmission in two‐hop amplify‐and‐forward systems with an untrusted relay. To prevent the untrusted relay from intercepting the source message and to achieve positive secrecy rate, the destination‐based cooperative jamming technique is used. In this method, the destination sends an intended jamming signal to the relay. This jamming signal helps protecting the source message from being captured reliably at the untrusted relay, while the destination cancels itself intended jamming signal. The optimal power allocation (OPA) strategy is considered for the proposed system. They observe that the objective function is a quasi‐concave function at high signal‐to‐noise‐ratio regimes. Based on this OPA strategy, in the first step, the outage probability of the system is investigated. It is investigated for three cases. In the two cases, either of the source or the destination node is equipped with large‐scale antennas, and in the third case, both of them are equipped with large‐scale antenna arrays. In all the cases, the closed‐form expressions are derived. In the second step, they investigate the ergodic secrecy rate and present the closed‐form solutions for all the mentioned cases. Finally, simulation results indicate the accuracy of the derived equations.
Ali Kuhestani 0001, Abbas Mohammadi 0002
IET Commun.1
2016 Optimal power allocation to improve secrecy performance of non-regenerative cooperative systems using an untrusted relay
abstract
To protect data communication from eavesdropper nodes, different techniques have been developed to improve the physical‐layer security (PLS) of communications systems. Destination‐based cooperative signalling (DBCS) is one of such techniques where the destination sends an intended artificial noise to the untrusted listeners helping to protect the source message from being captured reliably at eavesdroppers. In this study, the authors investigate the application of DBCS to improve the PLS, and as a consequence the secrecy performance of a two‐hop amplify‐and‐forward cooperative system with an untrusted relay. To get the best performance out of DBCS, the transmit power of the source's signal as well as the artificial noise should be carefully adjusted. To address this, they have introduced the optimal power allocation to maximise the secrecy rate of the system under a sum‐power constraint at the network nodes. For a system with large‐scale antenna arrays at the base station, then then find the closed‐form solution for the secrecy outage probability and the ergodic secrecy rate of the optimised system for both uplink and downlink. The presented simulation results validate the authors’ theoretical analysis and reveal that the proposed DBCS with optimal power allocation significantly improves the secrecy performance of the system.
Ali Kuhestani 0001, Abbas Mohammadi 0002, Moslem Noori
IET Commun.1
2015 Diversity-multiplexing trade-off of linear dispersion coded multi-input-multi-output systems
abstract
In this study, the authors study the diversity‐multiplexing trade‐off (DMT) of multi‐input–multi‐output (MIMO) systems in which linear dispersion (LD) codes are used. They first focus on an LD‐coded 2 × 2 MIMO systems at the high signal‐to‐noise ratio (SNR) regime. By using the joint eigenvalue density, the outage probability is presented in a very compact expression, which establishes the DMT framework at this regime. Simulation results show that the derived expression for the outage probability is sufficiently accurate at high SNR regimes but less accurate in the transition region. Finally, for the special case of multi‐input–single‐output, they derive both the outage probability and the DMT framework inexact and closed form formulas at all SNRs, including finite SNRs.
Ali Kuhestani 0001, Abbas Mohammadi 0002
IET Commun.1
2014 Simply decoded efficient full-rate space-time block codes over correlated Rician fading channels
abstract
A novel technique is presented to design efficient full‐rate space–time block codes (STBCs) over correlated Rician fading channels. The authors first derive a formula for the achievable information rate of a linear dispersion coded multi‐input single‐output system as a function of correlation at the transmitter in a Rician fading channel. In addition, the authors obtain the bit‐error‐rate (BER) equations for this system, when multiple phase shift keying and multiple quadrature amplitude modulation schemes are used at the transmitter. Therefore with regard to derived formulae and using a genetic algorithm, a method is presented to construct STBCs over correlated Rician fading channels. The efficient designed STBCs for two and four transmit antennas enjoy full‐rate, simple structure, simple processing at the receiver, better BER performance than associated orthogonal STBCs at practical signal‐to‐noise ratios (SNRs) and higher achievable information rate than them at all SNRs.
Ali Kuhestani 0001, Hossein Pilaram, Abbas Mohammadi 0002
IET Commun.1
2013 Design of efficient full-rate linear dispersion spacetime block codes over correlated fading channels
abstract
In this study, the authors present a method to design efficient full‐rate linear dispersion space‐time block codes (LD‐STBCs) in correlated Rayleigh fading channels with simple detection at the receiver. The authors first derive a formula for the achievable capacity of an LD‐STBC coded multi‐input multiple‐output (MIMO) system as a function of correlation at the transmitter and the receiver. Moreover, the authors compute closed‐form bit‐error rate equations for multiple phase shift keying ( M ‐PSK) and multiple quadrature amplitude modulation ( M ‐QAM) schemes. Then, the authors present a method to construct LD‐STBCs over correlated Rayleigh fading MIMO channels. Finally, the authors design LD‐STBCs for two and four transmit antennas. The designed LD‐STBCs enjoy full‐rate, minimum power fluctuation, simple structure, simple processing at the receiver. Moreover, the designed LD‐STBCs for two transmit antennas provide better performance than Alamouti and LYC codes and the designed LD‐STBCs for four transmit antennas provide better performance than TV codes at practical signal‐to‐noise ratios. Simulation results show that when the proposed LD‐STBC for two transmit antennas is concatenated with an efficient outer channel encoder, it provides better performance than LYC code over correlated fading channels.
Ali Kuhestani 0001, Paeiz Azmi
IET Commun.1