Download or read book On Designs and Fast Decoding Algorithms of Space time Codes and Group Codes written by Terasan Niyomsataya and published by . This book was released on 2008 with total page 376 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book On Designs and Fast Decoding Algorithms of Space time Codes and Group Codes written by Terasan Niyomsataya and published by . This book was released on 2008 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Space Time Coding written by Hamid Jafarkhani and published by Cambridge University Press. This book was released on 2005-09-22 with total page 320 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book covers the fundamental principles of space-time coding for wireless communications over multiple-input multiple-output (MIMO) channels, and sets out practical coding methods for achieving the performance improvements predicted by the theory. Starting with background material on wireless communications and the capacity of MIMO channels, the book then reviews design criteria for space-time codes. A detailed treatment of the theory behind space-time block codes then leads on to an in-depth discussion of space-time trellis codes. The book continues with discussion of differential space-time modulation, BLAST and some other space-time processing methods and the final chapter addresses additional topics in space-time coding. The theory and practice sections can be used independently of each other. Written by one of the inventors of space-time block coding, this book is ideal for a graduate student familiar with the basics of digital communications, and for engineers implementing the theory in real systems.

Download or read book Space time Code Designs and Fast Decoding for MIMO and Cooperative Communication Systems written by Yue Shang and published by ProQuest. This book was released on 2009 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: Space-time coding is an attractive technique to exploit the transmit diversity gain provided by a multiple-input multiple-output (MIMO) wireless system. Regarding a space-time code design, some important concerns are high rates, full diversity, large coding gain (diversity products) and low decoding complexity. However, a tradeoff exists among these goals and constructing a good code that optimizes some or all of these goals is a very practical and interesting problem that has attracted a lot of attention in the past 10 years. Furthermore, other design issues may also matter and should be taken into account when one considers certain special scenarios to which the space-time coding technique is applied. In this dissertation, we study both the code design at the transmitter side and the fast decoding algorithm at the receiver side for space-time coding. The first topic attempts to achieve both low decoding overhead and maximum (full) diversity for space-time block codes (STBC). By deploying a linear detector at the receiver, we can efficiently reduce the decoding complexity for an STBC and always obtain soft outputs that are desired when the STBC is concatenated with a channel code as in a real system. In this dissertation, we propose a design criterion for STBC to achieve full diversity with a zero-forcing (ZF) or minimum mean-square error (MMSE) receiver. Two families of STBC, orthogonal STBC (OSTBC) and Toeplitz codes, which are known to have full diversity with ZF or MMSE receiver, indeed meet this criterion, as one may expect. We also show that the symbol rates of STBC under this criterion are upper bounded by 1. Subsequently, we propose a novel family of STBC that satisfy the criterion and thus achieve full diversity with ZF or MMSE receiver. Our newly proposed STBC are constructed by overlapping the 2 x 2 Alamouti code and hence are named overlapped Alamouti codes. The new codes are close to orthogonal and have asymptotically optimal symbol rates. Simulation results show that overlapped Alamouti codes significantly outperform Toeplitz codes for any number of transmit antennas and also outperform OSTBC when the number of transmit antennas is above 4. The second topic concerns the design of space-time trellis codes (STTC) for their applications in cooperative communication systems, where transmission among different relay nodes that cooperate with each other is essentially asynchronous. A family of STTC that can achieve full cooperative diversity order regardless of the node transmission delays has been proposed and it was shown that the construction of this STTC family can be reduced to the design of binary matrices that can keep full row rank no matter how their rows are shifted. We call such matrices as shift-full-rank (SFR) matrices. We propose a systematic method to construct all the SFR matrices and, in particular, the shortest (square) SFR (SSFR) matrices that are attractive as the associated STTC require the fewest memories and hence the lowest decoding complexity. By relaxing the restriction imposed on SFR matrices, we also propose two matrix variations, q -SFR and LT-SFR matrices. In an extended cooperative system model with fractional symbol delays whose maximum value is specified, the STTC generated from q -SFR and LT-SFR matrices can still achieve asynchronous full diversity. As a result, more eligible generator matrices than SFR ones become available and some better STTC in terms of coding gain may be found. Finally, the third topic is to speed up the decoding algorithm for the vertical Bell Laboratories layered space-time (V-BLAST) scheme, a full rate STBC that however does not exploit any transmit diversity gain. A fast recursive algorithm for V-BLAST with the optimal ordered successive interference cancellation (SIC) detection has been proposed and two improved algorithms for it have also been independently introduced by different authors lately. We first incorporate the existing improvements into the original fast recursive algorithm to give an algorithm that is the fastest known one for the optimal SIC detection of V-BLAST. Then, we propose a further improvement from which two new algorithms result. Relative to the fastest known one from the existing improvements, one new algorithm has a speedup of 1:3 times in both the number of multiplications and the number of additions, and the other new algorithm requires less memory storage.

