default search action
Lorenz Weiland
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [c16]Lorenz Weiland, Christoph Stöckle, Michael Würth
, Thomas Weinberger, Wolfgang Utschick
OMP with Grid-Less Refinement Steps for Compressive mmWave MIMO Channel Estimation. SAM 2018: 543-547 - 2017
- [c15]Lorenz Weiland, Thomas Wiese, Wolfgang Utschick
Multipath mitigation using OMP and newton's method for multi-antenna GNSS receivers. CAMSAP 2017: 1-5 - [c14]Thomas Wiese, Lorenz Weiland, Wolfgang Utschick
Inexact projected gradients on unions of subspaces. ISIT 2017: 236-240 - 2016
- [c13]Thomas Wiese, Lorenz Weiland, Wolfgang Utschick
Exact recovery of structured block-sparse signals with model-aware orthogonal matching pursuit. SPAWC 2016: 1-5 - [c12]Thomas Wiese, Lorenz Weiland, Wolfgang Utschick:
Low-Rank Approximations for Spatial Channel Models. WSA 2016: 1-5 - 2015
- [j2]Lennart Gerdes, Christoph Hellings
On the Maximum Achievable Partial Decode-and-Forward Rate for the Gaussian MIMO Relay Channel. IEEE Trans. Inf. Theory 61(12): 6751-6758 (2015) - [c11]Lorenz Weiland, Thomas Wiese, Wolfgang Utschick
Coherent MIMO radar with sparse recovery: Joint vs. separate range and azimuth estimation. ACSSC 2015: 594-598 - [c10]Lorenz Weiland, Thomas Wiese, Wolfgang Utschick
Coherent MIMO radar imaging with model-aware block sparse recovery. CAMSAP 2015: 425-428 - [c9]Lorenz Weiland, Thomas Wiese, Wolfgang Utschick
Coherent MIMO radar range imaging with block sparse recovery. MILCOM 2015: 517-522 - [c8]Thomas Wiese, Lorenz Weiland, Wolfgang Utschick
DOA estimation and array registration with joint sparse reconstruction methods. SPAWC 2015: 500-504 - [c7]David Neumann, Michael Joham, Lorenz Weiland, Wolfgang Utschick:
Low-Complexity Computation of LMMSE Channel Estimates in Massive MIMO. WSA 2015: 1-6 - [c6]Lorenz Weiland, Wolfgang Utschick:
On Receive Filter Design for Coherent MIMO Radar with Non-Ideal Waveforms. WSA 2015: 1-8 - 2014
- [j1]Christoph Hellings
On Optimal Gaussian Signaling in MIMO Relay Channels With Partial Decode-and-Forward. IEEE Trans. Signal Process. 62(12): 3153-3164 (2014) - [c5]Lennart Gerdes, Lorenz Weiland, Maximilian Riemensberger, Wolfgang Utschick
Optimal partial decode-and-forward rates for stochastically degraded Gaussian relay channels. CISS 2014: 1-5 - [c4]Christoph Hellings
Optimality of proper signaling in Gaussian MIMO broadcast channels with shaping constraints. ICASSP 2014: 3474-3478 - [c3]Lennart Gerdes, Lorenz Weiland, Wolfgang Utschick
Optimal partial decode-and-forward rates for the Gaussian MIMO relay channel using the GSVD. SPAWC 2014: 259-263 - [i1]Lennart Gerdes, Christoph Hellings, Lorenz Weiland, Wolfgang Utschick:
The Optimal Input Distribution for Partial Decode-and-Forward in the MIMO Relay Channel. CoRR abs/1409.8624 (2014) - 2013
- [c2]Lennart Gerdes, Lorenz Weiland, Wolfgang Utschick
A zero-forcing partial decode-and-forward scheme for the Gaussian MIMO relay channel. ICC 2013: 3349-3354 - [c1]Lorenz Weiland, Lennart Gerdes, Wolfgang Utschick
Partial decode-and-forward rates for the Gaussian MIMO relay channel: Inner approximation of non-convex rate constraints. SPAWC 2013: 540-544
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-10-07 21:23 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: