Himanshu Bhusan Mishra
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Himanshu Bhusan Mishra has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Prem Singh
IIIT Bangalore
6 shared publications - Rohit Budhiraja
Indian Institute of Technology Kanpur
4 shared publications - Samrat Mukhopadhyay
Department of Electronics Engineering, Indian Institute of Technology (Indian School of Mines) Dhanbad, Dhanbad, India
4 shared publications Abhishek Gupta
Department of Electrical Engineering, Indian Institute of Technology Kanpur, Kanpur, India
2 shared publicationsAbhishek K. Prasad
Department of Electronics Engineering, IIT Dhanbad, Dhanbad, India
2 shared publicationsPrem Singh
2 shared publications
Latest Publications
- Open Access
Secrecy Rate Maximization in RIS-Assisted MIMO Systems Using a Practical Hardware Model
This study investigates a robust reconfigurable intelligent surface (RIS)-assisted multiple-input multiple-output (MIMO) system for secure wireless communication, in which a multi-antenna transmitter (Alice) sends confidential messages to a multi-antenna receiver (Bob) in the presence of an eavesdropper (Eve). Unlike idealized models, the reflecting elements (REs) of the RIS are assumed to possess inherent electrical resistance, introducing a practical non-ideal effect often neglected in prior research. The aim of the study is to maximize the secrecy rate of the MIMO system under perfect knowledge of the channel state information (CSI). To achieve this, the secrecy rate maximization problem is formulated and solved using a low-complexity joint optimization framework based on an adaptive projected gradient method (PGM), which simultaneously updates both the transmit precoding matrix and the RIS phase shifts. Solving the exact problem is computationally complex. Thus, a simplified variant is further introduced that maximizes the channel power difference rather than the exact secrecy rate. The simulation results show that this approximation yields a secrecy rate close to the true optimum while significantly reducing the computational cost. In addition, the proposed PGM with an adaptive step size initialization and control mechanism substantially improves the secrecy rate and reduces the computational time compared to the conventional fixed step size PGM. Overall, the simulation results confirm the effectiveness of the proposed PGM and demonstrate that adopting a practical RIS model is essential for establishing secure RIS-assisted MIMO communication links, especially under varying RE resistance values.
Open AccessSecrecy Rate Maximization in RIS-Assisted MIMO Systems Using a Practical Hardware Model
This study investigates a robust reconfigurable intelligent surface (RIS)-assisted multiple-input multiple-output (MIMO) system for secure wireless communication, in which a multi-antenna transmitter (Alice) sends confidential messages to a multi-antenna receiver (Bob) in the presence of an eavesdropper (Eve). Unlike idealized models, the reflecting elements (REs) of the RIS are assumed to possess inherent electrical resistance, introducing a practical non-ideal effect often neglected in prior research. The aim of the study is to maximize the secrecy rate of the MIMO system under perfect knowledge of the channel state information (CSI). To achieve this, the secrecy rate maximization problem is formulated and solved using a low-complexity joint optimization framework based on an adaptive projected gradient method (PGM), which simultaneously updates both the transmit precoding matrix and the RIS phase shifts. Solving the exact problem is computationally complex. Thus, a simplified variant is further introduced that maximizes the channel power difference rather than the exact secrecy rate. The simulation results show that this approximation yields a secrecy rate close to the true optimum while significantly reducing the computational cost. In addition, the proposed PGM with an adaptive step size initialization and control mechanism substantially improves the secrecy rate and reduces the computational time compared to the conventional fixed step size PGM. Overall, the simulation results confirm the effectiveness of the proposed PGM and demonstrate that adopting a practical RIS model is essential for establishing secure RIS-assisted MIMO communication links, especially under varying RE resistance values.
- 19 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 73 (4) , 2858-2871
Low Complexity High Speed Channel Estimation for OTFS on System on Chip
This work presents a novel, low-complexity hardware implementation of the Two-Choice Hard Thresholding Pursuit (TCHTP) algorithm for sparse channel estimation (CE) in the delay-Doppler (DD) domain, specifically designed for Orthogonal Time Frequency Space (OTFS) modulation. Unlike prior compressed sensing methods, the proposed approach does not require prior knowledge of channel sparsity or statistics, making it highly suitable for real-world, high-mobility scenarios. We formulate the CE problem in a sparse framework and develop a hardware-friendly variant of TCHTP that jointly estimates channel coefficients and their DD positions. To reduce complexity in the coefficient estimation stage involving the inverse operation, we explore and implement three matrix decomposition strategies—singular value decomposition (SVD), QR decomposition, and a novel hybrid QR+SVD approach—on a system-on-chip platform using hardware-software co-design. The proposed hybrid architecture achieves up to 70.6% memory savings, 42.4% reduction in DSP usage, and a $132\times $ speedup over the conventional design, while maintaining BER performance. Additionally, it achieves 10% lower power consumption and delivers an $84.2\times $ increase in end-to-end physical layer throughput.
- 19 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 73 (4) , 2858-2871
Low Complexity High Speed Channel Estimation for OTFS on System on Chip
This work presents a novel, low-complexity hardware implementation of the Two-Choice Hard Thresholding Pursuit (TCHTP) algorithm for sparse channel estimation (CE) in the delay-Doppler (DD) domain, specifically designed for Orthogonal Time Frequency Space (OTFS) modulation. Unlike prior compressed sensing methods, the proposed approach does not require prior knowledge of channel sparsity or statistics, making it highly suitable for real-world, high-mobility scenarios. We formulate the CE problem in a sparse framework and develop a hardware-friendly variant of TCHTP that jointly estimates channel coefficients and their DD positions. To reduce complexity in the coefficient estimation stage involving the inverse operation, we explore and implement three matrix decomposition strategies—singular value decomposition (SVD), QR decomposition, and a novel hybrid QR+SVD approach—on a system-on-chip platform using hardware-software co-design. The proposed hybrid architecture achieves up to 70.6% memory savings, 42.4% reduction in DSP usage, and a $132\times $ speedup over the conventional design, while maintaining BER performance. Additionally, it achieves 10% lower power consumption and delivers an $84.2\times $ increase in end-to-end physical layer throughput.
- 1 April 2025
- Published by Springer Nature in Wireless Personal Communications
- Vol. 141 (3-4) , 471-486
Signal Detection in OTFS with Non-stationary Iteration Based Approximate Inversion
- 1 April 2025
- Published by Springer Nature in Wireless Personal Communications
- Vol. 141 (3-4) , 471-486
Signal Detection in OTFS with Non-stationary Iteration Based Approximate Inversion
- 16 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (10) , 2382-2386
OFDM/OQAM-IRS System With Imperfect CSI
This study investigates offset quadrature amplitude modulation (OQAM) based orthogonal frequency division multiplexing (OFDM) waveform in conjunction with intelligent reflecting surfaces (IRS). For an OFDM/OQAM-IRS system, a frame structure is conceived for channel frequency response (CFR) estimation using an ALL-ON technique, followed by IRS reflection coefficients optimization using two methods based on maximizing the effective channel power. The computational complexities of both methods are derived. We analyze and demonstrate, through numerical examples, the effect of guard symbols in the OFDM/OQAM-IRS frame on CFR estimation and spectral efficiency. The simulations also showcase the performance gain of the proposed optimization schemes over the random selection of the IRS phase and OFDM/OQAM systems without IRS.
- 16 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (10) , 2382-2386
OFDM/OQAM-IRS System With Imperfect CSI
This study investigates offset quadrature amplitude modulation (OQAM) based orthogonal frequency division multiplexing (OFDM) waveform in conjunction with intelligent reflecting surfaces (IRS). For an OFDM/OQAM-IRS system, a frame structure is conceived for channel frequency response (CFR) estimation using an ALL-ON technique, followed by IRS reflection coefficients optimization using two methods based on maximizing the effective channel power. The computational complexities of both methods are derived. We analyze and demonstrate, through numerical examples, the effect of guard symbols in the OFDM/OQAM-IRS frame on CFR estimation and spectral efficiency. The simulations also showcase the performance gain of the proposed optimization schemes over the random selection of the IRS phase and OFDM/OQAM systems without IRS.
- 13 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (10) , 15721-15726
IRS-OTFS Systems: Design of Reflection Coefficients for Low-Complexity ZF Equalizer
The blend of both intelligent reflecting surface (IRS) and orthogonal time frequency space (OTFS) technologies can enhance the reliability of wireless systems for the high mobility scenarios by optimally designing the IRS coefficients. In this work, considering the fact that the conventional linear equalization technique experiences high computational complexity for IRS-OTFS based systems due to the presence of high dimensional delay- Doppler channel matrix and a large number of passive reflection elements in IRS, we initially develop a low-complexity zero-forcing (ZF) equalizer by exploiting the sparsity of the delay- Doppler cascaded channel for IRS-OTFS systems. We further derive the instantaneous bit-error-rate (BER) expression for the proposed ZF equalizer and develop an optimization framework to design the IRS coefficients with an objective to minimize the BER. We also propose Gradient-descent based solution to this optimization problem. Furthermore, we develop minimum mean squared error (MMSE) equalizer using the proposed ZF equalizer. Finally, through extensive numerical simulations, we compare the performances of the proposed techniques with that of the existing state-of-the-art techniques, in terms of computational calculations and BERs.
- 13 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (10) , 15721-15726
IRS-OTFS Systems: Design of Reflection Coefficients for Low-Complexity ZF Equalizer
The blend of both intelligent reflecting surface (IRS) and orthogonal time frequency space (OTFS) technologies can enhance the reliability of wireless systems for the high mobility scenarios by optimally designing the IRS coefficients. In this work, considering the fact that the conventional linear equalization technique experiences high computational complexity for IRS-OTFS based systems due to the presence of high dimensional delay- Doppler channel matrix and a large number of passive reflection elements in IRS, we initially develop a low-complexity zero-forcing (ZF) equalizer by exploiting the sparsity of the delay- Doppler cascaded channel for IRS-OTFS systems. We further derive the instantaneous bit-error-rate (BER) expression for the proposed ZF equalizer and develop an optimization framework to design the IRS coefficients with an objective to minimize the BER. We also propose Gradient-descent based solution to this optimization problem. Furthermore, we develop minimum mean squared error (MMSE) equalizer using the proposed ZF equalizer. Finally, through extensive numerical simulations, we compare the performances of the proposed techniques with that of the existing state-of-the-art techniques, in terms of computational calculations and BERs.
- 27 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (8) , 2083-2087
A Gradient Ascent Based Low Complexity Rate Maximization Algorithm for Intelligent Reflecting Surface-Aided OFDM Systems
Since a typical intelligent reflecting surface (IRS) comprises a large number of passive reflecting elements, it is crucial to update the reflection coefficients using a fast optimization algorithm. In this letter, we propose a Gradient Ascent (GA) based IRS coefficient optimization algorithm, to obtain the optimal IRS phase shifts that maximizes the achievable rate of IRS-Orthogonal frequency division multiplexing (OFDM) systems. We first transform the conventional complex phase optimization problem into a real-valued maximization problem with box constraints containing real variables. This transformation enables optimization through low-complexity real valued operations. We demonstrate the efficacy of the proposed GA method over the state-of-the-art solutions in terms of convergence speed, computational complexity and achievable rate through numerical simulations.
- 27 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (8) , 2083-2087
A Gradient Ascent Based Low Complexity Rate Maximization Algorithm for Intelligent Reflecting Surface-Aided OFDM Systems
Since a typical intelligent reflecting surface (IRS) comprises a large number of passive reflecting elements, it is crucial to update the reflection coefficients using a fast optimization algorithm. In this letter, we propose a Gradient Ascent (GA) based IRS coefficient optimization algorithm, to obtain the optimal IRS phase shifts that maximizes the achievable rate of IRS-Orthogonal frequency division multiplexing (OFDM) systems. We first transform the conventional complex phase optimization problem into a real-valued maximization problem with box constraints containing real variables. This transformation enables optimization through low-complexity real valued operations. We demonstrate the efficacy of the proposed GA method over the state-of-the-art solutions in terms of convergence speed, computational complexity and achievable rate through numerical simulations.
- Open Access
New Results on Single User Massive MIMO
Achieving high bit rates is the main goal of wireless technologies like 5G and beyond. This translates to obtaining high spectral efficiencies using large number of antennas at the transmitter and receiver (single user massive multiple input multiple output or SU-MMIMO). It is possible to have a large number of antennas in the mobile handset at mm-wave frequencies in the range $30 - 300$ GHz due to the small antenna size. In this work, we investigate the bit-error-rate (BER) performance of SU-MMIMO in two scenarios (a) using serially concatenated turbo code (SCTC) in uncorrelated channel and (b) parallel concatenated turbo code (PCTC) in correlated channel. Computer simulation results indicate that the BER is quite insensitive to re-transmissions and wide variations in the number of transmit and receive antennas. Moreover, we have obtained a BER of $10^{-5}$ at an average signal-to-interference plus noise ratio (SINR) per bit of just 1.25 dB with 512 transmit and receive antennas ($512\times 512$ SU-MMIMO system) with a spectral efficiency of 256 bits/transmission or 256 bits/sec/Hz in an uncorrelated channel. Similar BER results have been obtained for SU-MMIMO using PCTC in correlated channel. A semi-analytic approach to estimating the BER of a turbo code has been derived.Open AccessNew Results on Single User Massive MIMO
Achieving high bit rates is the main goal of wireless technologies like 5G and beyond. This translates to obtaining high spectral efficiencies using large number of antennas at the transmitter and receiver (single user massive multiple input multiple output or SU-MMIMO). It is possible to have a large number of antennas in the mobile handset at mm-wave frequencies in the range $30 - 300$ GHz due to the small antenna size. In this work, we investigate the bit-error-rate (BER) performance of SU-MMIMO in two scenarios (a) using serially concatenated turbo code (SCTC) in uncorrelated channel and (b) parallel concatenated turbo code (PCTC) in correlated channel. Computer simulation results indicate that the BER is quite insensitive to re-transmissions and wide variations in the number of transmit and receive antennas. Moreover, we have obtained a BER of $10^{-5}$ at an average signal-to-interference plus noise ratio (SINR) per bit of just 1.25 dB with 512 transmit and receive antennas ($512\times 512$ SU-MMIMO system) with a spectral efficiency of 256 bits/transmission or 256 bits/sec/Hz in an uncorrelated channel. Similar BER results have been obtained for SU-MMIMO using PCTC in correlated channel. A semi-analytic approach to estimating the BER of a turbo code has been derived. - 16 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 12 (6) , 1032-1036
Two Choice Hard Thresholding Pursuit (TCHTP) for Delay-Doppler Channel Estimation in OTFS
In this work, we develop a low complexity fast greedy sparse recovery algorithm known as Two Choice Hard Thresholding Pursuit (TCHTP) to estimate delay-Doppler locations and the associated channel state information (DDLCSI) for orthogonal-time-frequency-space (OTFS) systems, without the explicit knowledge of the number of delay-Doppler (DD) paths. Unlike the existing greedy algorithms, the proposed scheme simultaneously estimates the DDLCSI as well as the number of DD paths. Furthermore, we perform computational complexity calculations for the proposed TCHTP and the state-of-the-art technique, and observe that the proposed method enjoys reduced computational complexity along with fast convergence speed compared to the state-of-the-art technique. Numerical simulations validate the superiority of the proposed TCHTP algorithm in terms of mean squared error of the DDLCSI estimate, estimate of the number of DD paths, bit-error-rate, computational complexity and execution time.
- 16 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 12 (6) , 1032-1036
Two Choice Hard Thresholding Pursuit (TCHTP) for Delay-Doppler Channel Estimation in OTFS
In this work, we develop a low complexity fast greedy sparse recovery algorithm known as Two Choice Hard Thresholding Pursuit (TCHTP) to estimate delay-Doppler locations and the associated channel state information (DDLCSI) for orthogonal-time-frequency-space (OTFS) systems, without the explicit knowledge of the number of delay-Doppler (DD) paths. Unlike the existing greedy algorithms, the proposed scheme simultaneously estimates the DDLCSI as well as the number of DD paths. Furthermore, we perform computational complexity calculations for the proposed TCHTP and the state-of-the-art technique, and observe that the proposed method enjoys reduced computational complexity along with fast convergence speed compared to the state-of-the-art technique. Numerical simulations validate the superiority of the proposed TCHTP algorithm in terms of mean squared error of the DDLCSI estimate, estimate of the number of DD paths, bit-error-rate, computational complexity and execution time.
- 16 February 2023
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 95 (8) , 955-964
Low Complexity Implementation of OTFS Transmitter using Fully Parallel and Pipelined Hardware Architecture
- 16 February 2023
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 95 (8) , 955-964
Low Complexity Implementation of OTFS Transmitter using Fully Parallel and Pipelined Hardware Architecture