13,503 research outputs found

    Concatenated Space Time Block Codes and TCM, Turbo TCM Convolutional as well as Turbo Codes

    No full text
    Space-time block codes provide substantial diversity advantages for multiple transmit antenna systems at a low decoding complexity. In this paper, we concatenate space-time codes with Convolutional Codes (CC), Turbo Convolutional codes (TC), Turbo BCH codes (TBCH), Trellis Coded Modulation (TCM) and Turbo Trellis Coded Modulation (TTCM) schemes for achieving a high coding gain. The associated performance and complexity of the coding schemes is compared

    Space-time coding for UMTS. Performance evaluation in combination with convolutional and turbo coding

    Get PDF
    Space-time codes provide both diversity and coding gain when using multiple transmit antennas to increase spectral efficiency over wireless communications systems. Space-time block codes have already been included in the standardization process of UMTS in conjunction with conventional channel codes (convolutional and turbo codes). We discuss different encoding and decoding strategies when transmit diversity is combined with conventional channel codes, and present simulations results for the TDD and FDD modes of UTRA.Peer ReviewedPostprint (published version

    Turbo space-time coded modulation : principle and performance analysis

    Get PDF
    A breakthrough in coding was achieved with the invention of turbo codes. Turbo codes approach Shannon capacity by displaying the properties of long random codes, yet allowing efficient decoding. Coding alone, however, cannot fully address the problem of multipath fading channel. Recent advances in information theory have revolutionized the traditional view of multipath channel as an impairment. New results show that high gains in capacity can be achieved through the use of multiple antennas at the transmitter and the receiver. To take advantage of these new results in information theory, it is necessary to devise methods that allow communication systems to operate close to the predicted capacity. One such method recently invented is space-time coding, which provides both coding gain and diversity advantage. In this dissertation, a new class of codes is proposed that extends the concept of turbo coding to include space-time encoders as constituent building blocks of turbo codes. The codes are referred to as turbo spacetime coded modulation (turbo-STCM). The motivation behind the turbo-STCM concept is to fuse the important properties of turbo and space-time codes into a unified design framework. A turbo-STCM encoder is proposed, which consists of two space-time codes in recursive systematic form concatenated in parallel. An iterative symbol-by-symbol maximum a posteriori algorithm operating in the log domain is developed for decoding turbo-STCM. The decoder employs two a posteriori probability (APP) computing modules concatenated in parallel; one module for each constituent code. The analysis of turbo-STCM is demonstrated through simulations and theoretical closed-form expressions. Simulation results are provided for 4-PSK and 8-PSK schemes over the Rayleigh block-fading channel. It is shown that the turbo-STCM scheme features full diversity and full coding rate. The significant gain can be obtained in performance over conventional space-time codes of similar complexity. The analytical union bound to the bit error probability is derived for turbo-STCM over the additive white Gaussian noise (AWGN) and the Rayleigh block-fading channels. The bound makes it possible to express the performance analysis of turbo-STCM in terms of the properties of the constituent space-time codes. The union bound is demonstrated for 4-PSK and 8-PSK turbo-STCM with two transmit antennas and one/two receive antennas. Information theoretic bounds such as Shannon capacity, cutoff rate, outage capacity and the Fano bound, are computed for multiantenna systems over the AWGN and fading channels. These bounds are subsequently used as benchmarks for demonstrating the performance of turbo-STCM

    New bounding techniques for channel codes over quasi-static fading channels

    Get PDF
    This thesis is intended to provide several new bounding techniques for channel codes over quasi-static fading channels (QSFC). This type of channel has drawn more and more attention recently with the demanding need for higher capacity and more reliable wireless communication systems. Although there have been some published results on analyzing the performance of channel codes over QSFCs, most of them produced quite loose performance upper bounds. In this thesis, the general Gallager bounding approach which provides convergent upper bounds of coded systems over QSFCs is addressed first. It is shown that previous Gallager bounds employing trivial low SNR bounds tended to be quite loose. Then improved low instantaneous SNR bounds are derived for two classes of convolutional codes including turbo codes. Consequently, they are combined with the classical Union-Chernoff bound to produce new performance upper bounds for simple convolutional and turbo codes over single-input single-output (SISO) QSFCs. The new bound provides a much improved alternative to characterizing the performance of channel codes over QSFCs over the existing ones. Next the new bounding approach is extended to cases of serially concatenated space-time block codes, which show equivalence with SISO QSFCs. Tighter performance bounds are derived for this coding scheme for two specific cases: first a convolutional code, and later a turbo code. Finally, the more challenging cases of multiple-input multiple-output (MIMO) QSFCs are investigated. Several performance upper bounds are derived for the bit error probability of different cases of space-time trellis codes (STTC) over QSFCs using a new and tight low SNR bound. Also included in this work is an algorithm for computing the unusual information eigenvalue spectrum of STTCs

    Super-orthogonal space-time turbo coded OFDM systems.

    Get PDF
    Thesis (Ph.D.)-University of KwaZulu-Natal, Durban, 2012.The ever increasing demand for fast and efficient broadband wireless communication services requires future broadband communication systems to provide a high data rate, robust performance and low complexity within the limited available electromagnetic spectrum. One of the identified, most-promising techniques to support high performance and high data rate communication for future wireless broadband services is the deployment of multi-input multi-output (MIMO) antenna systems with orthogonal frequency division multiplexing (OFDM). The combination of MIMO and OFDM techniques guarantees a much more reliable and robust transmission over a hostile wireless channel through coding over the space, time and frequency domains. In this thesis, two full-rate space-time coded OFDM systems are proposed. The first one, designed for two transmit antennas, is called extended super-orthogonal space-time trellis coded OFDM (ESOSTTC-OFDM), and is based on constellation rotation. The second one, called super-quasi-orthogonal space-time trellis coded OFDM (SQOSTTCOFDM), combines a quasi-orthogonal space-time block code with a trellis code to provide a full-rate code for four transmit antennas. The designed space-time coded MIMO-OFDM systems achieve a high diversity order with high coding gain by exploiting the diversity advantage of frequency-selective fading channels. Concatenated codes have been shown to be an effective technique of achieving reliable communication close to the Shannon limit, provided that there is sufficient available diversity. In a bid to improve the performance of the super orthogonal space-time trellis code (SOSTTC) in frequency selective fading channels, five distinct concatenated codes are proposed for MIMO-OFDM over frequency-selective fading channels in the second part of this thesis. Four of the coding schemes are based on the concatenation of convolutional coding, interleaving, and space-time coding, along multiple-transmitter diversity systems, while the fifth coding scheme is based on the concatenation of two space-time codes and interleaving. The proposed concatenated Super-Orthogonal Space-Time Turbo-Coded OFDM System I. B. Oluwafemi 2012 vii coding schemes in MIMO-OFDM systems achieve high diversity gain by exploiting available diversity resources of frequency-selective fading channels and achieve a high coding gain through concatenations by employing the turbo principle. Using computer software simulations, the performance of the concatenated SOSTTC-OFDM schemes is compared with those of concatenated space-time trellis codes and those of conventional SOSTTC-OFDM schemes in frequency-selective fading channels. Simulation results show that the concatenated SOSTTC-OFDM system outperformed the concatenated space-time trellis codes and the conventional SOSTTC-OFDM system under the various channel scenarios in terms of both diversity order and coding gain

    Space-Time Trellis and Space-Time Block Coding Versus Adaptive Modulation and Coding Aided OFDM for Wideband Channels

    No full text
    Abstract—The achievable performance of channel coded spacetime trellis (STT) codes and space-time block (STB) codes transmitted over wideband channels is studied in the context of schemes having an effective throughput of 2 bits/symbol (BPS) and 3 BPS. At high implementational complexities, the best performance was typically provided by Alamouti’s unity-rate G2 code in both the 2-BPS and 3-BPS scenarios. However, if a low complexity implementation is sought, the 3-BPS 8PSK space-time trellis code outperfoms the G2 code. The G2 space-time block code is also combined with symbol-by-symbol adaptive orthogonal frequency division multiplex (AOFDM) modems and turbo convolutional channel codecs for enhancing the system’s performance. It was concluded that upon exploiting the diversity effect of the G2 space-time block code, the channel-induced fading effects are mitigated, and therefore, the benefits of adaptive modulation erode. In other words, once the time- and frequency-domain fades of the wideband channel have been counteracted by the diversity-aided G2 code, the benefits of adaptive modulation erode, and hence, it is sufficient to employ fixed-mode modems. Therefore, the low-complexity approach of mitigating the effects of fading can be viewed as employing a single-transmitter, single-receiver-based AOFDM modem. By contrast, it is sufficient to employ fixed-mode OFDM modems when the added complexity of a two-transmitter G2 scheme is affordable

    Turbo Decoding and Detection for Wireless Applications

    Get PDF
    A historical perspective of turbo coding and turbo transceivers inspired by the generic turbo principles is provided, as it evolved from Shannon’s visionary predictions. More specifically, we commence by discussing the turbo principles, which have been shown to be capable of performing close to Shannon’s capacity limit. We continue by reviewing the classic maximum a posteriori probability decoder. These discussions are followed by studying the effect of a range of system parameters in a systematic fashion, in order to gauge their performance ramifications. In the second part of this treatise, we focus our attention on the family of iterative receivers designed for wireless communication systems, which were partly inspired by the invention of turbo codes. More specifically, the family of iteratively detected joint coding and modulation schemes, turbo equalization, concatenated spacetime and channel coding arrangements, as well as multi-user detection and three-stage multimedia systems are highlighted
    corecore