arXiv cs/07010792007-01-11cs.ITcs.DSmath.IT

Practical Binary Adaptive Block Coder

Yuriy A. Reznik

英文摘要：

This paper describes design of a low-complexity algorithm for adaptive encoding/ decoding of binary sequences produced by memoryless sources. The algorithm implements universal block codes constructed for a set of contexts identified by the numbers of non-zero bits in previous bits in a sequence. We derive a precise formula for asymptotic redundancy of such codes, which refines previous well-known estimate by Krichevsky and Trofimov, and provide experimental verification of this result. In our experimental study we also compare our implementation with existing binary adaptive encoders, such as JBIG's Q-coder, and MPEG AVC (ITU-T H.264)'s CABAC algorithms.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Worst-Case Optimal Adaptive Prefix Coding

A common complaint about adaptive prefix coding is that it is much slower than static prefix coding. Karpinski and Nekrich recently took an important step towards resolving this: they gave an adaptive Shannon coding algorithm that encodes each character in (O (1)) amortized time and decodes it in (O (\log H)) amortized time, where $H$ is the empirical entropy of the input string $s$. For comparison, Gagie's adaptive Shannon coder and both Knuth's and Vitter's adaptive Huffman coders all use (Θ(H)) amortized time for each character. In this paper we give an adaptive Shannon coder that both enco…

2008-12-17cs.ITmath.IT

感知音频编码的协同自适应熵建模与率失真最优比特分配

Co-Adaptive Entropy Modeling and Rate-Distortion-Optimal Bit Allocation for Perceptual Audio Coding

Stanford University（斯坦福大学）

该研究提出一种无模型边信息的感知音频编码器，通过协同自适应熵建模与率失真最优比特分配，可降低感知失真，经MUSHRA测试验证了其性能排序。

2026-10-14cs.ITeess.ASmath.IT

集合塑造理论在通用编码中的应用

Set Shaping Theory Applied to Universal Coding

针对均匀生成序列，集合塑造理论通过可逆变换将序列长度增加1，系统性地降低了通用编码长度，优于Krichevsky-Trofimov基线，并适用于多种编码架构。

2026-06-16cs.ITmath.IT

自适应编码中训练数据的最优加权

Optimal Weighting of Training Data in Adaptive Coding

Massachusetts Institute of Technology（麻省理工学院）

针对自适应编码中训练数据与源不匹配的问题，提出通过缩放KT估计器计数的最优加权，推导出冗余最小化权重，并给出三种实现方式，实验表明可显著降低冗余。

2026-09-24cs.ITmath.IT

A Practical Approach to Lossy Joint Source-Channel Coding

This work is devoted to practical joint source channel coding. Although the proposed approach has more general scope, for the sake of clarity we focus on a specific application example, namely, the transmission of digital images over noisy binary-input output-symmetric channels. The basic building blocks of most state-of the art source coders are: 1) a linear transformation; 2) scalar quantization of the transform coefficients; 3) probability modeling of the sequence of quantization indices; 4) an entropy coding stage. We identify the weakness of the conventional separated source-channel codin…

2007-02-12cs.ITmath.IT

Proportionate Adaptive Filtering for Block Sparse System Identification

In this paper, a new family of proportionate normalized least mean square (PNLMS) adaptive algorithms that improve the performance of identifying block-sparse systems is proposed. The main proposed algorithm, called block-sparse PNLMS (BS-PNLMS), is based on the optimization of a mixed l2,1 norm of the adaptive filter coefficients. It is demonstrated that both the NLMS and the traditional PNLMS are special cases of BS-PNLMS. Meanwhile, a block-sparse improved PNLMS (BS-IPNLMS) is also derived for both sparse and dispersive impulse responses. Simulation results demonstrate that the proposed BS-…

2015-11-29cs.ITmath.IT

更多相关论文收起更多论文

DeepCABAC: Context-adaptive binary arithmetic coding for deep neural network compression

Fraunhofer Heinrich-Hertz Institut（弗劳恩霍夫海因里希·赫兹研究所）

We present DeepCABAC, a novel context-adaptive binary arithmetic coder for compressing deep neural networks. It quantizes each weight parameter by minimizing a weighted rate-distortion function, which implicitly takes the impact of quantization on to the accuracy of the network into account. Subsequently, it compresses the quantized values into a bitstream representation with minimal redundancies. We show that DeepCABAC is able to reach very high compression ratios across a wide set of different network architectures and datasets. For instance, we are able to compress by x63.6 the VGG16 ImageN…

2019-05-15cs.AIcs.ITcs.LG

Block-Sparsity-Induced Adaptive Filter for Multi-Clustering System Identification

In order to improve the performance of least mean square (LMS)-based adaptive filtering for identifying block-sparse systems, a new adaptive algorithm called block-sparse LMS (BS-LMS) is proposed in this paper. The basis of the proposed algorithm is to insert a penalty of block-sparsity, which is a mixed \$l_{2, 0}\$ norm of adaptive tap-weights with equal group partition sizes, into the cost function of traditional LMS algorithm. To describe a block-sparse system response, we first propose a Markov-Gaussian model, which can generate a kind of system responses of arbitrary average sparsity and…

