English
Related papers

Related papers: Block-Orthogonal Space-Time Code Structure and Its…

200 papers

We expand the class of holographic quantum error correcting codes by developing the notion of block perfect tensors, a wider class that includes previously defined perfect tensors. The relaxation of this constraint opens up a range of other…

Quantum Physics · Physics 2018-11-07 Robert J. Harris , Nathan A. McMahon , Gavin K. Brennen , Thomas M. Stace

Spatially-coupled low-density parity-check (LDPC) codes, which were first introduced as LDPC convolutional codes, have been shown to exhibit excellent performance under low-complexity belief-propagation decoding. This phenomenon is now…

Information Theory · Computer Science 2015-01-16 Santhosh Kumar , Andrew J. Young , Nicolas Macris , Henry D. Pfister

In this paper, we present a belief propagation (BP) based algorithm for decoding non-orthogonal space-time block codes (STBC) from cyclic division algebras (CDA) having {\em large dimensions}. The proposed approach involves message passing…

Information Theory · Computer Science 2009-01-14 Madhekar Suneel , Pritam Som , A. Chockalingam , B. Sundar Rajan

High data rates are one of the most prevalent requirements in current mobile communications. To cover this and other high standards regarding performance, increasing coverage, capacity, and reliability, numerous works have proposed the…

Information Theory · Computer Science 2023-07-26 Gabriela Morillo , John Cosmas

Staircase codes (SCCs) are typically decoded using iterative bounded-distance decoding (BDD) and hard decisions. In this paper, a novel decoding algorithm is proposed, which partially uses soft information from the channel. The proposed…

Signal Processing · Electrical Eng. & Systems 2020-06-05 Yi Lei , Bin Chen , Gabriele Liga , Xiong Deng , Zizheng Cao , Jianqiang Li , Kun Xu , Alex Alvarado

We construct a class of linear space-time block codes for any number of transmit antennas that have controllable ML decoding complexity with a maximum rate of 1 symbol per channel use. The decoding complexity for $M$ transmit antennas can…

Information Theory · Computer Science 2012-05-22 Naresh Sharma , Pavan R. Pinnamraju , Constantinos B. Papadias

Low-density parity-check (LDPC) codes together with belief propagation (BP) decoding yield exceptional error correction capabilities in the large block length regime. Yet, there remains a gap between BP decoding and maximum likelihood…

Information Theory · Computer Science 2025-01-22 Jonathan Mandelbaum , Holger Jäkel , Laurent Schmalen

In this paper, we compare the finite-length performance of protograph-based spatially coupled low-density parity-check (SC-LDPC) codes and LDPC block codes (LDPC-BCs) over GF(q). In order to reduce computational complexity and latency, a…

Information Theory · Computer Science 2014-08-13 Kechao Huang , David G. M. Mitchell , Lai Wei , Xiao Ma , Daniel J. Costello

We study the design of spectrally efficient fiber-optical communication systems based on different spatially coupled (SC) forward error correction (FEC) schemes. In particular, we optimize the allocation of the coded bits from the FEC…

Information Theory · Computer Science 2024-01-30 Christian Häger , Alexandre Graell i Amat , Fredrik Brännström , Alex Alvarado , Erik Agrell

In this paper, we study a new class of high-rate spatially coupled LDPC (SC-LDPC) codes based on the convolutional self-orthogonal codes (CSOCs) first introduced by Massey. The SC-LDPC codes are constructed by treating the irregular graph…

Information Theory · Computer Science 2025-02-18 Daniel J. Costello, , Min Zhu , David G. M. Mitchell , Michael Lentmaier

Spatially-Coupled (SC)-LDPC codes are known to have outstanding error-correction performance and low decoding latency. Whereas previous works on LDPC and SC-LDPC codes mostly take either an asymptotic or a finite-length design approach, in…

Information Theory · Computer Science 2022-09-02 Homa Esfahanizadeh , Eshed Ram , Yuval Cassuto , Lara Dolecek

Spatially-coupled (SC) codes are a class of low-density parity-check (LDPC) codes that have excellent performance thanks to the degrees of freedom they offer. An SC code is designed by partitioning a base matrix into components, the number…

Information Theory · Computer Science 2026-05-11 Bade Aksoy , Doğukan Özbayrak , Ahmed Hareedy

Coherent Space-Time Shift Keying (CSTSK) is a recently developed generalized shift-keying framework for Multiple-Input Multiple-Output systems, which uses a set of Space-Time matrices termed as Dispersion Matrices (DM). CSTSK may be…

Information Theory · Computer Science 2012-10-10 Rakshith Rajashekar , K. V. S. Hari , L. Hanzo

Low decoding latency and complexity are two important requirements of channel codes used in many applications, like machine-to-machine communications. In this paper, we show how these requirements can be fulfilled by using some special…

Information Theory · Computer Science 2018-09-14 Massimo Battaglioni , Alireza Tasdighi , Marco Baldi , Mohammad H. Tadayon , Franco Chiaraluce

The problem of designing good Space-Time Block Codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach…

Information Theory · Computer Science 2015-03-19 Lakshmi Prasad Natarajan , B. Sundar Rajan

The essential requirement for fault-tolerant quantum computation (FTQC) is the total protocol design to achieve a fair balance of all the critical factors relevant to its practical realization, such as the space overhead, the threshold, and…

Quantum Physics · Physics 2025-06-03 Satoshi Yoshida , Shiro Tamiya , Hayata Yamasaki

Recently, the sparse vector code (SVC) is emerging as a promising solution for short-packet transmission in massive machine type communication (mMTC) as well as ultra-reliable and low-latency communication (URLLC). In the SVC process, the…

Information Theory · Computer Science 2022-09-02 Linjie Yang , Pingzhi Fan

Multiple Input Multiple Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) is a promising transmission scheme for high performance broadband wireless communications. However, this technique suffers from a major drawback which…

Information Theory · Computer Science 2014-12-30 Mouna Sghaier , Fatma Abdelkefi , Mohamed Siala

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

In the landmark paper by Hassibi and Hochwald, it is claimed without proof that the upper triangular matrix R encountered during the sphere decoding of any linear dispersion code is full-ranked whenever the rate of the code is less than the…

Information Theory · Computer Science 2011-09-06 Lakshmi Prasad Natarajan , K. Pavan Srinath , B. Sundar Rajan