Ülekande süsteemi: Alamouti indeks-kodeerimine

Consider a wireless broadcast channel with a number of receivers, where each receiver possesses some side information. In an index coding problem, the transmitter aims at delivering different messages to different receivers. It is desirable to minimize the total number of message transmissions in order to improve the bandwidth efficiency. It is known that the minimum number of transmissions can be achieved by solving a minimum rank problem for a given side information graph, which is a known NP-hard problem. In this thesis, the index coding problem over additive white Gaussian noise and Rayleigh fading channels is studied. Modulation techniques, such as phase shift keying and quadrature amplitude modulation, are tested, and it is shown that a careful choice of modulation can improve the performance. It is also shown that a careful choice of a generator matrix can provide for further performance gains, in particular for ”prioritized” receivers. A probabilistic soft information detection (PSID) is compared to a simple hard decision scheme, and the PSID performance is shown superior in achieving a lower error rate. Additional improvement in performance is achieved by using diversity, when employing two transmit and two receive antenna system in conjunction with the Alamouti code. All these techniques provide for the lower error rates and higher throughput when compared to the traditional schemes

Trellis code-aided high-rate differential space-time block code and enhanced uncoded space-time labeling diversity.

Master of Science in Engineering. University of KwaZulu-Natal, Durban, 2017.In this dissertation, a trellis code-aided bandwidth efficiency improvement technique for space-time block coded wireless communication systems is investigated. The application of the trellis code-aided bandwidth efficiency improvement technique to differential space-time block codes (DSTBC) results in a high-rate system called trellis code-aided DSTBC (TC-DSTBC). Such a system has not been investigated in open literature to date. Hence, in this dissertation, the mathematical models and design methodology for TC-DSTBC are presented. The two transmit antenna TC-DSTBC system transmits data by using a transmission matrix similar to the conventional DSTBC. The fundamental idea of TC-DSTBC is to use a dynamic mapping rule rather than a fixed one to map additional bits onto the expanded space-time block code (STBC) prior to differential encoding, hence, the additional bits-to-STBC mapping technique, which incorporates trellis coding is proposed for square M-ary quadrature amplitude modulation (M-QAM) in order to enhance the bandwidth efficiency without sacrificing the error performance of the conventional DSTBC. The comparison of bandwidth efficiency between TC-DSTBC and the conventional DSTBC show that TC-DSTBC achieves a minimum of 12.5% and 8.3% increase in bandwidth efficiency for 16-QAM and 64-QAM, respectively. Furthermore, the Monte Carlo simulation results show that, at high signal-to-noise ratios (SNR), the four receive antenna TC- DSTBC retains the bit error rate (BER) performance of the conventional DSTBC with the same number of receive antennas under the same independent and identically distributed (i.i.d.) Rayleigh frequency-flat fading channel and additive white noise (AWGN) conditions for various square M-QAM modulation orders and numbers of additional bits. Motivated by the bandwidth efficiency advantage of TC-DSTBC over the conventional DSTBC, the trellis code-aided bandwidth efficiency improvement technique is extended to the recently developed uncoded space-time labeling diversity (USTLD) system, where a new system referred to as enhanced uncoded space-time labeling diversity (E-USTLD) is proposed. In addition to this, a tight closed form lower-bound is derived to predict the average BER of the E-USTLD system over i.i.d. Rayleigh frequency-flat fading channels at high SNR. The Monte Carlo simulation results validate that the more bandwidth efficient four receive antenna E-USTLD system at the minimum retains the BER performance of the conventional four receive antenna USTLD system under the same fading channel and AWGN conditions for various square M-QAM modulation orders. The bandwidth efficiency improvement for TC-DSTBC and E-USTLD is achieved at the cost of a much higher computational complexity at the receiver due to use of the high-complexity Viterbi algorithm (VA)-based detector. Therefore, the low-complexity (LC) near-maximum-likelihood (near-ML) detection scheme proposed for the conventional USTLD is extended to the E-USTLD detector in order to reduce the magnitude of increase in the computational complexity. The Monte Carlo simulation results show that E-USTLD with a VA-based detector that implements LC near-ML detection attains near optimal BER performance

Distributed space-time block codes for two-hop wireless relay networks

Recently, the idea of space-time coding has been applied to wireless relay networks wherein a set of geographically separated relay nodes cooperate to process the received signal from the source and forward them to the destination such that the signal received at the destination appears like a Space-Time Block Code (STBC). Such STBCs (referred to as Distributed Space-Time Block Codes (DSTBCs)) when appropriately designed are known to offer spatial diversity. It is known that different classes of DSTBCs can be designed primarily depending on (i) whether the Amplify and Forward (AF) protocol or the Decode and Forward (DF) protocol is employed at the relays and (ii) whether the relay nodes are synchronized or not. In this paper, we present a survey on the problems and results associated with the design of DSTBCs for the following classes of two-hop wireless relay networks: (i) synchronous relay networks with AF protocols, (ii) asynchronous relay networks with AF protocols (iii) synchronous relay networks with DF protocols and (iv) asynchronous relay Fig. 1. Co-located MIMO channel model networks with DF protocols

Space-Time Codes Concatenated with Turbo Codes over Fading Channels

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