English
Related papers

Related papers: Code-Weight Sphere Decoding

200 papers

This paper considers an uplink multiuser multiple-input-multiple-output (MU-MIMO) system with one-bit analog-to-digital converters (ADCs), in which $K$ users with a single transmit antenna communicate with one base station (BS) with $N_{\rm…

Information Theory · Computer Science 2017-07-14 S. Kim , N. Lee , S. -N. Hong

The lower bound on the decoding error probability for the optimal code given a signal-to-noise ratio and a code rate are investigated in this letter for the reconfigurable intelligent surface (RIS) communication system over a Rician fading…

Information Theory · Computer Science 2023-06-28 Likun Sui , Zihuai Lin

In this paper, we propose a new class of nonbinary polar codes with two-stage polarization for ultra-reliable and low-latency communications (URLLC), where the outer (symbol-level) polarization is achieved by using a 2X2 q-ary matrix [1 0;…

Information Theory · Computer Science 2019-02-26 Peiyao Chen , Baoming Bai , Xiao Ma

This paper presents a hybrid decoding architecture that serially couples a normalized min-sum (NMS) decoder with reinforced ordered statistics decoding (OSD) to achieve near-maximum likelihood (ML) performance for short linear block codes,…

Information Theory · Computer Science 2026-04-28 Guangwen Li , Xiao Yu

We focus on full-rate, fast-decodable space-time block codes (STBCs) for 2x2 and 4x2 multiple-input multiple-output (MIMO) transmission. We first derive conditions for reduced-complexity maximum-likelihood decoding, and apply them to a…

Information Theory · Computer Science 2008-03-18 Ezio Biglieri , Yi Hong , Emanuele Viterbo

Future beyond-5G and 6G systems demand ultra-reliable, low-latency communication with short blocklengths, motivating the development of universal decoding algorithms. Guessing decoding, which infers the noise or codeword candidate in order…

Information Theory · Computer Science 2025-11-24 Qianfan Wang , Jifan Liang , Peihong Yuan , Ken R. Duffy , Muriel Médard , Xiao Ma

Minimum achievable complexity (MAC) for a maximum likelihood (ML) performance-achieving detection algorithm is derived. Using the derived MAC, we prove that the conventional sphere decoding (SD) algorithms suffer from an inherent weakness…

Information Theory · Computer Science 2021-09-21 Mohammad Neinavaie , Mostafa Derakhtian , Sergiy A. Vorobyov

Wyner's soft-handoff network is considered where transmitters simultaneously send messages of enhanced mobile broadband (eMBB) and ultra-reliable low-latency communication (URLLC) services. Due to the low-latency requirements, the URLLC…

Information Theory · Computer Science 2022-06-24 Homa Nikbakht , Michèle Wigger , Shlomo Shamai , Jean-Marie Gorce , H. Vincent Poor

This letter introduces two fast maximum-likelihood (ML) detection methods for 4*4 quasi-orthogonal space-time block code (QOSTBC). The first algorithm with a relatively simple design exploits structure of quadrature amplitude modulation…

Information Theory · Computer Science 2017-06-14 Adel Ahmadi , Siamak Talebi

This paper presents a semantic-enhanced receiver framework for transmitting natural language sentences over noisy wireless channels using multiple short block codes. After ASCII encoding, the sentence is divided into segments, each…

Information Theory · Computer Science 2026-04-30 Jiafu Hao , Chentao Yue , Wanchun Liu , Branka Vucetic , Yonghui Li

Recent work by Polyanskiy et al. and Chen et al. has excited new interest in using feedback to approach capacity with low latency. Polyanskiy showed that feedback identifying the first symbol at which decoding is successful allows capacity…

Information Theory · Computer Science 2016-11-15 Adam R. Williamson , Tsung-Yi Chen , Richard D. Wesel

Fast and accurate quantum error correction (QEC) decoding is crucial for scalable fault-tolerant quantum computation. Most-Likely-Error (MLE) decoding, while being near-optimal, is intractable on general quantum Low-Density Parity-Check…

Quantum Physics · Physics 2025-10-06 Yue Wu , Binghong Li , Kathleen Chang , Shruti Puri , Lin Zhong

Convolutional precoding in polarization-adjusted convolutional (PAC) codes can reduce the number of minimum weight codewords (a.k.a error coefficient) of polar codes. This can result in improving the error correction performance of (near)…

Information Theory · Computer Science 2022-12-02 Xinyi Gu , Mohammad Rowshan , Jinhong Yuan

In this paper, Sphere Decoding (SD) algorithms for Spatial Modulation (SM) are developed to reduce the computational complexity of Maximum-Likelihood (ML) detectors. Two SDs specifically designed for SM are proposed and analysed in terms of…

Information Theory · Computer Science 2013-05-31 Abdelhamid Younis , Sinan Sinanović , Marco Di Renzo , Raed Mesleh , Harald Haas

Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC). This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes by…

Quantum Physics · Physics 2023-11-22 Arshpreet Singh Maan , Alexandru Paler

The 3D MIMO code is a robust and efficient space-time block code (STBC) for the distributed MIMO broadcasting but suffers from high maximum-likelihood (ML) decoding complexity. In this paper, we first analyze some properties of the 3D MIMO…

Information Theory · Computer Science 2014-01-16 Ming Liu , Matthieu Crussière , Maryline Hélard , Jean-François Hélard

With the phenomenal growth of the Internet of Things (IoT), Ultra Reliable Low Latency Communications (URLLC) has potentially been the enabler to guarantee the stringent requirements on latency and reliability. However, how to achieve low…

Information Theory · Computer Science 2019-03-15 Xiaoyu Zhao , Wei Chen

Ultra-reliable low latency communication (URLLC) is a key part of 5G wireless systems. Achieving low latency necessitates codes with short blocklengths for which polar codes with successive cancellation list (SCL) decoding typically…

Hardware Architecture · Computer Science 2025-12-22 Darja Nonaca , Jérémy Guichemerre , Reinhard Wiesmayr , Nihat Engin Tunali , Christoph Studer

Sparse superimposed coding (SSC) has emerged as a promising technique for short-packet transmission in ultra-reliable low-latency communication scenarios. However, conventional SSC schemes often suffer from high encoding and decoding…

Signal Processing · Electrical Eng. & Systems 2026-01-23 Yanfeng Zhang , Xi'an Fan , Xu Zhu , Jinkai Zheng , Hui Liang , Weiwei Yang , Tom H. Luan

Topological quantum error-correcting codes are a promising candidate for building fault-tolerant quantum computers. Decoding topological codes optimally, however, is known to be a computationally hard problem. Various decoders have been…

Quantum Physics · Physics 2020-04-01 Milap Sheth , Sara Zafar Jafarzadeh , Vlad Gheorghiu