Ansuman Patnaik
Ansuman Patnaik has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Rosalin
School of Electronics Engineering, KIIT Deemed to be University, Bhubaneswar, India
3 shared publications - Sarita Nanda
Kalinga Institute of Industrial Technology
3 shared publications - Deepak Kumar Rout
KIIT Deemed to be University
2 shared publications Rosalin
2 shared publicationsSarita Nanda
KIIT Deemed to be University
2 shared publicationsBishnu Prasad Mishra
1 shared publication
Latest Publications
- 2 June 2026
- Published by Springer Nature
- p. 514-521
Impulsive Noise Removal from ECG Signals Using VSS-Approximated LHCAF Algorithm
- 2 June 2026
- Published by Springer Nature
- p. 514-521
Impulsive Noise Removal from ECG Signals Using VSS-Approximated LHCAF Algorithm
- 3 May 2025
- Published by Springer Nature
- p. 445-453
LDMAF Algorithm with Non-uniform Constraint for Sparse System Identification
- 3 May 2025
- Published by Springer Nature
- p. 445-453
LDMAF Algorithm with Non-uniform Constraint for Sparse System Identification
- 17 February 2024
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 18 (4) , 3595-3601
A bias-compensated NLMS algorithm based on arctangent framework for system identification
- 17 February 2024
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 18 (4) , 3595-3601
A bias-compensated NLMS algorithm based on arctangent framework for system identification
- 8 September 2023
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 18 (1) , 335-342
A filter proportionate LMS algorithm based on the arctangent framework for sparse system identification
- 8 September 2023
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 18 (1) , 335-342
A filter proportionate LMS algorithm based on the arctangent framework for sparse system identification
- 6 October 2020
- Published by Wiley in International Journal of Adaptive Control and Signal Processing
- Vol. 34 (12) , 1799-1811
The variable step‐sizeLMS/F algorithm using nonparametric method for adaptive system identification
Summary: A fundamental challenge affecting the performance of a system is the undesired effect of noise on the system. Practically, real‐time systems are influenced by Gaussian noise and impulsive noise. Identification of these nonlinear physical systems in the presence of noise offers broader applications than linear system identification. Hence, this article introduces a variable step‐size technique to solve the conflicting requirement of rapid convergence and low mean square error (MSE) in the presence of both Gaussian and impulsive noise. Moreover, to avoid over parameterized equations existing in the variable step‐size equation, this article proposes the nonparametric variable step‐size (NPVSS), which depends on error estimates at instants of time and is used with the least mean square/fourth (LMS/F) algorithm. The computational complexity analysis, computer simulations, and implementation in real‐time setup validate that the proposed NPVSS‐LMS/F algorithm provides superior performance in terms of convergence time and MSE compared to the existing algorithms for both linear and nonlinear system identification in the presence of noise.
- 6 October 2020
- Published by Wiley in International Journal of Adaptive Control and Signal Processing
- Vol. 34 (12) , 1799-1811
The variable step‐sizeLMS/F algorithm using nonparametric method for adaptive system identification
Summary: A fundamental challenge affecting the performance of a system is the undesired effect of noise on the system. Practically, real‐time systems are influenced by Gaussian noise and impulsive noise. Identification of these nonlinear physical systems in the presence of noise offers broader applications than linear system identification. Hence, this article introduces a variable step‐size technique to solve the conflicting requirement of rapid convergence and low mean square error (MSE) in the presence of both Gaussian and impulsive noise. Moreover, to avoid over parameterized equations existing in the variable step‐size equation, this article proposes the nonparametric variable step‐size (NPVSS), which depends on error estimates at instants of time and is used with the least mean square/fourth (LMS/F) algorithm. The computational complexity analysis, computer simulations, and implementation in real‐time setup validate that the proposed NPVSS‐LMS/F algorithm provides superior performance in terms of convergence time and MSE compared to the existing algorithms for both linear and nonlinear system identification in the presence of noise.
- 1 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1553-1558
A Modified Variable Step Size for Fractional Least Mean Square Algorithm for System Identification and Its FPGA Implementation
In this paper, a variable step-size fractional least mean square (FLMS) named as modified variable step-size FLMS (MVSS-FLMS) is proposed to address the issue of faster convergence time and lower steady state error of the FLMS algorithm. In order to test the superiority of the algorithm, the algorithm is verified using MATLAB and Verilog code is written and implemented on FPGA. Matlab simulations shows that the proposed algorithm achieves faster convergence and lower runtime compared to the existing FLMS and robust VSSFLMS (RVSS-FLMS).
- 1 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1553-1558
A Modified Variable Step Size for Fractional Least Mean Square Algorithm for System Identification and Its FPGA Implementation
In this paper, a variable step-size fractional least mean square (FLMS) named as modified variable step-size FLMS (MVSS-FLMS) is proposed to address the issue of faster convergence time and lower steady state error of the FLMS algorithm. In order to test the superiority of the algorithm, the algorithm is verified using MATLAB and Verilog code is written and implemented on FPGA. Matlab simulations shows that the proposed algorithm achieves faster convergence and lower runtime compared to the existing FLMS and robust VSSFLMS (RVSS-FLMS).