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
FFT Architectures for Real-Valued Signals Based on Radix- $2^{3}$ and Radix- $2^{4}$ Algorithms
Manohar Ayinala,Keshab K. Parhi +1 more
TL;DR: A novel approach to develop pipelined fast Fourier transform (FFT) architectures for real-valued signals based on modifying the flow graph of the FFT algorithm such that it has both real and complex datapaths.
Patent
Area efficient parallel turbo decoding
Zhongfeng Wang,Keshab K. Parhi +1 more
TL;DR: In this paper, area-efficient parallel decoding schemes may be used to overcome the decoding latency and throughput associated with turbo decoders in high-level parallelism implementations, and the area efficient parallel decoding scheme introduces little or no performance degradation.
Journal ArticleDOI
Design of multigigabit multiplexer-loop-based decision feedback equalizers
TL;DR: Novel approaches for pipelining of parallel nested multiplexer loops and decision feedback equalizers (DFEs) based on look-ahead techniques are presented, which can guarantee improvement in performance either in the form of pipeline or parallelism.
Journal ArticleDOI
Determining the minimum iteration period of an algorithm
Kazuhito Ito,Keshab K. Parhi +1 more
TL;DR: A novel method based on theminimum cycle mean algorithm to determine the iteration bound of the MRDFG with a lower polynomial time complexity than the two existing techniques is proposed.
Journal ArticleDOI
A novel systolic array structure for DCT
Chao Cheng,Keshab K. Parhi +1 more
TL;DR: This paper presents a new algorithm for the implementation of discrete cosine transform (DCT), based on the idea of reformulating prime N-length DCT into two cyclic convolutions with exactly the same structure, which are implemented with a proposed fastcyclic convolution-based systolic array structure.