Sjoerd Dirksen

Sjoerd Dirksen

Auto-generated profile, based on publicly available information

Sjoerd Dirksen

Mathematical Institute, Utrecht University, Utrecht, The Netherlands

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 October 2019 in Information and Inference: A Journal of the IMA
Verified
Journal Article
Closed access
PDF file
SDSjoerd Dirksen
Sjoerd Dirksen
HJHans Christian Jung
Hans Christian Jung
HRHolger Rauhut
Holger Rauhut
In this paper we consider memoryless one-bit compressed sensing with randomly subsampled Gaussian circulant matrices. We show that in a small sparsity regime and for small enough accuracy $\delta$, $m\simeq \delta ^{-4} s\log (N/s\delta )$ measurements suffice to reconstruct the direction of any $s$-sparse vector up to accuracy $\delta$ via an efficient program. We derive this result by proving that partial Gaussian circulant matrices satisfy an $\ell _1/\ell _2$ restricted isometry property property. Under a slightly worse dependence on $\delta$, we establish stability with respect to approximate sparsity, as well as full vector recovery results, i.e., estimation of both vector norm and direction.

22 September 2023 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
TYTianyu Yang
Tianyu Yang
JMJohannes Maly
Johannes Maly
SDSjoerd Dirksen
Sjoerd Dirksen
Giuseppe CaireGiuseppe Caire
Giuseppe Caire
As the array dimension of massive MIMO systems increases to unprecedented levels, two problems occur. First, the spatial stationarity assumption along the antenna elements is no longer valid. Second, the large array size results in an unacceptably high power consumption if high-resolution analog-to-digital converters are used. To address these two challenges, we consider a Bussgang linear minimum mean square error (BLMMSE)-based channel estimator for large scale massive MIMO systems with one-bit quantizers and a spatially non-stationary channel. Whereas other works usually assume that the channel covariance is known at the base station, we consider a plug-in BLMMSE estimator that uses an estimate of the channel covariance and rigorously analyze the distortion produced by using an estimated, rather than the true, covariance. To cope with the spatial non-stationarity, we introduce dithering into the quantized signals and provide a theoretical error analysis. In addition, we propose an angular domain fitting procedure which is based on solving an instance of non-negative least squares. For the multi-user data transmission phase, we further propose a BLMMSE-based receiver to handle one-bit quantized data signals. Our numerical results show that the performance of the proposed BLMMSE channel estimator is very close to the oracle-aided scheme with ideal knowledge of the channel covariance matrix. The BLMMSE receiver outperforms the conventional maximum-ratio-combining and zero-forcing receivers in terms of the resulting ergodic sum rate.

26 January 2024 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
SDSjoerd Dirksen
Sjoerd Dirksen
JMJohannes Maly
Johannes Maly
We consider covariance estimation of any subgaussian distribution from finitely many i.i.d. samples that are quantized to one bit of information per entry. Recent work has shown that a reliable estimator can be constructed if uniformly distributed dithers on [-λ,λ] are used in the one-bit quantizer. This estimator enjoys near-minimax optimal, non-asymptotic error estimates in the operator and Frobenius norms if λ is chosen proportional to the largest variance of the distribution. However, this quantity is not known a-priori, and in practice λ needs to be carefully tuned to achieve good performance. In this work we resolve this problem by introducing a tuning-free variant of this estimator, which replaces λ by a data-driven quantity. We prove that this estimator satisfies the same non-asymptotic error estimates — up to small (logarithmic) losses and a slightly worse probability estimate. We also show that by using refined data-driven dithers that vary per entry of each sample, one can construct an estimator satisfying the same estimation error bound as the sample covariance of the samples before quantization — again up logarithmic losses. Our proofs rely on a new version of the Burkholder-Rosenthal inequalities for matrix martingales, which is expected to be of independent interest.

14 August 2019
Verified
Book Chapter
Closed access
PDF file
SDSjoerd Dirksen
Sjoerd Dirksen

14 June 2015
Verified
Conference Paper
Open access
JBJean Bourgain
Jean Bourgain
SDSjoerd Dirksen
Sjoerd Dirksen
JNJelani Nelson
Jelani Nelson
Let Φ∈Rm x n be a sparse Johnson-Lindenstrauss transform [52] with column sparsity s. For a subset T of the unit sphere and ε∈(0,1/2), we study settings for m,s to ensure EΦ supx∈ T |Φ x|22 - 1| < ε, i.e. so that Φ preserves the norm of every x ∈ T simultaneously and multiplicatively up to 1+ε. We introduce a new complexity parameter, which depends on the geometry of T, and show that it suffices to choose s and m such that this parameter is small. Our result is a sparse analog of Gordon's theorem, which was concerned with a dense Φ having i.i.d. Gaussian entries. We qualitatively unify several results related to the Johnson-Lindenstrauss lemma, subspace embeddings, and Fourier-based restricted isometries. Our work also implies new results in using the sparse Johnson-Lindenstrauss transform in randomized linear algebra, compressed sensing, manifold learning, and constrained least squares problems such as the Lasso.

21 October 2025 in Sampling Theory, Signal Processing, and Data Analysis
Verified
Journal Article
Open access
PDF file
MAMarc Allain
Marc Allain
SASelin Aslan
Selin Aslan
WCWim Coene
Wim Coene
SDSjoerd Dirksen
Sjoerd Dirksen
JDJonathan Dong
Jonathan Dong
MWMatthias Wellershoff
Matthias Wellershoff
Phase retrieval is an inverse problem that, on one hand, is crucial in many applications across imaging and physics, and, on the other hand, leads to deep research questions in theoretical signal processing and applied harmonic analysis. This survey paper is an outcome of the recent workshop Phase Retrieval in Mathematics and Applications (PRiMA) (held on August 5–9 2024 at the Lorentz Center in Leiden, The Netherlands) that brought together experts working on theoretical and practical aspects of the phase retrieval problem with the purpose to formulate and explore essential open problems in the field.