Tapan Kumar Sarkar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tapan Kumar Sarkar has a total of 107 co-authors. Here are the top co-authors by number of shared publications:
- Magdalena Salazar-Palma
Carlos III University of Madrid, Avda. de la Universidad 30, 28911 Leganés, Madrid, Spain
37 shared publications Yu Zhang
School of Electronic Engineering, Xidian University, Xi’an, China
13 shared publications- Ming-Da Zhu
Shaanxi Key Laboratory of Large Scale Electromagnetic Computing, Shaanxi Innovation Center for High Performance CAE Software, Xidian University, Xian, China
8 shared publications - Xiaopeng Yang
Beijing Institute of Technology
6 shared publications - Heng Chen
Syracuse University, 211 Lafayette Rd. Room 425, Syracuse, NY, USA
5 shared publications - Daniel Garcia-Donoro
Xidian University, China
4 shared publications
Latest Publications
- 9 July 2021
- Published by Wiley
- p. 519-571
Performance of Different Functionals for Interpolation/Extrapolation of Near/Far‐Field Data
- 9 July 2021
- Published by Wiley
- p. 519-571
Performance of Different Functionals for Interpolation/Extrapolation of Near/Far‐Field Data
- 9 July 2021
- Published by Wiley
- p. 491-518
Deconvolving Measured Electromagnetic Responses
- 9 July 2021
- Published by Wiley
- p. 191-233
Applications of the Hilbert Transform – A Nonparametric Method for Interpolation/Extrapolation of Data
- 9 July 2021
- Published by Wiley
- p. 191-233
Applications of the Hilbert Transform – A Nonparametric Method for Interpolation/Extrapolation of Data
- 2 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 69 (12) , 8539-8550
A Novel Framework of Singularity Cancellation Transformations for Strongly Near-Singular Integrals
In the solution of frequency- and time-domain integral equations, the singularity cancellation transformations are well-known for the treatments of the singular integrals involving Green’s functions and their gradients. The cancellation transformations for strongly near-singular integrals become inaccurate and inefficient for an extremely deformed triangular patch, and this phenomenon is referred to as shape-dependent problem in this article. As the degree of the singularity increases, the shape-dependent problem of strong near-singularity is more severe than that of the weakly near-singular integrals. Furthermore, if the source triangle is deformed, the accuracy of the cancellation methods decreases when no near singularity exists. In this work, we first investigate the reason for these problems via the theoretical analysis with numerical verification. Second, an updated framework of singularity cancellation methods for strongly near-singular integrals is proposed, which has a fast and consistent convergence rate for both regular and irregular triangles. Third, some numerical experiments are presented to illustrate the effectiveness of the theoretical framework and the proposed transformations.
- 2 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 69 (12) , 8539-8550
A Novel Framework of Singularity Cancellation Transformations for Strongly Near-Singular Integrals
In the solution of frequency- and time-domain integral equations, the singularity cancellation transformations are well-known for the treatments of the singular integrals involving Green’s functions and their gradients. The cancellation transformations for strongly near-singular integrals become inaccurate and inefficient for an extremely deformed triangular patch, and this phenomenon is referred to as shape-dependent problem in this article. As the degree of the singularity increases, the shape-dependent problem of strong near-singularity is more severe than that of the weakly near-singular integrals. Furthermore, if the source triangle is deformed, the accuracy of the cancellation methods decreases when no near singularity exists. In this work, we first investigate the reason for these problems via the theoretical analysis with numerical verification. Second, an updated framework of singularity cancellation methods for strongly near-singular integrals is proposed, which has a fast and consistent convergence rate for both regular and irregular triangles. Third, some numerical experiments are presented to illustrate the effectiveness of the theoretical framework and the proposed transformations.
- 5 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 69 (9) , 5837-5850
On the Shape-Dependent Problem of Singularity Cancellation Transformations for Weakly Near-Singular Integrals
The singularity cancellation transformations are well-known for calculating weakly singular and near-singular integrals in integral equation solutions. However, some singularity cancellation methods suffer from the shape-dependent problem of inaccuracy and inefficiency for deformed triangles. By the theoretical analysis and numerical verification in this article, the relation between the near-singularity and shape-dependence of the singularity cancellation schemes is discussed. Moreover, a novel framework for devising cancellation transformations of weakly near-singular integrals is presented, which results in fast convergence for both regular and irregular triangular domains. Some numerical results are given to illustrate the validity of the theoretical framework and the efficiency of the proposed transformations.
- 5 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 69 (9) , 5837-5850
On the Shape-Dependent Problem of Singularity Cancellation Transformations for Weakly Near-Singular Integrals
The singularity cancellation transformations are well-known for calculating weakly singular and near-singular integrals in integral equation solutions. However, some singularity cancellation methods suffer from the shape-dependent problem of inaccuracy and inefficiency for deformed triangles. By the theoretical analysis and numerical verification in this article, the relation between the near-singularity and shape-dependence of the singularity cancellation schemes is discussed. Moreover, a novel framework for devising cancellation transformations of weakly near-singular integrals is presented, which results in fast convergence for both regular and irregular triangular domains. Some numerical results are given to illustrate the validity of the theoretical framework and the efficiency of the proposed transformations.
- 2 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Antennas and Wireless Propagation Letters
- Vol. 20 (2) , 130-134
Robust Adaptive Beamforming Based on Covariance Matrix Reconstruction With Annular Uncertainty Set and Vector Space Projection
The performance of adaptive beamforming will degrade dramatically in practical application due to system errors including signal direction error, array geometry error, gain, and phase errors. Besides, the performance will further deteriorate when the desired signal is contained in the sample data. Therefore, a robust adaptive beamforming method based on the covariance matrix reconstruction with annular uncertainty set (AUS) and vector space projection (VSP) is proposed in this letter. By integrating the corresponding Capon spectrum over the surface of AUS, the interference-plus-noise covariance matrix (INCM) and the desired signal covariance matrix are reconstructed, respectively. Because the steering vector (SV) of desired signal lies in the intersection of the signal subspaces of the sample covariance matrix and the reconstructed desired signal covariance matrix, it can be estimated by the VSP method. Finally, the adaptive weight vector is calculated based on the reconstructed INCM and the estimated SV. Simulation and experiment results show that the proposed method can effectively suppress the interference and achieve excellent performance under system errors.
- 2 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Antennas and Wireless Propagation Letters
- Vol. 20 (2) , 130-134
Robust Adaptive Beamforming Based on Covariance Matrix Reconstruction With Annular Uncertainty Set and Vector Space Projection
The performance of adaptive beamforming will degrade dramatically in practical application due to system errors including signal direction error, array geometry error, gain, and phase errors. Besides, the performance will further deteriorate when the desired signal is contained in the sample data. Therefore, a robust adaptive beamforming method based on the covariance matrix reconstruction with annular uncertainty set (AUS) and vector space projection (VSP) is proposed in this letter. By integrating the corresponding Capon spectrum over the surface of AUS, the interference-plus-noise covariance matrix (INCM) and the desired signal covariance matrix are reconstructed, respectively. Because the steering vector (SV) of desired signal lies in the intersection of the signal subspaces of the sample covariance matrix and the reconstructed desired signal covariance matrix, it can be estimated by the VSP method. Finally, the adaptive weight vector is calculated based on the reconstructed INCM and the estimated SV. Simulation and experiment results show that the proposed method can effectively suppress the interference and achieve excellent performance under system errors.
- 9 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Antennas and Wireless Propagation Letters
- Vol. 19 (12) , 2280-2284
Robust Wideband Adaptive Beamforming Based on Focusing Transformation and Steering Vector Compensation
The wideband adaptive beamforming method would deteriorate severely when the desired signal is contained in the training snapshots, especially the mismatched signal steering vector existed simultaneously. Therefore, a robust wideband adaptive beamforming method is proposed based on focusing transformation and steering vector compensation. In proposed method, the received wideband signals are firstly decomposed into narrow sub-bands. Then, based on the Direction of Arrivals (DOAs) of signals, the interference plus noise covariance matrix of each sub-band is reconstructed to remove the desired signal and transformed into the reference frequency by the focusing transformation. Subsequently, the mismatched signal steering vector is compensated based on the error vector decomposition and the optimization of output power of adaptive beamformer. Finally, the adaptive weight vector of robust wideband beamforming is calculated based on the minimum variance distortionless response criterion. The effectiveness of proposed method is verified by numerical simulations.
- 9 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Antennas and Wireless Propagation Letters
- Vol. 19 (12) , 2280-2284
Robust Wideband Adaptive Beamforming Based on Focusing Transformation and Steering Vector Compensation
The wideband adaptive beamforming method would deteriorate severely when the desired signal is contained in the training snapshots, especially the mismatched signal steering vector existed simultaneously. Therefore, a robust wideband adaptive beamforming method is proposed based on focusing transformation and steering vector compensation. In proposed method, the received wideband signals are firstly decomposed into narrow sub-bands. Then, based on the Direction of Arrivals (DOAs) of signals, the interference plus noise covariance matrix of each sub-band is reconstructed to remove the desired signal and transformed into the reference frequency by the focusing transformation. Subsequently, the mismatched signal steering vector is compensated based on the error vector decomposition and the optimization of output power of adaptive beamformer. Finally, the adaptive weight vector of robust wideband beamforming is calculated based on the minimum variance distortionless response criterion. The effectiveness of proposed method is verified by numerical simulations.
- 18 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Antennas and Wireless Propagation Letters
- Vol. 19 (7) , 1206-1210
Fast and Robust Variable-Step-Size LMS Algorithm for Adaptive Beamforming
Conventional least mean square (LMS) algorithm is one of the most popular algorithms, which is widely used for adaptive beamforming. But the performance of the LMS algorithm degrades significantly because the constant step size is not suitable for varying signal-to-noise ratio (SNR) scenarios. Although numerous variable step size LMS (VSS-LMS) algorithms were proposed to improve the performance of the LMS algorithm; however, most of these VSS-LMS algorithms are either computationally complex or not reliable in practical scenarios since they depend on many parameters that are not easy to tune manually. In this letter, a fast and robust VSS-LMS algorithm is proposed for adaptive beamforming. The variable step size is obtained based on normalized sigmoid function, where the sigmoid function is calculated by using the mean of instantaneous error firstly and then normalized by the squared cumulative sum of instantaneous error and estimated signal power. The proposed algorithm can update the step size adaptively without tuning any parameter and outperform state-of-the-art algorithms with low computational complexity. The simulation results show better performance of the proposed algorithm.
- 18 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Antennas and Wireless Propagation Letters
- Vol. 19 (7) , 1206-1210
Fast and Robust Variable-Step-Size LMS Algorithm for Adaptive Beamforming
Conventional least mean square (LMS) algorithm is one of the most popular algorithms, which is widely used for adaptive beamforming. But the performance of the LMS algorithm degrades significantly because the constant step size is not suitable for varying signal-to-noise ratio (SNR) scenarios. Although numerous variable step size LMS (VSS-LMS) algorithms were proposed to improve the performance of the LMS algorithm; however, most of these VSS-LMS algorithms are either computationally complex or not reliable in practical scenarios since they depend on many parameters that are not easy to tune manually. In this letter, a fast and robust VSS-LMS algorithm is proposed for adaptive beamforming. The variable step size is obtained based on normalized sigmoid function, where the sigmoid function is calculated by using the mean of instantaneous error firstly and then normalized by the squared cumulative sum of instantaneous error and estimated signal power. The proposed algorithm can update the step size adaptively without tuning any parameter and outperform state-of-the-art algorithms with low computational complexity. The simulation results show better performance of the proposed algorithm.
- 6 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Multiscale and Multiphysics Computational Techniques
- Vol. 4, 269-281
MIMO: Does It Make Sense From an Electromagnetic Perspective and Illustrated Using Computational Electromagnetics?
The objective of this article is to illustrate the concepts of multiplc-input-multiple--oulput (MIMO) systems from an electromagnetic perspective and illustrated using computational techniques. The various conceptual evolutionary steps of MIMO are described. This methodology went through various distinct disjoint philosophies to satisfy its critics as the presented techniques had various shortcomings from a physics perspective. This is because the principle of superposition of power is not always valid in electrical engineering and hence not applicable to analysis of multi antenna systems where multi-streams are affected by mutual interference. The prime objective of this paper is to specify that the input power needs to be the same when comparing performance of systems, as it is not clear how one excites an antenna using a priori fixed power, as antennas are excited with voltage sources. Also to these misguided researchers antenna radiates power as they are treated as point sources where in reality it radiates an electric/magnetic field. Using computational electromagnetics, it is illustrated that a 1×1 SISO system may perform better than a 2×2 MIMO system under specific circumstances. However, as the concept of channel capacity is developed on purely mathematical grounds based on statistics and not on physics of electromagnetics, it is difficult to interpret its results. The channel capacity is defined with respect to background thermal noise whereas no receiver can accept a signal weaker than 100 μV/m in the absence of interference, which is far above the background noise. Finally, a zero-forcing scheme based on electromagnetic principle of reciprocity is presented. Numerical examples using computational electromagnetics are presented to illustrate this scenario and a comparison in performance with conventional systems is made illustrating that this system can perform equally well.
- 6 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Multiscale and Multiphysics Computational Techniques
- Vol. 4, 269-281
MIMO: Does It Make Sense From an Electromagnetic Perspective and Illustrated Using Computational Electromagnetics?
The objective of this article is to illustrate the concepts of multiplc-input-multiple--oulput (MIMO) systems from an electromagnetic perspective and illustrated using computational techniques. The various conceptual evolutionary steps of MIMO are described. This methodology went through various distinct disjoint philosophies to satisfy its critics as the presented techniques had various shortcomings from a physics perspective. This is because the principle of superposition of power is not always valid in electrical engineering and hence not applicable to analysis of multi antenna systems where multi-streams are affected by mutual interference. The prime objective of this paper is to specify that the input power needs to be the same when comparing performance of systems, as it is not clear how one excites an antenna using a priori fixed power, as antennas are excited with voltage sources. Also to these misguided researchers antenna radiates power as they are treated as point sources where in reality it radiates an electric/magnetic field. Using computational electromagnetics, it is illustrated that a 1×1 SISO system may perform better than a 2×2 MIMO system under specific circumstances. However, as the concept of channel capacity is developed on purely mathematical grounds based on statistics and not on physics of electromagnetics, it is difficult to interpret its results. The channel capacity is defined with respect to background thermal noise whereas no receiver can accept a signal weaker than 100 μV/m in the absence of interference, which is far above the background noise. Finally, a zero-forcing scheme based on electromagnetic principle of reciprocity is presented. Numerical examples using computational electromagnetics are presented to illustrate this scenario and a comparison in performance with conventional systems is made illustrating that this system can perform equally well.