Performance of MIMO Systems Using Space Time Block Codes (STBC)

Digital Communications, in relation to wireless networks, have taken off in recent years due to the expanding need to communicate faster and more efficiently. A popular way to achieve this is by using wireless Multiple Input Multiple Output (MIMO) communication systems. MIMO systems utilize Space Time Block Codes (STBC) as one of the leading ways to obtain higher data rates with limited bandwidth and power. With several STBC methods currently available, this paper analyzes simulations using Orthogonal Space Time Block Codes (OSTBC) in Rayleigh fading channels to evaluate the performance of MIMO systems. The selection to use a Rayleigh fading channel as a model for a non-line-of-sight (nLOS) environment is selected to mimic installations where a large number of signal paths and reflections are expected. All simulations are coded, generated and plotted using MATLAB resulting in graphical data representing the bit-error rate (BER) to signal-to-noise ratio (Eb/N0) or SNR. Each simulation captures how different configurations of key variables including code rate, diversity and antenna count can impact system performance. Four modulation schemes (BPSK, QPSK, 16-QAM and 64-QAM) are included in each simulation. Conclusive evidence based upon these simulations suggests higher diversity gains were achieved with a greater number of antennas. The most significant factor for increasing system performance was using a lower count of transmit antennas with a higher count of receive antennas.

A Method for Improving Power Distribution Characteristics of Space Time Block Codes

Improving power distribution characteristics of space time block codes(STBCs),namely peak to average power ratio(PAPR),average to minimum power ratio(Ave/min),and probability of transmitting"zero"by antenna,makes easier their practical implementation.To this end,this study proposes to multiply full diversity STB C with a non-singular matrix in multiple input multiple output(MIMO)or multiple input single output(MISO)systems with linear or maximum likelihood(ML)receivers.It is proved that the obtained code achieves full diversity and the order of detection complexity does not change.The proposed method is applied to different types of STBCs.The bit error rate(BER)and power distribution characteristics of the new codes demonstrate the superiority of the introduced method.Further,lower and upper bounds on the BER of the obtained STBCs are derived for all receivers.The proposed method provides trade-off among PAPR,spectral efficiency,energy efficiency,and BER.

Low complexity suboptimal decode algorithms for quasi- orthogonal space time block codes

Due to the high complexity of the pairwise decoding algorithm and the poor performance of zero forcing（ ZF） /minimum mean square error（ MMSE） decoding algorithm, two low-complexity suboptimal decoding algorithms, called pairwisequasi-ZF and pairwise-quasi-MMSE decoders, are proposed. First,two transmit signals are detected by the quasi-ZF or the quasiMMSE algorithm at the receiver. Then, the two detected signals as the decoding results are substituted into the two pairwise decoding algorithm expressions to detect the other two transmit signals. The bit error rate（ BER） performance of the proposed algorithms is compared with that of the current known decoding algorithms.Also, the number of calculations of ZF, MMSE, quasi-ZF and quasi-MMSE algorithms is compared with each other. Simulation results showthat the BER performance of the proposed algorithms is substantially improved in comparison to the quasi-ZF and quasiMMSE algorithms. The BER performance of the pairwise-quasiZF（ pairwise-quasi-MMSE） decoder is equivalent to the pairwiseZF（ pairwise-MMSE） decoder, while the computational complexity is significantly reduced.

Optimal and suboptimal structured algorithms of binary linear block codes

The optimal and suboptimal structured algorithms of linear block codes from the geometrical perspective are represented.The minimum distance and weight property lemmas and the theorem are proved for the generator matrix.Based upon the property of generator matrix,the structured algorithms of linear block codes are demonstrated.Since the complexity of optimal structured algorithm is very high,the binary linear block codes is searched by using the suboptimal structured algorithm.The comparison with Bose-Chaudhuri-Hocquenqhem（BCH） codes shows that the searched linear block codes are equivalent on minimum distance and can be designed for more block lengths.Because the linear block codes are used widely in communication systems and digital applications,the optimal and suboptimal structured algorithms must have great future being widely used in many applications and perspectives.

Linear Dispersion Orthogonal Space-Time Block Codes