2014-10-19cs.ITmath.IT

Blind Adaptive MIMO Receivers for Space-Time Block-Coded DS-CDMA Systems in Multipath Channels Using the Constant Modulus Criterion

We propose blind adaptive multi-input multi-output (MIMO) linear receivers for DS-CDMA systems using multiple transmit antennas and space-time block codes (STBC) in multipath channels. A space-time code-constrained constant modulus (CCM) design criterion based on constrained optimization techniques is considered and recursive least squares (RLS) adaptive algorithms are developed for estimating the parameters of the linear receivers. A blind space-time channel estimation method for MIMO DS-CDMA systems with STBC based on a subspace approach is also proposed along with an efficient RLS algorithm…

2012-12-29cs.ITmath.IT

Blind Adaptive MIMO Receivers for CDMA Systems with Space-Time Block-Codes and Low-Cost Algorithms

In this paper we present low-complexity blind multi-input multi-output (MIMO) adaptive linear multiuser receivers for direct sequence code division multiple access (DS-CDMA) systems using multiple transmit antennas and space-time block codes (STBC) in multipath channels. A space-time code-constrained constant modulus (CCM) design criterion based on constrained optimization techniques and low-complexity stochastic gradient (SG) adaptive algorithms are developed for estimating the parameters of the space-time linear receivers. The receivers are designed by exploiting the unique structure imposed…

2014-10-21cs.ITmath.IT

面向自适应变换编码的基于图像块GMRF建模的KLT矩阵量化

Quantization of KLT Matrices via GMRF Modeling of Image Blocks for Adaptive Transform Coding

针对图像前向自适应变换编码的码本构建难题，提出基于带非对称Neumann边界条件的GMRF模型的KLT矩阵量化方法，将高维正交矩阵量化简化为低维向量量化，还提出最大化高码率变换编码增益的GMRF参数估计方法，并探究其在可变块大小自适应变换编码中的应用。

2024-06-24cs.ITmath.IT

Mutual Information for the Stochastic Block Model by the Adaptive Interpolation Method

We rigorously derive a single-letter variational expression for the mutual information of the asymmetric two-groups stochastic block model in the dense graph regime. Existing proofs in the literature are indirect, as they involve mapping the model to a rank-one matrix estimation problem whose mutual information is then determined by a combination of methods (e.g., interpolation, cavity, algorithmic, spatial coupling). In this contribution we provide a self-contained direct method using only the recently introduced adaptive interpolation method.

2019-07-16cond-mat.dis-nncs.ITmath.IT

Delay-limited Source and Channel Coding of Quasi-Stationary Sources over Block Fading Channels: Design and Scaling Laws

In this paper, delay-limited transmission of quasi-stationary sources over block fading channels are considered. Considering distortion outage probability as the performance measure, two source and channel coding schemes with power adaptive transmission are presented. The first one is optimized for fixed rate transmission, and hence enjoys simplicity of implementation. The second one is a high performance scheme, which also benefits from optimized rate adaptation with respect to source and channel states. In high SNR regime, the performance scaling laws in terms of outage distortion exponent a…

2012-02-28cs.ITmath.IT

面向自适应变换编码的正交矩阵码本设计

Orthonormal Matrix Codebook Design for Adaptive Transform Coding

该研究提出一种基于分块平稳模型、结合块坐标下降与Stiefel流形映射的正交变换矩阵码本设计算法，可高效求解带正交约束的优化问题，在H265帧间预测残差上的实验验证了其优于标准DCT非自适应编码。

2022-02-24cs.ITmath.IT

Intrablock Interleaving for Batched Network Coding with Blockwise Adaptive Recoding

Batched network coding (BNC) is a low-complexity solution to network transmission in multi-hop packet networks with packet loss. BNC encodes the source data into batches of packets. As a network coding scheme, the intermediate nodes perform recoding on the received packets belonging to the same batch instead of just forwarding them. A recoding scheme that may generate more recoded packets for batches of a higher rank is also called adaptive recoding. Meanwhile, in order to combat burst packet loss, the transmission of a block of batches can be interleaved. Stream interleaving studied in litera…

2021-09-15cs.ITcs.NImath.IT

Adaptive Path Interpolation for Sparse Systems: Application to a Simple Censored Block Model

Recently a new adaptive path interpolation method has been developed as a simple and versatile scheme to calculate exactly the asymptotic mutual information of Bayesian inference problems defined on dense factor graphs. These include random linear and generalized estimation, sparse superposition codes, or low-rank matrix and tensor estimation. For all these systems, the adaptive interpolation method directly proves that the replica symmetric prediction is exact, in a simple and unified manner. When the underlying factor graph of the inference problem is sparse the replica prediction is conside…

2019-07-18cond-mat.dis-nncs.ITmath-ph