default search action
Clifford T. Mullis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
- [j15]Ateet Kapur, Mahesh K. Varanasi, Clifford T. Mullis:
Signal Design for Bandwidth Efficient Multiple Access under Asymptotic Effective Energy Constraints. IEEE Trans. Wirel. Commun. 6(8): 2837-2847 (2007) - 2006
- [j14]Mahesh K. Varanasi, Clifford T. Mullis, Ateet Kapur:
On the Limitation of Linear MMSE Detection. IEEE Trans. Inf. Theory 52(9): 4282-4286 (2006) - 2005
- [j13]Peter J. Schreier
, Louis L. Scharf, Clifford T. Mullis:
Detection and estimation of improper complex random signals. IEEE Trans. Inf. Theory 51(1): 306-312 (2005) - [j12]Ateet Kapur, Mahesh K. Varanasi, Clifford T. Mullis:
On the limitation of generalized Welch-bound equality signals. IEEE Trans. Inf. Theory 51(6): 2220-2224 (2005) - 2000
- [j11]Louis L. Scharf, Clifford T. Mullis:
Canonical coordinates and the geometry of inference, rate, and capacity. IEEE Trans. Signal Process. 48(3): 824-831 (2000)
1990 – 1999
- 1999
- [j10]Louis L. Scharf, Clifford T. Mullis:
Lag-windowing and multiple-data-windowing are roughly equivalent for smooth spectrum estimation. IEEE Trans. Signal Process. 47(3): 839-843 (1999) - 1998
- [j9]Mark Spurbeck, Clifford T. Mullis:
Least squares approximation of perfect reconstruction filter banks. IEEE Trans. Signal Process. 46(4): 968-978 (1998) - [c12]Louis L. Scharf, Benjamin Friedlander, Clifford T. Mullis:
Time-varying spectrum estimators for continuous-time signals. ICASSP 1998: 2405-2408 - 1996
- [j8]Knut C. Aas, Clifford T. Mullis:
Minimum mean-squared error transform coding and subband coding. IEEE Trans. Inf. Theory 42(4): 1179-1192 (1996) - 1995
- [j7]Knut C. Aas, Kenneth A. Duell, Clifford T. Mullis:
Synthesis of extremal wavelet-generating filters using Gaussian quadrature. IEEE Trans. Signal Process. 43(5): 1045-1057 (1995) - 1993
- [j6]Michael P. Clark, Clifford T. Mullis:
Quadratic Estimation of the Power Spectrum Using Orthogonal Time-Division Multiple Windows. IEEE Trans. Signal Process. 41(1): 222-231 (1993) - 1991
- [c11]Michael P. Clark, Louis L. Scharf, Clifford T. Mullis:
Quadratic estimators of the frequency-wavenumber spectrum. ICASSP 1991: 2329-2332 - 1990
- [j5]Cédric Demeure, Clifford T. Mullis:
A Newton-Raphson method for moving-average spectral factorization using the Euclid algorithm. IEEE Trans. Acoust. Speech Signal Process. 38(10): 1697-1709 (1990)
1980 – 1989
- 1989
- [j4]Cédric Demeure, Clifford T. Mullis:
The Euclid algorithm and the fast computation of cross-covariance and autocovariance sequences. IEEE Trans. Acoust. Speech Signal Process. 37(4): 545-552 (1989) - 1988
- [c10]German S. Feyh, Clifford T. Mullis:
Inverse eigenvalue problem for real symmetric Toeplitz matrices. ICASSP 1988: 1636-1639 - [c9]Cédric Demeure, Clifford T. Mullis:
On the fast computation of cross-covariance and auto-covariance sequences. ICASSP 1988: 1918-1921 - [c8]German S. Feyh, Clifford T. Mullis:
Moving average separation. ICASSP 1988: 2280-2283 - 1984
- [c7]Clifford T. Mullis, Richard A. Roberts:
Digital processing structures for VLSI implementation. ICASSP 1984: 325-327 - 1983
- [c6]Denis Henrot, Clifford T. Mullis:
A modular and orthogonal digital filter structure for parallel processing. ICASSP 1983: 623-626 - 1980
- [c5]William L. Mills, Clifford T. Mullis, Richard A. Roberts:
An iterative estimation technique for power spectra by an ARMA model. ICASSP 1980: 622-625 - [c4]Masud Arjmand, Clifford T. Mullis, Richard A. Roberts:
A modular hardware structure for digital filtering. ICASSP 1980: 780-783
1970 – 1979
- 1979
- [c3]William L. Mills, Clifford T. Mullis, Richard A. Roberts:
Normal realizations of IIR digital filters. ICASSP 1979: 340-343 - 1978
- [c2]William L. Mills, Clifford T. Mullis, Richard A. Roberts:
Digital filter realizations without overflow oscillations. ICASSP 1978: 71-74 - 1976
- [c1]Clifford T. Mullis, Richard A. Roberts:
Filter structures which minimize roundoff noise in fixed point digital filters. ICASSP 1976: 505-508 - 1974
- [j3]Clifford T. Mullis, Richard A. Roberts:
Finite-memory problems and algorithms. IEEE Trans. Inf. Theory 20(4): 440-455 (1974) - 1970
- [j2]Richard A. Roberts, Clifford T. Mullis:
A Bayes sequential test of m hypotheses (Corresp.). IEEE Trans. Inf. Theory 16(1): 91-94 (1970)
1960 – 1969
- 1968
- [j1]Clifford T. Mullis, Richard A. Roberts:
Memory Limitation and Multistage Decision Processes. IEEE Trans. Syst. Sci. Cybern. 4(3): 307-316 (1968)
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:54 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: