English
Related papers

Related papers: Single-Symbol Maximum Likelihood Decodable Linear …

200 papers

This paper generalizes results in noncoherent space-time block code (STBC) design based on quantum error correction (QEC) to new antenna configurations. Previous work proposed QEC-inspired STBCs for antenna geometries where the number of…

Signal Processing · Electrical Eng. & Systems 2026-01-27 S. Andrew Lanham , Eli Bradley , Brian R. La Cour

Recently, Guo and Xia introduced low complexity decoders called Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC), which include the Zero Forcing (ZF) and ZF-SIC receivers as special cases,…

Information Theory · Computer Science 2011-04-29 Lakshmi Prasad Natarajan , B. Sundar Rajan

In this paper, we introduce the notion of perfect space-time block codes (STBC). These codes have full rate, full diversity, non-vanishing constant minimum determinant for increasing spectral efficiency, uniform average transmitted energy…

Information Theory · Computer Science 2007-07-16 F. Oggier , G. Rekaya-Ben Othman , J. -C. Belfiore , E. Viterbo

Decoding of linear space-time block codes (STBCs) with sphere-decoding (SD) is well known. A fast-version of the SD known as fast sphere decoding (FSD) has been recently studied by Biglieri, Hong and Viterbo. Viewing a linear STBC as a…

Information Theory · Computer Science 2015-03-14 G. R. Jithamithra , B. Sundar Rajan

The space-time bit-interleaved coded modulation (ST-BICM) is an efficient technique to obtain high diversity and coding gain on a block-fading MIMO channel. Its maximum-likelihood (ML) performance is computed under ideal interleaving…

Information Theory · Computer Science 2016-11-15 Nicolas Gresset , Loic Brunel , Joseph Boutros

Locally decodable codes (LDCs) are error-correcting codes $C : \Sigma^k \to \Sigma^n$ that admit a local decoding algorithm that recovers each individual bit of the message by querying only a few bits from a noisy codeword. An important…

Computational Complexity · Computer Science 2020-09-17 Vahid R. Asadi , Igor Shinkar

A low complexity, essentially-ML decoding technique for the Golden code and the 3 antenna Perfect code was introduced by Sirianunpiboon, Howard and Calderbank. Though no theoretical analysis of the decoder was given, the simulations showed…

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

This paper presents a low-ML-decoding-complexity, full-rate, full-diversity space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna multiple-input multiple-output (MIMO) system, with coding gain equal to that of the best…

Information Theory · Computer Science 2016-11-15 K. Pavan Srinath , B. Sundar Rajan

A locally decodable code (LDC) C:{0,1}^k -> {0,1}^n is an error correcting code wherein individual bits of the message can be recovered by only querying a few bits of a noisy codeword. LDCs found a myriad of applications both in theory and…

Computational Complexity · Computer Science 2019-04-26 Tom Gur , Oded Lachish

Spatial modulation (SM) has proven to be a promising multiple-input-multiple-output (MIMO) technique which provides high energy efficiency and reduces system complexity. In SM, only one transmitter is active at any given time while the rest…

Information Theory · Computer Science 2020-01-08 Anil Yesilkaya , Rui Bian , Iman Tavakkolnia , Harald Haas

We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather…

Information Theory · Computer Science 2016-11-18 Joseph J. Boutros , Albert Guillen i Fabregas , Ezio Biglieri , Gilles Zemor

A new type of spatially coupled low-density parity-check (SC-LDPC) codes motivated by practical storage applications is presented. SC-LDPCL codes (suffix 'L' stands for locality) can be decoded locally at the level of sub-blocks that are…

Information Theory · Computer Science 2020-09-29 Eshed Ram , Yuval Cassuto

In this paper, we first derive the generic algebraic structure of a Quasi-Orthogonal STBC (QO-STBC). Next we propose Group-Constrained Linear Transformation (GCLT) as a means to optimize the diversity and coding gains of a QO-STBC with…

Information Theory · Computer Science 2008-06-23 Chau Yuen , Yong Liang Guan , Tjeng Thiang Tjhung

Multiple Input Double Output (MIDO) asymmetric space-time codes for 4 transmit antennas and 2 receive antennas can be employed in the downlink from base stations to portable devices. Previous MIDO code constructions with low Maximum…

Information Theory · Computer Science 2015-03-19 Laura Luzzi , Frédérique Oggier

SC-LDPC codes with sub-block locality can be decoded locally at the level of sub-blocks that are much smaller than the full code block, thus providing fast access to the coded information. The same code can also be decoded globally using…

Information Theory · Computer Science 2020-05-28 Homa Esfahanizadeh , Eshed Ram , Yuval Cassuto , Lara Dolecek

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD $\mathcal{O}_z$ with parameter $[p, n, k]$ is a $p \times n$ matrix, where nonzero entries are filled by $\pm z_i$ or $\pm z^*_i$, $i = 1, 2,..., k$, such…

Information Theory · Computer Science 2012-04-03 Yuan Li , Haibin Kan

Diffusion Large Language Models (dLLMs) have achieved rapid progress, viewed as a promising alternative to the autoregressive paradigm. However, most dLLM decoders still adopt a global confidence threshold, and do not explicitly model local…

Computation and Language · Computer Science 2026-04-09 Yuzhe Chen , Jiale Cao , Xuyang Liu , Jin Xie , Aiping Yang , Yanwei Pang

"Extended Clifford algebras" are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two specific classes of extended Clifford algebras, two systematic algebraic…

Information Theory · Computer Science 2016-11-17 G. Susinder Rajan , B. Sundar Rajan

An Orthogonally resolvable Matching Design OMD$(n, k)$ is a partition of the edges the complete graph $K_n$ into matchings of size $k$, called blocks, such that the blocks can be resolved in two different ways. Such a design can be…

Combinatorics · Mathematics 2017-07-21 Peter Danziger , Sophia Park

In this paper, we consider the Spatial Modulation (SM) system in a frequency selective channel under single carrier (SC) communication scenario and propose zero-padding instead of cyclic prefix considered in the existing literature. We show…

Information Theory · Computer Science 2013-01-18 Rakshith Rajashekar , K. V. S. Hari
‹ Prev 1 4 5 6 7 8 10 Next ›