569 research outputs found

    Space-Time Codes Concatenated with Turbo Codes over Fading Channels

    Get PDF
    The uses of space-time code (STC) and iterative processing have enabled robust communications over fading channels at previously unachievable signal-to-noise ratios. Maintaining desired transmission rate while improving the diversity from STC is challenging, and the performance of the STC suffers considerably due to lack of channel state information (CSI). This dissertation research addresses issues of considerable importance in the design of STC with emphasis on efficient concatenation of channel coding and STC with theoretical bound derivation of the proposed schemes, iterative space-time trellis coding (STTC), and differential space-time codes. First, we concatenate space-time block code (STBC) with turbo code for improving diversity gain as well as coding gain. Proper soft-information sharing is indispensable to the iterative decoding process. We derive the required soft outputs from STBC decoders for passing to outer turbo code. Traditionally, the performance of STBC schemes has been evaluated under perfect channel estimation. For fast time-varying channel, obtaining the CSI is tedious if not impossible. We introduce a scheme of calculating the CSI at the receiver from the received signal without the explicit channel estimation. The encoder of STTC, which is generally decoded using Viterbi like algorithm, is based on a trellis structure. This trellis structure provides an inherent advantage for the STTC scheme that an iterative decoding is feasible with the minimal addition computational complexity. An iteratively decoded space-time trellis coding (ISTTC) is proposed in this dissertation, where the STTC schemes are used as constituent codes of turbo code. Then, the performance upper bound of the proposed ISTTC is derived. Finally, for implementing STBC without channel estimation and maintaining trans- mission rate, we concatenate differential space-time block codes (DSTBC) with ISTTC. The serial concatenation of DSTBC or STBC with ISTTC offers improving performance, even without an outer channel code. These schemes reduce the system complexity com- pared to the standalone ISTTC and increase the transmission rate under the same SNR condition. Detailed design procedures of these proposed schemes are analyzed

    Interference-Mitigating Waveform Design for Next-Generation Wireless Systems

    No full text
    A brief historical perspective of the evolution of waveform designs employed in consecutive generations of wireless communications systems is provided, highlighting the range of often conflicting demands on the various waveform characteristics. As the culmination of recent advances in the field the underlying benefits of various Multiple Input Multiple Output (MIMO) schemes are highlighted and exemplified. As an integral part of the appropriate waveform design, cognizance is given to the particular choice of the duplexing scheme used for supporting full-duplex communications and it is demonstrated that Time Division Duplexing (TDD) is substantially outperformed by Frequency Division Duplexing (FDD), unless the TDD scheme is combined with further sophisticated scheduling, MIMOs and/or adaptive modulation/coding. It is also argued that the specific choice of the Direct-Sequence (DS) spreading codes invoked in DS-CDMA predetermines the properties of the system. It is demonstrated that a specifically designed family of spreading codes exhibits a so-called interference-free window (IFW) and hence the resultant system is capable of outperforming its standardised counterpart employing classic Orthogonal Variable Spreading Factor (OVSF) codes under realistic dispersive channel conditions, provided that the interfering multi-user and multipath components arrive within this IFW. This condition may be ensured with the aid of quasisynchronous adaptive timing advance control. However, a limitation of the system is that the number of spreading codes exhibiting a certain IFW is limited, although this problem may be mitigated with the aid of novel code design principles, employing a combination of several spreading sequences in the time-frequency and spatial-domain. The paper is concluded by quantifying the achievable user load of a UTRA-like TDD Code Division Multiple Access (CDMA) system employing Loosely Synchronized (LS) spreading codes exhibiting an IFW in comparison to that of its counterpart using OVSF codes. Both system's performance is enhanced using beamforming MIMOs

    A universal space-time architecture for multiple-antenna aided systems

    No full text
    In this tutorial, we first review the family of conventional multiple-antenna techniques, and then we provide a general overview of the recent concept of the powerful Multiple-Input Multiple-Output (MIMO) family based on a universal Space-Time Shift Keying (STSK) philosophy. When appropriately configured, the proposed STSK scheme has the potential of outperforming conventional MIMO arrangements

    SUPER ORTHOGONAL SPACE TIME TRELLIS CODES OVER NAKAGAMI FADING MODEL

    Get PDF
    Performance evaluation of super orthogonal space-time trellis codes for non-frequency selective fading channels & frequency selective fading channels. The analysis is done in presence of fast fading, block fading and quasi-static fading in Rayleigh, and Nakhagami fast fading channels along with comparison. While providing full diversity and full rate, the structure of our new codes allows an increase in the coding gain. Not only does our new SOSTTC outperform the space-time trellis codes in the literature, but it also provides a systematic method for designing space time trellis codes at different rates and for different trellises. Since we have used orthogonal designs as the building blocks in our new SOSTTCs, the complexity of the decoding remains low while full diversity is guaranteed. Codes operating at different rates, up to the highest theoretically possible rate, for different number of states, can be designed by using our optimal set partitioning. In general, new SOSTTCs can provide a tradeoff between rate and coding gain while achieving full diversity

    Improving the performance of free space optical systems: a space-time orthogonal frequency division modulation approach

    Get PDF
    Free space optical (FSO) communication systems are known for high capacity and information security. The overall system performances of FSO systems are however significantly affected by atmospheric turbulence induced fading. This paper, therefore, proposes a technique to mitigate this effect through the introduction of an additional degree of error correction capacity by exploiting the spectral dimension in the coding space. A space-time trellis coded orthogonal frequency division modulation (OFDM) scheme was developed, simulated and evaluated for optical communication through a Gamma-Gamma channel. The evaluation of the coding gain obtained from the simulation results, the mathematical analysis and the truncation error analysis shows that the proposed technique is a promising and viable technique for improving the error correction performance of space-time codes for free space optical communication links

    Transmission and detection for space-time block coding and v-blast systems

    Get PDF
    This dissertation focuses on topics of data transmission and detection of space -time block codes (STBC). The STBCs can be divided into two main categories, namely, the orthogonal space-time block codes (OSTBC) and the quasi-orthogonal space-time codes (Q-OSTBC). The space-time block coded systems from transceiver design perspective for both narrow-band and frequency selective wireless environment are studied. The dissertation also processes and studies a fast iterative detection scheme for a high-rate space-time transmission system, the V-BLAST system. In Chapter 2, a new OSTBC scheme with full-rate and full-diversity, which can be used on QPSK transceiver systems with four transmit antennas and any number of receivers is studied. The newly proposed coding scheme is a non-linear coding. Compared with full-diversity QOSTBC, an obvious advantage of our proposed new OSTBC is that the coded signals transmitted through all four transmit antennas do not experience any constellation expansion. In Chapter 3, a new fast coherent detection algorithm is proposed to provide maximum likelihood (ML) detection for Q-OSTBC. The new detection scheme is also very useful to analysis the diversity property of Q-OSTBC and design full diversity Q-OSTBC codes. The complexity of the new proposed detection algorithm can be independent to the modulation order and is especially suitable for high data rate transmission. In Chapter 4, the space-time coding schemes in frequency selective channels are studied. Q-OSTC transmission and detection schemes are firstly extended for frequency selective wireless environment. A new block based quasi-orthogonal space-time block encoding and decoding (Q-OSTBC) scheme for a wireless system with four transmit antennas is proposed in frequency selective fading channels. The proposed MLSE detection scheme effectively combats channel dispersion and frequency selectivity due to multipath, yet still provides full diversity gain. However, since the computational complexity of MLSE detection increases exponentially with the maximum delay of the frequency selective channel, a fast sub-optimal detection scheme using MMSE equalizer is also proposed, especially for channels with large delays. The Chapter 5 focuses on the V-BLAST system, an important high-rate space-time data transmission scheme. A reduced complexity ML detection scheme for VBLAST systems, which uses a pre-decoder guided local exhaustive search is proposed and studied. A polygon searching algorithm and an ordered successive interference cancellation (O-SIC) sphere searching algorithm are major components of the proposed multi-step ML detectors. At reasonable high SNRs, our algorithms have low complexity comparable to that of O-SIC algorithm, while they provide significant performance improvement. Another new low complexity algorithm termed ordered group-wise interference cancellation (O-GIC) is also proposed for the detection of high dimensional V-BLAST systems. The O-GIC based detection scheme is a sub-optimal detection scheme, however, it outperforms the O-SIC

    Study and Simulation of Quasi and Rotated Quasi Space Time Block Codes in MIMO systems using Dent Channel model

    Get PDF
    Multiple Input Multiple Output (MIMO) has become one of the most exciting fields in modern engineering. It is mainly used to increase data rate and capacity of wireless communication system. In this paper, we exploit the space and time diversity to decode the quasi and rotated quasi space time block codes (QOSTBC) based on dent channel model. For Doppler shifting and Rayleigh distribution we make use of dent channel model. This provides fast decoding and gives better performance of communication system.BER analysis is presented in terms of diversity and code rate. KEYWORDS: MIMO, Quasi Orthogonal Space-Time Block codes (QOSTBC), rotated QOSTBC, Maximum Likelihood (ML) decoding

    Computational Intelligence and Complexity Measures for Chaotic Information Processing

    Get PDF
    This dissertation investigates the application of computational intelligence methods in the analysis of nonlinear chaotic systems in the framework of many known and newly designed complex systems. Parallel comparisons are made between these methods. This provides insight into the difficult challenges facing nonlinear systems characterization and aids in developing a generalized algorithm in computing algorithmic complexity measures, Lyapunov exponents, information dimension and topological entropy. These metrics are implemented to characterize the dynamic patterns of discrete and continuous systems. These metrics make it possible to distinguish order from disorder in these systems. Steps required for computing Lyapunov exponents with a reorthonormalization method and a group theory approach are formalized. Procedures for implementing computational algorithms are designed and numerical results for each system are presented. The advance-time sampling technique is designed to overcome the scarcity of phase space samples and the buffer overflow problem in algorithmic complexity measure estimation in slow dynamics feedback-controlled systems. It is proved analytically and tested numerically that for a quasiperiodic system like a Fibonacci map, complexity grows logarithmically with the evolutionary length of the data block. It is concluded that a normalized algorithmic complexity measure can be used as a system classifier. This quantity turns out to be one for random sequences and a non-zero value less than one for chaotic sequences. For periodic and quasi-periodic responses, as data strings grow their normalized complexity approaches zero, while a faster deceasing rate is observed for periodic responses. Algorithmic complexity analysis is performed on a class of certain rate convolutional encoders. The degree of diffusion in random-like patterns is measured. Simulation evidence indicates that algorithmic complexity associated with a particular class of 1/n-rate code increases with the increase of the encoder constraint length. This occurs in parallel with the increase of error correcting capacity of the decoder. Comparing groups of rate-1/n convolutional encoders, it is observed that as the encoder rate decreases from 1/2 to 1/7, the encoded data sequence manifests smaller algorithmic complexity with a larger free distance value

    Performance comparison of differential space-time signalling schemes for OFDM systems

    Get PDF
    Differential transmit diversity is an attractive alternative to its coherent counterpart, especially for multiple antenna systems where channel estimation is more difficult to attain compared to that of single antenna systems. In this paper we compare two different types of differential transmit diversity techniques for OFDM based transmissions. The first technique uses differential space-time block codes (DSTBC) from orthogonal designs and the second uses the differential cyclic delay diversity (DCDD). The results compare the bit error performance for several transmit antenna configurations. The results show that DCDD offers a very close performance to that of DSTBC, with the advantage of a simplified receiver structure
    corecore