Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2202.02809

An evaluation of the data space dimension in phase retrieval: results in Fresnel zone

Rocco Pierri·Raffaele Moretta
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we address the problem of computing the dimension of data space in phase retrieval problem. Starting from the quadratic formulation of the phase retrieval,the analysis is performed in two steps. First, we exploit the lifting technique to obtain a linear representation of the data. Later, we evaluate the dimension of data space by computing analytically the number of relevant singular values of the linear operator that represents the data. The study is done with reference to a 2D scalar geometry consisting of an electric current strip whose square amplitude of the electric radiated field is observed on a twodimensional extended domain in Fresnel zone.

Explore related subjects

eess.SP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rocco Pierri, Raffaele Moretta. 2022-02-06. An evaluation of the data space dimension in phase retrieval: results in Fresnel zone. https://arxiv.org/abs/2202.02809

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Revisiting Beamforming Design for Stable Millimeter-Wave Communications Under Blockages

This paper investigates robust analog beamforming for millimeter-wave (mmWave) communications under stochastic path blockages using multi-panel arrays. Conventional designs concentrate beams on the line-of-sight (LoS) path to maximize array gain, but this approach is highly vulnerable to sudden disconnections when the LoS path is blocked. To overcome this limitation, we propose a multi-beam design that exploits both LoS and non-line-of-sight (NLoS) paths for stable communications. The major contribution of this work is to establish a theoretical foundation for multi-beam design, where closed-form expressions for the cumulative distribution function (CDF) and outage probability of the spectral efficiency (SE) are derived. To design the optimal multi-beam based on the derived outage probability, we formulate a panel allocation problem to determine the assignment of panels to specific paths. The optimization problem can be solved by two algorithms based on brute-force search. Through computer simulations, the validity of the theoretical analysis for multi-beam design is confirmed, and the proposed algorithms substantially reduce the outage probability while maintaining average SE performance, thereby achieving stable communication.

eess.SP↗
arXiv2026

Baseband-Efficient WMMSE Precoding: From a Signal Weighting Cost Perspective

For downlink transmission in massive multi-user multiple-input multiple-output (MU-MIMO) systems, conventional precoding research heavily focuses on reducing the computational complexity of precoding matrix design, while largely overlooking another critical bottleneck: the substantial signal weighting cost incurred by repeatedly applying the precoder to high-speed data streams. To address both challenges simultaneously, this paper proposes a novel sparse precoding framework tailored for fully-digital architectures. Within this framework, from the sum-rate maximization perspective, we design two sparse precoding architectures: a common-support row-sparse architecture and a user-specific row-sparse architecture, so as to reduce the number of multiplication operations required in baseband signal weighting while largely preserving the achievable sum-rate. For the formulated mixed-integer non-linear programming (MINLP) problem, we rigorously prove that the optimal precoder under both sparse architectures strictly resides in a specific low-dimensional subspace determined by the channel matrices, thereby reducing the dimensionality of the optimization variables. Based on this insight, an alternating optimization algorithm is developed within the weighted minimum mean square error (WMMSE) framework to jointly optimize sparse beam selection and low-dimensional precoding coefficients. The combinatorial beam selection problem is handled using an efficient penalty-based majorize-minimization (MM) method, yielding a low-complexity closed-form solution. Simulation results demonstrate that the proposed schemes achieve sum-rate performance close to that of full-dimensional WMMSE precoding without sparsity constraints, while substantially reducing the overall signal-weighting cost.

eess.SP↗
arXiv2026

Gaussian-trigonometric functional link artificial neural network: design and analysis

This paper proposes a Gaussian function-based trigonometric functional link artificial neural network (GTFLN) filter for linear-in-the-parameters nonlinear filtering. Compared with the adaptive exponential TFLN (AETFLN) filter, the GTFLN filter provides smooth and localized basis functions with reduced computational complexity, where modeling advantages are theoretically established through the smoothness, reproducing kernel Hilbert space, approximation error, and operator theory properties. To maximize the modeling performance, an optimized scaling parameter for the GTFLN filter is derived, yielding the optimized GTFLN (OGTFLN) filter. Least mean square (LMS) adaptation is applied to the GTFLN and OGTFLN filters for nonlinear system identification, resulting in the GTFLMS and OGTFLMS algorithms, respectively. Moreover, the theoretical steady-state excess mean-square error of the GTFLN filter is analyzed. Simulations validate the effectiveness of the theoretical analysis and demonstrate the improved performance of the GTFLN and OGTFLN filters over the linear-in-the-parameters benchmarks in nonlinear system identification and nonlinear acoustic echo cancellation. Based on the GTFLN filter, the filtered-g LMS (FgLMS) algorithm is proposed for nonlinear active noise control. Simulations demonstrate improved stability and noise reduction performance compared to the benchmarks.

eess.SP↗