Analog Adaptive Filtering Based on a Modified Hopfield Network

Mariko NAKANO-MIYATAKE; Hector PEREZ-MEANA

Analog Adaptive Filtering Based on a Modified Hopfield Network

Mariko NAKANO-MIYATAKE, Hector PEREZ-MEANA

Full Text Views

0

Cite this

Summary :

In the last few years analog adaptive filters have been a subject of active research because they have the ability to handle in real time much higher frequencies, with a smaller size and lower power consumption that their digital counterparts. During this time several analog adaptive filter algorithms have been reported in the literature, almost all of them use the continuous time version of the least mean square (LMS) algorithm. However the continuous time LMS algorithm presents the same limitations than its digital counterpart, when operates in noisy environments, although their convergence rate may be faster than the digital versions. This fact suggests the necessity of develop analog versions of recursive least square (RLS) algorithm, which in known to have a very low sensitivity to additive noise. However a direct implementation of the RLS in analog way would require a considerable effort. To overcome this problem, we propose an analog RLS algorithm in which the adaptive filter coefficients vector is estimated by using a fully connected network that resembles a Hopfield network. Theoretical and simulations results are given which show that the proposed and conventional RLS algorithms have quite similar convergence properties when they operate with the same sampling rate and signal-to-noise ratio.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E80-A No.11 pp.2245-2252

Publication Date: 1997/11/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)

Category: Stochastic Process/Signal Processing

Cite this

Copy

Mariko NAKANO-MIYATAKE, Hector PEREZ-MEANA, "Analog Adaptive Filtering Based on a Modified Hopfield Network" in IEICE TRANSACTIONS on Fundamentals, vol. E80-A, no. 11, pp. 2245-2252, November 1997, doi: .
Abstract: In the last few years analog adaptive filters have been a subject of active research because they have the ability to handle in real time much higher frequencies, with a smaller size and lower power consumption that their digital counterparts. During this time several analog adaptive filter algorithms have been reported in the literature, almost all of them use the continuous time version of the least mean square (LMS) algorithm. However the continuous time LMS algorithm presents the same limitations than its digital counterpart, when operates in noisy environments, although their convergence rate may be faster than the digital versions. This fact suggests the necessity of develop analog versions of recursive least square (RLS) algorithm, which in known to have a very low sensitivity to additive noise. However a direct implementation of the RLS in analog way would require a considerable effort. To overcome this problem, we propose an analog RLS algorithm in which the adaptive filter coefficients vector is estimated by using a fully connected network that resembles a Hopfield network. Theoretical and simulations results are given which show that the proposed and conventional RLS algorithms have quite similar convergence properties when they operate with the same sampling rate and signal-to-noise ratio.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e80-a_11_2245/_p

Copy

@ARTICLE{e80-a_11_2245,
author={Mariko NAKANO-MIYATAKE, Hector PEREZ-MEANA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Analog Adaptive Filtering Based on a Modified Hopfield Network},
year={1997},
volume={E80-A},
number={11},
pages={2245-2252},
abstract={In the last few years analog adaptive filters have been a subject of active research because they have the ability to handle in real time much higher frequencies, with a smaller size and lower power consumption that their digital counterparts. During this time several analog adaptive filter algorithms have been reported in the literature, almost all of them use the continuous time version of the least mean square (LMS) algorithm. However the continuous time LMS algorithm presents the same limitations than its digital counterpart, when operates in noisy environments, although their convergence rate may be faster than the digital versions. This fact suggests the necessity of develop analog versions of recursive least square (RLS) algorithm, which in known to have a very low sensitivity to additive noise. However a direct implementation of the RLS in analog way would require a considerable effort. To overcome this problem, we propose an analog RLS algorithm in which the adaptive filter coefficients vector is estimated by using a fully connected network that resembles a Hopfield network. Theoretical and simulations results are given which show that the proposed and conventional RLS algorithms have quite similar convergence properties when they operate with the same sampling rate and signal-to-noise ratio.},
keywords={},
doi={},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - Analog Adaptive Filtering Based on a Modified Hopfield Network
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2245
EP - 2252
AU - Mariko NAKANO-MIYATAKE
AU - Hector PEREZ-MEANA
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E80-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 1997
AB - In the last few years analog adaptive filters have been a subject of active research because they have the ability to handle in real time much higher frequencies, with a smaller size and lower power consumption that their digital counterparts. During this time several analog adaptive filter algorithms have been reported in the literature, almost all of them use the continuous time version of the least mean square (LMS) algorithm. However the continuous time LMS algorithm presents the same limitations than its digital counterpart, when operates in noisy environments, although their convergence rate may be faster than the digital versions. This fact suggests the necessity of develop analog versions of recursive least square (RLS) algorithm, which in known to have a very low sensitivity to additive noise. However a direct implementation of the RLS in analog way would require a considerable effort. To overcome this problem, we propose an analog RLS algorithm in which the adaptive filter coefficients vector is estimated by using a fully connected network that resembles a Hopfield network. Theoretical and simulations results are given which show that the proposed and conventional RLS algorithms have quite similar convergence properties when they operate with the same sampling rate and signal-to-noise ratio.
ER -