English
Related papers

Related papers: Asymmetrical two-level scalar quantizer with exten…

200 papers

We perform an extended numerical search for practical fermion-to-qubit encodings with error correcting properties. Ideally, encodings should strike a balance between a number of the seemingly incompatible attributes, such as having a high…

Quantum Physics · Physics 2024-05-29 Fedor Simkovic , Martin Leib , Francisco Revson F. Pereira

We introduce a new variant of variable-length source coding for sending a source over two parallel channels, one of which is costly and the other free. We give a complete solution to this problem. Next, we relate the problem to the number…

Data Structures and Algorithms · Computer Science 2026-01-30 Niloufar Ahmadypour , Amin Gohari

In this paper, we consider the problem of robust joint source-channel coding over an additive white Gaussian noise channel. We propose a new scheme which achieves the optimal slope of the signal-to-distortion (SDR) curve (unlike the…

Information Theory · Computer Science 2008-05-28 Mahmoud Taherzadeh , Amir K. Khandani

Finding optimal message quantization is a key requirement for low complexity belief propagation (BP) decoding. To this end, we propose a floating-point surrogate model that imitates quantization effects as additions of uniform noise, whose…

Information Theory · Computer Science 2022-08-11 Marvin Geiselhart , Ahmed Elkelesh , Jannis Clausius , Fei Liang , Wen Xu , Jing Liang , Stephan ten Brink

The imperfections of a receiver's detector affect the performance of two-way continuous-variable quantum key distribution protocols and are difficult to adjust in practical situations. We propose a method to improve the performance of…

Quantum Physics · Physics 2014-02-24 Yi-Chen Zhang , Zhengyu Li , Christian Weedbrook , Song Yu , Wanyi Gu , Maozhu Sun , Xiang Peng , Hong Guo

This paper presents an efficient quadratic programming (QP) decoder via the alternating direction method of multipliers (ADMM) technique, called QP-ADMM, for binary low-density parity-check (LDPC) codes. Its main contents are as follows:…

Information Theory · Computer Science 2020-02-19 Jing Bai , Yongchao Wang , Qingjiang Shi

In this paper, we propose a lattice-based robust distributed source coding system for two correlated sources and provide a detailed performance analysis under the high resolution assumption. It is shown, among other things, that, in the…

Information Theory · Computer Science 2018-10-04 Dania Elzouki , Sorina Dumitrescu , Jun Chen

In this work, a deep learning-based method for log-likelihood ratio (LLR) lossy compression and quantization is proposed, with emphasis on a single-input single-output uncorrelated fading communication setting. A deep autoencoder network is…

Machine Learning · Computer Science 2021-05-11 Marius Arvinte , Ahmed H. Tewfik , Sriram Vishwanath

In this paper we study the topic of signal restoration using complexity regularization, quantifying the compression bit-cost of the signal estimate. While complexity-regularized restoration is an established concept, solid practical methods…

Information Theory · Computer Science 2018-11-14 Yehuda Dar , Michael Elad , Alfred M. Bruckstein

A loss-less compression technique is proposed which uses a variable length Region formation technique to divide the input file into a number of variable length regions. Huffman codes are obtained for entire file after formation of regions.…

Information Theory · Computer Science 2014-03-04 Utpal Nandi , Jyotsna Kumar Mandal

We study the computational phase transition in a multi-frequency group synchronization problem, where pairwise relative measurements of group elements are observed across multiple frequency channels and corrupted by Gaussian noise. Using…

Statistics Theory · Mathematics 2026-01-29 Zhangsong Li

Based on the problem of quantum data compression in a lossless way, we present here an operational interpretation for the family of quantum R\'enyi entropies. In order to do this, we appeal to a very general quantum encoding scheme that…

Quantum Physics · Physics 2017-10-05 G. Bellomo , G. M. Bosyk , F. Holik , S. Zozor

Utilizing low-resolution analog-to-digital converters (ADCs) in uplink massive multiple-input multiple-output (MIMO) systems is a practical solution to decrease power consumption. The performance gap between the low and high-resolution…

Information Theory · Computer Science 2023-10-05 Gökhan Yılmaz , Ali Özgür Yılmaz

This paper explores the combination of neural network quantization and entropy coding for memory footprint minimization. Edge deployment of quantized models is hampered by the harsh Pareto frontier of the accuracy-to-bitwidth tradeoff,…

Machine Learning · Computer Science 2024-06-11 C. Metz , O. Bichler , A. Dupret

A number of engineering and scientific problems require representing and manipulating probability distributions over large alphabets, which we may think of as long vectors of reals summing to $1$. In some cases it is required to represent…

Information Theory · Computer Science 2023-10-27 Aviv Adler , Jennifer Tang , Yury Polyanskiy

Quantization is a widely used compression method that effectively reduces redundancies in over-parameterized neural networks. However, existing quantization techniques for deep neural networks often lack a comprehensive error analysis due…

Machine Learning · Computer Science 2023-09-21 Jinjie Zhang , Rayan Saab

Sample-based quantum diagonalization (SQD) is an algorithm for hybrid quantum-classical molecular simulation that has been of broad interest for application with noisy intermediate scale quantum (NISQ) devices. However, SQD does not always…

Quantum Physics · Physics 2025-12-05 L. Andrew Wray , Cheng-Ju Lin , Vincent Su , Hrant Gharibyan

Nonlinear Kalman Filters are powerful and widely-used techniques when trying to estimate the hidden state of a stochastic nonlinear dynamic system. In this paper, we extend the Smart Sampling Kalman Filter (S2KF) with a new point symmetric…

Systems and Control · Computer Science 2015-06-11 Jannik Steinbring , Martin Pander , Uwe D. Hanebeck

This paper finds new tight finite-blocklength bounds for the best achievable lossy joint source-channel code rate, and demonstrates that joint source-channel code design brings considerable performance advantage over a separate one in the…

Information Theory · Computer Science 2014-02-05 Victoria Kostina , Sergio Verdú

Second order asymptotics of fixed-length source coding and intrinsic randomness is discussed with a constant error constraint. There was a difference between optimal rates of fixed-length source coding and intrinsic randomness, which never…

Information Theory · Computer Science 2010-01-23 Masahito Hayashi