English
Related papers

Related papers: Fast Maximum-Likelihood Decoding of the Golden Cod…

200 papers

The Golden Code is a full-rate full-diversity space-time code, which achieves maximum coding gain for Multiple-Input Multiple-Output (MIMO) systems with two transmit and two receive antennas. Since four information symbols taken from an…

Information Theory · Computer Science 2012-08-17 Boyu Li , Ender Ayanoglu

Algebraic space-time coding allows for reliable data exchange across fading multiple-input multiple-output channels. A powerful technique for decoding space-time codes in Maximum-Likelihood (ML) decoding, but well-performing and widely-used…

Information Theory · Computer Science 2015-01-28 Amaro Barreal , Camilla Hollanti , David Karpuk

This paper (Part of the content of this manuscript has been accepted for presentation in IEEE Globecom 2008, to be held in New Orleans) deals with low maximum likelihood (ML) decoding complexity, full-rate and full-diversity space-time…

Information Theory · Computer Science 2008-09-04 K. Pavan Srinath , B. Sundar Rajan

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 $n_{min} = min(n_t,n_r)$ complex symbols per channel use. The well known Golden code is an example of a…

Information Theory · Computer Science 2015-03-17 K. Pavan Srinath , B. Sundar Rajan

The recently proposed Golden code is an optimal space-time block code for 2 X 2 multiple-input multiple-output (MIMO) systems. The aim of this work is the design of a VLSI decoder for a MIMO system coded with the Golden code. The…

Hardware Architecture · Computer Science 2007-11-16 Barbara Cerato , Guido Masera , Emanuele Viterbo

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

We study the problem of constructing good space-time codes for broadcasting $K$ independent messages over a MIMO network to $L$ users, where each user demands all the messages and already has a subset of messages as side information. As a…

Information Theory · Computer Science 2017-04-25 Yu-Chih Huang , Yi Hong , Emanuele Viterbo

Multiple-input double-output (MIDO) codes are important in the near-future wireless communications, where the portable end-user device is physically small and will typically contain at most two receive antennas. Especially tempting is the 4…

Information Theory · Computer Science 2016-11-15 Roope Vehkalahti , Camilla Hollanti , Frédérique Oggier

Orthogonality is a much desired property for MIMO coding. It enables symbol-wise decoding, where the errors in other symbol estimates do not affect the result, thus providing an optimality that is worth pursuing. Another beneficial property…

Information Theory · Computer Science 2016-11-17 Risto Nordman

The standard approach to the design of individual space-time codes is based on optimizing diversity and coding gains. This geometric approach leads to remarkable examples, such as perfect space-time block codes, for which the complexity of…

Information Theory · Computer Science 2015-05-13 Yiyue Wu , Robert Calderbank

In this paper, we propose a fast decoder algorithm for uniquely decodable (errorless) code sets for overloaded synchronous optical code-division multiple-access (O-CDMA) systems. The proposed decoder is designed in a such a way that the…

Information Theory · Computer Science 2019-02-27 Michel Kulhandjian , Hovannes Kulhandjian , Claude D'Amours , Halim Yanikomeroglu , Gurgen Khachatrian

Repetition-based retransmission is used in Alamouti-modulation [1998] for $2\times 2$ MIMO systems. We propose to use instead of ordinary repetition so-called "scaled repetition" together with rotation. It is shown that the rotated and…

Information Theory · Computer Science 2008-02-06 Frans M. J. Willems

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 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

Two new rate-one full-diversity space-time block codes (STBC) are proposed. They are characterized by the \emph{lowest decoding complexity} among the known rate-one STBC, arising due to the complete separability of the transmitted symbols…

Information Theory · Computer Science 2016-11-17 Dung Ngoc Dao , Chau Yuen , Chintha Tellambura , Yong Liang Guan , Tjeng Thiang Tjhung

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

The 3D MIMO code is a robust and efficient space-time coding scheme for the distributed MIMO broadcasting. However, it suffers from the high computational complexity if the optimal maximum-likelihood (ML) decoding is used. In this paper we…

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

Maximum-likelihood (ML) decoding for arbitrary block codes remains fundamentally hard, with worst-case time complexity-measured by the total number of multiplications-being no better than straightforward exhaustive search, which requires…

Information Theory · Computer Science 2026-01-21 Hoang Ly , Emina Soljanin , Michael Schleppy

We study fast lattice decodability of space-time block codes for $n$ transmit and receive antennas, written very generally as a linear combination $\sum_{i=1}^{2l} s_i A_i$, where the $s_i$ are real information symbols and the $A_i$ are…

Information Theory · Computer Science 2016-11-18 Grégory Berhuy , Nadya Markin , B. A. Sethuraman

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
‹ Prev 1 2 3 10 Next ›