ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Architectural Synthesis of Computational Engines for Subband Adaptive Filtering

Ramanathan, S and Visvanathan, V and Nandy, SK (1999) Architectural Synthesis of Computational Engines for Subband Adaptive Filtering. In: Journal of VLSI Signal Processing, 22 (3). pp. 173-195.

[img] PDF
fulltext.pdf - Published Version
Restricted to Registered users only

Download (377Kb) | Request a copy
Official URL: http://www.springerlink.com/content/u4447518566173...

Abstract

Architectural synthesis of low-power computational engines (hardware accelerators) for a subband-based adaptive filtering algorithm is presented. The full-band least mean square (LMS) adaptive filtering algorithm, widely used in various applications, is confronted by two problems, viz., slow convergence when the input correlation matrix is ill-conditioned, and increased computational complexity for applications involving use of large adaptive filter orders. Both of these problems can be overcome by the use of a subband-based normalized LMS (NLMS) adaptive filtering algorithm. Since this algorithm is not amenable to pipelining, delayed coefficient adaptation in the NLMS updation is used, which provides the required delays for pipelining. However, the convergence speed of this subband-based delayed NLMS (DNLMS) algorithm degrades with increase in the adaptation delay. We first present a pipelined subband DNLMS adaptive filtering architecture with minimal adaptation delay for any given sampling rate. The architecture is synthesized by using a number of function preserving transformations on the signal flow graph (SFG) representation of the subband DNLMS algorithm. With the use of carry-save arithmetic, the pipelined architecture can support high sampling rates limited only by the delay of two full adders and a 2-to-1 multiplexer. We then extend this synthesis methodology to synthesize a pipelined subband DNLMS architecture whose power dissipation meets a specified budget. This low-power architecture exploits the parallelism in the subband DNLMS algorithm to meet the required computational throughput. The architecture exhibits a novel tradeoff between algorithmic performance (convergence speed) and power dissipation. Finally, we incorporate configurability for filter order, sample period, power reduction factor, number of subbands and decimation/interpolation factor in the low-power architecture, thus resulting in a low-power subband computational engine for adaptive filtering.

Item Type: Journal Article
Additional Information: Copyright of this article belongs to Kluwer Academic Publishers.
Department/Centre: Division of Information Sciences > Supercomputer Education & Research Centre
Date Deposited: 27 Feb 2009 09:36
Last Modified: 19 Sep 2010 04:59
URI: http://eprints.iisc.ernet.in/id/eprint/18004

Actions (login required)

View Item View Item