default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCédric Demeure
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
[j9]Thibault Joël, Nicollet Eric, Cédric Demeure:
Software defined radio architecture for cellular networks base stations: TheSunbeam project. Ann. des Télécommunications 57(7-8): 626-652 (2002)
1990 – 1999
- 1998
- [j8]Cédric Demeure, Pascal Chevalier:
The smart antennas at Thomson-Csf Communications: concepts, implementations, performances and applications. Ann. des Télécommunications 53(11-12): 466-482 (1998) - 1996
- [c7]Y. Abramovicht, Cédric Demeure, A. Gorokhovt:
Experimental verification of a generalized multivariate propagation model for ionospheric HF signals. EUSIPCO 1996: 1-4 - 1993
- [c6]Antoine Souloumiac, Pascal Chevalier, Cédric Demeure:
Improvement in non-Gaussian jammers rejection with a non-linear spatial filter. ICASSP (5) 1993: 670-673 - 1990
- [j7]Cédric Demeure:
Fast least squares estimation of amplitude and phase of damped cosines. Signal Process. 21(2): 107-115 (1990) - [j6]Cédric Demeure, Louis L. Scharf:
Sliding windows and lattice algorithms for computing QR factors in the least squares theory of linear prediction. IEEE Trans. Acoust. Speech Signal Process. 38(4): 721-725 (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) - [j4]Cédric Demeure:
QR factorization of confluent Vandermonde matrices. IEEE Trans. Acoust. Speech Signal Process. 38(10): 1799-1802 (1990)
1980 – 1989
- 1989
- [j3]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) - [j2]Cédric Demeure:
Bowtie factors of Toeplitz matrices by means of split algorithms. IEEE Trans. Acoust. Speech Signal Process. 37(10): 1601-1603 (1989) - [c5]Cédric Demeure, Louis L. Scharf:
Fast algorithms to QR factor circulant matrices. ICASSP 1989: 1123-1126 - [c4]Cédric Demeure, Louis L. Scharf:
Fast least squares solution of Vandermonde systems of equations. ICASSP 1989: 2198-2210 - 1988
- [c3]Cédric Demeure, Clifford T. Mullis:
On the fast computation of cross-covariance and auto-covariance sequences. ICASSP 1988: 1918-1921 - [c2]Cédric Demeure, Louis L. Scharf:
True lattice algorithms for square root solution of least squares linear prediction problems. ICASSP 1988: 2312-2315 - 1987
- [j1]Cédric Demeure, Louis L. Scharf:
Linear statistical models for stationary sequences and related algorithms for Cholesky factorization of Toeplitz matrices. IEEE Trans. Acoust. Speech Signal Process. 35(1): 29-42 (1987) - [c1]Cédric Demeure, Louis L. Scharf:
Vector algorithms for computing QR and Cholesky factors of close-to-Toeplitz matrices. ICASSP 1987: 1851-1854
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 2025-01-09 13:25 CET 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:
