English
Related papers

Related papers: Minimizing the Complexity of Fast Sphere Decoding …

200 papers

Faster-than-Nyquist (FTN) signaling is a candidate non-orthonormal transmission technique to improve the spectral efficiency (SE) of future communication systems. However, such improvements of the SE are at the cost of additional…

Information Theory · Computer Science 2022-04-18 Sina Abbasi , Ebrahim Bedeer

Full-rate space time codes (STC) with rate = number of transmit antennas have high multiplexing gain, but high decoding complexity even when decoded using reduced-complexity decoders such as sphere or QRDM decoders. In this paper, we…

Information Theory · Computer Science 2015-05-30 Tian Peng Ren , Yong Liang Guan , Chau Yuen , Er Yang Zhang

In this work, a new fast-decodable space-time block code (STBC) is proposed. The code is full-rate and full-diversity for 4x2 multiple-input multiple-output (MIMO) transmission. Due to the unique structure of the codeword, the proposed code…

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

The sphere decoder (SD) is an attractive low-complexity alternative to maximum likelihood (ML) detection in a variety of communication systems. It is also employed in multiple-input multiple-output (MIMO) systems where the computational…

Information Theory · Computer Science 2013-03-05 Gianmarco Romano , Domenico Ciuonzo , Pierluigi Salvo Rossi , Francesco Palmieri

In this paper we present a novel method for decoding multiple input - multiple output (MIMO) transmission, which combines sphere decoding (SD) and zero forcing (ZF) techniques to provide near optimal low complexity and high performance…

Information Theory · Computer Science 2008-03-03 Vadim Neder , Doron Ezri , Motti Haridim

Classical ML decoders of MIMO systems like the sphere decoder, the Schnorr-Euchner algorithm, the Fano and the stack decoders suffer of high complexity for high number of antennas and large constellation sizes. We propose in this paper a…

Information Theory · Computer Science 2008-11-07 Rym Ouertani , Ghaya Rekaya Ben-Othman , Abdellatif Salah

Space-time coding techniques have become common-place in wireless communication standards as they provide an effective way to mitigate the fading phenomena inherent in wireless channels. However, the use of Space-Time Block Codes (STBCs)…

Information Theory · Computer Science 2016-11-17 Amr Ismail , Jocelyn Fiorina , Hikmet Sari

This paper presents low-complexity block-based encoding and decoding algorithms for short block length channels. In terms of the precise use-case, we are primarily concerned with the baseline 3GPP Short block transmissions in which payloads…

Information Theory · Computer Science 2025-02-11 Mody Sy , Raymond Knopp

The partial interference cancellation (PIC) group decoding has recently been proposed to deal with the decoding complexity and code rate trade-off on the basis of space-time block code (STBC) design criterion when full diversity is…

Information Theory · Computer Science 2011-01-28 Moon Ho Lee , Ying Guo

Low complexity error correction code is a key enabler for next generation ultra-reliable low-latency communications (xURLLC) in six generation (6G). Against this background, this paper proposes a decoding scheme for linear block code by…

Signal Processing · Electrical Eng. & Systems 2025-12-11 Di Zhang , Yinglei Yang , Zilong Liu , Shaobo Jia , Kyungchun Lee , Zhirong Zhang

A Space-Time Block Code (STBC) in $K$ symbols (variables) is called $g$-group decodable STBC if its maximum-likelihood decoding metric can be written as a sum of $g$ terms such that each term is a function of a subset of the $K$ variables…

Information Theory · Computer Science 2007-07-16 Sanjay Karmakar , B. Sundar Rajan

High-rate space-time block codes (STBC with code rate > 1) in multi-input multi-output (MIMO) systems are able to provide both spatial multiplexing gain and diversity gain, but have high maximum likelihood (ML) decoding complexity. Since…

Information Theory · Computer Science 2016-11-18 Tian Peng Ren , Yong Liang Guan , Chau Yuen , Erry Gunawan , Er Yang Zhang

Quantum low-density parity-check (QLDPC) codes have been proven to achieve higher minimum distances at higher code rates than surface codes. However, this family of codes imposes stringent latency requirements and poor performance under…

Information Theory · Computer Science 2024-06-26 Dimitris Chytas , Nithin Raveendran , Bane Vasić

A new design method for high rate, fully diverse ('spherical') space frequency codes for MIMO-OFDM systems is proposed, which works for arbitrary numbers of antennas and subcarriers. The construction exploits a differential geometric…

Information Theory · Computer Science 2016-11-17 Oliver Henkel

While quantum algorithms for solving large scale systems of linear equations offer potentially exponential speedups, their application has largely been confined to sparse matrices. This work extends the scope of these algorithms to a broad…

Quantum Physics · Physics 2026-02-27 Kun Tang , Jun Lai

In this paper, we propose a systematic design of space-time block codes (STBC) which can achieve high rate and full diversity when the partial interference cancellation (PIC) group decoding is used at receivers. The proposed codes can be…

Information Theory · Computer Science 2010-04-19 Long Shi , Wei Zhang , Xiang-Gen Xia

An efficient decoding algorithm named `divided decoder' is proposed in this paper. Divided decoding can be combined with any decoder using QR-decomposition and offers different pairs of performance and complexity. Divided decoding provides…

Information Theory · Computer Science 2009-01-23 In Sook Park

Linear space-time block codes (STBCs) of unitary rate and full diversity, systematically constructed over arbitrary constellations for any number of transmit antennas are introduced. The codes are obtained by generalizing the existing ABBA…

Information Theory · Computer Science 2007-07-13 Giuseppe Thadeu Freitas de Abreu

In this paper, Space-Time Block Codes (STBCs) with reduced Sphere Decoding Complexity (SDC) are constructed for two-user Multiple-Input Multiple-Output (MIMO) fading multiple access channels. In this set-up, both the users employ identical…

Information Theory · Computer Science 2009-08-11 J. Harshan , B. Sundar Rajan

The use of Space-Time Block Codes (STBCs) increases significantly the optimal detection complexity at the receiver unless the low-complexity decodability property is taken into consideration in the STBC design. In this paper we propose a…

Information Theory · Computer Science 2016-11-17 Amr Ismail , Jocelyn Fiorina , Hikmet Sari