Performance Enhancement in SU and MU MIMO-OFDM Technique for Wireless Communication: A Review

The consistent demand for higher data rates and need to send giant volumes of data while not compromising the quality of communication has led the development of a new generations of wireless systems. But range and data rate limitations are there in wireless devices. In an attempt to beat these limitations, Multi Input Multi Output (MIMO) systems will be used which also increase diversity and improve the bit error rate (BER) performance of wireless systems. They additionally increase the channel capacity, increase the transmitted data rate through spatial multiplexing, and/or reduce interference from other users. MIMO systems therefore create a promising communication system because of their high transmission rates without additional bandwidth or transmit power and robustness against multipath fading. This paper provides the overview of Multiuser MIMO system. A detailed review on how to increase performance of system and reduce the bit error rate (BER) in different fading environment e.g. Rayleigh fading, Rician fading, Nakagami fading, composite fading

Evaluation of Interference-Cancellation Based MAC Protocols for Vehicular Communications

Vehicular communications form an important part of future intelligent transport systems. Wireless connectivity between vehicles can enhance safety in vehicular networks and enable new services such as adaptive traffic control, collision detection and avoidance. As several new algorithms are being developed for enhancing vehicle to vehicle wireless connectivity, it is important to validate the performance of these algorithms using reasonably accurate wireless channel models. Specifically, some recent developments in the medium access control (MAC) layer algorithms appear to have the potential to improve the performance of vehicle to vehicle communications; however, these algorithms have not been validated with realistic channel models encountered in vehicular communications. The aforementioned issues are addressed in this thesis and correspondingly, there are two main contributions - (i) A complete IEEE 802.11p based transceiver model has been simulated in MATLAB and its performance & reliability are tested using existing empirically-developed wireless channel models. (ii) A new MAC layer algorithm based on slotted ALOHA with successive interference cancellation(SIC) has been evaluated and tested by taking into consideration the performance of underlying physical layer. The performance of slotted ALOHA-SIC and the already existing carrier sense multiple access with collision avoidance (CSMA/CA) scheme with respect to channel access delay and average packet loss ratio is also studied

A Tutorial on Nonorthogonal Multiple Access for 5G and Beyond

Today's wireless networks allocate radio resources to users based on the orthogonal multiple access (OMA) principle. However, as the number of users increases, OMA based approaches may not meet the stringent emerging requirements including very high spectral efficiency, very low latency, and massive device connectivity. Nonorthogonal multiple access (NOMA) principle emerges as a solution to improve the spectral efficiency while allowing some degree of multiple access interference at receivers. In this tutorial style paper, we target providing a unified model for NOMA, including uplink and downlink transmissions, along with the extensions tomultiple inputmultiple output and cooperative communication scenarios. Through numerical examples, we compare the performances of OMA and NOMA networks. Implementation aspects and open issues are also detailed.Comment: 25 pages, 10 figure

Distributed space-time coding including the golden code with application in cooperative networks

This thesis presents new methodologies to improve performance of wireless cooperative networks using the Golden Code. As a form of space-time coding, the Golden Code can achieve diversity-multiplexing tradeoff and the data rate can be twice that of the Alamouti code. In practice, however, asynchronism between relay nodes may reduce performance and channel quality can be degraded from certain antennas. Firstly, a simple offset transmission scheme, which employs full interference cancellation (FIC) and orthogonal frequency division multiplexing (OFDM), is enhanced through the use of four relay nodes and receiver processing to mitigate asynchronism. Then, the potential reduction in diversity gain due to the dependent channel matrix elements in the distributed Golden Code transmission, and the rate penalty of multihop transmission, are mitigated by relay selection based on two-way transmission. The Golden Code is also implemented in an asynchronous one-way relay network over frequency flat and selective channels, and a simple approach to overcome asynchronism is proposed. In one-way communication with computationally efficient sphere decoding, the maximum of the channel parameter means is shown to achieve the best performance for the relay selection through bit error rate simulations. Secondly, to reduce the cost of hardware when multiple antennas are available in a cooperative network, multi-antenna selection is exploited. In this context, maximum-sum transmit antenna selection is proposed. End-to-end signal-to-noise ratio (SNR) is calculated and outage probability analysis is performed when the links are modelled as Rayleigh fading frequency flat channels. The numerical results support the analysis and for a MIMO system maximum-sum selection is shown to outperform maximum-minimum selection. Additionally, pairwise error probability (PEP) analysis is performed for maximum-sum transmit antenna selection with the Golden Code and the diversity order is obtained. Finally, with the assumption of fibre-connected multiple antennas with finite buffers, multiple-antenna selection is implemented on the basis of maximum-sum antenna selection. Frequency flat Rayleigh fading channels are assumed together with a decode and forward transmission scheme. Outage probability analysis is performed by exploiting the steady-state stationarity of a Markov Chain model

Self-concatenated coding for wireless communication systems