A new architecture of space-time codes as a combination of orthogonal space-time block codes （OSTBC） and linear dispersion codes （LDC） is proposed in order to improve the bit error rate（BER） performance of OSTBC.The scheme proposed is named linear dispersion orthogonal space-time block codes （LDOSTBC）.In LDOSTBC scheme,firstly,the data is coded into LDC codewords.Then,the coded LDC substreams are coded into OSTBC codewords again.The decoding algorithm of LDOSTBC combines linear decoding of OSTBC and ML decoding or suboptimum detection algorithms of LDC.Compared with OSTBC scheme when the rate of LDC is MtR,the performance of LDOSTBC scheme can be improved without decreasing the data rate,where Mt is the number of transmit antennas and R is the spectral efficiency of the modulation constellation.If some rate penalty is allowed,when the rate of LDC is less than MtR the performance of LDOSTBC can be improved further.

Differential modulation based on space-time block codes

A differential modulation scheme using space-time block codes is put forward. Compared with other schemes, our scheme has lower computational complexity and has a simpler decoder. In the case of three or four transmitter antennas, our scheme has a higher rate a higher coding gain and a lower bit error rate for a given rate. Then we made simulations for space-time block codes as well as group codes in the case of two, three, four and five transmit antennas. The simulations prove that using two transmit antennas, one receive antenna and code rate of 4 bits/s/Hz, the differential STBC method outperform the differential group codes method by 4 dB. Useing three, four and five transmit antennas, one receive antenna, and code rate of 3 bits/s/Hz are adopted, the differential STBC method outperform the differential group codes method by 5 dB, 6. 5 dB and 7 dB, respectively. In other words, the differential modulation scheme based on space-time block code is better than the corresponding differential modulation scheme

A New Generalized Complex Orthogonal Space-Time Block Codes

Recent research challenges in the wireless communication include the usage of diversity and efficient coding to improve data transmission quality and spectral efficiency. Space diversity uses multiple transmitting and/or receiving antennas to create independent fading channels without penalty in bandwidth efficiency. Space-time block coding is an encoding scheme for communication over Rayleigh fading channels using multiple transmitting antennas. Space-time block codes from complex orthogonal designs exist only for two transmitting antennas. This paper generalizes a new complex orthogonal space-time block code for four transmitting antennas, whose decoding complexity is very low. Simulations show that the generalized complex orthogonal space-time block code has low bit error rate, full rate and possibly large diversity.

Space-time Block Codes Based on Quasi-Orthogonal Designs

A new space-time block codes based on quasi-orthogonal designs are put forward. First the channel model is formulated. Then the connection between orthogonal /quasi-orthogonal designs and space-time block codes is explored. Finally we make simulations for the transmission of 4 bits/s/Hz and 6 bits/s/Hz using eight transmit antennas using the rate 3/4 quasi-orthogonal space-time block code and the rate 1/2 full-diversity orthogonal space-time block code. Simulation results show that full transmission rate is more important for very low signal noise ratio (SNR) and high bit error probability (BEP), while full diversity is more important for very high SNR and low BEP.

EXACT ERROR PROBABILITY OF ORTHOGONAL SPACE-TIME BLOCK CODES OVER FLAT FADING CHANNELS

Space time block coding is a modulation scheme recently discovered for the transmit an- tenna diversity to combat the effects of wireless fading channels. Using the equivalent Single-Input Single-Output (SISO) model, this paper presents closed-form expressions for the exact Symbol Error Rate (SER) and Bit Error Rate (BER) of Orthogonal Space-Time Block Codes (OSTBCs) with M-ary Phase-Shift Keying (MPSK) and M-ary Quadrature Amplitude Modulation (MQAM) over flat un- correlated Nakagami-m and Ricean fading channels.

Application of maximum rank distance codes in designing of STBC-OFDM system for next-generation wireless communications

