Tjeng Thiang Tjhung

Learn More
In this paper, we consider a Quasi-Orthogonal STBC with minimum decoding complexity (MDC-QOSTBC). We formulate its algebraic structure and propose a systematic method for its construction. We show that a maximum likelihood (ML) decoder for this MDCQOSTBC for any numbers of transmit antennas only requires the joint detection of two real symbols. Assuming the(More)
Quasi-Orthogonal Space-Time Block Code presents an up-to-date, comprehensive and in-depth discussion of an important emerging class of space-time codes, called the Quasi-Orthogonal STBC (QO-STBC). Used in Multiple-Input Multiple-Output (MIMO) communication systems, they provide transmit diversity with higher code rates than the well-known orthogonal STBC(More)
Two new rate-one full-diversity space-time block codes (STBC) are proposed. They are characterized by the lowest decoding complexity among the known rate-one STBC, arising due to the complete separability of the transmitted symbols into four groups for maximum likelihood detection. The first and the second codes are delay-optimal if the number of transmit(More)
A new class of quasi-orthogonal space-time block code (QO-STBC) namely minimum-decoding-complexity QO-STBC (MDC-QOSTBC) has recently been proposed in the literature. In this paper, we analyze some of its essential code parameters and code properties. Specifically we derive its maximum achievable code rate expression for any number of transmit antennas. We(More)
In this paper, we formulate the algebraic structure of Quasi-Orthogonal STBC with minimum decoding complexity (MDC-QOSTBC), whose maximum likelihood (ML) decoder only requires the joint detection of two real symbols, for any numbers of transmit antennas. We also propose a systematic method to construct an MDC-QOSTBC from an Orthogonal-STBC (OSTBC). The(More)
Amicable complex orthogonal design (ACOD), which is the complex version of amicable orthogonal design first reported in Wolfe (1976) is proposed and its existence is proven. Using ACOD, new orthogonal space-time block codes (O-STBC) for four and eight transmit antennas are constructed. Their maximum achievable code rates are proven to be as high as the(More)
A Quasi-Orthogonal Space-Time Block Code (QO-STBC) is attractive because it achieves higher code rate than Orthogonal STBC and lower decoding complexity than nonorthogonal STBC. In this paper, we first derive the algebraic structure of QO-STBC, then we apply it in a novel graph-based search algorithm to find high-rate QO-STBCs with code rates greater than(More)
We show that Minimum-Decoding-Complexity QuasiOrthogonal Space-Time Block Code (MDC-QOSTBC) can be used to form a new differential space-time modulation (DSTM) scheme to provide full transmit diversity with single-symbol decodable complexity. This is the first known single-symbol decodable DSTM not based on Orthogonal STBC. We derive the DSTM code design(More)