Efficient folded VLSI architectures for linear prediction error filters

Authors:
Sayed Ahmad Salehi;Rasoul Amirfattahi;Keshab Parhi
Affiliations:
Isfahan University of Technology, Isfahan, Iran;Isfahan University of Technology, Isfahan, Iran;University of Minnesota, Minneapolis, MN, USA
Venue:
Proceedings of the great lakes symposium on VLSI
Year:
2012

Citing 3
Cited 1

The split Levinson algorithm is weakly stable

SIAM Journal on Numerical Analysis
Exact and first-order error analysis of the Schur and split Schuralgorithms: theory and practice

IEEE Transactions on Signal Processing
Immittance-domain Levinson algorithms

IEEE Transactions on Information Theory

A design methodology for optimally folded, pipelined architectures in VLSI applications using projective space lattices

Microprocessors & Microsystems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose two efficient low-area, low-power folded VLSI architectures for linear prediction error filter. One of them is based on the split-Levinson-Durbin and requires half computational complexity of an architecture based on the Levinson-Durbin algorithm. The other one is based on the Schur algorithm. Using folding method, the number of multipliers and adders is minimized. In addition, by modifications in data scheduling, the number of required multiplexers are also decreased. Comparison with previous architectures demonstrates the efficiency of the proposed architectures with respect to hardware and computational complexity.