Download or read book Space Time Code Designs for Broadband Wireless Communications written by and published by . This book was released on 2005 with total page 20 pages. Available in PDF, EPUB and Kindle. Book excerpt: The goal of this research is to design new space & time codes, such as complex orthogonal space & time block codes with rate above 1/2 from complex orthogonal designs for QAM, PSK, and CPM signals, lattice based space-time codes, and unitary differential space-time codes for large number of transmit antennas. We want to study space-time code properties including fast decoding algorithms and performance and adaptivity to fading channels.

Download or read book Space Time Coding for Broadband Wireless Communications written by Georgios B. Giannakis and published by Wiley-Interscience. This book was released on 2007 with total page 496 pages. Available in PDF, EPUB and Kindle. Book excerpt: This is the first book on space-time coding for wireless communications, one of the most promising techniques for ensuring bandwidth efficiency. The text describes theoretical principles as well as engineering applications; discusses key criteria in the design of practical space-time codes; and covers single-carrier and multi-carrier transmission for both single- and multi-user communications.

Download or read book Space time Code Design for Wireless Communication Systems written by Xiaoyong Guo and published by . This book was released on 2010 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: It is well understood that MIMO technology could enhance the reliability of wireless communication and increase the channel capacity. The design of space-time code to explore the benefit provided by the multi-antenna systems is of key importance. This dissertation addresses several issues concerning the design of space-time code. The following is a brief description of these issues and our contributions. Cyclic division algebra (CDA) has been introduced as a means to construct full-rate nonvanishing determinant STBC (space-time block code), which achieves the diversity-multiplexing trade-off and has a very good performance. There are two steps to construct CDA-based nonvanishing determinant STBC: construction of a cyclic extension over [Special characters omitted.] (i) and finding a non-norm element. For the first step we proposed a new up-to-down construction method. With this new method we find a broad range of cyclic extensions over [Special characters omitted.] (i), which encompasses all the previous constructions. For the second step, we give new criteria for the non-norm element. Non-norm elements found by these new criteria have smaller absolute values, hence the resulted STBC has a better coding gain. The well-known design criteria for space-time code is proposed by Guey-Fitz-Bell-Kuo in 1996 and Tarokh-Seshadri-Calderbank in 1998. The derivation of the design criteria is based on the assumption that the received signals are decoded with an ML receiver. One important issue seems to be long ignored: there is no design criterion for space-time code decoded with suboptimal receivers. Only until recently that Zhang-Liu-Wong and Shang-Xia studied the full diversity codes with linear receivers. We address the issue in a much broader sense. We proposed a more general receiver structure called PIC (partial interference cancellation) group decoding. A PIC group decoding can be viewed as an intermediate decoding algorithm between linear decoding and ML decoding. It encompasses both linear decoding and ML decoding as its two extremes. We also derived a design criterion for space-time codes with PIC receivers to achieve full diversity. The full diversity criteria for codes with ML receivers and linear receivers are special cases of our new design criterion. In many applications, wireless communication devices are limited by size or hardware complexity to one antenna. Cooperative communication was introduced for communication networks with single-antenna nodes to exploit the multi-path diversity. In cooperative communications, a few nodes positioned between the source node and destination node are served as the relay nodes. One important problem for cooperative communication networks is the time-asynchronism among the relay nodes. We propose a distributed space-time coding scheme called distributed linear convolutional space-time code (DLC-STC) to address this problem. We also give systematic construction methods of DLC-STC which achieves full diversity without time synchronization among the relay nodes. Furthermore, we show that our proposed DLC-STC achieves full diversity even with suboptimal receivers such as ZF/MMSE receiver and DFE receiver.

Download or read book Turbo like Codes written by Aliazam Abbasfar and published by Springer Science & Business Media. This book was released on 2007-09-09 with total page 94 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book introduces turbo error correcting concept in a simple language, including a general theory and the algorithms for decoding turbo-like code. It presents a unified framework for the design and analysis of turbo codes and LDPC codes and their decoding algorithms. A major focus is on high speed turbo decoding, which targets applications with data rates of several hundred million bits per second (Mbps).

