Low cost parallel adaptive filter structures

Cheng Chao; Keshab K. Parhi

Low cost parallel adaptive filter structures

Cheng Chao, Keshab K. Parhi

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Scopus citations

Abstract

In this paper, we present two parallel LMS adaptive filtering algorithms with low hardware. The proposed parallel algorithm 1 doesn't alter the input-output behavior and saves large amount of hardware cost of previous designs, especially when the parallelism level is high. For example, it saves 68.4% of the multiplications and 4.7% of the additions, of those of prior fast parallel adaptive filtering algorithms when parallelism level is 72 and the filter length N is large. The proposed parallel algorithm 2, while maintaining the same performance, can further save 5.56% to 12.5% of the multipliers and 8.54% to 24.9% of the additions when the level of parallelism varies from 3 to 72.

Original language	English (US)
Title of host publication	Conference Record of The Thirty-Ninth Asilomar Conference on Signals, Systems and Computers
Pages	354-358
Number of pages	5
State	Published - 2005
Event	39th Asilomar Conference on Signals, Systems and Computers - Pacific Grove, CA, United States Duration: Oct 28 2005 → Nov 1 2005

Publication series

Name	Conference Record - Asilomar Conference on Signals, Systems and Computers
Volume	2005
ISSN (Print)	1058-6393

Other

Other	39th Asilomar Conference on Signals, Systems and Computers
Country/Territory	United States
City	Pacific Grove, CA
Period	10/28/05 → 11/1/05

Find It

Find It at U of M Libraries

Cite this

Low cost parallel adaptive filter structures. / Chao, Cheng; Parhi, Keshab K.
Conference Record of The Thirty-Ninth Asilomar Conference on Signals, Systems and Computers. 2005. p. 354-358 1599767 (Conference Record - Asilomar Conference on Signals, Systems and Computers; Vol. 2005).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Chao, C & Parhi, KK 2005, Low cost parallel adaptive filter structures. in Conference Record of The Thirty-Ninth Asilomar Conference on Signals, Systems and Computers., 1599767, Conference Record - Asilomar Conference on Signals, Systems and Computers, vol. 2005, pp. 354-358, 39th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, United States, 10/28/05.

@inproceedings{96d0cbaff9e64592b3561318d38146dc,

title = "Low cost parallel adaptive filter structures",

abstract = "In this paper, we present two parallel LMS adaptive filtering algorithms with low hardware. The proposed parallel algorithm 1 doesn't alter the input-output behavior and saves large amount of hardware cost of previous designs, especially when the parallelism level is high. For example, it saves 68.4% of the multiplications and 4.7% of the additions, of those of prior fast parallel adaptive filtering algorithms when parallelism level is 72 and the filter length N is large. The proposed parallel algorithm 2, while maintaining the same performance, can further save 5.56% to 12.5% of the multipliers and 8.54% to 24.9% of the additions when the level of parallelism varies from 3 to 72.",

author = "Cheng Chao and Parhi, {Keshab K.}",

year = "2005",

language = "English (US)",

isbn = "1424401313",

series = "Conference Record - Asilomar Conference on Signals, Systems and Computers",

pages = "354--358",

booktitle = "Conference Record of The Thirty-Ninth Asilomar Conference on Signals, Systems and Computers",

note = "39th Asilomar Conference on Signals, Systems and Computers ; Conference date: 28-10-2005 Through 01-11-2005",

}

TY - GEN

T1 - Low cost parallel adaptive filter structures

AU - Chao, Cheng

AU - Parhi, Keshab K.

PY - 2005

Y1 - 2005

N2 - In this paper, we present two parallel LMS adaptive filtering algorithms with low hardware. The proposed parallel algorithm 1 doesn't alter the input-output behavior and saves large amount of hardware cost of previous designs, especially when the parallelism level is high. For example, it saves 68.4% of the multiplications and 4.7% of the additions, of those of prior fast parallel adaptive filtering algorithms when parallelism level is 72 and the filter length N is large. The proposed parallel algorithm 2, while maintaining the same performance, can further save 5.56% to 12.5% of the multipliers and 8.54% to 24.9% of the additions when the level of parallelism varies from 3 to 72.

AB - In this paper, we present two parallel LMS adaptive filtering algorithms with low hardware. The proposed parallel algorithm 1 doesn't alter the input-output behavior and saves large amount of hardware cost of previous designs, especially when the parallelism level is high. For example, it saves 68.4% of the multiplications and 4.7% of the additions, of those of prior fast parallel adaptive filtering algorithms when parallelism level is 72 and the filter length N is large. The proposed parallel algorithm 2, while maintaining the same performance, can further save 5.56% to 12.5% of the multipliers and 8.54% to 24.9% of the additions when the level of parallelism varies from 3 to 72.

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

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

M3 - Conference contribution

AN - SCOPUS:33847655709

SN - 1424401313

SN - 9781424401314

T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers

SP - 354

EP - 358

BT - Conference Record of The Thirty-Ninth Asilomar Conference on Signals, Systems and Computers

T2 - 39th Asilomar Conference on Signals, Systems and Computers

Y2 - 28 October 2005 through 1 November 2005

ER -

Low cost parallel adaptive filter structures

Abstract

Publication series

Other

Find It

Other files and links

Fingerprint

Cite this