Lanping Deng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Lanping Deng has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Chaitali Chakrabarti
Arizona State University, Tempe, AZ, USA
3 shared publications - Jung-Sub Kim
Pennsylvania State University
2 shared publications - Kanwaldeep Sobti
Department of Electrical Engineering, Arizona State University, Phoenix, USA
2 shared publications - Vijaykrishnan Narayanan
The Pennsylvania State University
2 shared publications - Chi-Li Yu
Arizona State University
1 shared publication - Kevin Irick
The Pennsylvania State University
1 shared publication
Latest Publications
- 30 June 2010
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 64 (1) , 109-122
FPGA Architecture for 2D Discrete Fourier Transform Based on 2D Decomposition for Large-sized Data
- 30 June 2010
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 64 (1) , 109-122
FPGA Architecture for 2D Discrete Fourier Transform Based on 2D Decomposition for Large-sized Data
- 19 June 2009
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 63 (1) , 39-50
Accurate Area, Time and Power Models for FPGA-Based Implementations
- 19 June 2009
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 63 (1) , 39-50
Accurate Area, Time and Power Models for FPGA-Based Implementations
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21623562,p. 463-468
Efficient Function Evaluations with Lookup Tables for Structured Matrix Operations
A hardware efficient approach is introduced for elementary function evaluations in certain structured matrix computations. It is a comprehensive approach that utilizes lookup tables for compactness, employs interpolations with adders and multipliers for their adaptivity to non-tabulated values and, more distinctively, exploits the function properties and the matrix structures to claim better control over numerical dynamic ranges. We demonstrate the effectiveness of the approach with simulation and synthesis results on evaluating, in particular, the cosine function, the exponential function and the zero-order Bessel function of the first kind.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21623562,p. 463-468
Efficient Function Evaluations with Lookup Tables for Structured Matrix Operations
A hardware efficient approach is introduced for elementary function evaluations in certain structured matrix computations. It is a comprehensive approach that utilizes lookup tables for compactness, employs interpolations with adders and multipliers for their adaptivity to non-tabulated values and, more distinctively, exploits the function properties and the matrix structures to claim better control over numerical dynamic ranges. We demonstrate the effectiveness of the approach with simulation and synthesis results on evaluating, in particular, the cosine function, the exponential function and the zero-order Bessel function of the first kind.