English
Related papers

Related papers: On the Search for High-Rate Quasi-Orthogonal Space…

200 papers

Distributed space-time block coding is a diversity technique to mitigate the effects of fading in multi-hop wireless networks, where multiple relay stages are used by a source to communicate with its destination. This paper proposes a new…

Information Theory · Computer Science 2008-05-06 Rahul Vaze , Robert W. Heath

The computational complexity of the Maximum Likelihood decoding algorithm in [1], [2] for orthogonal space-time block codes is smaller than specified.

Information Theory · Computer Science 2009-08-08 Ender Ayanoglu

Because of the emerging field of Internet of Things (IoT), future backscatter RFID is required to be more reliable and data intensive. Motivated by this, orthogonal space-time block code (OSTBC), which is very successful in mobile…

Information Theory · Computer Science 2015-02-18 Chen He , Z. Jane Wang , Victor C. M. Leung

In this thesis, we study differential modulation schemes which do not need channel knowledge at the transmitter nor at the receiver. First, we consider single-antenna systems and investigate the use of Differential Amplitude Phase Shift…

Information Theory · Computer Science 2019-02-12 Rania Morsi

The computational complexity of optimum decoding for an orthogonal space-time block code G satisfying the orthogonality property that the Hermitian transpose of G multiplied by G is equal to a constant c times the sum of the squared symbols…

Information Theory · Computer Science 2009-10-13 Ender Ayanoglu , Erik G. Larsson , Eleftherios Karipidis

In this paper, we present a space-time-frequency joint block coding (STFBC) scheme to exploit the essential space-time-frequency degrees of freedom of multiuser MISO-MC-CDMA systems. Specifically, we use a series of orthogonal random codes…

Information Theory · Computer Science 2014-07-10 Xiaoming Chen , Xiumin Wang

Distributed Space-Time Block Codes (DSTBCs) from Complex Orthogonal Designs (CODs) (both square and non-square CODs other than the Alamouti design) are known to lose their single-symbol ML decodable (SSD) property when used in two-hop…

Information Theory · Computer Science 2009-08-04 J. Harshan , B. Sundar Rajan , Are Hjørungnes

Partial interference cancellation (PIC) group decoding proposed by Guo and Xia is an attractive low-complexity alternative to the optimal processing for multiple-input multiple-output (MIMO) wireless communications. It can well deal with…

Information Theory · Computer Science 2010-03-23 Wei Zhang , Long Shi , Xiang-Gen Xia

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

Orthogonal geometric constructions are the basis of many many quantum error-correcting codes (QEC), but strict orthogonality constraints limit design flexibility and resource efficiency. We introduce a quasi-orthogonal geometric framework…

In this paper, we present a belief propagation (BP) based algorithm for decoding non-orthogonal space-time block codes (STBC) from cyclic division algebras (CDA) having {\em large dimensions}. The proposed approach involves message passing…

Information Theory · Computer Science 2009-01-14 Madhekar Suneel , Pritam Som , A. Chockalingam , B. Sundar Rajan

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD $\mathcal{O}_z$ with parameter $[p, n, k]$ is a $p \times n$ matrix, where nonzero entries are filled by $\pm z_i$ or $\pm z^*_i$, $i = 1, 2,..., k$, such…

Information Theory · Computer Science 2012-04-03 Yuan Li , Haibin Kan

This paper (Part of the content of this manuscript has been accepted for presentation in IEEE Globecom 2008, to be held in New Orleans) deals with low maximum likelihood (ML) decoding complexity, full-rate and full-diversity space-time…

Information Theory · Computer Science 2008-09-04 K. Pavan Srinath , B. Sundar Rajan

An equivalent model for a multi-input multi-output (MIMO) communication system with orthogonal space-time block codes (OSTBCs) is proposed based on a newly revealed connection between OSTBCs and Euclidean codes. Examples of distance…

Information Theory · Computer Science 2016-03-03 Alex E. Geyer , Reza Nikjah , Sergiy A. Vorobyov , Norman C. Beaulieu

We propose several differential decoding schemes for asynchronous multi-user MIMO systems based on orthogonal space-time block codes (OSTBCs) where neither the transmitters nor the receiver has knowledge of the channel. First, we derive…

Information Theory · Computer Science 2014-12-22 Sina Poorkasmaei , Hamid Jafarkhani

This letter investigates the problem of blind detection of orthogonal space-time block codes (OSTBC) over a quasi-static flat multiple-input multiple-output (MIMO) Rayleigh fading channel. We first introduce a core iterative least-squares…

Information Theory · Computer Science 2016-11-15 Xiaowen Tian , Ming Li , Guangyu Ti , Wenfei Liu

Differential space time block coding (STBC) achieves full spatial diversity and avoids channel estimation overhead. Over highly frequency-selective channels, STBC is integrated with orthogonal frequency division multiplexing (OFDM) to…

Information Theory · Computer Science 2016-12-28 Lei Chen , Ahmed G. Helmy , Guangrong Yue , Shaoqian Li , Naofal Al-Dhahir

In this paper, a comprehensive study has been made to evaluate the performance of a MISO wireless communication system. The 4-by-1 spatially multiplexed Turbo encoded system under investigation incorporates Quasi-orthogonal space-time block…

Information Theory · Computer Science 2012-05-23 M. Hasnat Kabir , Shaikh Enayet Ullah , Mustari Zaman , Md. Golam Rashed

A novel distributed space-time block code (STBC) for the next generation mobile TV broadcasting is proposed. The new code provides efficient performance within a wide range of power imbalance showing strong adaptivity to the single…

Networking and Internet Architecture · Computer Science 2012-12-12 Ming Liu , Maryline Hélard , Matthieu Crussière , Jean-François Hélard

A code $C \colon \{0,1\}^k \to \{0,1\}^n$ is a $q$-locally decodable code ($q$-LDC) if one can recover any chosen bit $b_i$ of the message $b \in \{0,1\}^k$ with good confidence by randomly querying the encoding $x := C(b)$ on at most $q$…

Computational Complexity · Computer Science 2023-08-30 Omar Alrabiah , Venkatesan Guruswami , Pravesh K. Kothari , Peter Manohar