KDKaushik Das

Kaushik Das

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Kaushik Das has a total of 12 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Loop Control Strategy of Eleven-Level Multilevel Inverter Design Utilizing Reduced Number of Switches

    by Moumita Saha, Upama Das, Sukanta Debnath, Arpita Mandal, Kaushik Das, Pinki Deb

  • An Efficient Multi-Channel EEG Compression Using Intelligent Tunable Q -Wavelet Transform: A Machine Learning-Driven Approach

    by Priyanka Bera, Kaushik Das, Rajarshi Gupta

    Processing of multichannel EEG (electroencephalography) or MEEG signals in real-time is challenging due to the high data volume, which affects storage, transmission and computational efficiency. This study presents a 2-stage approach leveraging the correlations between EEG channels using a machine learning-based intelligent tunable Q-wavelet transform (TQWT) and multiscale principal component analysis (MSPCA) for efficient compression of MEEG. TQWT first decomposes each channel into subbands to capture intra-channel correlations. Then, MSPCA is applied to the subbands to identify inter-channel correlations, enabling enhanced data compression. Principal components (PCs) are encoded via delta coding and run-length encoding to improve compression efficiency further. The signal reconstruction quality is ensured by optimizing the Q-factor and TQWT decomposition levels for each 3s EEG snippet through a multilayer feedforward neural network (MLPFFNN) trained offline with particle swarm optimization (PSO). A deep autoencoder (DAE) extracts relevant features as inputs for the MLPFFNN. Testing on four benchmark datasets, including PhysioNet and brain-computer interface (BCI) competition data, results in high compression rates (CR of 14.74) and low error (PRD of 2.72), with a mean squared coherence (MSC) of 0.97. The method shows competitive or superior compression performance, with low memory and latency demands, suitable for real-time EEG applications.


  • Efficient Hardware Architecture Design of Radix-22 Fast Fourier Transform Using Coordinate Rotation Digital Computer

    by Kaushik Das, Sambhu Nath Pradhan, Abhishek Bhattacharjee

    The fast Fourier transform (FFT) is a widely used algorithm for computing the discrete Fourier transform (DFT) in real-time signal processing. Achieving high performance with minimal resource usage is crucial for any real-time application. This paper introduces an architecture based on coordinate rotation digital computer (CORDIC) for implementing a radix-[ ] FFT. Traditional FFT implementations require complex twiddle factor multiplications, which is not cost-effective in terms of hardware utilization. To address this issue, we have proposed a radix-8 CORDIC-based approach integrated with FFT computation. The proposed radix-8 CORDIC requires fewer stages than the conventional radix-2 CORDIC, enhancing computational efficiency and reducing hardware utilization. The feedforward radix-[ ] FFT architecture is presented where the butterflies of the FFT are computed with the help of radix-8 CORDIC. A total of three FFT architectures are developed supporting 16-, 1024- and 2048-point FFTs. The proposed FFT architectures are developed using Verilog-HDL code and implemented on a Virtex-7 field-programmable gate array (FPGA). The FPGA-based radix-[ ] FFT achieves a clock frequency of 323.4[ ]MHz and utilizes minimal FPGA resources. Processing of 2048 data samples takes only 4.06[ ][ ]S by the proposed FPGA-based design. Additionally, two ASICs have been designed: the 1024-point FFT ASIC occupies an area of 1.079[ ]mm2, and the 2048-point FFT ASIC occupies an area of 1.544 mm2. The proposed FFT ASICs have better-normalized area per FFT and energy per FFT than the state-of-the-art designs.


  • Area–time–energy efficient architecture of CBNS‐based fast Fourier transform

    by Kaushik Das, Eda Harshavardhan Reddy, Arpita Mandal, Sambhu Nath Pradhan, Abhishek Bhattacharjee

    A new approach for implementing the fast Fourier transform (FFT) using complex binary number system (CBNS) is presented in this paper. The advantage of using CBNS is that instead of processing the real and imaginary parts of a complex number separately, we can process both as a single entity. A total of four FFT architectures have been developed, which are 16‐, 64‐, 256‐, and 1024‐point FFT architectures. The proposed FFT is designed using Verilog‐HDL and implemented using a Virtex‐7 field‐programmable gate array (FPGA). The maximum clock rate achieved by the proposed FPGA‐based design is 376.1 MHz. The FPGA resource utilization of the FFT is less than the state‐of‐the‐art FFT designs. An application‐specific integrated circuit (ASIC) for the FFT is also designed. The normalized energy per FFT of the proposed ASIC is 0.14 nJ, and the normalized area per FFT of the ASIC is 1.08 mm2 which is less than other existing designs.


  • Field‐programmable gate array‐based design for real‐time computation of ensemble empirical mode decomposition

    by Kaushik Das, Sambhu Nath Pradhan

    Summary: Empirical mode decomposition (EMD) is considered as a suitable method when the signal to be analyzed is nonlinear or nonstationary in nature. But, EMD suffers from a problem known as mode mixing. To, reduce this problem, ensemble EMD (EEMD) was proposed. In this paper, we have presented a fast field‐programmable gate array (FPGA)‐based design for EEMD. Where calculation of output can be done in a parallel manner for different realizations. The design has a comparatively less execution time, and the execution time of the proposed EEMD design is even less than some state‐of‐the‐art EMD‐based design, although the architecture of EEMD is more complex, when compared with the EMD design. In this work, we have also performed an FPGA implementation of the EMD algorithm. The root mean square error (RMSE) and the correlation values of the intrinsic mode function (IMFs) obtained from the proposed EMD and EEMD designs are compared. The proposed FPGA‐based architecture of the EEMD algorithm is designed using Verilog‐hardware description language (HDL) and implemented on a Kintex‐7 FPGA. The EEMD architecture consists of cubic Hermite spline interpolation (CHSI) and cubic spline interpolation (CSI) for the envelope generation.


  • An efficient hardware realization of EMD for real‐time signal processing applications

    by Kaushik Das, Sambhu Nath Pradhan

    Summary: This paper presents a field‐programmable gate array (FPGA) and application‐specific integrated circuit (ASIC) based design for the real‐time implementation of empirical mode decomposition (EMD) algorithm. Here, at the beginning, register‐transfer‐level (RTL) design of EMD algorithm is developed in the form of verilog‐HDL code. Then, simulation‐based testing of the RTL design is done. In this paper, two envelope computation methods are proposed: one using linear Bezier curve (LBC) and the other using cubic spline interpolation (CSI). For ASIC, the verilog‐HDL code of EMD is synthesized using Genus tool of Cadence using SCL 180‐nm technology library and Innovus tool of Cadence is used for the layout design. The core area of the proposed EMD ASIC is 1.16 mm2 and can be operated at 62.5 MHz clock rate. The developed FPGA‐based EMD architecture can be operated at 50 MHz clock rate and up to 50 MHz sampling rate. Here, an effort is also made to classify the normal and seizure/ictal electroencephalogram (EEG) signals, which are used as an input to EMD, with the help of a support vector machine (SVM). The classification accuracy obtained is above 99%, and here, MATLAB is used for feature calculation and classification purposes.