English
Related papers

Related papers: Group-Decodable Space-Time Block Codes with Code R…

200 papers

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

Space-time block codes (STBCs) from non-square complex orthogonal designs are bandwidth efficient when compared with those from square real/complex orthogonal designs. Though there exists rate-1 ROD for any number of transmit antennas,…

Information Theory · Computer Science 2008-08-12 Smarajit Das , B. Sundar Rajan

We compare four open-loop transmit diversity schemes in a coded Orthogonal Frequency Division Multiplexing (OFDM) system with four transmit antennas, namely cyclic delay diversity (CDD), Space-Time Block Code (STBC, Alamouti code is used)…

Information Theory · Computer Science 2008-06-24 Chau Yuen , Yan Wu , Sumei Sun

In this letter, we consider intensity modulation/direct detection (IM/DD) channel in the visible light communication (VLC) systems with multiple transmitter phosphor-based white light emitting diodes (LED) and single receiver avalanche…

Information Theory · Computer Science 2015-09-25 Yan-Yu Zhang , Hong-Yi Yu , Yi-Jun Zhu , Jin-Long Wang

In this paper, fast-decodable lattice code constructions are designed for the nonorthogonal amplify-and-forward (NAF) multiple-input multiple-output (MIMO) channel. The constructions are based on different types of algebraic structures,…

Information Theory · Computer Science 2012-02-28 Camilla Hollanti , Nadya Markin

Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs becomes prohibitive large as the number of transmit and…

Information Theory · Computer Science 2016-11-15 G. Susinder Rajan , B. Sundar Rajan

This paper concerns the maximum-likelihood channel estimation for MIMO systems with orthogonal space-time block codes when the finite alphabet constraint of the signal constellation is relaxed. We study the channel coefficients estimation…

Information Theory · Computer Science 2020-05-26 Kamran Kalbasi , S. Jamaloddin Golestani

A set of sufficient conditions to construct $\lambda$-real symbol Maximum Likelihood (ML) decodable STBCs have recently been provided by Karmakar et al. STBCs satisfying these sufficient conditions were named as Clifford Unitary Weight…

Information Theory · Computer Science 2016-11-17 G. Susinder Rajan , B. Sundar Rajan

In the sixth generation (6G), ultra-reliable low-latency communications (URLLC) will be further developed to achieve TKu extreme connectivity. On the premise of ensuring the same rate and reliability, the spatial domain advantage of…

Information Theory · Computer Science 2025-04-02 Feng Ye , Xiaohu You , Jiamin Li , Chen Ji , Chuan Zhang

Low-density parity-check (LDPC) codes together with belief propagation (BP) decoding yield exceptional error correction capabilities in the large block length regime. Yet, there remains a gap between BP decoding and maximum likelihood…

Information Theory · Computer Science 2025-01-22 Jonathan Mandelbaum , Holger Jäkel , Laurent Schmalen

For any $n_t$ transmit, $n_r$ receive antenna ($n_t\times n_r$) MIMO system in a quasi-static Rayleigh fading environment, it was shown by Elia et al. that linear space-time block code-schemes (LSTBC-schemes) which have the non-vanishing…

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

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

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

To combine the high power efficiency of Continuous Phase Modulation (CPM) with either high spectral efficiency or enhanced performance in low Signal to Noise conditions, some authors have proposed to introduce CPM in a MIMO frame, by using…

Information Theory · Computer Science 2008-12-18 Matthias Hesse , Jerome Lebrun , Luc Deneire

Gradient descent and its many variants, including mini-batch stochastic gradient descent, form the algorithmic foundation of modern large-scale machine learning. Due to the size and scale of modern data, gradient computations are often…

Machine Learning · Statistics 2018-05-29 Zachary Charles , Dimitris Papailiopoulos

We propose novel deep joint source-channel coding (DeepJSCC) algorithms for wireless image transmission over multi-input multi-output (MIMO) Rayleigh fading channels, when channel state information (CSI) is available only at the receiver.…

Signal Processing · Electrical Eng. & Systems 2023-06-22 Chenghong Bian , Yulin Shao , Haotian Wu , Deniz Gunduz

Coherent Space-Time Shift Keying (CSTSK) is a recently developed generalized shift-keying framework for Multiple-Input Multiple-Output systems, which uses a set of Space-Time matrices termed as Dispersion Matrices (DM). CSTSK may be…

Information Theory · Computer Science 2012-10-10 Rakshith Rajashekar , K. V. S. Hari , L. Hanzo

In a distributed space-time coding scheme, based on the relay channel model, the relay nodes co-operate to linearly process the transmitted signal from the source and forward them to the destination such that the signal at the destination…

Information Theory · Computer Science 2008-06-20 J. Harshan , B. Sundar Rajan

"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

The design of linear STBCs offering a low-complexity ML decoding using the well known Sphere Decoder (SD) has been extensively studied in last years. The first considered approach to derive design criteria for the construction of such codes…

Information Theory · Computer Science 2016-05-11 Asma Mejri , Mohamed-Achraf Khsiba , Ghaya Rekaya-Ben Othmane
‹ Prev 1 4 5 6 7 8 10 Next ›