English
Related papers

Related papers: Reliable Detection for Spatial Modulation Systems

200 papers

With the assistance of singular value decomposition (SVD), a multi-beam directional modulation (DM) scheme based on symmetrical multi-carrier frequency diverse array (FDA) is proposed. The proposed DM scheme is capable of achieving…

Signal Processing · Electrical Eng. & Systems 2019-07-30 Qian Cheng , Vincent Fusco , Jiang Zhu , Shilian Wang , Chao Gu

Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses significant challenges for practical receiver implementations, in particular in the context…

Information Theory · Computer Science 2009-06-05 Christoph Studer , Helmut Bölcskei

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

Spatial modulation (SM) is a transmission scheme that uses multiple transmit antennas but only one transmit RF chain. At each time instant, only one among the transmit antennas will be active and the others remain silent. The index of the…

Information Theory · Computer Science 2014-01-28 T. Lakshmi Narasimhan , Yalagala Naresh , Tanumay Datta , A. Chockalingam

We introduce Reward-Guided Speculative Decoding (RSD), a novel framework aimed at improving the efficiency of inference in large language models (LLMs). RSD synergistically combines a lightweight draft model with a more powerful target…

Computation and Language · Computer Science 2025-06-27 Baohao Liao , Yuhui Xu , Hanze Dong , Junnan Li , Christof Monz , Silvio Savarese , Doyen Sahoo , Caiming Xiong

Although the sphere decoder (SD) is a powerful detector for multiple-input multiple-output (MIMO) systems, it has become computationally prohibitive in massive MIMO systems, where a large number of antennas are employed. To overcome this…

Information Theory · Computer Science 2021-07-22 Nhan Thanh Nguyen , Kyungchun Lee , Huaiyu Dai

Speculative decoding is an inference-acceleration method for large language models (LLMs) where a small language model generates a draft-token sequence which is further verified by the target LLM in parallel. Recent works have advanced this…

Machine Learning · Computer Science 2024-03-06 Wonseok Jeon , Mukul Gagrani , Raghavv Goel , Junyoung Park , Mingu Lee , Christopher Lott

This paper proposes the Symbolic-Stochastic Chase Decoding Algorithm (S-SCA) for the Reed-Solomon (RS) and BCH codes. By efficient usage of void space between constellation points for $q$-ary modulations and using soft information at the…

Information Theory · Computer Science 2017-07-17 Hossein Mani , Saied Hemati

Offline Handwritten Mathematical Expression Recognition (HMER) has been dramatically advanced recently by employing tree decoders as part of the encoder-decoder method. Despite the tree decoder-based methods regard the expressions as a tree…

Computer Vision and Pattern Recognition · Computer Science 2023-03-14 Zihao Lin , Jinrong Li , Fan Yang , Shuangping Huang , Xu Yang , Jianmin Lin , Ming Yang

This work investigates spatial-mode multiplexing (SMM) for practical free-space optical communication (FSO) systems using direct detection. Unlike several works in the literature where mutually incoherent channels are assumed, we consider…

Information Theory · Computer Science 2018-01-22 Shenjie Huang , Gilda Raoof Mehrpoor , Majid Safari

The problem of efficient modulation classification (MC) in multiple-input multiple-output (MIMO) systems is considered. Per-layer likelihood-based MC is proposed by employing subspace decomposition to partially decouple the transmitted…

Information Theory · Computer Science 2016-10-12 Hadi Sarieddeen , Mohammad M. Mansour , Ali Chehab

We consider the detection of binary (antipodal) signals transmitted in a spatially multiplexed fashion over a fading multiple-input multiple-output (MIMO) channel and where the detection is done by means of semidefinite relaxation (SDR).…

Information Theory · Computer Science 2007-07-13 J. Jalden , B. Ottersten

In the setting of quasi-static multiple-input multiple-output (MIMO) channels, we consider the high signal-to-noise ratio (SNR) asymptotic complexity required by the sphere decoding (SD) algorithm for decoding a large class of full rate…

Information Theory · Computer Science 2011-02-08 Joakim Jalden , Petros Elia

A complexity-adaptive tree search algorithm is proposed for $\boldsymbol{G}_N$-coset codes that implements maximum-likelihood (ML) decoding by using a successive decoding schedule. The average complexity is close to that of the successive…

Information Theory · Computer Science 2021-09-03 Peihong Yuan , Mustafa Cemil Coşkun

Massive MIMO, a candidate for 5G technology, promises significant gains in wireless data rates and link reliability by using large numbers of antennas (more than 64) at the base transceiver station (BTS). Extra antennas help by focusing the…

Information Theory · Computer Science 2016-05-11 Garimella Rama Murthy , Kunal Sankhe

The interpolation based algebraic decoding for Reed-Solomon (RS) codes can correct errors beyond half of the code's minimum Hamming distance. Using soft information, the algebraic soft decoding (ASD) further improves the decoding…

Information Theory · Computer Science 2018-05-18 Jiongyue Xing , Li Chen , Martin Bossert

Multidimensional scaling (MDS) is a popular dimensionality reduction techniques that has been widely used for network visualization and cooperative localization. However, the traditional stress minimization formulation of MDS necessitates…

Optimization and Control · Mathematics 2016-12-22 Ketan Rajawat , Sandeep Kumar

One popular approach to soft-decision decoding of Reed-Solomon (RS) codes is based on using multiple trials of a simple RS decoding algorithm in combination with erasing or flipping a set of symbols or bits in each trial. This paper…

Information Theory · Computer Science 2015-03-17 Phong S. Nguyen , Henry D. Pfister , Krishna R. Narayanan

Minimum achievable complexity (MAC) for a maximum likelihood (ML) performance-achieving detection algorithm is derived. Using the derived MAC, we prove that the conventional sphere decoding (SD) algorithms suffer from an inherent weakness…

Information Theory · Computer Science 2021-09-21 Mohammad Neinavaie , Mostafa Derakhtian , Sergiy A. Vorobyov

Recently, a number of authors have proposed decoding schemes for Reed-Solomon (RS) codes based on multiple trials of a simple RS decoding algorithm. In this paper, we present a rate-distortion (R-D) approach to analyze these…

Information Theory · Computer Science 2009-08-21 Phong S. Nguyen , Henry D. Pfister , Krishna R. Narayanan