English
Related papers

Related papers: Revisited Design Criteria For STBCs With Reduced C…

200 papers

High-rate space-time block codes (STBC with code rate > 1) in multi-input multi-output (MIMO) systems are able to provide both spatial multiplexing gain and diversity gain, but have high maximum likelihood (ML) decoding complexity. Since…

Information Theory · Computer Science 2016-11-18 Tian Peng Ren , Yong Liang Guan , Chau Yuen , Erry Gunawan , Er Yang Zhang

Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The complexity of the SD has been shown to be exponential in some cases,…

Information Theory · Computer Science 2007-07-13 Luay Azzam , Ender Ayanoglu

It is well known that the Space-time Block Codes (STBCs) from Complex orthogonal designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD). The weight matrices of the square CODs are all unitary and obtainable from the…

Information Theory · Computer Science 2016-11-17 Sanjay Karmakar , K. Pavan Srinath , B. Sundar Rajan

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 2018-04-04 J. Harshan , Amin Sakzad , Emanuele Viterbo

Full-rate space time codes (STC) with rate = number of transmit antennas have high multiplexing gain, but high decoding complexity even when decoded using reduced-complexity decoders such as sphere or QRDM decoders. In this paper, we…

Information Theory · Computer Science 2015-05-30 Tian Peng Ren , Yong Liang Guan , Chau Yuen , Er Yang Zhang

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

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

The use of Space-Time Block Codes (STBCs) increases significantly the optimal detection complexity at the receiver unless the low-complexity decodability property is taken into consideration in the STBC design. In this paper we propose a…

Information Theory · Computer Science 2016-11-17 Amr Ismail , Jocelyn Fiorina , Hikmet Sari

In this paper, we propose a full-rate full-diversity space-time block code (STBC) for 2x2 reconfigurable multiple-input multiple-output (MIMO) systems that require a low complexity maximum likelihood (ML) detector. We consider a transmitter…

Information Theory · Computer Science 2015-05-27 Vida Vakilian , Hani Mehrpouyan , Yingbo Hua , Hamid Jafarkhani

Space-time coding techniques have become common-place in wireless communication standards as they provide an effective way to mitigate the fading phenomena inherent in wireless channels. However, the use of Space-Time Block Codes (STBCs)…

Information Theory · Computer Science 2016-11-17 Amr Ismail , Jocelyn Fiorina , Hikmet Sari

In this paper, collocated and distributed space-time block codes (DSTBCs) which admit multi-group maximum likelihood (ML) decoding are studied. First the collocated case is considered and the problem of constructing space-time block codes…

Information Theory · Computer Science 2008-11-24 G. Susinder Rajan , B. Sundar Rajan

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 this paper, we propose a reduced-complexity optimal modified sphere decoding (MSD) detection scheme for SCMA. As SCMA systems are characterized by a number of resource elements (REs) that are less than the number of the supported users,…

Information Theory · Computer Science 2017-08-30 Monirosharieh Vameghestahbanati , Ebrahim Bedeer , Ian Marsland , Ramy H. Gohary , Halim Yanikomeroglu

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

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

Ultra-reliable low-latency communications (URLLC) operate with short packets, where finite-blocklength effects make near-maximum-likelihood (near-ML) decoding desirable but often too costly. This paper proposes a two-stage near-ML decoding…

Information Theory · Computer Science 2026-02-10 Yubeen Jo , Geon Choi , Yongjune Kim , Namyoon Lee

Classical ML decoders of MIMO systems like the sphere decoder, the Schnorr-Euchner algorithm, the Fano and the stack decoders suffer of high complexity for high number of antennas and large constellation sizes. We propose in this paper a…

Information Theory · Computer Science 2008-11-07 Rym Ouertani , Ghaya Rekaya Ben-Othman , Abdellatif Salah

A partial interference cancellation (PIC) group decoding based space-time block code (STBC) design criterion was recently proposed by Guo and Xia, where the decoding complexity and the code rate trade-off is dealt when the full diversity is…

Information Theory · Computer Science 2010-01-04 Wei Zhang , Tianyi Xu , Xiang-Gen Xia

In this paper, we propose a systematic design of space-time block codes (STBC) which can achieve high rate and full diversity when the partial interference cancellation (PIC) group decoding is used at receivers. The proposed codes can be…

Information Theory · Computer Science 2010-04-19 Long Shi , Wei Zhang , Xiang-Gen Xia

Linear space-time block codes (STBCs) of unitary rate and full diversity, systematically constructed over arbitrary constellations for any number of transmit antennas are introduced. The codes are obtained by generalizing the existing ABBA…

Information Theory · Computer Science 2007-07-13 Giuseppe Thadeu Freitas de Abreu