The following pages link to Pramod Kumar Meher (Q605723):
Displaying 26 items.
- High-speed \(\mathrm{RS}(255, 239)\) decoder based on LCC decoding (Q411184) (← links)
- Efficient bit-parallel multipliers over finite fields GF\((2^m)\) (Q605724) (← links)
- (Q839086) (redirect page) (← links)
- Nonlinear channel equalization for wireless communication systems using Legendre neural networks (Q839088) (← links)
- WMicaD: A new digital watermarking technique using independent component analysis (Q938895) (← links)
- (Q4414584) (← links)
- FPGA Realization of FIR Filters by Efficient and Flexible Systolization Using Distributed Arithmetic (Q4568956) (← links)
- Memory Efficient Modular VLSI Architecture for Highthroughput and Low-Latency Implementation of Multilevel Lifting 2-D DWT (Q4572917) (← links)
- Memory-Efficient Architecture for 3-D DWT Using Overlapped Grouping of Frames (Q4573331) (← links)
- A High-Performance Energy-Efficient Architecture for FIR Adaptive Filter Based on New Distributed Arithmetic Formulation of Block LMS Algorithm (Q4578415) (← links)
- Scalable and modular memory-based systolic architectures for discrete Hartley transform (Q4590547) (← links)
- Systolic VLSI and FPGA Realization of Artificial Neural Networks (Q4929795) (← links)
- Analysis and Optimization of Product-Accumulation Section for Efficient Implementation of FIR Filters (Q4956758) (← links)
- Efficient FPGA Implementation of Low-Complexity Systolic Karatsuba Multiplier Over $GF(2^{m})$ Based on NIST Polynomials (Q5007244) (← links)
- 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"&g (Q5007418) (← links)
- Efficient Subquadratic Space Complexity Architectures for Parallel MPB Single- and Double-Multiplications for All Trinomials Using Toeplitz Matrix-Vector Product Decomposition (Q5007719) (← links)
- Fine-Grained Critical Path Analysis and Optimization for Area-Time Efficient Realization of Multiple Constant Multiplications (Q5007720) (← links)
- Low-Latency High-Throughput Systolic Multipliers Over <formula formulatype="inline"><tex Notation="TeX">$GF(2^{m})$</tex> </formula> for NIST Recommended Pentanomials (Q5007724) (← links)
- 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)$</ (Q5007773) (← links)
- Efficient Digit-Serial KA-Based Multiplier Over Binary Extension Fields Using Block Recombination Approach (Q5007939) (← links)
- New Approach to the Reduction of Sign-Extension Overhead for Efficient Implementation of Multiple Constant Multiplications (Q5008080) (← links)
- Efficient VLSI Architecture for Decimation-in-Time Fast Fourier Transform of Real-Valued Data (Q5008112) (← links)
- 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 Te (Q5008113) (← links)
- Scale-Free Hyperbolic CORDIC Processor and Its Application to Waveform Generation (Q5008430) (← links)
- 50 Years of CORDIC: Algorithms, Architectures, and Applications (Q5010845) (← links)
- Hardware-Efficient Realization of Prime-Length DCT Based on Distributed Arithmetic (Q5274424) (← links)
