Keshab K. Parhi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Keshab K. Parhi has a total of 188 co-authors. Here are the top co-authors by number of shared publications:
- Yingjie Lao
Tufts University
9 shared publications - Antian Wang
Purdue University Fort Wayne
7 shared publications - Sin-Wei Chiu
Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN, USA
7 shared publications - Sai Sanjay Balaji
Dept. Electrical & Computer Engineering, University of Minnesota Twin Cities, 200 Union St. S.E., #4-174, Minneapolis, MN 55455, Minneapolis, Minnesota, 55455, UNITED STATES
6 shared publications Marc D. Riedel
Department of Electrical and Computer Engineering, University of Minnesota, 200 Union St. S.E., Minneapolis, MN, 55455, USA
5 shared publications- Nanda K. Unnikrishnan
Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN, USA
5 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 73 (11) , 1159-1163
Optimizing Encoder Circuits of Entanglement-Assisted Quantum LDPC Codes via Beam Search
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 73 (11) , 1159-1163
Optimizing Encoder Circuits of Entanglement-Assisted Quantum LDPC Codes via Beam Search
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 73 (10) , 6787-6797
HEDWIG: Homomorphic Encryption Accelerator Design Using BFV-HPS With High-Speed Fixed-Point Approximation
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 73 (10) , 6787-6797
HEDWIG: Homomorphic Encryption Accelerator Design Using BFV-HPS With High-Speed Fixed-Point Approximation
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Magazine
- Vol. 43 (5) , 106-113
Approaches to the Design of Fast Parallel Finite-Impulse Response Filter Structures [Lecture Notes]
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Magazine
- Vol. 43 (5) , 106-113
Approaches to the Design of Fast Parallel Finite-Impulse Response Filter Structures [Lecture Notes]
- Open Access
- 22 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 325-331
CKKS-Encrypted RBF SVM Inference with Model Encryption via Exponential Function Approximations
- 22 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 325-331
Open AccessCKKS-Encrypted RBF SVM Inference with Model Encryption via Exponential Function Approximations
- 1 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Circuits and Systems Magazine
- Vol. 26 (1) , 3-9
Reflections on the 25th Anniversary of the IEEE Circuits and Systems Magazine [Editorial]
- 1 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Circuits and Systems Magazine
- Vol. 26 (1) , 3-9
Reflections on the 25th Anniversary of the IEEE Circuits and Systems Magazine [Editorial]
- Open Access
- 2 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 7, 1-15
Encoder Circuit Optimization for Nonbinary Quantum Error Correction Codes in Prime Dimensions: An Algorithmic Framework
Quantum computers are a revolutionary class of computational platforms with applications in combinatorial and global optimization, machine learning, and other domains involving computationally hard problems. While these machines typically operate on qubits—quantum information elements that can occupy superpositions of the basis $|0\rangle$ and $|1\rangle$ states—recent advances have demonstrated the practical implementation of higher-dimensional quantum systems (qudits) across various hardware platforms. In these hardware realizations, the higher-order states are less stable and thus remain coherent for a shorter duration than the basis $|0\rangle$ and $|1\rangle$ states. Moreover, formal methods for designing efficient encoder circuits for these systems remain underexplored. This limitation motivates the development of efficient circuit techniques for qudit systems (d-level quantum systems). Previous works have typically established generating gate sets for higher-dimensional codes by generalizing the methods used for qubits. In this work, we introduce a systematic framework for optimizing encoder circuits for prime-dimension stabilizer codes. This framework is based on novel generating gate sets whose elements map directly to efficient Clifford gate sequences. We demonstrate the effectiveness of this method on key codes, achieving a 13–44% reduction in encoder circuit gate count for the qutrit (d = 3) $[[9,5,3]]_{3}$, $[[5,1,3]]_{3}$, and $[[7,1,3]]_{3}$ codes, and a 9–21% reduction for the ququint (d = 5) $[[10,6,3]]_{5}$ code when compared to prior work. We also achieved circuit depth reductions up to 42%.
- 2 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 7, 1-15
Open AccessEncoder Circuit Optimization for Nonbinary Quantum Error Correction Codes in Prime Dimensions: An Algorithmic Framework
Quantum computers are a revolutionary class of computational platforms with applications in combinatorial and global optimization, machine learning, and other domains involving computationally hard problems. While these machines typically operate on qubits—quantum information elements that can occupy superpositions of the basis $|0\rangle$ and $|1\rangle$ states—recent advances have demonstrated the practical implementation of higher-dimensional quantum systems (qudits) across various hardware platforms. In these hardware realizations, the higher-order states are less stable and thus remain coherent for a shorter duration than the basis $|0\rangle$ and $|1\rangle$ states. Moreover, formal methods for designing efficient encoder circuits for these systems remain underexplored. This limitation motivates the development of efficient circuit techniques for qudit systems (d-level quantum systems). Previous works have typically established generating gate sets for higher-dimensional codes by generalizing the methods used for qubits. In this work, we introduce a systematic framework for optimizing encoder circuits for prime-dimension stabilizer codes. This framework is based on novel generating gate sets whose elements map directly to efficient Clifford gate sequences. We demonstrate the effectiveness of this method on key codes, achieving a 13–44% reduction in encoder circuit gate count for the qutrit (d = 3) $[[9,5,3]]_{3}$, $[[5,1,3]]_{3}$, and $[[7,1,3]]_{3}$ codes, and a 9–21% reduction for the ququint (d = 5) $[[10,6,3]]_{5}$ code when compared to prior work. We also achieved circuit depth reductions up to 42%.
- 16 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74 (1053587X) , 892-903
Efficient Decomposition of Multistage Composite Length FFT for Complex and Real Signals
Fast Fourier Transform (FFT) algorithms play a fundamental role in modern digital signal processing (DSP). A composite length FFT decomposes a longer-length FFT into multiple shorter-length FFTs, enabling a bottom-up construction approach. If the input signal is complex-valued (real-valued), the DFT computation is referred as CFFT (RFFT). If the input is real-valued, redundancies and symmetries in the RFFT can be exploited to design more efficient algorithms. In this work, we extend the concept of two-stage composite FFTs to multistage composite FFTs. In a multistage FFT, the decomposition and parenthesization of sub-blocks significantly affect the structure’s efficiency. Although the set of sub-blocks remains the same, different parenthesizations lead to varying numbers of twiddle factor multiplications in the interconnect stages. We adopt radix-2 FFTs as the fundamental building blocks and apply dynamic programming to determine the optimal decomposition and parenthesization for arbitrary power-of-two FFT lengths. Our work presents optimal strategies for both complex-valued and real-valued FFTs. Compared to the radix-2 FFT, our multistage FFT reduces the number of complex multiplications by approximately 20% for complex-valued inputs and 30% for real-valued inputs. These results demonstrate that the multistage FFT approach not only simplifies the design process but also improves computational efficiency by significantly reducing the number of complex multiplications. Furthermore, the composite multistage structure enables an efficient bottom-up design methodology, requiring only two types of sub-blocks for CFFT and four types for RFFT implementations. Designers can follow the proposed straightforward design strategies, which guarantee the construction of optimal CFFT and RFFT structures.
- 16 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74 (1053587X) , 892-903
Efficient Decomposition of Multistage Composite Length FFT for Complex and Real Signals
Fast Fourier Transform (FFT) algorithms play a fundamental role in modern digital signal processing (DSP). A composite length FFT decomposes a longer-length FFT into multiple shorter-length FFTs, enabling a bottom-up construction approach. If the input signal is complex-valued (real-valued), the DFT computation is referred as CFFT (RFFT). If the input is real-valued, redundancies and symmetries in the RFFT can be exploited to design more efficient algorithms. In this work, we extend the concept of two-stage composite FFTs to multistage composite FFTs. In a multistage FFT, the decomposition and parenthesization of sub-blocks significantly affect the structure’s efficiency. Although the set of sub-blocks remains the same, different parenthesizations lead to varying numbers of twiddle factor multiplications in the interconnect stages. We adopt radix-2 FFTs as the fundamental building blocks and apply dynamic programming to determine the optimal decomposition and parenthesization for arbitrary power-of-two FFT lengths. Our work presents optimal strategies for both complex-valued and real-valued FFTs. Compared to the radix-2 FFT, our multistage FFT reduces the number of complex multiplications by approximately 20% for complex-valued inputs and 30% for real-valued inputs. These results demonstrate that the multistage FFT approach not only simplifies the design process but also improves computational efficiency by significantly reducing the number of complex multiplications. Furthermore, the composite multistage structure enables an efficient bottom-up design methodology, requiring only two types of sub-blocks for CFFT and four types for RFFT implementations. Designers can follow the proposed straightforward design strategies, which guarantee the construction of optimal CFFT and RFFT structures.
- Open Access
An Iterated Hybrid Fast Parallel FIR Filter
This paper revisits the design and optimization of parallel fast finite impulse response (FIR) filters using polyphase decomposition and iterated fast FIR algorithms (FFAs). Parallel FIR filtering enhances computational efficiency and throughput in digital signal processing (DSP) applications by enabling the simultaneous processing of multiple input samples. We revisit a prior approach to design of fast parallel filter architectures by using the iterated FFA approach where the same primitive filter, such as 2-parallel, is iterated to design the fast parallel filter. In this paper, we present yet another novel iterated fast parallel FIR filter, referred to as the fast hybrid filter. The hybrid filter iterates a transposed 2-parallel fast FIR filter in all the inner layers and a direct-form 2-parallel fast FIR filter in the outermost layer, resulting in reduced hardware complexity. Such an iterated hybrid approach has not been presented before. We show that the hybrid fast parallel filters require less number of additions compared to prior approaches.
Open AccessAn Iterated Hybrid Fast Parallel FIR Filter
This paper revisits the design and optimization of parallel fast finite impulse response (FIR) filters using polyphase decomposition and iterated fast FIR algorithms (FFAs). Parallel FIR filtering enhances computational efficiency and throughput in digital signal processing (DSP) applications by enabling the simultaneous processing of multiple input samples. We revisit a prior approach to design of fast parallel filter architectures by using the iterated FFA approach where the same primitive filter, such as 2-parallel, is iterated to design the fast parallel filter. In this paper, we present yet another novel iterated fast parallel FIR filter, referred to as the fast hybrid filter. The hybrid filter iterates a transposed 2-parallel fast FIR filter in all the inner layers and a direct-form 2-parallel fast FIR filter in the outermost layer, resulting in reduced hardware complexity. Such an iterated hybrid approach has not been presented before. We show that the hybrid fast parallel filters require less number of additions compared to prior approaches.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Circuits and Systems Magazine
- Vol. 26 (4) , 3-4
Reflections and Celebration of 2026 CAS Society Award Recipients [Editorial]
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Circuits and Systems Magazine
- Vol. 26 (4) , 3-4
Reflections and Celebration of 2026 CAS Society Award Recipients [Editorial]
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Biomedical and Health Informatics
- Vol. PP, 1-10
Long-Term, Patient-Specific Seizure Prediction using Absolute Mean Instantaneous Frequency Difference (AMIFD) and Seizure Clustering
Long-term seizure prediction in epileptic individuals is challenging, mainly due to signal non-stationarity and seizure type variability. This research presents a patient-specific prediction pipeline for intracranial electroencephalography (iEEG) based on the novel Absolute Mean Instantaneous Frequency Difference (AMIFD) biomarker. The approach addresses seizure variability using the minimum uncertainty and sample elimination (MUSE) feature-ranking technique to automatically cluster seizure types based on their top-ranked AMIFD features, distinguishing the interictal baseline from the preictal phase (defined as a 60-min window ending 5 min before onset). For each identified seizure cluster, a specialized random forest classifier is trained independently, creating a multi-model ensemble tailored to specific seizure morphologies. The final prediction alarm is triggered using a k-of-N aggregation logic to enhance reliability and minimize false alarms. The AMIFD biomarker shows a significantly larger effect size than several standard electrophysiological features (adjusted p < 0.04). When tested on 10 epileptic subjects, the patient-specific framework achieved a mean sensitivity of 92.08% and a false-positive rate of 1.32/day, outperforming the minimum Redundancy Maximum Relevance (mRMR) and MUSE baselines. This patient-specific, multi-model strategy establishes a viable pathway toward more accurate and clinically reliable personalized seizure prediction systems.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Biomedical and Health Informatics
- Vol. PP, 1-10
Long-Term, Patient-Specific Seizure Prediction using Absolute Mean Instantaneous Frequency Difference (AMIFD) and Seizure Clustering
Long-term seizure prediction in epileptic individuals is challenging, mainly due to signal non-stationarity and seizure type variability. This research presents a patient-specific prediction pipeline for intracranial electroencephalography (iEEG) based on the novel Absolute Mean Instantaneous Frequency Difference (AMIFD) biomarker. The approach addresses seizure variability using the minimum uncertainty and sample elimination (MUSE) feature-ranking technique to automatically cluster seizure types based on their top-ranked AMIFD features, distinguishing the interictal baseline from the preictal phase (defined as a 60-min window ending 5 min before onset). For each identified seizure cluster, a specialized random forest classifier is trained independently, creating a multi-model ensemble tailored to specific seizure morphologies. The final prediction alarm is triggered using a k-of-N aggregation logic to enhance reliability and minimize false alarms. The AMIFD biomarker shows a significantly larger effect size than several standard electrophysiological features (adjusted p < 0.04). When tested on 10 epileptic subjects, the patient-specific framework achieved a mean sensitivity of 92.08% and a false-positive rate of 1.32/day, outperforming the minimum Redundancy Maximum Relevance (mRMR) and MUSE baselines. This patient-specific, multi-model strategy establishes a viable pathway toward more accurate and clinically reliable personalized seizure prediction systems.