default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Steffens
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2018
[b1]Christian Steffens:
Compact Formulations for Sparse Reconstruction in Fully and Partly Calibrated Sensor Arrays. TU Darmstadt, Germany, 2018
Journal Articles
- 2018
- [j2]Christian Steffens
, Marius Pesavento:
Block- and Rank-Sparse Recovery for Direction Finding in Partly Calibrated Arrays. IEEE Trans. Signal Process. 66(2): 384-399 (2018) - [j1]Christian Steffens, Marius Pesavento, Marc E. Pfetsch:
A Compact Formulation for the $\ell _{2, 1}$ Mixed-Norm Minimization Problem. IEEE Trans. Signal Process. 66(6): 1483-1497 (2018)
Conference and Workshop Papers
- 2019
- [c10]Gerta Kushe, Yang Yang, Christian Steffens, Marius Pesavento:
A parallel sparse regularization method for structured multilinear low-rank tensor decomposition. EUSIPCO 2019: 1-5 - 2017
- [c9]Wassim Suleiman, Christian Steffens, Alexander Sorg, Marius Pesavento:
Gridless compressed sensing for fully augmentable arrays. EUSIPCO 2017: 1986-1990 - [c8]Christian Steffens, Marius Pesavento, Marc E. Pfetsch:
A compact formulation for the l21 mixed-norm minimization problem. ICASSP 2017: 4730-4734 - [c7]Christian Steffens, Wassim Suleiman, Alexander Sorg, Marius Pesavento:
Gridless compressed sensing under shift-invariant sampling. ICASSP 2017: 4735-4739 - 2016
- [c6]Jens Steinwandt, Florian Roemer, Christian Steffens, Martin Haardt, Marius Pesavento:
Gridless super-resolution direction finding for strictly non-circular sources based on atomic norm minimization. ACSSC 2016: 1518-1522 - [c5]Christian Steffens, Yang Yang, Marius Pesavento:
Multidimensional sparse recovery for MIMO channel parameter estimation. EUSIPCO 2016: 66-70 - [c4]Ganapati Hegde, Yang Yang, Christian Steffens, Marius Pesavento:
Parallel low-complexity M-PSK detector for large-scale MIMO systems. SAM 2016: 1-5 - [c3]Jens Steinwandt, Christian Steffens, Marius Pesavento, Martin Haardt:
Sparsity-aware direction finding for strictly non-circular sources based on rank minimization. SAM 2016: 1-5 - 2014
- [c2]Christian Steffens, Pouyan Parvazi, Marius Pesavento:
Direction finding and array calibration based on sparse reconstruction in partly calibrated arrays. SAM 2014: 21-24 - 2012
- [c1]Christian Steffens, Marius Pesavento:
A physical layer average consensus algorithm for wireless sensor networks. WSA 2012: 70-77
Informal and Other Publications
- 2017
- [i3]Christian Steffens, Marius Pesavento:
Block- and Rank-Sparse Recovery for Direction Finding in Partly Calibrated Arrays. CoRR abs/1702.05411 (2017) - 2016
- [i2]Christian Steffens, Yang Yang, Marius Pesavento:
Multidimensional Sparse Recovery for MIMO Channel Parameter Estimation. CoRR abs/1603.05410 (2016) - [i1]Christian Steffens, Marius Pesavento, Marc E. Pfetsch:
A Compact Formulation for the ℓ2, 1 Mixed-Norm Minimization Problem. CoRR abs/1606.07231 (2016)
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 23:03 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:
