K
Keshab K. Parhi
Researcher at University of Minnesota
Publications - 768
Citations - 21763
Keshab K. Parhi is an academic researcher from University of Minnesota. The author has contributed to research in topics: Decoding methods & Adaptive filter. The author has an hindex of 68, co-authored 749 publications receiving 20097 citations. Previous affiliations of Keshab K. Parhi include University of California, Berkeley & University of Warwick.
Papers
More filters
Journal ArticleDOI
An efficient pipelined FFT architecture
Yun-Nan Chang,Keshab K. Parhi +1 more
TL;DR: This paper presents an efficient VLSI architecture of the pipeline fast Fourier transform (FFT) processor based on radix-4 decimation-in-time algorithm with the use of digit-serial arithmetic units by combining both the feedforward and feedback commutator schemes.
Journal ArticleDOI
Concurrent cellular VLSI adaptive filter architectures
TL;DR: In this paper, a decomposition technique was used to derive pipelined word-parallel realizations of high-sampling-rate adaptive lattice filters using the techniques of look-ahead computation decomposed state update implementation, and incremental output computation.
Proceedings ArticleDOI
Architectures for digital filters using stochastic computing
Yun-Nan Chang,Keshab K. Parhi +1 more
TL;DR: A novel scaling method for efficient stochastic logic implementations of inner products and digital filters by incorporating the filter coefficients into the probability of the selection signals of the multiplexors, which can achieve better signal scaling with lower cost than the one derived from a traditional structure.
Journal ArticleDOI
Evaluation of CORDIC Algorithms for FPGA Design
TL;DR: It is concluded that the redundant arithmetic based CORDIC methods are not suitable for FPGA implementation, and the conventional two's complement architecture leads to the best performance.
Journal ArticleDOI
Fast and exact transistor sizing based on iterative relaxation
TL;DR: The primary contribution of this paper is to take advantage of the structure of the transistor sizing problem and devise an iterative relaxation based gradient descent approach (D-phase) that has excellent convergence properties.