English
Related papers

Related papers: LR-aided MMSE lattice decoding is DMT optimal for …

200 papers

Reed-Muller (RM) codes exhibit good performance under maximum-likelihood (ML) decoding due to their highly-symmetric structure. In this paper, we explore the question of whether the code symmetry of RM codes can also be exploited to achieve…

Information Theory · Computer Science 2018-04-30 Elia Santi , Christian Häger , Henry D. Pfister

We introduce harmonization, an ensembling method that combines several "noisy" decoders to generate highly accurate decoding predictions. Harmonized ensembles of MWPM-based decoders achieve lower logical error rates than their individual…

Quantum Physics · Physics 2024-03-18 Noah Shutty , Michael Newman , Benjamin Villalonga

In this paper, the performance of decision directed (DD) maximum likelihood (ML) channel tracking algorithm is analyzed. The ML channel tracking algorithm presents efficient performance especially in the decision directed mode of the…

Signal Processing · Electrical Eng. & Systems 2018-03-13 Ebrahim Karami

Recent studies have revealed a number of pathologies of neural machine translation (NMT) systems. Hypotheses explaining these mostly suggest there is something fundamentally wrong with NMT as a model or its training algorithm, maximum…

Computation and Language · Computer Science 2020-10-29 Bryan Eikema , Wilker Aziz

We propose a novel optimization-based decoding algorithm for LDPC-coded massive MIMO channels. The proposed decoding algorithm is based on a proximal gradient method for solving an approximate maximum a posteriori (MAP) decoding problem.…

Information Theory · Computer Science 2021-02-11 Tadashi Wadayama , Satoshi Takabe

We consider the sequential transmission of a stream of messages over a block-fading multi-input-multi-output (MIMO) channel. A new message arrives at the beginning of each coherence block, and the decoder is required to output each message…

Information Theory · Computer Science 2014-08-13 Ashish Khisti , Stark Draper

We establish the optimal diversity-multiplexing (DM) tradeoff of coherent time, frequency and time-frequency selective-fading MIMO channels and provide a code design criterion for DM-tradeoff optimality. Our results are based on the…

Information Theory · Computer Science 2007-07-13 Pedro Coronel , Helmut Bölcskei

The performance of maximum-likelihood (ML) decoding on the binary erasure channel for finite-length low-density parity-check (LDPC) codes from two random ensembles is studied. The theoretical average spectrum of the Gallager ensemble is…

Information Theory · Computer Science 2018-11-21 Irina E. Bocharova , Boris D. Kudryashov , Vitaly Skachek , Eirik Rosnes , Øyvind Ytrehus

The field of neural machine translation (NMT) has changed with the advent of large language models (LLMs). Much of the recent emphasis in natural language processing (NLP) has been on modeling machine translation and many other problems…

Computation and Language · Computer Science 2025-06-03 Yingfeng Luo , Tong Zheng , Yongyu Mu , Bei Li , Qinghong Zhang , Yongqi Gao , Ziqiang Xu , Peinan Feng , Xiaoqian Liu , Tong Xiao , Jingbo Zhu

In this paper, we show that nested lattice codes achieve the capacity of arbitrary channels with or without non-casual state information at the transmitter. We also show that nested lattice codes are optimal for source coding with or…

Information Theory · Computer Science 2012-03-20 Aria G. Sahebi , S. Sandeep Pradhan

For ergodic fading, a lattice coding and decoding strategy is proposed and its performance is analyzed for the single-input single-output (SISO) and multiple-input multiple-output (MIMO) point-to-point channel as well as the multiple-access…

Information Theory · Computer Science 2017-02-28 Ahmed Hindy , Aria Nosratinia

This work develops a rate-distortion-based approach to stochastic Chase decoding of algebraic codes over binary memoryless symmetric (BMS) channels, replacing the heuristics traditionally used to determine flip probabilities with…

Information Theory · Computer Science 2026-05-20 Amit Berman , Ariel Doubchak , Uri Erez , Tal Philosof , Ilya Shapir

Secured opportunistic Medium Access Control (MAC) and complexity reduction in channel estimation are proposed in the Cross layer design Cognitive Radio Networks deploying the secured dynamic channel allocation from the endorsed channel…

Networking and Internet Architecture · Computer Science 2012-03-19 Niraj Shakhakarmi

Lattice reduction is a popular preprocessing strategy in multiple-input multiple-output (MIMO) detection. In a quest for developing a low-complexity reduction algorithm for large-scale problems, this paper investigates a new framework…

Information Theory · Computer Science 2019-12-16 Shanxiang Lyu , Jinming Wen , Jian Weng , Cong Ling

Large language models (LLMs) have achieved remarkable success across diverse tasks, yet their inference processes are hindered by substantial time and energy demands due to single-token generation at each decoding step. While previous…

Computation and Language · Computer Science 2025-04-11 Zongyue Qin , Ziniu Hu , Zifan He , Neha Prakriya , Jason Cong , Yizhou Sun

We establish the optimal diversity-multiplexing (DM) tradeoff of coherent selective-fading multiple-access multiple-input multiple-output (MIMO) channels and provide corresponding code design criteria. As a byproduct, on the conceptual…

Information Theory · Computer Science 2008-05-02 Pedro Coronel , Markus Gärtner , Helmut Bölcskei

In this study we consider rateless coding over discrete memoryless channels (DMC) with feedback. Unlike traditional fixed-rate codes, in rateless codes each codeword is infinitely long, and the decoding time depends on the confidence level…

Information Theory · Computer Science 2012-01-30 Navot Blits

This work considers optimizing LDPC codes in the physical-layer network coded two-way relay channel using noncoherent FSK modulation. The error-rate performance of channel decoding at the relay node during the multiple-access phase was…

Information Theory · Computer Science 2015-02-23 Terry Ferrett , Matthew C. Valenti

Conventional decoding algorithms for polar codes strive to balance achievable performance and computational complexity in classical computing. While maximum likelihood (ML) decoding guarantees optimal performance, its NP-hard nature makes…

Quantum Physics · Physics 2024-11-08 Shintaro Fujiwara , Naoki Ishikawa

This dissertation focuses on fountain codes under maximum likelihood (ML) decoding. First LT codes are considered under a practical and widely used ML decoding algorithm known as inactivation decoding. Different analysis techniques are…

Information Theory · Computer Science 2017-06-28 Francisco Lázaro