logo
    Maximum-Likelihood Detection of Orthogonal Space-Time Block Coded OFDM in Unknown Block Fading Channels
    40
    Citation
    39
    Reference
    10
    Related Paper
    Citation Trend
    Abstract:
    For orthogonal space-time block coded orthogonal frequency division multiplexing (OSTBC-OFDM) systems, many of the existing blind detection and channel estimation methods rely on the assumption that the channel is static for many OSTBC-OFDM blocks. This paper considers the blind (semiblind) maximum-likelihood (ML) detection problem of OSTBC-OFDM with a single OSTBC-OFDM block only. The merit of such an investigation is the ability to accommodate channels with shorter coherence time. We examine both the implementation and identifiability issues, with a focus on BPSK or QPSK constellations. In the implementation, we propose reduced-complexity detection schemes using subchannel grouping. In the identifiability analysis, we show that the proposed schemes can ensure a probability one identifiability condition using very few number of pilots. For example, the proposed semiblind detection scheme only requires a single pilot code for unique data identification; while the conventional pilot-based channel estimation method requires L pilots where L denotes the channel length. Our simulation results demonstrate that the proposed schemes can provide performance close to that of their nonblind counterparts.
    Keywords:
    Identifiability
    Space–time block code
    In this paper, we give a family of orthogonal space time block codes (STBC), which is so called universal rotated STBC. The constructed codes include all existing STBC cases, and give several extended results suitable for different modulations, such as MPSK or M-QAM. The results show that the proposed codes can be widely applied for MIMO transmission, quasi-orthogonal designs and the orthogonal set partition of the space time trellis codes (STTC), e.g., super orthogonal STTC.
    Space–time block code
    QAM
    Space–time trellis code
    Trellis modulation
    A family of space-time block codes (STBCs) that achieve full rate and full diversity is designed with a simple approach by making use of Hadamard transforms. Simulations show the good performance of the proposed STBC.
    Space–time block code
    Hadamard code
    Code (set theory)
    Full Rate
    Citations (0)
    A class of rate-one space-time block codes (STBC) allowing the decoding of transmitted symbols into four groups is recently proposed by Yuen, Guan and Tjhung. This code is called four-group decodable STBC (4Gp-STBC). In this paper, the equivalent channel of 4Gp-STBC is derived and a new method to decode 4Gp-STBC based on sphere decoders is presented. Furthermore, the performance of 4Gp-STBC is analyzed. A New signal rotation method is proposed, which performs better than the existing one.
    Space–time block code
    Code (set theory)
    Citations (13)
    The iteratively decoded space-time trellis codes (ISTTC) have been introduced in Junghoon Suh and Mostofa K. Howlader (March 2004). In this article, we propose to combine a differential space-time block code (DSTBC) scheme with ISTTC, and show that an acceptable performance can be achieved over flat fading channels without channel estimation and error correction codes. When the space-time trellis code (STTC) is combined with space-time block codes (STTC-STBC), it provides an improved BER over the system with STTC only. Here, we also present an iteratively decoded STTC-STBC (ISTTC-STBC) to improve the BER performance, and compare the performance of ISTTC-STBC with ISTTC-DSTBC. The design methodologies of ISTTC-DSTBC and ISTTC-STBC are described in detail, where the extrinsic information shared between two constituent decoders and computing branch metrics using soft-outputs out of DSTBC or STBC are studied thoroughly. The performance of these proposed schemes are shown via simulation.
    Space–time block code
    Trellis (graph)
    Space–time trellis code
    Code (set theory)
    Convolutional code
    It is well known that Space-Time Block Codes from orthogonal designs (O-STBC) are linearly Maximum-Likelihood (ML) decodable. However there are not full rate complex O-STBC designs except for two transmit-antennas. Recently, one class of minimum-decoding-complexity STBCs (MDC-STBC) have been studied
    Space–time block code
    Symbol (formal)
    Citations (1)
    Hadamard transform has played a great part in Jacket transform. Motivated by Jacket transform, we propose a simple approach for space time block codes (STBC) design by using the Hadamrd in this letter,which achieves full rate, full diversity and employs simple decoding. The orthogonal STBC may be designed easily by using the proposed approach. Especially the performance of the designed orthogonal STBC may be improved greatly.
    Space–time block code
    Full Rate
    Citations (13)
    The schemes about orthogonal STBC codes, quasi-orthogonal STBC codes, and STBC codes using constellation rotations are introduced in this paper. Simulation results and performance comparison of these schemes are presented. In the same condition, the STBC code providing full diversity and full rate outperforms all other codes compared.
    Space–time block code
    Code (set theory)
    Full Rate
    Transmit diversity
    Diversity gain
    Citations (0)
    This paper proposed space-time block codes (STBC) based on Galois theory. These codes are linear, which can be decoded via the sphere decoding algorithm or any interference cancellation algorithm. The simulation results show that the performance of the space-time block code system based on Galois theory is better than that of the orthogonal space-time block code system and the uncoded system. When the SNR increases, the difference between the BER of the orthogonal STBC system and that of the STBC system in this paper is increased. Also, the difference between the BER of the uncoded system and that of the STBC system in this paper increases with the SNR.
    Space–time block code
    Citations (0)
    For two-transmitter systems, there are (full-rate) orthogonal space-time block codes (O-STBC). For four-transmitter systems, there are (full-rate) quasi-orthogonal space-time block codes (QO-STBC). The orthogonality of such codes makes a decoder attractively simple with only little compromise of optimality of coding performance. A complete family of O-STBC is well understood. But for QO-STBC, only ad hoc examples have been reported in the literature. In this paper, we provide a systematic construction of a complete family of 4 /spl times/ 4 QO-STBC. We show that there are only three independent QO-STBC and all other QO-STBC can be constructed by trivial variations of any three independent codes. Indeed, all 4 /spl times/ 4 QO-STBC in the literature can be constructed in such a way. Furthermore, we show a connection between three independent QO-STBC and the Hurwitz-Radon families of matrices. A complete set of the HR families of size four is also discovered.
    Space–time block code
    Orthogonality
    Recently several STBC designs were proposed for MIMO systems with linear receivers. In this paper, we propose a new design of high-rate STBC with linear receivers. Compared to the overlapped Alamouti code (OAC) recently proposed by Shang and Xia, the new STBC has a higher symbol rate without guarantee of achieving full diversity. To achieve the same rate, the new STBC has only a half of the block length (code delay) of the OAC. Simulation results show that in comparison with some existing codes for a given rate the proposed STBC can give a better outage probability performance.
    Space–time block code
    Code (set theory)
    Diversity gain
    Full Rate
    Citations (6)