15 papers · ranked by Valyu relevance
Qicheng Zeng, Zhaojun Nan, Sheng Zhou, T. Aaron Gulliver
Coded computing is recognized as a promising solution to address the privacy leakage problem and the straggling effect in distributed computing. This technique leverages coding theory to recover computation tasks using results from a subset of workers. In this paper, we propose the adaptive privacy-preserving coded…
Yongcheng Yang, Yifei Huang, Xiaohuan Qin, Shenglian Lu + 3 more
'Yanlin Geng' 'Youlong Wu' 'Ling Liu'] Coded distributed computing (CDC) is a powerful approach to reduce the communication overhead in distributed computing frameworks by utilizing coding techniques. In this paper, we focus on the CDC problem in $(H,L)$-combination networks, where H APs act as intermediate pivots and…
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…
Ming Xiao, Mikael Skoglund, H. Vincent Poor, Onur Günlü + 2 more
'Rafael F. Schaefer' 'Holger Boche'] This article aims to give a comprehensive and rigorous review of the principles and recent development of coding for large-scale distributed machine learning (DML). With increasing data volumes and the pervasive deployment of sensors and computing machines, machine learning has…
Yuqi Jiang, Tianyi Mao, Jianyong Zhou, Qile Zhao + 4 more
Coded aperture X-ray computed tomography (CAXCT) measures coded X-ray projections to reconstruct the inner structure of an object. Coded apertures, which determine the point spread function, can be designed to improve the reconstruction quality, but most approaches are computationally expensive, leading to very small…
Jesús E. Garca, Verónica A. González-López, Gustavo H. Tasca, Karina Y. Yaginuma + 1 more
In the framework of coding theory, under the assumption of a Markov process $(X_{t})$ on a finite alphabet $A,$ the compressed representation of the data will be composed of a description of the model used to code the data and the encoded data. Given the model, the Huffman’s algorithm is optimal for the number of bits…
Longqian Huang, Ruichen Luo, Xu Liu, Xiang Hao
The goal of spectral imaging is to capture the spectral signature of a target. Traditional scanning method for spectral imaging suffers from large system volume and low image acquisition speed for large scenes. In contrast, computational spectral imaging methods have resorted to computation power for reduced system…
Mario Stipčević, Mateja Batelić
We present five novel or modified circuits intended for building a universal computer based on random pulse computing (RPC) paradigm, a biologically-inspired way of computation in which variable is represented by a frequency of a random pulse train (RPT) rather than by a logic state. For the first time we investigate…
Kun Tu, Dariusz Puchala, Jun Chen, Sadaf Salehkalaibar
In this paper, we address the problem of m-gram entropy variable-to-variable coding, extending the classical Huffman algorithm to the case of coding m-element (i.e., m-grams) sequences of symbols taken from the stream of input data for $m>1$. We propose a procedure to enable the determination of the frequencies of the…
Valéria G. Pedrosa, Max H. M. Costa, Sangun Park
The index coding problem consists of a system with a server and multiple receivers with different side information and demand sets, connected by a noiseless broadcast channel. The server knows the side information available to the receivers. The objective is to design an encoding scheme that enables all receivers to…
Bingrui Wang, Zhaopeng Xie, Xingang Zhang, Sedat Akleylek
Spectral shaping codes are modulation codes widely used in communication and data storage systems. This research enhances the algorithms employed in constructing spectral shaping codes for hardware implementation. We present a parallel scrambling calculation with a time complexity of O(1). Second, in the minimum…
Amir Matin, Xu Wang
Compressive coded rotating mirror (CCRM) camera is a novel high-speed imaging system that operates under amplitude optical encoding and frame sweeping modalities in a passive imaging mode that is capable of reconstructing 1400 frames from a single shot image acquisition and achieves the highest compression ratio of 368…
Claus Kestel, Lucas Johannsen, Norbert Wehn, Pingyi Fan + 4 more
'Zhanjie Song' 'Qi Chen' 'Suihua Cai' 'Gangtao Xin'] In digital baseband processing, the forward error correction (FEC) unit belongs to the most demanding components in terms of computational complexity and power consumption. Hence, efficient implementation of FEC decoders is crucial for next-generation mobile…
Kees Schouhamer Immink, Jos H. Weber, Tuan Thanh Nguyen, Kui Cai + 2 more
The design of low-complexity and efficient constrained codes has been a major research item for many years. This paper reports on a versatile method named concatenated constrained codes for designing efficient fixed-length constrained codes with small complexity. A concatenated constrained code comprises two (or more)…
Zoe Leyva-Acosta, Eduardo Acuña Yeomans, Francisco Hernandez-Quiroz, Boris Ryabko
'Boris Ryabko'] We study practical approximations of Kolmogorov prefix complexity (K) using IMP2, a high-level programming language. Our focus is on investigating the optimality of the interpreter for this language as the reference machine for the Coding Theorem Method (CTM). This method is designed to address…