English
Related papers

Related papers: On the Minimum Decoding Delay of Balanced Complex …

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

In this paper, a new method is proposed to obtain full-diversity, rate-2 (rate of 2 complex symbols per channel use) space-time block codes (STBCs) that are full-rate for multiple input, double output (MIDO) systems. Using this method,…

Information Theory · Computer Science 2013-04-25 K. Pavan Srinath , B. Sundar Rajan

Recently, a special class of complex designs called Training-Embedded Complex Orthogonal Designs (TE-CODs) has been introduced to construct single-symbol Maximum Likelihood (ML) decodable (SSD) distributed space-time block codes (DSTBCs)…

Information Theory · Computer Science 2009-09-15 J. Harshan , B. Sundar Rajan , Are Hjørungnes

This paper proposes a polar code construction scheme that reduces constituent-code supplemented decoding latency. Constituent codes are the sub-codewords with specific patterns. They are used to accelerate the successive cancellation…

Information Theory · Computer Science 2017-09-22 Tiben Che , Gwan Choi

We propose a new algorithm to compute a shifted proper orthogonal decomposition (sPOD) for systems dominated by multiple transport velocities. The sPOD is a recently proposed mode decomposition technique which overcomes the poor performance…

Numerical Analysis · Mathematics 2018-03-06 Philipp Schulze , Julius Reiss , Volker Mehrmann

Motivated by the recent developments in the Space Shift Keying (SSK) and Spatial Modulation (SM) systems which employ Time-Orthogonal Pulse Shaping (TOPS) filters to achieve transmit diversity gains, we propose TOPS for Space-Time Block…

Information Theory · Computer Science 2012-04-26 Rakshith Rajashekar , K. V. S. Hari

This paper presents a novel, more efficient proper orthogonal decomposition (POD) based reduced-order model (ROM) for compressible flows. In this POD model the governing equations, i.e., the conservation of mass, momentum, and energy…

Computational Physics · Physics 2021-02-03 Elizabeth H. Krath , Forrest L. Carpenter , Paul G. A. Cizmas , David A. Johnston

Perfect space-time codes were first introduced by Oggier et. al. to be the space-time codes that have full rate, full diversity-gain, non-vanishing determinant for increasing spectral efficiency, uniform average transmitted energy per…

Information Theory · Computer Science 2007-07-13 Petros Elia , B. A. Sethuraman , P. Vijay Kumar

Coded modulation (CM) is the combination of forward error correction (FEC) and multilevel constellations. Coherent optical communication systems result in a four-dimensional (4D) signal space, which naturally leads to 4D-CM transceivers. A…

Information Theory · Computer Science 2024-01-25 Alex Alvarado , Erik Agrell

Quantum low-density parity-check (QLDPC) codes are among the most promising candidates for future quantum error correction schemes. However, a limited number of short to moderate-length QLDPC codes have been designed and their decoding…

Information Theory · Computer Science 2024-05-07 Sisi Miao , Jonathan Mandelbaum , Holger Jäkel , Laurent Schmalen

In this thesis, we study differential modulation schemes which do not need channel knowledge at the transmitter nor at the receiver. First, we consider single-antenna systems and investigate the use of Differential Amplitude Phase Shift…

Information Theory · Computer Science 2019-02-12 Rania Morsi

A key problem in random network coding (NC) lies in the complexity and energy consumption associated with the packet decoding processes, which hinder its application in mobile environments. Controlling and hence limiting such factors has…

Multimedia · Computer Science 2016-11-18 Attilio Fiandrotti , Valerio Bioglio , Marco Grangetto , Rossano Gaeta , Enrico Magli

We propose a decoder for quantum low density parity check (LDPC) codes based on a beam search heuristic guided by belief propagation (BP). Our beam search decoder applies to all quantum LDPC codes and achieves different speed-accuracy…

Quantum Physics · Physics 2025-12-18 Min Ye , Dave Wecker , Nicolas Delfosse

Optical orthogonal signature pattern codes (OOSPCs) play an important role in a novel type of optical code-division multiple-access (CDMA) network for 2-dimensional image transmission. There is a one-to-one correspondence between an $(m, n,…

Discrete Mathematics · Computer Science 2016-09-26 Jingyuan Chen , Yun Li , Lijun Ji

Quantum error correction (QEC) for fault-tolerant quantum computing requires a balanced decoding solution that offers high performance, low complexity, and low latency. However, the de facto standard, belief propagation (BP) combined with…

Quantum Physics · Physics 2026-05-04 Hee-Youl Kwak , Seong-Joon Park , Hyunwoo Jung , Jeongseok Ha , Jae-Won Kim

The goal of combining beamforming and space-time coding in this work is to obtain full-diversity order and to provide additional received power (array gain) compared to conventional space-time codes. In our system, we consider a…

Information Theory · Computer Science 2008-04-23 Siavash Ekbatani , Hamid Jafarkhani

For an $n_t$ transmit, $n_r$ receive antenna system ($n_t \times n_r$ system), a {\it{full-rate}} space time block code (STBC) transmits $min(n_t,n_r)$ complex symbols per channel use. In this paper, a scheme to obtain a full-rate STBC for…

Information Theory · Computer Science 2010-01-13 K. Pavan Srinath , B. Sundar Rajan

We study the performance of medium-length quantum LDPC (QLDPC) codes in the depolarizing channel. Only degenerate codes with the maximal stabilizer weight much smaller than their minimum distance are considered. It is shown that with the…

Quantum Physics · Physics 2021-11-24 Pavel Panteleev , Gleb Kalachev

We show an interesting PBD-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A consequence of this PBD-closure result is that the size of optimal constant-composition codes…

Information Theory · Computer Science 2007-12-18 Yeow Meng Chee , Alan C. H. Ling , San Ling , Hao Shen

The construction of polar codes for channels other than BECs requires sorting of all bit channels and then selecting the best $K$ of them for a block length $N=2^n$. In this paper, two types of partial orders (PO) of polar codes are…

Information Theory · Computer Science 2017-04-25 Wei Wang , Liping Li