English
Related papers

Related papers: Compressed Shaping: Concept and FPGA Demonstration

200 papers

An unsupervised learning approach based on expectation maximization is proposed to obtain the parameters of a soft decision forward error correction decoding metric for probabilistic shaping. The algorithm depends only on the channel…

Information Theory · Computer Science 2018-06-27 Fabian Steiner , Patrick Schulte , Georg Böcherer

The security of private communication is increasingly at risk due to widespread surveillance. Steganography, a technique for embedding secret messages within innocuous carriers, enables covert communication over monitored channels. Provably…

Cryptography and Security · Computer Science 2026-02-16 Kaiyi Pang , Minhao Bai

Emerging sonography techniques often require increasing the number of transducer elements involved in the imaging process. Consequently, larger amounts of data must be acquired and processed. The significant growth in the amounts of data…

Information Theory · Computer Science 2015-06-04 Noam Wagner , Yonina C. Eldar , Zvi Friedman

Probabilistic Circuits (PCs) are a promising avenue for probabilistic modeling. They combine advantages of probabilistic graphical models (PGMs) with those of neural networks (NNs). Crucially, however, they are tractable probabilistic…

Machine Learning · Computer Science 2021-06-07 Anji Liu , Guy Van den Broeck

Sorted data is usually easier to compress than unsorted permutations of the same data. This motivates a simple compression scheme: specify the sorted permutation of the data along with a representation of the sorted data compressed…

Data Structures and Algorithms · Computer Science 2014-11-24 Oscar Stiffelman

Unsourced random access is a novel communication paradigm designed for handling a large number of uncoordinated users that sporadically transmit very short messages. Under this model, coded compressed sensing (CCS) has emerged as a…

Information Theory · Computer Science 2021-07-22 Jamison R. Ebert , Vamsi K. Amalladinne , Stefano Rini , Jean-Francois Chamberland , Krishna R. Narayanan

The encoder and decoder for lossy data compression of binary memoryless sources are developed on the basis of a specific-type nonmonotonic perceptron. Statistical mechanical analysis indicates that the potential ability of the…

Information Theory · Computer Science 2009-11-11 Tadaaki Hosaka , Yoshiyuki Kabashima

In this work we explore possibilities for coding and decoding tailor-made for mean squared error evaluation of error in contexts such as image transmission. To do so, we introduce a loss function that expresses the overall performance of a…

Information Theory · Computer Science 2014-11-06 Marcelo Firer , Luciano Panek , Jerry Anderson Pinheiro

Compressive sensing (CS) is a sampling technique designed for reducing the complexity of sparse data acquisition. One of the major obstacles for practical deployment of CS techniques is the signal reconstruction time and the high storage…

Information Theory · Computer Science 2011-07-12 Wei Dai , Olgica Milenkovic , Hoa Vin Pham

Recent advances in convolutional neural networks(CNNs) usually come with the expense of excessive computational overhead and memory footprint. Network compression aims to alleviate this issue by training compact models with comparable…

Computer Vision and Pattern Recognition · Computer Science 2021-05-17 Xin-Yu Zhang , Kai Zhao , Taihong Xiao , Ming-Ming Cheng , Ming-Hsuan Yang

Spectrum resources management of growing demands is a challenging problem and Cognitive Radio (CR) known to be capable of improving the spectrum utilization. Recently, Power Spectral Density (PSD) map is defined to enable the CR to reuse…

Information Theory · Computer Science 2017-03-17 Mohammad Eslami , Seyed Hamid Safavi , Farah Torkamani-Azar , Esfandiar Mehrshahi

Modern compression algorithms exploit complex structures that are present in signals to describe them very efficiently. On the other hand, the field of compressed sensing is built upon the observation that "structured" signals can be…

Information Theory · Computer Science 2016-01-08 Farideh Ebrahim Rezagah , Shirin Jalali , Elza Erkip , H. Vincent Poor

As state of the art neural networks (NNs) continue to grow in size, their resource-efficient implementation becomes ever more important. In this paper, we introduce a compression scheme that reduces the number of computations required for…

Machine Learning · Computer Science 2025-04-25 Hans Rosenberger , Rodrigo Fischer , Johanna S. Fröhlich , Ali Bereyhi , Ralf R. Müller

Probabilistic constellation shaping has been used in long-haul optically amplified coherent systems for its capability to approach the Shannon limit and realize fine rate granularity. The availability of high-bandwidth optical-electronic…

Signal Processing · Electrical Eng. & Systems 2023-03-31 Md Sabbir-Bin Hossain , Georg Bocherer , Talha Rahman , Tom Wettlin , Nebojsa Stojanovic , Stefano Calabro , Stephan Pachnicke

We consider the problem of joint source and channel coding of structured data such as natural language over a noisy channel. The typical approach to this problem in both theory and practice involves performing source coding to first…

Information Theory · Computer Science 2018-02-21 Nariman Farsad , Milind Rao , Andrea Goldsmith

Limitations on bandwidth and power consumption impose strict bounds on data rates of diagnostic imaging systems. Consequently, the design of suitable (i.e. task- and data-aware) compression and reconstruction techniques has attracted…

Image and Video Processing · Electrical Eng. & Systems 2021-01-26 Iris A. M. Huijben , Bastiaan S. Veeling , Kees Janse , Massimo Mischi , Ruud J. G. van Sloun

Many common types of data can be represented as functions that map coordinates to signal values, such as pixel locations to RGB values in the case of an image. Based on this view, data can be compressed by overfitting a compact neural…

Machine Learning · Computer Science 2023-10-31 Zongyu Guo , Gergely Flamich , Jiajun He , Zhibo Chen , José Miguel Hernández-Lobato

Message passing on factor graphs is a powerful framework for probabilistic inference, which finds important applications in various scientific domains. The most wide-spread message passing scheme is the sum-product algorithm (SPA) which…

Machine Learning · Computer Science 2023-06-06 Luca Schmid , Joshua Brenk , Laurent Schmalen

We describe a general framework -- compressive statistical learning -- for resource-efficient large-scale learning: the training collection is compressed in one pass into a low-dimensional sketch (a vector of random empirical generalized…

Machine Learning · Statistics 2021-06-23 Rémi Gribonval , Gilles Blanchard , Nicolas Keriven , Yann Traonmilin

Noise shaping refers to an analog-to-digital conversion methodology in which quantization error is arranged to lie mostly outside the signal spectrum by means of oversampling and feedback. Recently it has been successfully applied to more…

Information Theory · Computer Science 2015-02-23 Evan Chou , C. Sinan Güntürk , Felix Krahmer , Rayan Saab , Özgür Yılmaz
‹ Prev 1 4 5 6 7 8 10 Next ›