Peter M. Grant

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Ganapati Panda

> Home > Persons > Peter M. Grant

Publications

1987
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/tsp/PandaAGC87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsp/PandaAGC87
Ganapati Panda, A. M. Alvarez, Peter M. Grant, C. F. N. Cowan:
A transform domain circular convolution algorithm for adaptive filtering. IEEE Trans. Acoust. Speech Signal Process. 35(8): 1217-1220 (1987)
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/icassp/PandaCG87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icassp/PandaCG87
Ganapati Panda, C. F. N. Cowan, Peter M. Grant:
Assessment of finite precision limitations in LMS and BLMS adaptive algorithms. ICASSP 1987: 137-140
1986
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/tsp/PandaMCG86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsp/PandaMCG86
Ganapati Panda, Bernard Mulgrew, Colin F. N. Cowan, Peter M. Grant:
A self-orthogonalizing efficient block adaptive filter. IEEE Trans. Acoust. Speech Signal Process. 34(6): 1573-1582 (1986)
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/icassp/PandaMCG86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icassp/PandaMCG86
Ganapati Panda, Bernard Mulgrew, Colin F. N. Cowan, Peter M. Grant:
On the rectangular transform approach for BLMS adaptive filtering. ICASSP 1986: 2955-2958

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.