English
Related papers

Related papers: Optimal sparse CDMA detection at high load

200 papers

Batched sparse (BATS) code is a network coding solution for multi-hop wireless networks with packet loss. Achieving a close-to-optimal rate relies on an optimal degree distribution. Technical challenges arise from the sensitivity of this…

Information Theory · Computer Science 2024-05-15 Hoover H. F. Yin , Jie Wang , Sherman S. M. Chow

We study the maximum likelihood problem for the blind estimation of massive mmWave MIMO channels while taking into account their underlying sparse structure, the temporal shifts across antennas in the broadband regime, and ultimately…

Information Theory · Computer Science 2018-05-23 Amine Mezghani , A. Lee Swindlehurst

Multicarrier CDMA is a multiple access scheme in which modulated QAM symbols are spread over OFDMA tones by using a generally complex spreading sequence. Effectively, a QAM symbol is repeated over multiple tones. Low density signature (LDS)…

Information Theory · Computer Science 2016-11-18 Mahmoud Taherzadeh , Hosein Nikopour , Alireza Bayesteh , Hadi Baligh

A popular approach within the signal processing and machine learning communities consists in modelling signals as sparse linear combinations of atoms selected from a learned dictionary. While this paradigm has led to numerous empirical…

Machine Learning · Statistics 2012-10-03 Rodolphe Jenatton , Rémi Gribonval , Francis Bach

We investigate theoretically the efficiency of deep-space optical communication in the presence of background noise. With decreasing average signal power spectral density, a scaling gap opens up between optimized simple-decoded pulse…

Quantum Physics · Physics 2018-02-20 Marcin Jarzyna , Wojciech Zwoliński , Michał Jachura , Konrad Banaszek

In the first part of the series papers, we set out to answer the following question: given specific restrictions on a set of samplers, what kind of signal can be uniquely represented by the corresponding samples attained, as the foundation…

Information Theory · Computer Science 2021-08-25 Hanshen Xiao , Yaowen Zhang , Guoqiang Xiao

This paper studies the affine frequency division multiplexing (AFDM)-empowered sparse code multiple access (SCMA) system, referred to as AFDM-SCMA, for supporting massive connectivity in high-mobility environments. First, by placing the…

Information Theory · Computer Science 2024-06-12 Qu Luo , Pei Xiao , Zilong Liu , Ziwei Wan , Thomos Nikolaos , Zhen Gao , Ziming He

Broadband wireless channels usually have the sparse nature. Based on the assumption of Gaussian noise model, adaptive filtering algorithms for reconstruction sparse channels were proposed to take advantage of channel sparsity. However,…

Information Theory · Computer Science 2015-02-20 Guan Gui , Li Xu , Wentao Ma , Badong Chen

Recent results in compressed sensing showed that the optimal subsampling strategy should take into account the sparsity pattern of the signal at hand. This oracle-like knowledge, even though desirable, nevertheless remains elusive in most…

Information Theory · Computer Science 2023-06-28 Simon Ruetz

A popular approach within the signal processing and machine learning communities consists in modelling signals as sparse linear combinations of atoms selected from a learned dictionary. While this paradigm has led to numerous empirical…

Machine Learning · Computer Science 2015-08-25 Rémi Gribonval , Rodolphe Jenatton , Francis Bach

This paper investigates the fundamental limits for detecting a high-dimensional sparse matrix contaminated by white Gaussian noise from both the statistical and computational perspectives. We consider $p\times p$ matrices whose rows and…

Statistics Theory · Mathematics 2018-01-03 T. Tony Cai , Yihong Wu

The frequency selectivity of wireless communication channels can be characterized by the delay spread Ds of the channel impulse response. If the delay spread is small compared to the bandwidth W of the input signal, that is, Ds*W…

Information Theory · Computer Science 2008-08-07 Georg Böcherer , Daniel Bielefeld

Random linear network coding (RLNC) in theory achieves the max-flow capacity of multicast networks, at the cost of high decoding complexity. To improve the performance-complexity tradeoff, we consider the design of sparse network codes. A…

Information Theory · Computer Science 2016-04-20 Ye Li , Wai-Yip Chan , Steven D. Blostein

Initial ranging constitutes a part of the synchronization procedure employed by the wireless communication standards. This allows the base station (BS) to detect the subscriber stations (SS) that are willing to commence communication. In…

Information Theory · Computer Science 2015-05-25 Md Mashud Hyder , Kaushik Mahata

Massive MTC support is an important future market segment, but not yet efficiently supported in cellular systems. In this paper we follow-up on recent concepts combining advanced MAC protocols with Compressed Sensing (CS) based multiuser…

Information Theory · Computer Science 2017-07-04 Gerhard Wunder , Cedomir Stefanovic , Petar Popovski , Lars Thiele

Spectrum sensing enables cognitive radio systems to detect unused portions of the radio spectrum and then use them while avoiding interferences to the primary users. Energy detection is one of the most used techniques for spectrum sensing…

Signal Processing · Electrical Eng. & Systems 2018-03-15 Youness Arjoune

Sparse coding strategies have been lauded for their parsimonious representations of data that leverage low dimensional structure. However, inference of these codes typically relies on an optimization procedure with poor computational…

Machine Learning · Computer Science 2022-09-02 Kion Fallah , Christopher J. Rozell

To cope with the increasing demand of wireless communication services multi-carrier systems are being used. Radio resources are very limited and efficient usages of these resources are inevitable to get optimum performance of the system.…

Networking and Internet Architecture · Computer Science 2011-09-13 Sheikh Shanawaz Mostafa , Khondker Jahid Reza , Gazi Maniur Rashid , Muhammad Moinuddin , Md. Ziaul Amin , Abdullah Al Nahid

The minimum energy, and, more generally, the minimum cost, to transmit one bit of information has been recently derived for bursty communication when information is available infrequently at random times at the transmitter. This result…

Information Theory · Computer Science 2013-03-25 Aslan Tchamkerten , Venkat Chandar , Giuseppe Caire

We consider the problem of detecting the overlap between a pair of short fragments sampled in random locations from an exponentially longer sequence, via their possibly noisy reads. We consider a noiseless setting, in which the reads are…

Information Theory · Computer Science 2025-02-20 Nir Luria , Nir Weinberger