Space-Time Block Coded(STBC)Orthogonal Frequency Division Multiplexing(OFDM)satisfies higher data-rate requirements while maintaining signal quality in a multipath fading channel.However,conventional STBCs,including Orthogonal STBCs(OSTBCs),Non-Orthogonal(NOSTBCs),and Quasi-Orthogonal STBCs(QOSTBCs),do not provide both maximal diversity order and unity code rate simultaneously for more than two transmit antennas.This paper targets this problem and applies Maximum Rank Distance(MRD)codes in designing STBCOFDM systems.By following the direct-matrix construction method,we can construct binary extended finite field MRD-STBCs for any number of transmitting antennas.Work uses MRD-STBCs built over Phase-Shift Keying(PSK)modulation to develop an MRD-based STBC-OFDM system.The MRD-based STBC-OFDM system sacrifices minor error performance compared to traditional OSTBC-OFDM but shows improved results against NOSTBC and QOSTBC-OFDM.It also provides 25%higher data-rates than OSTBC-OFDM in configurations that use more than two transmit antennas.The tradeoffs are minor increases in computational complexity and processing delays.

Capacity of orthogonal space-time block codes in MISO fading channels with co-channel interference and noise

Orthogonal space-time block codes （OSTBCs） are an efficient mean in order to exploit the diversity offered by the wireless multiple-input multiple-output （MIMO） channel. This paper considers capacity problems of OSTBCs over spatially correlated multiple-input single-out （MISO） Rayleigh fading channels in the presence of spatially correlated Rayleigh co-channel interference and additive Gaussian noise, and derives exact expressions of the ergodic capacity and outage probability （capacity distribution） for such OSTBCs. Some numerical examples are given to illustrate the effect of co-channel interference on the ergodic and outage capacity of OSTBCs.

Blind identification of space–time block codes based on deep learning

Deep Learning(DL)has important applications to both commercial and military communications,such as software-defined radio,cognitive radio and spectrum surveillance.While DL has been intensively studied for modulation recognition,there are very few investigations for blind identification of Space-Time Block Codes(STBCs).This paper proposes a Residual Network(RN)-based model for identifying 6 kinds of STBC signals with a single receiving antenna,including the same length of coding matrix.In our work,we use the frequency-domain correlation function of a single time delay as the training data of DL model.Then,we explore the suitable RN structure for blind identification of STBCs.Finally,we compare the RN model with convolutional neural network and traditional method,and test the performance of RN model.Simulation results show that our RN-based model provides good performance with low sensitivity to decay of the dataset,such as sample length and data size.At the same time,better identification accuracy can be achieved under the condition of different modulation types and channel fading parameters at low Signal to Noise Ratio(SNR).

Distinction of self-synchronous scrambled linear blockcodes based on multi-fractal spectrum

This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block code share the propertyof linear correlation, the existing linear correlation-basedidentification method is invalid for this case. This drawback can becircumvented by introducing a novel multi-fractal spectrum-basedmethod. Simulation results show that the new method has highrobustness and under the same conditions of bit error, the lowerthe code rate, the higher the recognition rate. Thus, the methodhas significant potential for future application in engineering.

Adaptive Decoding Algorithm Based on Multiplicity of Candidate Sequences for Block Turbo Codes

It is known that Block Turbo Codes （BTC） can be nearly optimally decoded by Chase-II algorithm, in which the Least Reliable Bits （LRBs） are chosen empirically to keep the size of the test patterns （sequences） relatively small and to reduce the decoding complexity. While there are also other adaptive techniques, where the decoder＇s LRBs adapt to the external parameter of the decoder like SNR （Signal Noise Ratio） level, a novel adaptive algorithm for BTC based on the statistics of an internal variable of the decoder itself is proposed in this paper. Different from the previous reported results, it collects the statistics of the multiplicity of the candidate sequences, i.e., the number of the same candidate sequences with the same minimum squared Euclidean distance resulted from the decoding of test sequences. It is shown by Monte Carlo simulations that the proposed adaptive algorithm has only about 0.02dB coding loss but the average complexity of the proposed algorithm is about 42% less compared with Pyndiah＇s iterative decoding algorithm using the fixed LRBs parameter.

Technique of Error Concealment for Block-Based Image Coding Using Genetic Algorithm

