Pramod Kumar Meher

From MaRDI portal
Revision as of 19:27, 11 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Person:839086 to Pramod Kumar Meher: Duplicate)

Person:605723

Available identifiers

zbMath Open meher.pramod-kumarMaRDI QIDQ605723

List of research outcomes





PublicationDate of PublicationType
Analysis and Optimization of Product-Accumulation Section for Efficient Implementation of FIR Filters2021-09-02Paper
Efficient FPGA Implementation of Low-Complexity Systolic Karatsuba Multiplier Over $GF(2^{m})$ Based on NIST Polynomials2021-08-26Paper
Comment on “Subquadratic Space-Complexity Digit-Serial Multipliers Over <inline-formula> <tex-math notation="LaTeX">$GF(2^{m})$</tex-math> </inline-formula> Using Generalized <inline-formula> <tex-math notation="LaTeX">$(a, b)$</tex-math> </inline-formula>-Way Karatsuba Algorithm”2021-08-26Paper
Efficient Subquadratic Space Complexity Architectures for Parallel MPB Single- and Double-Multiplications for All Trinomials Using Toeplitz Matrix-Vector Product Decomposition2021-08-26Paper
Fine-Grained Critical Path Analysis and Optimization for Area-Time Efficient Realization of Multiple Constant Multiplications2021-08-26Paper
Low-Latency High-Throughput Systolic Multipliers Over <formula formulatype="inline"><tex Notation="TeX">$GF(2^{m})$</tex> </formula> for NIST Recommended Pentanomials2021-08-26Paper
Subquadratic Space-Complexity Digit-Serial Multipliers Over <formula formulatype="inline"><tex Notation="TeX">$GF(2^{m})$</tex> </formula> Using Generalized <formula formulatype="inline"><tex Notation="TeX">$(a,b)$</tex></formula>-Way Karatsuba Algorithm2021-08-26Paper
Efficient Digit-Serial KA-Based Multiplier Over Binary Extension Fields Using Block Recombination Approach2021-08-26Paper
New Approach to the Reduction of Sign-Extension Overhead for Efficient Implementation of Multiple Constant Multiplications2021-08-26Paper
Efficient VLSI Architecture for Decimation-in-Time Fast Fourier Transform of Real-Valued Data2021-08-26Paper
Area-Efficient Subquadratic Space-Complexity Digit-Serial Multiplier for Type-II Optimal Normal Basis of <formula formulatype="inline"><tex Notation="TeX">$GF(2^{m})$</tex> </formula> Using Symmetric TMVP and Block Recombination Techniques2021-08-26Paper
Scale-Free Hyperbolic CORDIC Processor and Its Application to Waveform Generation2021-08-26Paper
50 Years of CORDIC: Algorithms, Architectures, and Applications2021-08-26Paper
A High-Performance Energy-Efficient Architecture for FIR Adaptive Filter Based on New Distributed Arithmetic Formulation of Block LMS Algorithm2018-08-22Paper
Memory Efficient Modular VLSI Architecture for Highthroughput and Low-Latency Implementation of Multilevel Lifting 2-D DWT2018-07-18Paper
Memory-Efficient Architecture for 3-D DWT Using Overlapped Grouping of Frames2018-07-18Paper
FPGA Realization of FIR Filters by Efficient and Flexible Systolization Using Distributed Arithmetic2018-06-27Paper
Scalable and modular memory-based systolic architectures for discrete Hartley transform2017-11-20Paper
Hardware-Efficient Realization of Prime-Length DCT Based on Distributed Arithmetic2017-07-12Paper
High-speed \(\mathrm{RS}(255, 239)\) decoder based on LCC decoding2012-04-04Paper
Efficient bit-parallel multipliers over finite fields GF\((2^m)\)2010-11-25Paper
Systolic VLSI and FPGA Realization of Artificial Neural Networks2010-09-24Paper
Nonlinear channel equalization for wireless communication systems using Legendre neural networks2009-09-01Paper
WMicaD: A new digital watermarking technique using independent component analysis2008-08-28Paper
https://portal.mardi4nfdi.de/entity/Q44145842003-07-25Paper

Research outcomes over time

This page was built for person: Pramod Kumar Meher