default search action
Martin Morf
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
- [j9]Jacob A. Bower, Wayne Luk, Oskar Mencer, Michael J. Flynn, Martin Morf:
Dynamic clock-frequencies for FPGAs. Microprocess. Microsystems 30(6): 388-397 (2006) - 2001
- [j8]Oskar Mencer, Marco Platzner
, Martin Morf, Michael J. Flynn:
Object-oriented domain specific compilers for programming FPGAs. IEEE Trans. Very Large Scale Integr. Syst. 9(1): 205-210 (2001) - 2000
- [j7]Oskar Mencer, Luc Séméria, Martin Morf, Jean-Marc Delosme:
Application of Reconfigurable CORDIC Architectures. J. VLSI Signal Process. 24(2-3): 211-221 (2000) - [c23]Oskar Mencer, Heiko Hübert, Martin Morf, Michael J. Flynn:
StReAm: Object-Oriented Programming of Stream Architectures Using PAM-Blox. FCCM 2000: 309-312 - [c22]Oskar Mencer, Heiko Hübert, Martin Morf, Michael J. Flynn:
StReAm: Object-Oriented Programming of Stream Architectures Using PAM-Blox. FPL 2000: 595-604
1990 – 1999
- 1998
- [c21]Oskar Mencer, Martin Morf, Michael J. Flynn:
PAM-Blox: High Performance FPGA Design for Adaptive Computing. FCCM 1998: 167-174 - [c20]Oskar Mencer, Martin Morf, Michael J. Flynn:
Hardware software tri-design of encryption for mobile communication units. ICASSP 1998: 3045-3048
1980 – 1989
- 1986
- [j6]Sedat Ölçer, Bo Egardt, Martin Morf:
Convergence analysis of ladder algorithms for AR and ARMA models. Autom. 22(3): 345-354 (1986) - [j5]Guaning Su, Martin Morf:
Modal decomposition signal subspace algorithms. IEEE Trans. Acoust. Speech Signal Process. 34(3): 585-602 (1986) - 1984
- [c19]Carlos H. Muravchik, Martin Morf:
Square root normalized feedback ladder algorithm for the identification of moving average systems. ICASSP 1984: 236-239 - [c18]A. S. Krishnakumar, Martin Morf:
A divide-and-conquer approach to the evaluation of the characteristic polynomial of a symmetric tridiagonal matrix. ICASSP 1984: 351-354 - [c17]Ping Ang, Martin Morf:
Concurrent array processor for fast eigenvalue computations. ICASSP 1984: 766-769 - 1983
- [c16]Guaning Su, Martin Morf:
Modal decomposition signal subspace algorithms. ICASSP 1983: 340-343 - [c15]Arye Nehorai, Martin Morf:
A new derivation for fast recursive least squares and Levinson algorithms by the conjugate direction method. ICASSP 1983: 675-678 - [c14]Carlos H. Muravchik, Martin Morf:
A new stable feedback ladder algorithm for the identification of moving average processes. ICASSP 1983: 683-686 - [c13]Martin Morf, Ping Ang, Jean-Marc Delosme:
Development of signal processing algorithms via functional programming. ICASSP 1983: 1176-1179 - 1982
- [j4]Hassan M. Ahmed, Jean-Marc Delosme, Martin Morf:
Highly Concurrent Computing Structures for Matrix Arithmetic and Signal Processing. Computer 15(1): 65-82 (1982) - [c12]Martin Morf, Carlos H. Muravchik, Ping Ang, Jean-Marc Delosme:
Fast Cholesky algorithms and adaptive feedback filters. ICASSP 1982: 1727-1731 - [c11]Jean-Marc Delosme, Martin Morf:
Constant-gain filters for finite shift-rank processes. ICASSP 1982: 1732-1735 - [c10]Daniel T. L. Lee, Martin Morf:
Generalized CORDIC for digital signal processing. ICASSP 1982: 1748-1751 - 1981
- [c9]Benjamin Friedlander, Martin Morf:
Least-squares algorithms for adaptive linear-phase filtering. ICASSP 1981: 247-250 - [c8]Arye Nehorai, Martin Morf:
Enhancement of sinusoids in colored noise and the whitening performance of exact least-squares predictors. ICASSP 1981: 275-278 - [c7]Hassan M. Ahmed, Martin Morf, Daniel T. L. Lee, Ping Ang:
A VLSI speech analysis chip set based on square root normalized ladder forms. ICASSP 1981: 648-653 - [c6]Martin Morf, Carlos H. Muravchik, Daniel T. L. Lee:
Hilbert space array methods for finite rank process estimation and ladder realizations for adaptive signal processing. ICASSP 1981: 856-859 - [c5]Boaz Porat, Benjamin Friedlander, Martin Morf:
Square-root covariance ladder algorithms. ICASSP 1981: 877-880 - 1980
- [c4]Daniel T. L. Lee, Martin Morf:
A novel innovation based time domain pitch detector. ICASSP 1980: 40-44 - [c3]Jean-Marc Delosme, Martin Morf, Benjamin Friedlander:
Source location from time differences of arrival: Identifiability and estimation. ICASSP 1980: 818-824 - [c2]Martin Morf:
Doubling algorithms for Toeplitz and related equations. ICASSP 1980: 954-959 - [c1]Daniel T. L. Lee, Martin Morf:
Recursive square-root ladder estimation algorithms. ICASSP 1980: 1005-1017
1970 – 1979
- 1979
- [j3]Martin Morf, J. R. Dobbins, Benjamin Friedlander, Thomas Kailath:
Square-root algorithms for parallel processing in optimal estimation, . Autom. 15(3): 299-306 (1979) - [j2]Martin Morf, Thomas Kailath, J. R. Dobbins, Benjamin Friedlander, John A. Newkirk:
Reply to discussion of 'square-root algorithms for parallel processing in optimal estimation'. Autom. 15(4): 499 (1979) - 1978
- [j1]Thomas Kailath, Bernard C. Levy, Lennart Ljung, Martin Morf:
Fast time-invariant implementations of Gaussian signal detectors. IEEE Trans. Inf. Theory 24(4): 469-477 (1978)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: