The fast subsampled-updating fast transversal filter (FSU FTF) RLS algorithm View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

1994-07

AUTHORS

Dirk T. M. Slock, Karim Maouche

ABSTRACT

We present a new fast algorithm for Recursive Least-Squares(rls) adaptive filtering that uses displacement structure and subsampled updating. Thefsu ftf algorithm is based on the Fast Transversal Filter(ftf) algorithm, which exploits the shift invariance that is present in therls adaptation of afir filter. Theftf algorithm is in essence the application of a rotation matrix to a set of filters and in that respect resembles the Levinson algorithm. In the subsampled updating approach, we accumulate the rotation matrices over some time interval before applying them to the filters. It turns out that the successive rotation matrices themselves can be obtained from a Schur type algorithm which, once properly initialized, does not require inner products. The various convolutions that thus appear in the algorithm are done using the Fast Fourier Transform(fft). For relatively long filters, the computational complexity of the new algorithm is smaller than the one of the well-known lms algorithm, rendering it especially suitable for applications such as acoustic echo cancellation. More... »

PAGES

407

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/bf02999429

DOI

http://dx.doi.org/10.1007/bf02999429

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1085463486


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/09", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Engineering", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/10", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Technology", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0906", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Electrical and Electronic Engineering", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/1005", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Communications Technologies", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Institut Eurecom, BP 193, F-06904, Sophia Antipolis Cedex, France", 
          "id": "http://www.grid.ac/institutes/grid.28848.3e", 
          "name": [
            "Institut Eurecom, BP 193, F-06904, Sophia Antipolis Cedex, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Slock", 
        "givenName": "Dirk T. M.", 
        "id": "sg:person.015046645205.37", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015046645205.37"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Institut Eurecom, BP 193, F-06904, Sophia Antipolis Cedex, France", 
          "id": "http://www.grid.ac/institutes/grid.28848.3e", 
          "name": [
            "Institut Eurecom, BP 193, F-06904, Sophia Antipolis Cedex, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Maouche", 
        "givenName": "Karim", 
        "id": "sg:person.013532612025.28", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013532612025.28"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1994-07", 
    "datePublishedReg": "1994-07-01", 
    "description": "We present a new fast algorithm for Recursive Least-Squares(rls) adaptive filtering that uses displacement structure and subsampled updating. Thefsu ftf algorithm is based on the Fast Transversal Filter(ftf) algorithm, which exploits the shift invariance that is present in therls adaptation of afir filter. Theftf algorithm is in essence the application of a rotation matrix to a set of filters and in that respect resembles the Levinson algorithm. In the subsampled updating approach, we accumulate the rotation matrices over some time interval before applying them to the filters. It turns out that the successive rotation matrices themselves can be obtained from a Schur type algorithm which, once properly initialized, does not require inner products. The various convolutions that thus appear in the algorithm are done using the Fast Fourier Transform(fft). For relatively long filters, the computational complexity of the new algorithm is smaller than the one of the well-known lms algorithm, rendering it especially suitable for applications such as acoustic echo cancellation.", 
    "genre": "article", 
    "id": "sg:pub.10.1007/bf02999429", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1120575", 
        "issn": [
          "0003-4347", 
          "1958-9395"
        ], 
        "name": "Annals of Telecommunications", 
        "publisher": "Springer Nature", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "7-8", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "49"
      }
    ], 
    "keywords": [
      "long filters", 
      "echo cancellation", 
      "RLS algorithm", 
      "computational complexity", 
      "set of filters", 
      "filter", 
      "adaptive filtering", 
      "acoustic echo cancellation", 
      "algorithm", 
      "updating approach", 
      "cancellation", 
      "applications", 
      "rotation matrix", 
      "new algorithm", 
      "filtering", 
      "complexity", 
      "LMS algorithm", 
      "Levinson algorithm", 
      "Least", 
      "matrix", 
      "fast algorithm", 
      "new fast algorithm", 
      "displacement structure", 
      "FTF algorithm", 
      "approach", 
      "type algorithm", 
      "convolution", 
      "inner product", 
      "structure", 
      "adaptation", 
      "fast", 
      "time interval", 
      "respect", 
      "set", 
      "invariance", 
      "shift invariance", 
      "essence", 
      "transversal", 
      "products", 
      "intervals", 
      "Schur type algorithm", 
      "Recursive Least", 
      "Thefsu ftf algorithm", 
      "Fast Transversal", 
      "therls adaptation", 
      "afir filter", 
      "Theftf algorithm", 
      "successive rotation matrices", 
      "fast subsampled-updating fast transversal filter (FSU FTF) RLS algorithm", 
      "subsampled-updating fast transversal filter (FSU FTF) RLS algorithm", 
      "fast transversal filter (FSU FTF) RLS algorithm", 
      "transversal filter (FSU FTF) RLS algorithm", 
      "filter (FSU FTF) RLS algorithm"
    ], 
    "name": "The fast subsampled-updating fast transversal filter (FSU FTF) RLS algorithm", 
    "pagination": "407", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1085463486"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bf02999429"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/bf02999429", 
      "https://app.dimensions.ai/details/publication/pub.1085463486"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2022-01-01T18:06", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/article/article_241.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://doi.org/10.1007/bf02999429"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/bf02999429'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/bf02999429'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/bf02999429'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/bf02999429'


 

