Skip to main content
Article thumbnail
Location of Repository

By 

Abstract

Abstract—In this paper, the implementation of a classical identification technique with medium computational complexity over a system with limited computing capability, is addressed. As a testbed, the Frequency-Domain Least Mean Squares (FD-LMS) algorithm [1] is implemented with fixed--point (finite wordlength) rather than floating--point routines. The fundamental issue of faster sampling at a reduced wordlength, compared to the case of a slower sampling rate with increased accuracy (smaller roundoff errors) is investigated in the ensuing simulation studies. This problem is typical in embedded systems (controllers) with limited number crunching capabilities, where their computational power significantly limits the maximum number of operations (multiplications and additions) that can be executed within a time interval. The results of this study point towards the need of jointly optimizing the sampling rate, the wordlength size and the complexity of the assumed filter (model) in system identification cases. Index Terms—System identification, Finite wordlength

Topics: Computational resources, LMS S
Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.5271
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.umn.edu/~mouriki... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.