We propose a joint source and channel coding (JSCC) technique for wireless image transmission that does not rely on explicit codes for either compression or error correction; instead, it directly maps the image pixel values to the complex-valued channel input symbols. We parameterize the encoder and decoder functions b…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “channel coding”
The design of codes for communicating reliably over a statistically well defined channel is an important endeavor involving deep mathematical research and wide-ranging practical applications. In this work, we present the first family of codes obtained via deep learning, which significantly beats state-of-the-art codes …
DeepJSCC-f uses feedback to improve image transmission quality.
problem Improve image transmission quality in feedback channels.
method Autoencoder-based joint source-channel coding (DeepJSCC-f) exploiting feedback.
result Improves reconstruction quality for fixed-length or variable-length transmission.
While the channel capacity reflects a theoretical upper bound on the achievable information transmission rate in the limit of infinitely many bits, it does not characterise the information transfer of a given encoding routine with finitely many bits. In this note, we characterise the quality of a code (i. e. a given en…
Two new coding schemes improve the efficient communication of noisy data.
problem Efficient communication of noisy data in machine learning.
method Ordered Random Coding (ORC) and Hybrid Coding Scheme.
result Improved coding schemes over existing approaches.
Paper proposes IABF to improve NECST robustness.
problem Limited robustness of NECST learned coding networks.
method Infomax Adversarial-Bit-Flip (IABF) to improve stability and robustness.
result IABF achieves state-of-the-art performances on compression and error correction benchmarks.
For reliable transmission across a noisy communication channel, classical results from information theory show that it is asymptotically optimal to separate out the source and channel coding processes. However, this decomposition can fall short in the finite bit-length regime, as it requires non-trivial tuning of hand-…
Study neural communication systems with bandwidth-limited channels.
problem Reliable message transmission despite noisy channels.
method Jointly model compression and error correction with neural networks; introduce prior for missing information; use auxiliary latent variables.
result Joint neural communication systems outperform separate models under expected information loss.
End-to-end learning of codes for secure BPSK communication in Gaussian wiretap channel.
problem Secure communication in the presence of an adversary for BPSK modulation.
method Learning finite-length codes using deep neural networks (DNNs) with mutual information estimation.
result Learned codes achieve near-optimal security performance, as demonstrated by numerical results.
Paper uses RNNs to design LDPC codes for binary erasure channels.
problem Designing capacity-approaching LDPC codes for binary erasure channels.
method Model Density Evolution using RNNs to determine LDPC code coefficients and structure.
result NDE improves LDPC design performance and complexity compared to differential evolution.
A privacy-preserving method for transmitting data over a wiretap channel using generative networks.
problem Privacy protection in communication over a wiretap channel.
method Data-driven approach using variational autoencoder (VAE)-based joint source channel coding (JSCC).
result The approach provides high reconstruction quality at the receiver while confusing the eavesdropper about the latent sensitive attribute.
Two coding schemes designed for different settings are compared.
problem Comparing two coding schemes designed for different communication settings.
method Demonstrated through evaluation of Deepcode and Modulo-SK on the AWGN channel with coded feedback and unit delay.
result Deepcode outperforms Modulo-SK in settings with coded feedback and noisy feedback.
New algorithm for active learning from feedback coding.
problem Efficiently selecting examples for labeling in active machine learning.
method Formalized structural similarities between active learning and feedback channel coding, developed an optimal transport-based algorithm called Approximate Posterior Matching (APM).
result Learning performance comparable to existing methods at reduced computational cost.
Unsupervised Linear and Nonlinear Channel Equalization and Decoding using Variational Autoencoderscs.LG
A new approach for blind channel equalization and decoding, variational inference, and variational autoencoders (VAEs) in particular, is introduced. We first consider the reconstruction of uncoded data symbols transmitted over a noisy linear intersymbol interference (ISI) channel, with an unknown impulse response, with…
New scheme optimizes BMI through probabilistic and geometric shaping.
problem Optimizing bit-wise mutual information (BMI) for coded modulation.
method Joint optimization of BMI through probabilistic and geometric shaping.
result Joint optimization enables a continuum of constellation geometries and probability distributions.
The possibility of latency arbitrage in financial markets has led to the deployment of high-speed communication links between distant financial centers. These links are noisy and so there is a need for coding. In this paper, we develop a gametheoretic model of trading behavior where two traders compete to capture laten…
This paper considers a transmission control problem in network-coded two-way relay channels (NC-TWRC), where the relay buffers random symbol arrivals from two users, and the channels are assumed to be fading. The problem is modeled by a discounted infinite horizon Markov decision process (MDP). The objective is to find…
After being trained, classifiers must often operate on data that has been corrupted by noise. In this paper, we consider the impact of such noise on the features of binary classifiers. Inspired by tools for classifier robustness, we introduce the same classification probability (SCP) to measure the resulting distortion…
CN normalizes channels for better time series model performance.
problem Improper channel identification in time series models.
method Channel Normalization (CN) and its variants (ACN, PCN) using distinct affine transformations.
result Significant performance gains across various time series models.
A new algorithm reduces regret in multi-player bandits without collision info.
problem Decentralized multi-player multi-armed bandits with no collision info.
method EC-SIC algorithm using optimal error correction coding for reward statistics.
result Regret approaches that of centralized with collision info.
Sparse superposition codes were recently introduced by Barron and Joseph for reliable communication over the AWGN channel at rates approaching the channel capacity. The codebook is defined in terms of a Gaussian design matrix, and codewords are sparse linear combinations of columns of the matrix. In this paper, we prop…
This paper finds the noise threshold for learning Gaussian mixture models equals channel capacity.
problem Learning Gaussian mixture models with noisy data.
method Bayesian formulation with uniformly distributed centers on a sphere, analyzing the large system limit.
result The maximal noise level for which GMM learning is as easy as labeled observations is the channel capacity.
SOR-Mamba improves Mamba for robust time series forecasting by minimizing channel order bias.
problem Robust time series forecasting with Mamba's sequential order bias.
method SOR-Mamba incorporates regularization to minimize channel order discrepancy and introduces CCM for channel correlation preservation.
result SOR-Mamba enhances robustness to channel order and improves forecasting accuracy.
Inspired by recent advances in deep learning, we propose a novel iterative BP-CNN architecture for channel decoding under correlated noise. This architecture concatenates a trained convolutional neural network (CNN) with a standard belief-propagation (BP) decoder. The standard BP decoder is used to estimate the coded b…
Optical DNNet boosts accuracy with multiple frequency-channels.
problem Improving the accuracy of optical neural networks.
method Developed a novel optical diffractive deep neural network with multiple frequency-channels.
result Multiple frequency-channels significantly increase network accuracy.
BottleNet++: An End-to-End Approach for Feature Compression in Device-Edge Co-Inference Systemscs.LG
BottleNet++ compresses deep learning features for efficient mobile inference.
problem Balancing computation and communication in mobile devices with deep learning models.
method End-to-end architecture with encoder, non-trainable channel layer, and decoder.
result Achieves high compression ratio and bandwidth reduction with minimal accuracy loss.
In this paper, we use reinforcement learning to find effective decoding strategies for binary linear codes. We start by reviewing several iterative decoding algorithms that involve a decision-making process at each step, including bit-flipping (BF) decoding, residual belief propagation, and anchor decoding. We then ill…
Proposes GPCA module for channel attention in CNNs using Gaussian processes.
problem Improving performance in visual tasks through effective channel selection.
method Integrates Gaussian processes into channel attention mechanisms for probabilistic modeling of channel correlations.
result Demonstrates improved performance of GPCA module in end-to-end CNN training.
Enhances Transformer models for multivariate time series with dataset-specific channel masks.
problem Capturing channel dependency in multivariate time series models.
method Introduces partial channel dependence and channel masks to refine channel dependency in Transformers.
result Improves model performance across diverse tasks and datasets.
Relationships that exist between the classical, Shannon-type, and geometric-based approaches to sampling are investigated. Some aspects of coding and communication through a Gaussian channel are considered. In particular, a constructive method to determine the quantizing dimension in Zador's theorem is provided. A geom…
In this paper, we study the sum rate maximization for successive zero-forcing dirty-paper coding (SZFDPC) with per-antenna power constraint (PAPC). Although SZFDPC is a low-complexity alternative to the optimal dirty paper coding (DPC), efficient algorithms to compute its sum rate are still open problems especially und…
In this paper we consider the problem of transmitting a continuous alphabet discrete-time source over an AWGN channel. The design of good curves for this purpose relies on geometrical properties of spherical codes and projections of -dimensional lattices. We propose a constructive scheme based on a set of curves on …
A new distillation method transfers channel information from teacher to student.
problem Transfer knowledge from teacher to student with fewer parameters and calculations.
method Channel Distillation (CD) and Guided Knowledge Distillation (GKD) with loss decay.
result Achieved 27.68% top-1 error on ImageNet with ResNet18, outperforming state-of-the-art methods.
Constrained sequence codes have been widely used in modern communication and data storage systems. Sequences encoded with constrained sequence codes satisfy constraints imposed by the physical channel, hence enabling efficient and reliable transmission of coded symbols. Traditional encoding and decoding of constrained …
Truncated Singular Value Decomposition (SVD) calculates the closest rank- approximation of a given input matrix. Selecting the appropriate rank defines a critical model order choice in most applications of SVD. To obtain a principled cut-off criterion for the spectrum, we convert the underlying optimization prob…
Paper models and compresses wideband CSI feedback in FDD MIMO systems.
problem Fundamental limits of channel state information (CSI) feedback in FDD massive MIMO systems.
method Modeling CSI as a Gaussian-mixture source with latent geometry states, proposing Gaussian-mixture transform coding (GMTC).
result Near-optimal CSI compression achieved through state-adaptive transform coding without large neural encoders.
Tiled Squeeze-and-Excite improves channel attention with local spatial context.
problem Improving channel attention mechanisms in neural networks.
method Proposes tiled squeeze-and-excite (TSE) framework for channel attention.
result Local context of 7 rows or columns is sufficient for matching global context performance.
AverageTime uses simple averaging to enhance long-term time series forecasting.
problem Long-term time series forecasting with improved intra-sequence and cross-channel dependencies.
method Proposes AverageTime, a simple, efficient, and scalable forecasting model that reframes channel extraction as a stackable architecture.
result AverageTime surpasses state-of-the-art models in forecasting performance with near-linear complexity.
Proposes CNN-based analog CSI feedback for FDD MIMO-OFDM systems.
problem High CSI feedback overhead in FDD MIMO systems.
method AnalogDeepCMC: maps downlink CSI to uplink channel input, reconstructs channel estimate.
result Significantly improves downlink spectral efficiency and simplifies operation.
In this work, we introduce a deep learning-based polar code construction algorithm. The core idea is to represent the information/frozen bit indices of a polar code as a binary vector which can be interpreted as trainable weights of a neural network (NN). For this, we demonstrate how this binary vector can be relaxed t…
This paper models the crowdsourced labeling/classification problem as a sparsely encoded source coding problem, where each query answer, regarded as a code bit, is the XOR of a small number of labels, as source information bits. In this paper we leverage the connections between this problem and well-studied codes with …
Performance-aware channel pruning improves CNN on embedded GPUs.
problem Inefficient channel pruning on embedded GPUs leads to performance slowdowns.
method Evaluate higher-level libraries that analyze input characteristics for optimized code generation.
result Performance-aware pruning can achieve significant performance speedups, up to 10x.
This paper proposes a novel deep learning-based error correction coding scheme for AWGN channels under the constraint of one-bit quantization in the receivers. Specifically, it is first shown that the optimum error correction code that minimizes the probability of bit error can be obtained by perfectly training a speci…
Proposes a secure communication method independent of eavesdropper's decoder.
problem Lack of practical security constraints in existing methods.
method Dual MINE-based neural secure communications model.
result Security performance is not affected by eavesdropper's decoding means.
A central machine is interested in estimating the underlying structure of a sparse Gaussian Graphical Model (GGM) from datasets distributed across multiple local machines. The local machines can communicate with the central machine through a wireless multiple access channel. In this paper, we are interested in designin…
Coding theory is a central discipline underpinning wireline and wireless modems that are the workhorses of the information age. Progress in coding theory is largely driven by individual human ingenuity with sporadic breakthroughs over the past century. In this paper we study whether it is possible to automate the disco…
Vault as a credit instrumentq-fin.RM
Derives metrics for DeFi vaults, addressing credit risk.
problem Credit risk in DeFi lending vaults.
method Three-level decomposition of vault risk; six structural features identified.
result Estimation architecture for credit risk metrics.
Auto-Compressing Subset Pruning reduces model size for faster inference.
problem High parameter counts and slow inference times in semantic segmentation models.
method Learning a channel selection mechanism based on temperature annealing schedule.
result Significant compression of segmentation models with acceptable inference performance.