English
Related papers

Related papers: Low ML-Decoding Complexity, Large Coding Gain, Ful…

200 papers

Reed-Muller (RM) codes are known for their good maximum likelihood (ML) performance in the short block-length regime. Despite being one of the oldest classes of channel codes, finding a low complexity soft-input decoding scheme is still an…

Information Theory · Computer Science 2021-07-28 Marvin Geiselhart , Ahmed Elkelesh , Moustafa Ebada , Sebastian Cammerer , Stephan ten Brink

In this paper, probabilistic shaping is numerically and experimentally investigated for increasing the transmission reach of wavelength division multiplexed (WDM) optical communication system employing quadrature amplitude modulation (QAM).…

Since the classical work of Berlekamp, McEliece and van Tilborg, it is well known that the problem of exact maximum-likelihood (ML) decoding of general linear codes is NP-hard. In this paper, we show that exact ML decoding of a classs of…

Information Theory · Computer Science 2016-11-17 Weiyu Xu , Babak Hassibi

In this paper, Sphere Decoding (SD) algorithms for Spatial Modulation (SM) are developed to reduce the computational complexity of Maximum-Likelihood (ML) detectors. Two SDs specifically designed for SM are proposed and analysed in terms of…

Information Theory · Computer Science 2013-05-31 Abdelhamid Younis , Sinan Sinanović , Marco Di Renzo , Raed Mesleh , Harald Haas

The Golden space-time trellis coded modulation (GST-TCM) scheme was proposed in \cite{Hong06} for a high rate $2\times 2$ multiple-input multiple-output (MIMO) system over slow fading channels. In this letter, we present the performance…

Information Theory · Computer Science 2007-11-09 Emanuele Viterbo , Yi Hong

In this paper we analyze the performance of 2by3 MIMOMCCDMA system in MATLAB which greatly reduces BER by increasing the efficiency of system. MIMO and MCCDMA system arrangement is used to decrease bit error rate and also figure a new…

Information Theory · Computer Science 2014-05-26 Mr. Atul Singh Kushwah , Mr. Sachin Manglasheril

A comprehensive study of the coded performance of long-haul spectrally-efficient WDM optical fiber transmission systems with different coded modulation decoding structures is presented. Achievable information rates are derived for three…

Information Theory · Computer Science 2024-01-25 Gabriele Liga , Alex Alvarado , Erik Agrell , Polina Bayvel

In this paper we present an alternative separable implementation of L2-orthogonal space-time codes (STC) for continuous phase modulation (CPM). In this approach, we split the STC CPM transmitter into a single conventional CPM modulator and…

Information Theory · Computer Science 2016-11-18 Matthias Hesse , Jerome Lebrun , Lutz Lampe , Luc Deneire

In multiple-input multiple-output (MIMO) fading channels, the design criterion for full-diversity space-time block codes (STBCs) is primarily determined by the decoding method at the receiver. Although constructions of STBCs have…

Information Theory · Computer Science 2017-01-16 J. Harshan , Amin Sakzad , Emanuele Viterbo

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

A new coded modulation scheme is proposed. At the transmitter, the concatenation of a distribution matcher and a systematic binary encoder performs probabilistic signal shaping and channel coding. At the receiver, the output of a bitwise…

Information Theory · Computer Science 2015-04-23 Georg Böcherer , Patrick Schulte , Fabian Steiner

Perfect Space-Time Codes (STC) are optimal codes in their original construction for Multiple Input Multiple Output (MIMO) systems. Based on Cyclic Division Algebras (CDA), they are full-rate, full-diversity codes, have Non-Vanishing…

Information Theory · Computer Science 2010-11-03 Mireille Sarkiss , Ghaya Rekaya-Ben Othman , Mohamed Oussama Damen , Jean-Claude Belfiore

In this paper, a novel low-complexity detection algorithm for spatial modulation (SM), referred to as the minimum-distance of maximum-length (m-M) algorithm, is proposed and analyzed. The proposed m-M algorithm is a smart searching method…

Information Theory · Computer Science 2019-07-22 Ibrahim Al-Nahhal , Ertugrul Basar , Octavia A. Dobre , Salama Ikki

This article investigates the effect of equal and unequal received powers on the performances of different MIMO-OFDM schemes for terrestrial digital TV. More precisely, we focus on three types of non-orthogonal schemes: the BLAST scheme,…

Networking and Internet Architecture · Computer Science 2008-09-30 Youssef Nasser , Jean-François Hélard , Matthieu Crussière , Oudomsack Pasquero

For a family/sequence of STBCs $\mathcal{C}_1,\mathcal{C}_2,\dots$, with increasing number of transmit antennas $N_i$, with rates $R_i$ complex symbols per channel use (cspcu), the asymptotic normalized rate is defined as $\lim_{i \to…

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

We consider a time division duplex (TDD) $n_t \times n_r$ multiple-input multiple-output (MIMO) system with channel state information (CSI) at both the transmitter and receiver. We propose X- and Y-Codes to achieve high multiplexing and…

Information Theory · Computer Science 2009-12-11 Saif Khan Mohammed , Emanuele Viterbo , Yi Hong , Ananthanarayanan Chockalingam

Multiple beamforming is realized by singular value decomposition of the channel matrix which is assumed to be known to both the transmitter and the receiver. Bit-Interleaved Coded Multiple Beamforming (BICMB) can achieve full diversity as…

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

Multiple Input Multiple Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) is a promising transmission scheme for high performance broadband wireless communications. However, this technique suffers from a major drawback which…

Information Theory · Computer Science 2014-12-30 Mouna Sghaier , Fatma Abdelkefi , Mohamed Siala

This paper investigates the design and performance of delayed bit-interleaved coded modulation (DBICM) with low-density parity-check (LDPC) codes. For Gray labeled square $M$-ary quadrature amplitude modulation (QAM) constellations, we…

Information Theory · Computer Science 2021-03-04 Yihuan Liao , Min Qiu , Jinhong Yuan

The min-sum (MS) algorithm is arguably the second most fundamental algorithm in the realm of message passing due to its optimality (for a tree code) with respect to the {\em block error} probability \cite{Wiberg}. There also seems to be a…

Information Theory · Computer Science 2007-07-13 Kapil Bhattad , Vishwambhar Rathi , Ruediger Urbanke