Since real world communication channels are not error free, the coded data transmitted on them may be corrupted, and block based image coding systems are vulnerable to transmission impairment. So the best neighborhood match method using genetic algorithm is used to conceal the error blocks. Experimental results show that the searching space can be greatly reduced by using genetic algorithm compared with exhaustive searching method, and good image quality is achieved. The peak signal noise ratios(PSNRs) of the restored images are increased greatly.

SPARSE SEQUENCE CONSTRUCTION OF LDPC CODES

This letter proposes a novel and simple construction of regular Low-Density Parity-Check (LDPC) codes using sparse binary sequences. It utilizes the cyclic cross correlation function of sparse sequences to generate codes with girth8. The new codes perform well using the sumproduct decoding. Low encodingcomplexity can also be achieved due to the inherent quasi-cyclic structure of the codes.

BLOCK CODING SCHEME FOR REDUCING PAPR IN OFDM SYSTEMS WITH LARGE NUMBER OF SUBCARRIERS

The major drawback in Orthogonal Frequency Division Multiplexing (OFDM) system is due to the high Peak-to-Average Power Ratio (PAPR), so the performance of the system is significantly degraded by the nonlinearity of a High Power Amplifier (HPA) in the transmitter.In order to mitigate distortion, a block coding scheme for reducing PAPR in OFDM systems with large number of subcarriers based on complementary sequences and predistortion is proposed,which is capable of both error correction and PAPR reduction. Computer simulation results show that the proposed scheme significantly improves Bit Error Rate(BER) performance as compared to an uncoded system when an HPA is employed or a coded system without predistortion.

Performance Enhancement of Multiuser Passive Time Reversal Communication Based on Space-Time Block Coding

Reliable, with high data rate, acoustic communication in time-valTing, multipath shallow water environment is a hot research topic recently. Passive time reversal communication has shown promising results in improvement of the system performance. In multiuser environment, the system performance is significantly degraded due to the interference among different users. Passive time reversal can reduce such interference by minimizing the cross-correlated version of channel impulse response among users, which can be realized by the well-separated users in depth. But this method also has its shortcomings, even with the absence of relative motion, the minimization sometimes may be impossible because of the time-varying environment. Therefore in order to avoid the limitation of minimizing the cross-correlated channel function, an approach of passive time reversal based on space-time block coding （STBC） is presented in this paper. In addition, a single channel equalizer is used as a pest processing technique to reduce the residual symbol interference. Experimental results at 13 kHz with 2 kHz bandwidth demonstrate that this method has better performance to decrease bit error rate and improve signal to noise ratio, compared with passive time reversal alone or passive time reversal combined with equalization.

An Improved Group Space-Time Block Code Through Constellation Rotation

A new improved group space-time block code (G-STBC) based on constellation rotation for four transmit antennas was proposed. In comparison with the traditional G-STBC coding scheme, the proposed space-time code has longer code length and adopts proper rotation-based symbols, which can increase the minimum distance of space-time codes and thereby improve code gain and achieve full diversity performance. The simulation results verify that the proposed group space-time code can achieve better bit error performance than both the traditional group space-time code and other quasi-orthogonal space-time codes. Compared with Ma’s full diversity full rate (FDFR) codes, the proposed space-time code also can achieve the same excellent error performance. Furthermore, the design of the new space-time code gives another new and simple method to construct space-time codes with full diversity and high rate in case that it is not easy to design the traditional FDFR space-time codes.

A HIGH-PERFORMANCE VLSI ARCHITECTURE OF EBCOT BLOCK CODING IN JPEG2000

The paper presents a new architecture composed of bit plane-parallel coder for Embedded Block Coding with Optimized Truncation (EBCOT) entropy encoder used in JPEG2000. In the architecture, the coding information of each bit plane can be obtained simultaneously and processed parallel. Compared with other architectures, it has advantages of high parallelism, and no waste clock cycles for a single point. The experimental results show that it reduces the processing time about 86% than that of bit plane sequential scheme. A Field Programmable Gate Array (FPGA) prototype chip is designed and simulation results show that it can process 512×512 gray-scaled images with more than 30 frames per second at 52MHz.