Adaptive line enhancers on the basis of least-squares algorithm for a single sinusoid detection

Koji Matsuura, Eiji Watanabe, Akinori Nishihara

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

This paper proposes adaptive line enhancers with new coefficient update algorithms on the basis of least-square-error criteria. Adaptive algorithms by least-squares are known to converge faster than stochastic-gradient ones. However they have high computational complexity due to matrix inversion. To avoid matrix inversion the proposed algorithms adapt only one coefficient to detect one sinusoid. Both FIR and IIR types of adaptive algorithm are presented, and the techniques to reduce the influence of additive noise is described in this paper. The proposed adaptive line enhancers have simple structures and show excellent convergence characteristics. While the convergence of gradient-based algorithms largely depend on their stepsize parameters, the proposed ones are free from them.

Original languageEnglish
Pages (from-to)1536-1543
Number of pages8
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE82-A
Issue number8
Publication statusPublished - 1999

Fingerprint

Adaptive algorithms
Additive noise
Computational complexity

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Information Systems

Cite this

Adaptive line enhancers on the basis of least-squares algorithm for a single sinusoid detection. / Matsuura, Koji; Watanabe, Eiji; Nishihara, Akinori.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E82-A, No. 8, 1999, p. 1536-1543.

Research output: Contribution to journalArticle

@article{4495eca05f5741379b455c75a305f748,
title = "Adaptive line enhancers on the basis of least-squares algorithm for a single sinusoid detection",
abstract = "This paper proposes adaptive line enhancers with new coefficient update algorithms on the basis of least-square-error criteria. Adaptive algorithms by least-squares are known to converge faster than stochastic-gradient ones. However they have high computational complexity due to matrix inversion. To avoid matrix inversion the proposed algorithms adapt only one coefficient to detect one sinusoid. Both FIR and IIR types of adaptive algorithm are presented, and the techniques to reduce the influence of additive noise is described in this paper. The proposed adaptive line enhancers have simple structures and show excellent convergence characteristics. While the convergence of gradient-based algorithms largely depend on their stepsize parameters, the proposed ones are free from them.",
author = "Koji Matsuura and Eiji Watanabe and Akinori Nishihara",
year = "1999",
language = "English",
volume = "E82-A",
pages = "1536--1543",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "8",

}

TY - JOUR

T1 - Adaptive line enhancers on the basis of least-squares algorithm for a single sinusoid detection

AU - Matsuura, Koji

AU - Watanabe, Eiji

AU - Nishihara, Akinori

PY - 1999

Y1 - 1999

N2 - This paper proposes adaptive line enhancers with new coefficient update algorithms on the basis of least-square-error criteria. Adaptive algorithms by least-squares are known to converge faster than stochastic-gradient ones. However they have high computational complexity due to matrix inversion. To avoid matrix inversion the proposed algorithms adapt only one coefficient to detect one sinusoid. Both FIR and IIR types of adaptive algorithm are presented, and the techniques to reduce the influence of additive noise is described in this paper. The proposed adaptive line enhancers have simple structures and show excellent convergence characteristics. While the convergence of gradient-based algorithms largely depend on their stepsize parameters, the proposed ones are free from them.

AB - This paper proposes adaptive line enhancers with new coefficient update algorithms on the basis of least-square-error criteria. Adaptive algorithms by least-squares are known to converge faster than stochastic-gradient ones. However they have high computational complexity due to matrix inversion. To avoid matrix inversion the proposed algorithms adapt only one coefficient to detect one sinusoid. Both FIR and IIR types of adaptive algorithm are presented, and the techniques to reduce the influence of additive noise is described in this paper. The proposed adaptive line enhancers have simple structures and show excellent convergence characteristics. While the convergence of gradient-based algorithms largely depend on their stepsize parameters, the proposed ones are free from them.

UR - http://www.scopus.com/inward/record.url?scp=0032596313&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032596313&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0032596313

VL - E82-A

SP - 1536

EP - 1543

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 8

ER -