Download or read book Distributed Space Time Coding written by Yindi Jing and published by Springer Science & Business Media. This book was released on 2013-04-23 with total page 118 pages. Available in PDF, EPUB and Kindle. Book excerpt: Distributed Space-Time Coding (DSTC) is a cooperative relaying scheme that enables high reliability in wireless networks. This brief presents the basic concept of DSTC, its achievable performance, generalizations, code design, and differential use. Recent results on training design and channel estimation for DSTC and the performance of training-based DSTC are also discussed.

Download or read book Quasi orthogonal Space time Block Code written by Yong Liang Guan and published by World Scientific. This book was released on 2007-11-19 with total page 209 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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 (O-STBC), yet at lower decoding complexity than non-orthogonal STBC. This book will help readers gain a broad understanding of the fundamental principles as well as the state-of-the-art work in QO-STBC, thus enabling them to appreciate the roles of QO-STBC in future broadband wireless systems and to inspire further research./a

Download or read book Space time Block Codes with Low Maximum likelihood Decoding Complexity written by Mohanned Omar Sinnokrot and published by . This book was released on 2009 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: In this thesis, we consider the problem of designing space-time block codes that have low maximum-likelihood (ML) decoding complexity. We present a unified framework for determining the worst-case ML decoding complexity of space-time block codes. We use this framework to not only determine the worst-case ML decoding complexity of our own constructions, but also to show that some popular constructions of space-time block codes have lower ML decoding complexity than was previously known. Recognizing the practical importance of the two transmit and two receive antenna system, we propose the asymmetric golden code, which is designed specifically for low ML decoding complexity. The asymmetric golden code has the lowest decoding complexity compared to previous constructions of space-time codes, regardless of whether the channel varies with time. We also propose the embedded orthogonal space-time codes, which is a family of codes for an arbitrary number of antennas, and for any rate up to half the number of antennas. The family of embedded orthogonal space-time codes is the first general framework for the construction of space-time codes with low-complexity decoding, not only for rate one, but for any rate up to half the number of transmit antennas. Simulation results for up to six transmit antennas show that the embedded orthogonal space-time codes are simultaneously lower in complexity and lower in error probability when compared to some of the most important constructions of space-time block codes with the same number of antennas and the same rate larger than one. Having considered the design of space-time block codes with low ML decoding complexity on the transmitter side, we also develop efficient algorithms for ML decoding for the golden code, the asymmetric golden code and the embedded orthogonal space-time block codes on the receiver side. Simulations of the bit-error rate performance and decoding complexity of the asymmetric golden code and embedded orthogonal codes are used to demonstrate their attractive performance-complexity tradeoff.

Download or read book Designing Space time Codes Using Orthogonal Designs written by Girish Ganesan and published by . This book was released on 2002 with total page 172 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Channel Coding Theory Algorithms and Applications written by and published by Academic Press. This book was released on 2014-07-29 with total page 687 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book gives a review of the principles, methods and techniques of important and emerging research topics and technologies in Channel Coding, including theory, algorithms, and applications. Edited by leading people in the field who, through their reputation, have been able to commission experts to write on a particular topic. With this reference source you will: Quickly grasp a new area of research Understand the underlying principles of a topic and its applications Ascertain how a topic relates to other areas and learn of the research issues yet to be resolved Quick tutorial reviews of important and emerging topics of research in Channel Coding Presents core principles in Channel Coding theory and shows their applications Reference content on core principles, technologies, algorithms and applications Comprehensive references to journal articles and other literature on which to build further, more specific and detailed knowledge

