Search · four archives
Search · four archives
17 papers · ranked by Valyu relevance
Junwei Zhou, HaoYun Xiao, Jianwen Xi, Qiuzhen Lin
—Distributed Arithmetic Coding (DAC) has emerged as a feasible solution to the Slepian-Wolf problem, particularly in scenarios with non-stationary sources and for data sequences with lengths ranging from small to medium. Due to the inherent decoding ambiguity in DAC, the number of candidate paths grows exponentially…
Yong Fang, Nan Yang, Jun Chen, Sadaf Salehkalaibar
As a typical symbol-wise solution of asymmetric Slepian-Wolf coding problem, Distributed Arithmetic Coding (DAC) non-linearly partitions source space into disjoint cosets with unequal sizes. The distribution of DAC coset cardinalities, named the Coset Cardinality Spectrum (CCS), plays an important role in both…
Yong Fang, Jechang Jeong
—Distributed arithmetic coding (DAC) has been shown to be effective for Slepian-Wolf coding, especially for short data blocks. In this letter, we propose to use the DAC to compress momery-correlated sources. More specifically, the correlation between sources is modeled as a hidden Markov process. Experimental results…
Jingjian Li, Wei Wang, Hong Mo, Mengting Zhao + 3 more
'Derya Malak' 'Song-Nam Hong'] A distributed arithmetic coding algorithm based on source symbol purging and using the context model is proposed to solve the asymmetric Slepian-Wolf problem. The proposed scheme is to make better use of both the correlation between adjacent symbols in the source sequence and the…
Marcin Pikus, Wen Xu
—A distribution matcher (DM) encodes a binary input data sequence into a sequence of symbols (codeword) with desired target probability distribution. The set of the output codewords constitutes a codebook (or code) of a DM. Constantcomposition DM (CCDM) uses arithmetic coding to efficiently encode data into codewords…
Sijie Li, Cheuk Ting Li
We consider a network coding problem where the destination wants to recover the sum of the signals (Gaussian random variables or random finite field elements) at all the source nodes, but the sum must be kept secret from an eavesdropper that can wiretap on a subset of edges. This setting arises naturally in sensor…
Amir Said
Entropy coding, compression, complexity This introduction to arithmetic coding is divided in two parts. The first explains how and why arithmetic coding works. We start presenting it in very general terms, so that its simplicity is not lost under layers of implementation details. Next, we show some of its basic…
Hosam M. Mahmoud, Hans Jakob Rivertz
We probabilistically analyze the performance of the arithmetic coding algorithm under a probability model for binary data in which a message is received by a coder from a source emitting independent equally distributed bits, with 1 occurring with probability p ∈ (0, 1) and 0 occurring with probability 1 − p.
M. F. Siddiqui, A. W. Reza, J. Kanesan, H. Ramiah
A wide interest has been observed to find a low power and area efficient hardware design of discrete cosine transform (DCT) algorithm. This research work proposed a novel Common Subexpression Elimination (CSE) based pipelined architecture for DCT, aimed at reproducing the cost metrics of power and area while…
Wei Wang, Jianhua Chen
In order to effectively improve the quality of side information in distributed video coding, we propose a side information generation scheme based on a coefficient matrix improvement model. The discrete cosine transform coefficient bands of the Wyner-Ziv frame at the encoder side are divided into entropy coding…
Bin Fan, Bin Tang, Zhihao Qu, Baoliu Ye + 1 more
In wireless distributed computing systems, worker nodes connect to a master node wirelessly and perform large-scale computational tasks that are parallelized across them. However, the common phenomenon of straggling (i.e., worker nodes often experience unpredictable slowdown during computation and communication) and…
Zijian Liang, Kai Niu, Jin Xu, Ping Zhang + 1 more
Recent semantic communication methods explore effective ways to expand the communication paradigm and improve the performance of communication systems. Nonetheless, a common problem with these methods is that the essence of semantics is not explicitly pointed out and directly utilized. A new epistemology suggests that…
Jia Lu, Ryan Tsoi, Nan Luo, Yuanchi Ha + 8 more
Dynamical systems often generate distinct outputs according to different initial conditions, and one can infer the corresponding input configuration given an output. This property captures the essence of information encoding and decoding. Here, we demonstrate the use of self-organized patterns, combined with machine…
Derya Malak, Mohammad Reza Deylam Salehi, Berksan Serbetci, Petros Elia + 2 more
'Petros Elia' 'Chintha Tellambura' 'Jun Chen'] The work here studies the communication cost for a multi-server multi-task distributed computation framework, as well as for a broad class of functions and data statistics. Considering the framework where a user seeks the computation of multiple complex (conceivably…
Ian Holmes
We describe a strategy for constructing codes for DNA-based information storage by serial composition of weighted finite-state transducers. The resulting state machines can integrate correction of substitution errors; synchronization by interleaving watermark and periodic marker signals; conversion from binary to…
Ceca Kraišniković, Wolfgang Maass, Robert Legenstein
The brain uses recurrent spiking neural networks for higher cognitive functions such as symbolic computations, in particular, mathematical computations. We review the current state of research on spike-based symbolic computations of this type. In addition, we present new results which show that surprisingly small…
Alex Shepherd, Emily Stone, Lucy L. W. Owen
Naturalistic cognition emerges from coordinated interactions among distributed brain systems operating across multiple representational scales. Characterizing this organization remains challenging because cognitively relevant information is embedded within high-dimensional neural activity. Here, we apply Multisubject…