English
Related papers

Related papers: Approximate Message Passing for Multi-Preamble Det…

200 papers

Orthogonal Matching pursuit (OMP) is a popular algorithm to estimate an unknown sparse vector from multiple linear measurements of it. Assuming exact sparsity and that the measurements are corrupted by additive Gaussian noise, the success…

Statistics Theory · Mathematics 2020-08-07 Chen Amiraz , Robert Krauthgamer , Boaz Nadler

This paper explicitly models a coarse and noisy quantization in a communication system empowered by orthogonal time frequency space (OTFS) for cost and power efficiency. We first point out, with coarse quantization, the effective channel is…

Information Theory · Computer Science 2024-01-23 Junwei He , Haochuan Zhang , Chao Dong , Huimin Zhu

The orthogonal matching pursuit (OMP) is an algorithm to solve sparse approximation problems. Sufficient conditions for exact recovery are known with and without noise. In this paper we investigate the applicability of the OMP for the…

Numerical Analysis · Mathematics 2010-10-26 Loic Denis , Dirk A. Lorenz , Dennis Trede

Maximum a posteriori (MAP) inference in discrete-valued Markov random fields is a fundamental problem in machine learning that involves identifying the most likely configuration of random variables given a distribution. Due to the…

Machine Learning · Computer Science 2020-07-03 Jonathan N. Lee , Aldo Pacchiano , Peter Bartlett , Michael I. Jordan

The problem of sparse approximation and the closely related compressed sensing have received tremendous attention in the past decade. Primarily studied from the viewpoint of applied harmonic analysis and signal processing, there have been…

Information Theory · Computer Science 2018-10-23 Ali Çivril

In this paper, we will consider the Look-Ahead Security Constrained Optimal Power Flow (LASCOPF) problem looking forward multiple dispatch intervals, in which the load demand varies over dispatch intervals according to some forecast. We…

Systems and Control · Electrical Eng. & Systems 2019-09-19 Sambuddha Chakrabarti , Ross Baldick

As a promising technique for high-mobility wireless communications, orthogonal time frequency space (OTFS) has been proved to enjoy excellent advantages with respect to traditional orthogonal frequency division multiplexing (OFDM). Although…

Data Structures and Algorithms · Computer Science 2023-06-22 Mi Qian , Fei Ji , Yao Ge , Miaowen Wen , Xiang Cheng , H. Vincent Poor

This paper considers an uplink massive machine-type communication (mMTC) scenario, where a large number of user devices are connected to a base station (BS). A novel grant-free massive random access (MRA) strategy is proposed, considering…

Information Theory · Computer Science 2021-02-23 Jia-Cheng Jiang , Hui-Ming Wang

The fundamental communication problem in the wireless Internet of Things (IoT) is to discover a massive number of devices and to allow them reliable access to shared channels. Oftentimes these devices transmit short messages randomly and…

Information Theory · Computer Science 2021-11-22 Xu Chen , Lina Liu , Dongning Guo , Gregory W. Wornell

Orthogonal Time Frequency Space (OTFS) modulation exploits the sparsity of Delay-Doppler domain channels, making it highly effective in high-mobility scenarios. Its accurate channel estimation supports integrated sensing and communication…

Signal Processing · Electrical Eng. & Systems 2025-05-13 Guangyu Lei , Yanduo Qiao , Tianhao Liang , Weijie Yuan , Tingting Zhang

In this paper, we address the problem of recovering complex-valued signals from a set of complex-valued linear measurements. Approximate message passing (AMP) is one state-of-the-art algorithm to recover real-valued sparse signals. However,…

Information Theory · Computer Science 2016-01-26 Xiangming Meng , Sheng Wu , Linling Kuang , Jianhua Lu

Orthogonal time frequency space (OTFS) is a modulation technique that is dedicated to the high-speed mobility scenario. However, its transmission involves a two-dimensional convolution of the symbols of interest and the multipath fading…

Signal Processing · Electrical Eng. & Systems 2020-05-19 Yaru Shan , Fanggang Wang

The recent proposed orthogonal time frequency space (OTFS) modulation shows signifcant advantages than conventional orthogonal frequency division multiplexing (OFDM) for high mobility wireless communications. However, a challenging problem…

Information Theory · Computer Science 2022-07-25 Xiangxiang Li , Haiyan Wang , Yao Ge , Xiaohong Shen , Yuanyuan Lei

In oversampled adaptive sensing (OAS), noisy measurements are collected in multiple subframes. The sensing basis in each subframe is adapted according to some posterior information exploited from previous measurements. The framework is…

Information Theory · Computer Science 2019-12-11 Ali Bereyhi , Ralf R. Müller

We propose efficient and low-complexity multiuser detection (MUD) algorithms for Gaussian multiple access channel (G-MAC) for short-packet transmission in massive machine type communications. To do so, we first formulate the G-MAC MUD…

Information Theory · Computer Science 2024-03-26 Mostafa Mohammadkarimi , Masoud Ardakani

This paper proposes a unified sparsity-aware robust normalized subband adaptive filtering (SA-RNSAF) algorithm for identification of sparse systems under impulsive noise. The proposed SA-RNSAF algorithm generalizes different algorithms by…

Machine Learning · Computer Science 2022-05-17 Yi Yu , Zongxin Huang , Hongsen He , Yuriy Zakharov , Rodrigo C. de Lamare

Sparse superposition codes, or sparse regression codes (SPARCs), are a recent class of codes for reliable communication over the AWGN channel at rates approaching the channel capacity. Approximate message passing (AMP) decoding, a…

Information Theory · Computer Science 2019-04-24 Cynthia Rush , Ramji Venkataramanan

Accurate parameter estimation such as angle of arrival (AOA) is essential to enhance the performance of integrated sensing and communication (ISAC) in mmWave multiple-input multiple-output (MIMO) systems. This work presents a sensing-aided…

Information Theory · Computer Science 2025-03-05 Ngoc-Son Duong , Khac-Hoang Ngo , Thai-Mai Dinh , Van-Linh Nguyen

A common goal in many research areas is to reconstruct an unknown signal x from noisy linear measurements. Approximate message passing (AMP) is a class of low-complexity algorithms for efficiently solving such high-dimensional regression…

Information Theory · Computer Science 2019-05-07 Hangjin Liu , Cynthia Rush , Dror Baron

Affine Frequency Division Multiplexing (AFDM) is considered as a promising solution for next-generation wireless systems due to its satisfactory performance in high-mobility scenarios. By adjusting AFDM parameters to match the multi-path…

Information Theory · Computer Science 2024-10-16 Jin Xu , Zijian Liang , Kai Niu
‹ Prev 1 8 9 10 Next ›