English
Related papers

Related papers: LR-aided MMSE lattice decoding is DMT optimal for …

200 papers

Over discrete memoryless channels (DMC), linear decoders (maximizing additive metrics) afford several nice properties. In particular, if suitable encoders are employed, the use of decoding algorithm with manageable complexities is…

Information Theory · Computer Science 2008-10-01 Emmanuel Abbe , Lizhong Zheng

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

Many powerful data detection algorithms employed in multiple-input multiple-output (MIMO) communication systems, such as sphere decoding (SD) and lattice-reduction (LR)-aided detection, were initially designed for infinite lattices.…

Information Theory · Computer Science 2008-11-27 Christoph Studer , Dominik Seethaler , Helmut Bölcskei

Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC's)), and various ensembles of random codes, are studied by combining the competitive minimax approach,…

Information Theory · Computer Science 2007-08-01 Yaniv Akirav , Neri Merhav

This paper considers the multi-antenna multiple access relay channel (MARC), in which multiple users transmit messages to a common destination with the assistance of a relay. In a variety of MARC settings, the dynamic decode and forward…

Information Theory · Computer Science 2013-01-08 Chung-Pi Lee , Shih-Chun Lin , Hsuan-Jung Su , H. Vincent Poor

A recent result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, referred to as the diversity-multiplexing gain (D-MG) tradeoff, between the spatial multiplexing gain and the diversity gain that…

Information Theory · Computer Science 2007-07-13 Petros Elia , K. Raj Kumar , Sameer A. Pawar , P. Vijay Kumar , Hsiao-feng Lu

This paper studies maximum likelihood(ML) decoding in error-correcting codes as rational maps and proposes an approximate ML decoding rule by using a Taylor expansion. The point for the Taylor expansion, which will be denoted by $p$ in the…

Dynamical Systems · Mathematics 2010-06-30 Kazunori Hayashi , Yasuaki Hiraoka

In this paper, the inherent drawbacks of the naive lattice decoding for MIMO fading systems is investigated. We show that using the naive lattice decoding for MIMO systems has considerable deficiencies in terms of the rate-diversity…

Information Theory · Computer Science 2007-09-04 Mahmoud Taherzadeh , Amir K. Khandani

This paper proposes spatial lattice modulation (SLM), a spatial modulation method for multipleinput-multiple-output (MIMO) systems. The key idea of SLM is to jointly exploit spatial, in-phase, and quadrature dimensions to modulate…

Information Theory · Computer Science 2018-05-23 Jiwook Choi , Yunseo Nam , Namyoon Lee

In this paper, we derive a maximum likelihood (ML) decoder of the differential data in a decode-and-forward (DF) based cooperative communication system utilizing uncoded transmissions. This decoder is applicable to complex-valued unitary…

Information Theory · Computer Science 2012-04-12 Manav R. Bhatnagar

Linear precoding is a relatively simple method of MIMO signaling that can also be optimal in certain special cases. This paper is dedicated to high-SNR analysis of MIMO linear precoding. The Diversity-Multiplexing Tradeoff (DMT) of a number…

Information Theory · Computer Science 2012-02-27 Ahmed Hesham Mehana , Aria Nosratinia

The code that combines channel estimation and error protection has received general attention recently, and has been considered a promising methodology to compensate multi-path fading effect. It has been shown by simulations that such code…

Information Theory · Computer Science 2007-12-18 Chia-Lung Wu , Po-Ning Chen , Yunghsiang S. Han , Ming-Hsin Kuo

Quantum error correction (QEC) is indispensable for realizing fault-tolerant quantum computation, yet its effectiveness hinges critically on the classical decoding algorithm that interprets noisy syndrome measurements. Among all possible…

Quantum Physics · Physics 2026-05-19 Hanyan Cao , Ge Yan , Yuxuan Du , Feng Pan

In this paper, a joint power allocation algorithm with minimum mean-squared error (MMSE) receiver for a cooperative Multiple-Input and Multiple-Output (MIMO) network which employs multiple relays and a Decode-and-Forward (DF) strategy is…

Information Theory · Computer Science 2013-03-22 T. Peng , R. C. de Lamare , A. Schmeink

An adaptive distributed space-time coding (DSTC) scheme is proposed for two-hop cooperative MIMO networks. Linear minimum mean square error (MMSE) receive filters and adjustable code matrices are considered subject to a power constraint…

Information Theory · Computer Science 2016-11-17 T. Peng , R. C. de Lamare , A. Schmeink

We describe two implementations of the optimal error correction algorithm known as the maximum likelihood decoder (MLD) for the 2D surface code with a noiseless syndrome extraction. First, we show how to implement MLD exactly in time…

Quantum Physics · Physics 2014-10-01 Sergey Bravyi , Martin Suchara , Alexander Vargo

"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

This paper investigates the diversity order of the minimum mean squared error (MMSE) based optimal transceivers in multiple-input multiple-output (MIMO) amplify-and-forward (AF) relaying systems. While the diversity-multiplexing tradeoff…

Information Theory · Computer Science 2013-12-17 Changick Song , Cong Ling

In a recent work, Coronel et al. initiated the study of the relation between the diversity-multiplexing tradeoff (DMT) performance of a multiuser multiple-input multiple-output (MU-MIMO) lattice code and the rate of the decay of the…

Information Theory · Computer Science 2009-08-19 Jyrki Lahtonen , Roope Vehkalahti , Hsiao-feng Lu , Camilla Hollanti , Emanuele Viterbo

In this paper, we propose a new detection technique for multiuser multiple-input multiple-output (MU-MIMO) systems. The proposed scheme combines a lattice reduction (LR) transformation, which makes the channel matrix nearly orthogonal, and…

Information Theory · Computer Science 2014-12-09 L. Arevalo , R. C. de Lamare , R. Sampaio-Neto