DocumentCode
1013148
Title
Analog rank filtering
Author
Paul, Steffen ; Hüper, Knut
Author_Institution
Inst. for Network Theory & Circuit Design, Tech. Univ. of Munich, Germany
Volume
40
Issue
7
fYear
1993
fDate
7/1/1993 12:00:00 AM
Firstpage
469
Lastpage
476
Abstract
The main task in rank filtering and many other nonlinear filtering operations is sorting. In this work, a nonlinear dynamical system for this operation is proposed. The sorting problem is embedded in a higher dimensional matrix-valued problem. An equivalent analog circuit consists of basic building blocks like adders, multipliers, and integrators which set up basic nonlinear processing cells. These processing cells are locally connected in a one-dimensional array of length N for a rank filter, with N input data elements taken as the initial values of the dynamical system. The time for sorting can be estimated theoretically and indicates fast convergence. In time complexity, the algorithm is of O (N ). As opposed to a digital rank filter, the analog rank filter possesses a parameter to control the speed of convergence and the accuracy
Keywords
analogue processing circuits; cellular arrays; convergence; filtering and prediction theory; matrix algebra; analog rank filter; convergence; discrete-time analogue system; equivalent analog circuit; higher dimensional matrix-valued problem; nonlinear dynamical system; nonlinear filtering; sorting problem; time complexity; Analog circuits; Convergence; Differential equations; Digital filters; Information filtering; Information filters; Nonlinear dynamical systems; Nonlinear filters; Signal processing algorithms; Sorting;
fLanguage
English
Journal_Title
Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
Publisher
ieee
ISSN
1057-7122
Type
jour
DOI
10.1109/81.257302
Filename
257302
Link To Document