Download or read book Space time Coding for Broadband Wireless Communication Systems written by Zhiqiang Liu and published by . This book was released on 2001 with total page 300 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Performance Analysis and Design of Space time Codes written by Chen Liao and published by . This book was released on 2006 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: Wireless communication technologies have evolved from the original analog networks to IP-based network. Today's wireless communications have been affected by increasing customer expectations on wireless wideband internet services and continuously evolving improvements on technologies. Wireless communication systems must increase their ability to respond to the challenges. The new generation wireless systems (3G/4G) are designed for this purpose. The notable characteristic of 3G/4G is that it provides high data rate transmission at data rate up to 348kbps/2Mbps for 3G and 100Mbps/1Gbps for 4G. Designing the system for such high data rate transmission has become very challenging for wireless systems where the multipath fading is an important factor. In recent years, researches are ongoing in the industry and academic to increase capacity performance of wireless systems through antenna diversity. Multiple Input Multiple Output (MIMO) is one of the major recent developments in the study of high data rate transmission. There has been considerable attention paid to remarkable performance improvements in MIMO in terms of capacity. Another technology that has been traditionally adopted for wireless communications is the channel coding. Combining MIMO with channel coding has received increasing interest to support a variety of high data rate applications. These schemes have been termed as "space-time codes". Space-time codes are currently an area of exciting activity and have been studied as promising candidates for future 3G/4G systems. The most important characteristic of space-time codes is that it can provide full diversity gain as well as coding gain. In this dissertation, both performance analysis of upper bound of Pair-Wise Error Probability (PEP) and exact PEP are performed. In the derivation of exact PEP, a new method is presented. The method is straightforward and comprehensible. The upper bound provides the insight to understand the performance behavior for high Signal-to-Noise Ratio (SNR), while the exact PEP provides a better understanding of the performance behavior to other range of SNR. Design criteria for space-time codes had been first developed by Tarokh, which utilize the analysis of the upper bound on PEP to maximize diversity gain and coding gain from the property of the codeword distance matrix. These criteria are the most widely accepted, which form the basis for space-time codes. The criteria assume that the performance of space-time codes is dominated by the dominant error events. However, there are no dominant error events in fading channel for space-time codes. Therefore, Tarokh's criteria do not provide design guideline for the coding gain. Union bound analysis offers a alternative solution to this problem. The union bound technique is a more attractive method that allows us to analyze the contribution of all error events to the performance. In this thesis, the performance of space-time codes are analyzed using union bound analysis. Based on the union bound on Frame Error Rate (FER), new design criteria are proposed. This is achieved by applying more accurate upper bound of PEP in the union bound analysis. With the proposed criteria, new coding gain performance metrics had been defined. New codes based on the new performance metrics are designed and their coding gain performance superiority are demonstrated. Space-time block codes have been initially designed to provide full diversity order with low decoding complexity, but without coding gain. By integrating space-time trellis codes with space-time block codes, super-orthogonal space-time trellis codes can significantly enhance the coding gain performance. However, the super-orthogonal space-time trellis codes improve performance only in slow fading channel, but do not perform well in fast fading channel. In fast fading channel, the orthogonal design of space-time block codes has little effect on the coding gain and does not lead to noticeable improvement. Furthermore, super-orthogonal space-time trellis codes introduce the diversity gain loss in fast fading channel. It is well known that the performances of space-time codes are dominated by diversity gain and any diversity gain loss may cause substantial loss in performance. We therefore develop orthogonal space-time trellis codes, which improve performance in diversity gain in fast fading channel. The improvement is achieved by transferring the vector output of space-time trellis codes into an orthogonal matrix of space-time block codes, and meanwhile maintaining the symbol Hamming distance of space-time trellis codes. Theoretical analysis and simulation results had demonstrated that the proposed codes can improve diversity gain linearly with an increase in the number of transmit antennas. Performance saturation and decoding complexity increase with the increased number of trellis states are the major problems that trellis-based codes have to face in practice. Turbo codes that allow for reaching near Shannon limit performance are a significant advance in digital communications. Space-time turbo codes have been developed to achieve high performance. In a perfect world, system designers would like to achieve high performance while maintaining a full code rate. Therefore, puncture operation is always used in space-time turbo codes. The problem with the puncture operation in space-time turbo codes is that codeword distance matrix is rank deficient for small diversity gain in slow fading channel, which constitutes a major problem with space-time turbo codes. Space-time turbo codes that concern the rank deficiency have been developed. The codes improve performance by reducing the effect of rank deficiency on performance, but exist high complexity in both code structure and design criteria. This limitation makes the codes not suitable for the design of complex codes with large trellis state and/or large numbers of transmit antennas. A new space-time turbo codes have been proposed in this research. In previous works, it has been demonstrated the systematic structure with the rotation of the output of the low constitute encoder can effectively reduce the rank deficient effect on performance. Our new codes utilize the systematic characteristic to construct a simple code structure. Further, a simple but very effective trace criterion has been proposed. With the simple codes structure and design criteria, the design of complex codes can be achieved with significant improvement in coding gain performance for the systems with small diversity gain in slow fading channel. Overall, this dissertation presents new design criteria and new codes that contribute to improving performances of space-time codes.

