213 research outputs found

    Single-Symbol-Decodable Differential Space-Time Modulation Based on QO-STBC

    Full text link
    We present a novel differential space-time modulation (DSTM) scheme that is single-symbol decodable and can provide full transmit diversity. It is the first known singlesymbol- decodable DSTM scheme not based on Orthogonal STBC (O-STBC), and it is constructed based on the recently proposed Minimum-Decoding-Complexity Quasi-Orthogonal Space-Time Block Code (MDC-QOSTBC). We derive the code design criteria and present systematic methodology to find the solution sets. The proposed DSTM scheme can provide higher code rate than DSTM schemes based on O-STBC. Its decoding complexity is also considerably lower than DSTM schemes based on Sp(2) and double-symbol-decodable QOSTBC, with negligible or slight trade-off in decoding error probability performance.Comment: Accepted for IEEE Trans Wireless Comm

    Maximum Rate of Unitary-Weight, Single-Symbol Decodable STBCs

    Full text link
    It is well known that the Space-time Block Codes (STBCs) from Complex orthogonal designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD). The weight matrices of the square CODs are all unitary and obtainable from the unitary matrix representations of Clifford Algebras when the number of transmit antennas nn is a power of 2. The rate of the square CODs for n=2an = 2^a has been shown to be a+12a\frac{a+1}{2^a} complex symbols per channel use. However, SSD codes having unitary-weight matrices need not be CODs, an example being the Minimum-Decoding-Complexity STBCs from Quasi-Orthogonal Designs. In this paper, an achievable upper bound on the rate of any unitary-weight SSD code is derived to be a2aāˆ’1\frac{a}{2^{a-1}} complex symbols per channel use for 2a2^a antennas, and this upper bound is larger than that of the CODs. By way of code construction, the interrelationship between the weight matrices of unitary-weight SSD codes is studied. Also, the coding gain of all unitary-weight SSD codes is proved to be the same for QAM constellations and conditions that are necessary for unitary-weight SSD codes to achieve full transmit diversity and optimum coding gain are presented.Comment: accepted for publication in the IEEE Transactions on Information Theory, 9 pages, 1 figure, 1 Tabl

    Channel estimation and tracking for closed loop EO-STBC with differentially encoding feedback

    Get PDF
    Extended orthogonal space time block coding (EO-STBC) can achieve high transmit diversity over a multiple-input multiple-output (MIMO) channel. To do so, it requires channel state information on the transmitter side, which needs to be estimated and fed back from the receiver. Therefore, this paper explores an estimation and tracking scheme by means of a Kalman filter, which is integrated with EO-STBC detection and exploits the smooth evolution of the channel coefficients by applying differential feedback. For slow fading, we propose the inclusion of a drift vector in the Kalman model, which is motivated by a second order approximation of the underlying channel model and can be shown to offer advantages in terms of temporal smoothness when addressing channels whose coefficient trajectories evolve smoothly

    Construction and analysis of a new quaternionic space-time code for 4 transmit antennas

    Full text link

    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

    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 suļ¬€ers 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 eļ¬ƒcient concatenation of channel coding and STC with theoretical bound derivation of the proposed schemes, iterative space-time trellis coding (STTC), and diļ¬€erential 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 diļ¬€erential space-time block codes (DSTBC) with ISTTC. The serial concatenation of DSTBC or STBC with ISTTC oļ¬€ers 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
    • ā€¦
    corecore