In this thesis, we have explored self-concatenated coding schemes that are designed for transmission over Additive White Gaussian Noise (AWGN) and uncorrelated Rayleigh fading channels. We designed both the symbol-based Self-ConcatenatedCodes considered using Trellis Coded Modulation (SECTCM) and bit-based Self- Concatenated Convolutional Codes (SECCC) using a Recursive Systematic Convolutional (RSC) encoder as constituent codes, respectively. The design of these codes was carried out with the aid of Extrinsic Information Transfer (EXIT) charts. The EXIT chart based design has been found an efficient tool in finding the decoding convergence threshold of the constituent codes. Additionally, in order to recover the information loss imposed by employing binary rather than non-binary schemes, a soft decision demapper was introduced in order to exchange extrinsic information withthe SECCC decoder. To analyse this information exchange 3D-EXIT chart analysis was invoked for visualizing the extrinsic information exchange between the proposed Iteratively Decoding aided SECCC and soft-decision demapper (SECCC-ID). Some of the proposed SECTCM, SECCC and SECCC-ID schemes perform within about 1 dB from the AWGN and Rayleigh fading channels’ capacity. A union bound analysis of SECCC codes was carried out to find the corresponding Bit Error Ratio (BER) floors. The union bound of SECCCs was derived for communications over both AWGN and uncorrelated Rayleigh fading channels, based on a novel interleaver concept.Application of SECCCs in both UltraWideBand (UWB) and state-of-the-art video-telephone schemes demonstrated its practical benefits.In order to further exploit the benefits of the low complexity design offered by SECCCs we explored their application in a distributed coding scheme designed for cooperative communications, where iterative detection is employed by exchanging extrinsic information between the decoders of SECCC and RSC at the destination. In the first transmission period of cooperation, the relay receives the potentially erroneous data and attempts to recover the information. The recovered information is then re-encoded at the relay using an RSC encoder. In the second transmission period this information is then retransmitted to the destination. The resultant symbols transmitted from the source and relay nodes can be viewed as the coded symbols of a three-component parallel-concatenated encoder. At the destination a Distributed Binary Self-Concatenated Coding scheme using Iterative Decoding (DSECCC-ID) was employed, where the two decoders (SECCC and RSC) exchange their extrinsic information. It was shown that the DSECCC-ID is a low-complexity scheme, yet capable of approaching the Discrete-input Continuous-output Memoryless Channels’s (DCMC) capacity.Finally, we considered coding schemes designed for two nodes communicating with each other with the aid of a relay node, where the relay receives information from the two nodes in the first transmission period. At the relay node we combine a powerful Superposition Coding (SPC) scheme with SECCC. It is assumed that decoding errors may be encountered at the relay node. The relay node then broadcasts this information in the second transmission period after re-encoding it, again, using a SECCC encoder. At the destination, the amalgamated block of Successive Interference Cancellation (SIC) scheme combined with SECCC then detects and decodes the signal either with or without the aid of a priori information. Our simulation results demonstrate that the proposed scheme is capable of reliably operating at a low BER for transmission over both AWGN and uncorrelated Rayleigh fading channels. We compare the proposed scheme’s performance to a direct transmission link between the two sources having the same throughput

Multifunctional MIMO systems: A combined diversity and multiplexing design perspective

In this treatise we investigate the design alternatives of different multiple-input multiple-output schemes while considering the attainable diversity gains, multiplexing gains, and beamforming gains. Following a brief classification of different MIMO schemes, where the different MIMO schemes are categorized as diversity techniques, multiplexing schemes, multiple access arrangements, and beamforming techniques, we introduce the family of multifunctional MIMOs. These multifunctional MIMOs are capable of combining the benefits of several MIMO schemes and hence attaining improved performance in terms of both their bit error rate as well as throughput. The family of multifunctional MIMOs combines the benefits of both space-time coding and the Bell Labs layered space-time scheme as well as those of beamforming. We also introduce the idea of layered steered space-time spreading, which combines the benefits of space-time spreading, V-BLAST, and beamforming with those of the generalized multicarrier direct sequence code-division multiple access concept. Additionally, we compare the attainable diversity, multiplexing, and beamforming gains of the different MIMO schemes in order to document the advantages of multifunctional MIMOs over conventional MIMO schemes

Error Rates of the Maximum-Likelihood Detector for Arbitrary Constellations: Convex/Concave Behavior and Applications

Motivated by a recent surge of interest in convex optimization techniques, convexity/concavity properties of error rates of the maximum likelihood detector operating in the AWGN channel are studied and extended to frequency-flat slow-fading channels. Generic conditions are identified under which the symbol error rate (SER) is convex/concave for arbitrary multi-dimensional constellations. In particular, the SER is convex in SNR for any one- and two-dimensional constellation, and also in higher dimensions at high SNR. Pairwise error probability and bit error rate are shown to be convex at high SNR, for arbitrary constellations and bit mapping. Universal bounds for the SER 1st and 2nd derivatives are obtained, which hold for arbitrary constellations and are tight for some of them. Applications of the results are discussed, which include optimum power allocation in spatial multiplexing systems, optimum power/time sharing to decrease or increase (jamming problem) error rate, an implication for fading channels ("fading is never good in low dimensions") and optimization of a unitary-precoded OFDM system. For example, the error rate bounds of a unitary-precoded OFDM system with QPSK modulation, which reveal the best and worst precoding, are extended to arbitrary constellations, which may also include coding. The reported results also apply to the interference channel under Gaussian approximation, to the bit error rate when it can be expressed or approximated as a non-negative linear combination of individual symbol error rates, and to coded systems.Comment: accepted by IEEE IT Transaction