Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 20 for “"Approximate message passing"”.

  1. Approximate Message Passing for Matrix Regression

    Approximate message passing (AMP) algorithms have become popular in various structured high-dimensional statistical problems. Previous AMP algorithms for generalized linear models (GLM) typically require the signal to be in the form of a vector, and the design matrix to have independent and …

    cambridge Repository record for Approximate Message Passing for Matrix Regression (opens in a new tab)

  2. Analogic for code estimation and detection

    … by locally propagating probabilities in a message-passing algorithm [29] [15]. In this thesis, we study an exemplary embodiment of analogic called Noise-Locked Loop(NLL) which is a pseudo-random code estimation system. The previous work shows NLL can perform direct-sequence spread-spectrum …

    mit Repository record for Analogic for code estimation and detection (opens in a new tab)

  3. Computational Hardness in Random Optimization Problems from the Overlap Gap Property

    … Low degree polynomial algorithms encompass Fix, message passing algorithms including Belief and Survey Propagation guided decimation, and local algorithms on the factor graph. This is the first hardness result against any class of algorithms within a constant factor of the clause density achieved …

    mit Repository record for Computational Hardness in Random Optimization Problems from the Overlap Gap Property (opens in a new tab)

  4. Low-Complexity Iterative Receiver Design for Multi-Carrier Faster-Than-Nyquist Signaling Over Frequency-Selective Fading Channel

    … iterative receiver based on hybrid message passing is proposed for spectrally efficient frequency division multiplexing (SEFDM) signaling combined with index modulation (IM), which solves the problem of joint symbol detection and channel estimation for frequency-domain …

    uts Repository record for Low-Complexity Iterative Receiver Design for Multi-Carrier Faster-Than-Nyquist Signaling Over Frequency-Selective Fading Channel (opens in a new tab)

  5. Algorithms for 3D time-of-flight imaging

    … The second application uses a generalized approximate message passing (GAMP) framework to incorporate both accurate probabilistic modeling for the measurement process and underlying scene depth map sparsity to accurately extend the unambiguous depth range of the camera. This joint …

    mit Repository record for Algorithms for 3D time-of-flight imaging (opens in a new tab)

  6. Optimal standoff imaging using structured laser illumination and graphical models

    … standoff imaging along with an approximate message-passing algorithm for belief propagation to perform optimal scene reconstruction. This approach lets us accurately model the statistics of speckled images, photon detection, and atmospheric turbulence, as well as incorporate …

    mit Repository record for Optimal standoff imaging using structured laser illumination and graphical models (opens in a new tab)

  7. Statistical estimation in the presence of group actions

    … variety of areas, including statistical physics, approximate message passing, representation theory, contiguity and the associated second moment method, invariant theory, algebraic geometry, and the sum-of-squares hierarchy..

    mit Repository record for Statistical estimation in the presence of group actions (opens in a new tab)

  8. Efficient Multi-Target Tracking using graphical models

    … structure, and subsequently develop e±cient, approximate message passing algorithms to solve the MTT problem. Our modeling approach is able to take into account issues such as false alarms and missed detections. Although exact inference is intractable in graphs with a mix of both discrete and …

    mit Repository record for Efficient Multi-Target Tracking using graphical models (opens in a new tab)

  9. A compressed sensing approach to block-iterative equalization: connections and applications to radar imaging reconstruction

    … thus outperforming the state-of-the-art Complex Approximate Message Passing (CAMP) recursions. The merits of the new recursions are illustrated under a novel 3D MIMO Radar formulation, where the CAMP algorithm is shown to fail with respect to important performance measures.

    brazil-uerj Repository record for A compressed sensing approach to block-iterative equalization: connections and applications to radar imaging reconstruction (opens in a new tab)

  10. Graphical models and message passing receivers for interference limited communication systems

    … of the OFDM system to propose low-complexity message passing OFDM receivers that leverage recent results in soft-input soft-output decoding, approximate message passing, and sparse signal recovery for joint channel/interference estimation and data decoding. The resulting receivers provide huge …

    texas Repository record for Graphical models and message passing receivers for interference limited communication systems (opens in a new tab)

  11. Spatially Coupled Sparse Regression Codes for Single- and Multi-user Communications

    … an i.i.d. Gaussian design matrix, and the user message is encoded in the indices of those columns. Techniques such as power allocation and spatial coupling have been proposed to improve the performance of low-complexity iterative decoding algorithms such as approximate message passing (AMP). In …

    cambridge Repository record for Spatially Coupled Sparse Regression Codes for Single- and Multi-user Communications (opens in a new tab)

  12. Design Techniques for Efficient Sparse Regression Codes

    … channel capacity. One such algorithm is the approximate message passing (AMP) decoder. However, directly implementing these decoders does not yield good empirical performance at practical block lengths. This thesis develops techniques for improving both the error rate performance, and the …

    cambridge Repository record for Design Techniques for Efficient Sparse Regression Codes (opens in a new tab)

  13. Spatial Coupling for High-Dimensional Estimation

    … optimal performance with efficient message-passing algorithms. This thesis investigates spatial coupling for a range of statistical problems, starting with generalized linear models (GLMs). Recent work has precisely characterized the asymptotic minimum mean-squared error (MMSE) for …

    cambridge Repository record for Spatial Coupling for High-Dimensional Estimation (opens in a new tab)

  14. Message Passing Algorithms for Statistical Estimation and Communication

    … schemes, based on belief propagation (BP) and Approximate Message Passing (AMP), are developed for these problems. We first consider matrix sketching, where the goal is to recover an *n*<sub>1</sub> x *n*<sub>2</sub> low-rank matrix with *k*-sparse singular vectors from a small number of linear …

    cambridge Repository record for Message Passing Algorithms for Statistical Estimation and Communication (opens in a new tab)

  15. High-Dimensional Inference with Heterogeneous Data

    … with <em>change points</em>. We develop a novel Approximate Message Passing (AMP) algorithm for inference in this setting, and characterize its performance in the high-dimensional regime where the number of samples $n$ and the covariate dimension $p$ grow proportionally. Under the assumption of …

    cambridge Repository record for High-Dimensional Inference with Heterogeneous Data (opens in a new tab)

  16. Two New Applications of Tensors to Machine Learning for Wireless Communications

    … algorithm based on the Generalized Approximate Message Passing (GAMP) framework that exploits this prior information about the gradients. Through the numerical simulations, we demonstrate that the developed gradient reconstruction method improves the convergence of the CNN model.

    vt Repository record for Two New Applications of Tensors to Machine Learning for Wireless Communications (opens in a new tab)

  17. Analysis of Wireless Networks With Massive Connectivity

    … Specifically, employing the generalized approximate message passing (GAMP) algorithm, we obtain the MMSE estimates of the equivalent effective channel coefficients from the base station (BS) to all users, and transform the received pilot signals into additive Gaussian noise corrupted …

    syracuse-diss Repository record for Analysis of Wireless Networks With Massive Connectivity (opens in a new tab)

  18. Algorithms and Algorithmic Barriers in High-Dimensional Statistics and Random Combinatorial Structures

    … of several important algorithms including the approximate message passing and the low-degree polynomial based methods. Our hardness results for the stable algorithms are based on Ramsey Theory from extremal combinatorics. To the best of our knowledge, this is the first usage of Ramsey Theory to …

    mit Repository record for Algorithms and Algorithmic Barriers in High-Dimensional Statistics and Random Combinatorial Structures (opens in a new tab)

  19. One-bit Compressed Sensing in the Presence of Noise

    … this setup, we develop tractable algorithms that approximate the minimum mean square error (MMSE) estimator of the signal. We consider the following three different SI-based scenarios:</p><p>1. The side-information is assumed to be a noisy version of the signal. The noise is independent of the …

    syracuse-diss Repository record for One-bit Compressed Sensing in the Presence of Noise (opens in a new tab)