English
Related papers

Related papers: Revisited Design Criteria For STBCs With Reduced C…

200 papers

In this paper we present low-complexity blind multi-input multi-output (MIMO) adaptive linear multiuser receivers for direct sequence code division multiple access (DS-CDMA) systems using multiple transmit antennas and space-time block…

Information Theory · Computer Science 2014-10-22 R. C. de Lamare , R. Sampaio-Neto

Recently, neural networks have improved MinSum message-passing decoders for low-density parity-check (LDPC) codes by multiplying or adding weights to the messages, where the weights are determined by a neural network. The neural network…

Signal Processing · Electrical Eng. & Systems 2023-12-06 Linfang Wang , Caleb Terrill , Richard Wesel , Dariush Divsalar

In the setting of quasi-static multiple-input multiple-output (MIMO) channels, we consider the high signal-to-noise ratio (SNR) asymptotic complexity required by the sphere decoding (SD) algorithm for decoding a large class of full rate…

Information Theory · Computer Science 2011-02-08 Joakim Jalden , Petros Elia

Orthogonal designs are fundamental mathematical notions used in the construction of space time block codes for wireless transmissions. Designs have two important parameters, the rate and the decoding delay; the main problem of the theory is…

Information Theory · Computer Science 2012-03-05 Sophie Morier-Genoud , Valentin Ovsienko

Belief-propagation (BP) decoding for quantum low-density parity-check (QLDPC) codes is appealing due to its low complexity, yet it often exhibits convergence issues due to quantum degeneracy and short cycles that exist in the Tanner graph.…

Information Theory · Computer Science 2026-03-12 Mohsen Moradi , Vahid Nourozi , Salman Habib , David G. M. Mitchell

Complex orthogonal design (COD) with parameter $[p, n, k]$ is a combinatorial design used in space-time block codes (STBCs). For STBC, $n$ is the number of antennas, $k/p$ is the rate, and $p$ is the decoding delay. A class of rate $1/2$…

Information Theory · Computer Science 2016-09-20 Xiaodong Liu , Yuan Li , Haibin Kan

In order to understand the performance of a code under maximum-likelihood (ML) decoding, one studies the codewords, in particular the minimal codewords, and their Hamming weights. In the context of linear programming (LP) decoding, one's…

Information Theory · Computer Science 2007-07-13 Roxana Smarandache , Pascal O. Vontobel

Efficient high-performance decoding of topological stabilizer codes has the potential to crucially improve the balance between logical failure rates and the number and individual error rates of the constituent qubits. High-threshold…

Hybrid beamforming (HB) architectures are attractive for wireless communication systems with large antenna arrays because the analog beamforming stage can significantly reduce the number of RF transceivers and hence power consumption. In HB…

Information Theory · Computer Science 2019-09-24 Junmo Sung , Brian L. Evans

In 2019, Trombetti and Zhou introduced a new family of $\mathbb{F}_{q^n}$-linear Maximum Rank Distance (MRD) codes over $\mathbb{F}_{q^{2n}}$. For such codes we propose a new syndrome-based decoding algorithm. It is well known that a…

Information Theory · Computer Science 2025-12-01 Chunlei Li , Angelica Piccirillo , Olga Polverino , Ferdinando Zullo

Data encoding is a fundamental step in emerging computing paradigms, particularly in stochastic computing (SC) and hyperdimensional computing (HDC), where it plays a crucial role in determining the overall system performance and hardware…

Emerging Technologies · Computer Science 2025-01-07 Mehran Shoushtari Moghadam , Sercan Aygun , M. Hassan Najafi

Rate-adaptive MacKay-Neal (MN) codes based on protographs are analyzed. The code construction employs an outer distribution matcher (DM) to adapt the rate of the scheme. The DM is coupled with an inner protograph-based low-density…

Information Theory · Computer Science 2025-10-17 Ayman Zahr , Emna Ben Yacoub , Balázs Matuz , Gianluigi Liva

A set of linearly constrained permutation matrices are proposed for constructing a class of permutation codes. Making use of linear constraints imposed on the permutation matrices, we can formulate a minimum Euclidian distance decoding…

Information Theory · Computer Science 2015-03-17 Tadashi Wadayama , Manabu Hagiwara

Classical low-density parity-check (LDPC) codes are a widely deployed and well-established technology, forming the backbone of modern communication and storage systems. It is well known that, in this classical setting, increasing the girth…

Quantum Physics · Physics 2026-01-21 Kenta Kasai

The rapidly improving performance of modern hardware renders convolutional codes obsolete, and allows for the practical implementation of more sophisticated correction codes such as low density parity check (LDPC) and turbo codes (TC). Both…

Information Theory · Computer Science 2015-03-20 Jarosław Duda , Paweł Korus

In this work, we analyze efficient window shift schemes for windowed decoding of spatially coupled low-density parity-check (SC-LDPC) codes, which is known to yield close-tooptimal decoding results when compared to full belief propagation…

Information Theory · Computer Science 2018-10-03 Kevin Klaiber , Sebastian Cammerer , Laurent Schmalen , Stephan ten Brink

In this paper, a design criterion for space-time block codes (STBC) is proposed for two-user MIMO interference channels when a group zero-forcing (ZF) algorithm is applied at each receiver to eliminate the inter-user interference. Based on…

Information Theory · Computer Science 2012-09-27 Long Shi , Wei Zhang , Xiang-Gen Xia

In this paper, we design space-time block codes (STBCs) to broadcast the common information omnidirectionally in a massive MIMO downlink. To reduce the burden of the downlink channel estimation and achieve partial spatial diversity from…

Information Theory · Computer Science 2016-10-26 Xin Meng , Xiang-Gen Xia , Xiqi Gao

The Radiative transfer coherent backscattering (RT-CB) code is extended to apply to dense discrete random media of optically soft spherical particles. This is achieved by utilizing the well-known static-structure-factor (SSF) correction…

Materials Science · Physics 2023-11-23 Johannes Markkanen , Antti Penttilä

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