Download or read book Turbo Coding Turbo Equalisation and Space Time Coding for Transmission over Fading Channels written by Lajos L. Hanzo and published by Wiley-IEEE Press. This book was released on 2002-09-09 with total page 766 pages. Available in PDF, EPUB and Kindle. Book excerpt: Turbo coding has opened an exciting new chapter in the design of iterative detection assisted communication systems. Similar dramatic advances have been achieved with the advent of space time coding, when communicating over dispersive fading wireless channels. By assuming no prior knowledge in the field of channel coding, the authors provide a self-contained reference on these stimulating hot topics, concluding at an advanced level. This essential volume is divided into five key parts: 1. Convolutional and Block Coding Introduces the family of convolutional codes, hard and soft-decision Viterbi algorithms and the most prominent classes of block codes, namely Reed-Solomon (RS) and Bose-Chaudhuri-Hocquenghem (BCH) codes, as well as their algebraic and trellis-decoding. 2. Turbo Convolutional and Turbo Block Coding Introduces turbo convolutional codes and details the Maximum A-Posteriori (MAP), Log-MAP and Max-Log-MAP as well as the Soft Output Viterbi Algorithm (SOVA). Investigates the effects of the various turbo codec parameters. Studies the super-trellis structure of turbo codes and characterises turbo BCH codes. Portrays Redundant Residue Number System (RRNS) based codes and their turbo decoding. 3. Coded Modulation: TCM, TTCM, BICM, BICM-ID Studies Trellis Coded Modulation (TCM), Turbo Trellis Coded Modulation (TTCM), Bit-Interleaved Coded Modulation (BICM), Iterative BICM (BICM-ID) and compares them under various channel conditions. 4. Space-Time Block and Space-Time Trellis Coding Introduces space-time codes and studies their performance using numerous channel codecs providing guidelines for system designers. Studies Multiple-Input Multiple-Output (MIMO) based schemes and the concept of near-instantaneously Adaptive Quadrature Amplitude Modulation (AQAM) combined with near-instantaneously adaptive turbo channel coding. 5. Turbo Equalisation Covers the principle in detail, provides theoretical performance bounds for turbo equalisers and includes a study of various turbo equaliser arrangements. Also addresses the problem of reduced implementation complexity and covers turbo equalised space-time trellis codes. If you are looking for a comprehensive treatment covering both classic channel coding techniques and recent advances in this field, then this is the book for you. Researchers, practising engineers and advanced students will all find it both informative and stimulating.

Download or read book A New Generic Maximum likelihood Metric Expression for Space time Block Codes with Applications to Decoding written by Jeff Leuschner and published by . This book was released on 2007 with total page 162 pages. Available in PDF, EPUB and Kindle. Book excerpt: Space-time block coding is a technique used to exploit diversity in a multiple-input multiple-output (MIMO) environment. Orthogonal space-time block codes (OSTBCs) are desirable because they can achieve full transmit diversity while maintaining a simple low-complexity maximum-likelihood (ML) decoding algorithm. However, OSTBCs are limited in their error performance. This has led to the development of more general linear space-time block codes, such as quasi-orthogonal space-time block codes (QOSTBCs). QOSTBCs offer better error performance, but their decoding complexity is a concern since it is no longer a linear function of the number of transmitted symbols. In this thesis, a new vectorization for linear STBCs is proposed that explicitly maintains the redundancy in the STBC transmission matrix. By expressing the ML metric using the new vectorization, a new generic representation of the ML metric expression for a linear STBC is derived. One immediate application of this new metric expression is the convenient partial decoupling and simplification of the detection metric for linear STBCs. The new metric expression can also be used as a design tool to help in the construction of new STBCs with low decoding complexity. As an example, a new QOSTBC is constructed that has lower decoding complexity than one previously proposed in the literature of equal rate and diversity. A comparison is conducted to answer the following question: for the family of QOSTBCs, when is it best to perform an exhaustive search using a metric expression that is simplified and decoupled as much as possible, and when should an efficient implementation of the sphere decoding algorithm be applied? Determining this boundary is an important and practical issue not yet directly addressed in the literature. The new metric expression can also be used as the framework for a new family of sub-optimal decoding algorithms for STBCs that trade-off error performance for a reduction in decoding complexity. A practical example of such an algorithm is given as an example.