1996
DOI: 10.1007/bf00924987
|View full text |Cite
|
Sign up to set email alerts
|

Pipelined systolic architectures for DLMS adaptive filtering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

1999
1999
2019
2019

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(7 citation statements)
references
References 16 publications
0
7
0
Order By: Relevance
“…(19) for DLMS in each configuration. In Douglass configuration, L(n) is calculated recursively and hence the effect of finite word length appears in realization.…”
Section: Architecturementioning
confidence: 99%
See 1 more Smart Citation
“…(19) for DLMS in each configuration. In Douglass configuration, L(n) is calculated recursively and hence the effect of finite word length appears in realization.…”
Section: Architecturementioning
confidence: 99%
“…In configuration (i), the length of CP is 2W m + 2W a that is longer than the one given by Eq. (19) for CP of DLMS. In configuration (ii), the length of CP is equal to Eq.…”
Section: Pipeline Configuration Based On Lmsmentioning
confidence: 99%
“…1,2 In many adaptive filtering applications, very high sample rates, and/or filters of large size, are required. [3][4][5][6][7][8][9] The computational burden of the adaptation mechanism becomes extremely high, and processing power of several GOPS (Giga operations per second) is needed. This means that for a real-time implementation, pipelined and/or parallel computational architectures should be developed.…”
Section: Introductionmentioning
confidence: 99%
“…A remedy to this bottleneck is the engagement of Delayed LMS (D-LMS) schemes. [5][6][7][8][9][10]12,13 The D-LMS algorithm, originally proposed in Ref. 12, gave rise to the development of high throughput pipelineable and/or parallel schemes for the implementation of the LMS filter, on ASIC VLSI systolic, or on wavefront array processors.…”
Section: Introductionmentioning
confidence: 99%
“…Many architectures for the pipelined implementation of the least mean square (LMS) ADFs have been proposed [3,4,5,6,7,8,9,101 and using these architectures, LMS ADFs can be operated at desired throughput levels. The rates of convergence of them however are smaller than those of RLS ADFs, whose throughput rate is lower because of their computational requirements.…”
Section: Introductionmentioning
confidence: 99%