This table displays all metadata directly associated to this object as RDF triples.

126 TRIPLES      21 PREDICATES      81 URIs      71 LITERALS      6 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/bf02999429 schema:about anzsrc-for:09
2 anzsrc-for:0906
3 anzsrc-for:10
4 anzsrc-for:1005
5 schema:author Ne1e98dd9a6c6446e80148dfd05d3f00b
6 schema:datePublished 1994-07
7 schema:datePublishedReg 1994-07-01
8 schema:description We present a new fast algorithm for Recursive Least-Squares(rls) adaptive filtering that uses displacement structure and subsampled updating. Thefsu ftf algorithm is based on the Fast Transversal Filter(ftf) algorithm, which exploits the shift invariance that is present in therls adaptation of afir filter. Theftf algorithm is in essence the application of a rotation matrix to a set of filters and in that respect resembles the Levinson algorithm. In the subsampled updating approach, we accumulate the rotation matrices over some time interval before applying them to the filters. It turns out that the successive rotation matrices themselves can be obtained from a Schur type algorithm which, once properly initialized, does not require inner products. The various convolutions that thus appear in the algorithm are done using the Fast Fourier Transform(fft). For relatively long filters, the computational complexity of the new algorithm is smaller than the one of the well-known lms algorithm, rendering it especially suitable for applications such as acoustic echo cancellation.
9 schema:genre article
10 schema:inLanguage en
11 schema:isAccessibleForFree false
12 schema:isPartOf N5b428793e8044460bbc5dfb48b010201
13 N8c791718dd2341f3a0ee2ec8265e21e1
14 sg:journal.1120575
15 schema:keywords FTF algorithm
16 Fast Transversal
17 LMS algorithm
18 Least
19 Levinson algorithm
20 RLS algorithm
21 Recursive Least
22 Schur type algorithm
23 Thefsu ftf algorithm
24 Theftf algorithm
25 acoustic echo cancellation
26 adaptation
27 adaptive filtering
28 afir filter
29 algorithm
30 applications
31 approach
32 cancellation
33 complexity
34 computational complexity
35 convolution
36 displacement structure
37 echo cancellation
38 essence
39 fast
40 fast algorithm
41 fast subsampled-updating fast transversal filter (FSU FTF) RLS algorithm
42 fast transversal filter (FSU FTF) RLS algorithm
43 filter
44 filter (FSU FTF) RLS algorithm
45 filtering
46 inner product
47 intervals
48 invariance
49 long filters
50 matrix
51 new algorithm
52 new fast algorithm
53 products
54 respect
55 rotation matrix
56 set
57 set of filters
58 shift invariance
59 structure
60 subsampled-updating fast transversal filter (FSU FTF) RLS algorithm
61 successive rotation matrices
62 therls adaptation
63 time interval
64 transversal
65 transversal filter (FSU FTF) RLS algorithm
66 type algorithm
67 updating approach
68 schema:name The fast subsampled-updating fast transversal filter (FSU FTF) RLS algorithm
69 schema:pagination 407
70 schema:productId Nc89b8ed60e714da1aadd0f1a5f311371
71 Ne2b22a3df3584b32b11187630aac3867
72 schema:sameAs https://app.dimensions.ai/details/publication/pub.1085463486
73 https://doi.org/10.1007/bf02999429
74 schema:sdDatePublished 2022-01-01T18:06
75 schema:sdLicense https://scigraph.springernature.com/explorer/license/
76 schema:sdPublisher N790ab1ac42c948519729a9074026cd4a
77 schema:url https://doi.org/10.1007/bf02999429
78 sgo:license sg:explorer/license/
79 sgo:sdDataset articles
80 rdf:type schema:ScholarlyArticle
81 N5b428793e8044460bbc5dfb48b010201 schema:issueNumber 7-8
82 rdf:type schema:PublicationIssue
83 N790ab1ac42c948519729a9074026cd4a schema:name Springer Nature - SN SciGraph project
84 rdf:type schema:Organization
85 N8c791718dd2341f3a0ee2ec8265e21e1 schema:volumeNumber 49
86 rdf:type schema:PublicationVolume
87 Nc89b8ed60e714da1aadd0f1a5f311371 schema:name dimensions_id
88 schema:value pub.1085463486
89 rdf:type schema:PropertyValue
90 Nd8eacdeef850447782901ad34cf45ee5 rdf:first sg:person.013532612025.28
91 rdf:rest rdf:nil
92 Ne1e98dd9a6c6446e80148dfd05d3f00b rdf:first sg:person.015046645205.37
93 rdf:rest Nd8eacdeef850447782901ad34cf45ee5
94 Ne2b22a3df3584b32b11187630aac3867 schema:name doi
95 schema:value 10.1007/bf02999429
96 rdf:type schema:PropertyValue
97 anzsrc-for:09 schema:inDefinedTermSet anzsrc-for:
98 schema:name Engineering
99 rdf:type schema:DefinedTerm
100 anzsrc-for:0906 schema:inDefinedTermSet anzsrc-for:
101 schema:name Electrical and Electronic Engineering
102 rdf:type schema:DefinedTerm
103 anzsrc-for:10 schema:inDefinedTermSet anzsrc-for:
104 schema:name Technology
105 rdf:type schema:DefinedTerm
106 anzsrc-for:1005 schema:inDefinedTermSet anzsrc-for:
107 schema:name Communications Technologies
108 rdf:type schema:DefinedTerm
109 sg:journal.1120575 schema:issn 0003-4347
110 1958-9395
111 schema:name Annals of Telecommunications
112 schema:publisher Springer Nature
113 rdf:type schema:Periodical
114 sg:person.013532612025.28 schema:affiliation grid-institutes:grid.28848.3e
115 schema:familyName Maouche
116 schema:givenName Karim
117 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013532612025.28
118 rdf:type schema:Person
119 sg:person.015046645205.37 schema:affiliation grid-institutes:grid.28848.3e
120 schema:familyName Slock
121 schema:givenName Dirk T. M.
122 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015046645205.37
123 rdf:type schema:Person
124 grid-institutes:grid.28848.3e schema:alternateName Institut Eurecom, BP 193, F-06904, Sophia Antipolis Cedex, France
125 schema:name Institut Eurecom, BP 193, F-06904, Sophia Antipolis Cedex, France
126 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...