Power control scheme for multiple antenna systems with space-time coding in Rayleigh fading channels

Two optimal power control （PC） schemes under the power constraint for space-time coded multiple input multiple output systems over the flat Rayleigh fading channel with the imperfect channel state information （CSI） are presented. One is based on the minimization of a bit error rate （BER）, and the other is based on the maximization of a fuzzy signal-to-noise ratio. In these schemes, different powers are allocated to individual transmit an- tennas rather than equal power in the conventional one. For the first scheme, the optimal PC procedure is developed. It is shown that the Lagrange multiplier for the constrained optimization in the power control does exist and is unique. A practical iterative algorithm based on Newton＇s method for finding the Lagrange multiplier is proposed. In the second scheme, some existing schemes are included, and a suboptimal PC procedure is developed by means of the asymptotic performance analysis. With this suboptimal scheme, a simple PC calculation formula is provided, and thus the calculation of the PC will be straightforward. Moreover, the suboptimal scheme has the BER performance close to the optimal scheme. Simulation results show that the two PC schemes can provide BER lower than the equal PC and antenna selection scheme under the imperfect CSI.

Multi-dimensional ambiguity function for subarray-based space-time coding radar

Space-time coding radar has been recently proposed and investigated.It is a radar framework which can perform transmit beamforming at the receiver.However,the range resolution decreases when the number of the transmit element increases.A subarray-based space-time coding(sub-STC)radar is explored to alleviate the range resolution reduction.For the proposed radar configuration,an identical waveform is transmitted and it introduces a small time offset in different subarrays.The multidimensional ambiguity function of sub-STC radar is defined by considering resolutions in multiple domains including the range,Doppler,angle and probing direction.Analyses on properties of the multi-dimensional ambiguity function of the sub-STC radar with regard to the spatial coverage,resolution performance and low sidelobes are also given.Results reveal that the range resolution and low sidelobes performance are improved with the proposed approach.

An Efficient Space-Time Coding Scheme for Time Dispersive MIMO Channels

In this paper, we introduce an efficient space-time coding scheme for time dispersive Multiple-Input Multiple-Output (MIMO) channels. Channel layering and Orthogonal Frequency Division Multiplexing (OFDM) technique are used in the proposed scheme. The proposed scheme is based on maximizing the distance between any two codewords. This is done by inserting an optimized phase shifts between the symbols in the same layer and between different layers. This way leads to the increase of the achieved diversity and coding gains. As a result, the performance of the system will be improved. Simulation results show the efficiency of the proposed scheme compared to the conventional schemes.

Comparative Study of Different Space-Time Coding Schemes for MC-CDMA Systems

In this paper, performance of space-time trellis-code (STTC), space-time block code (STBC), and space-time trellis-code concatenated with space-time block code (STTC-STBC) for multi-carrier code-division multiple-access (MC-CDMA) system are studied. These schemes are considered by employing different detection techniques with various multi input multi output (MIMO) antenna diversity for different number of states in multi-path fading channel. The corresponding bit error rate (BER) is obtained using simulation for minimum mean-square error (MMSE), maximum-ratio combining (MRC), and equal-gain combining (EGC) receivers employing Viterbi decoder. The simulation results show that the STTC-STBC MC-CDMA system perform better compared to other schemes considered in this paper using MMSE detection and it is also observed that the performance can also be enhanced by increasing diversity using more transmitter and receiver antennas. However, this improvement in performance comes at the cost of increased computational complexity, which is calculated for different transmitting and receiving antennas.

LDPC based time-frequency double differential space-time coding for multi-antenna OFDM systems

Differential space-time coding was proposed recently in the literature for multi-antenna systems, where neither the transmitter nor the receiver knows the fading coefficients. Among existing schemes, double differential space-time (DDST) coding is of special interest because it is applicable to continuous fast time-varying channels. However, it is less effective in fre- quency-selective fading channels. This paper’s authors derived a novel time-frequency double differential space-time (TF-DDST) coding scheme for multi-antenna orthogonal frequency division multiplexing (OFDM) systems in a time-varying fre- quency-selective fading environment, where double differential space-time coding is introduced into both time domain and fre- quency domain. Our proposed TF-DDST-OFDM system has a low-complexity non-coherent decoding scheme and is robust for time- and frequency-selective Rayleigh fading. In this paper, we also propose the use of state-of-the-art low-density parity-check (LDPC) code in serial concatenation with our TF-DDST scheme as a channel code. Simulations revealed that the LDPC based TF-DDST OFDM system has low decoding complexity and relatively better performance.

Space-time spreading and space-time coding for correlated frequency-selective channel in the presence of interference

The space-time spreading(STS),superimposed training sequences and space-time coding(STC)are adopted to obtain a closed-form of average error probability upper bound and maximum likelihood esti-mation expression for multiple input and multiple output(MIMO)correlated frequency-selective channelin the presence of interference(colored interference).Moreover,the correlation at both ends of the wire-less link that can be incorporated equivalently into correlation at the transmit end is derived.Finally,themean square error(MSE)of the maximum likelihood estimate is also derived.

Robust Space-Time Adaptive Track-Before-Detect Algorithm Based on Persymmetry and Symmetric Spectrum

Underwater monopulse space-time adaptive track-before-detect method,which combines space-time adaptive detector(STAD)and the track-before-detect algorithm based on dynamic programming(DP-TBD),denoted as STAD-DP-TBD,can effectively detect low-speed weak targets.However,due to the complexity and variability of the underwater environment,it is difficult to obtain sufficient secondary data,resulting in a serious decline in the detection and tracking performance,and leading to poor robustness of the algorithm.In this paper,based on the adaptive matched filter(AMF)test and the RAO test,underwater monopulse AMF-DP-TBD algorithm and RAO-DP-TBD algorithm which incorporate persymmetry and symmetric spectrum,denoted as PSAMF-DP-TBD and PS-RAO-DP-TBD,are proposed and compared with the AMF-DP-TBD algorithm and RAO-DP-TBD algorithm based on persymmetry array,denoted as P-AMF-DP-TBD and P-RAO-DP-TBD.The simulation results show that the four methods can work normally with sufficient secondary data and slightly insufficient secondary data,but when the secondary data is severely insufficient,the P-AMF-DP-TBD and P-RAO-DP-TBD algorithms has failed while the PSAMF-DP-TBD and PS-RAO-DP-TBD algorithms still have good detection and tracking capabilities.

Decoding topological XYZ^(2) codes with reinforcement learning based on attention mechanisms

Quantum error correction, a technique that relies on the principle of redundancy to encode logical information into additional qubits to better protect the system from noise, is necessary to design a viable quantum computer. For this new topological stabilizer code-XYZ^(2) code defined on the cellular lattice, it is implemented on a hexagonal lattice of qubits and it encodes the logical qubits with the help of stabilizer measurements of weight six and weight two. However topological stabilizer codes in cellular lattice quantum systems suffer from the detrimental effects of noise due to interaction with the environment. Several decoding approaches have been proposed to address this problem. Here, we propose the use of a state-attention based reinforcement learning decoder to decode XYZ^(2) codes, which enables the decoder to more accurately focus on the information related to the current decoding position, and the error correction accuracy of our reinforcement learning decoder model under the optimisation conditions can reach 83.27% under the depolarizing noise model, and we have measured thresholds of 0.18856 and 0.19043 for XYZ^(2) codes at code spacing of 3–7 and 7–11, respectively. our study provides directions and ideas for applications of decoding schemes combining reinforcement learning attention mechanisms to other topological quantum error-correcting codes.

Recurrent neural network decoding of rotated surface codes based on distributed strategy

Quantum error correction is a crucial technology for realizing quantum computers.These computers achieve faulttolerant quantum computing by detecting and correcting errors using decoding algorithms.Quantum error correction using neural network-based machine learning methods is a promising approach that is adapted to physical systems without the need to build noise models.In this paper,we use a distributed decoding strategy,which effectively alleviates the problem of exponential growth of the training set required for neural networks as the code distance of quantum error-correcting codes increases.Our decoding algorithm is based on renormalization group decoding and recurrent neural network decoder.The recurrent neural network is trained through the ResNet architecture to improve its decoding accuracy.Then we test the decoding performance of our distributed strategy decoder,recurrent neural network decoder,and the classic minimum weight perfect matching(MWPM)decoder for rotated surface codes with different code distances under the circuit noise model,the thresholds of these three decoders are about 0.0052,0.0051,and 0.0049,respectively.Our results demonstrate that the distributed strategy decoder outperforms the other two decoders,achieving approximately a 5%improvement in decoding efficiency compared to the MWPM decoder and approximately a 2%improvement compared to the recurrent neural network decoder.

Improved Segmented Belief Propagation List Decoding for Polar Codes with Bit-Flipping

Belief propagation list(BPL) decoding for polar codes has attracted more attention due to its inherent parallel nature. However, a large gap still exists with CRC-aided SCL(CA-SCL) decoding.In this work, an improved segmented belief propagation list decoding based on bit flipping(SBPL-BF) is proposed. On the one hand, the proposed algorithm makes use of the cooperative characteristic in BPL decoding such that the codeword is decoded in different BP decoders. Based on this characteristic, the unreliable bits for flipping could be split into multiple subblocks and could be flipped in different decoders simultaneously. On the other hand, a more flexible and effective processing strategy for the priori information of the unfrozen bits that do not need to be flipped is designed to improve the decoding convergence. In addition, this is the first proposal in BPL decoding which jointly optimizes the bit flipping of the information bits and the code bits. In particular, for bit flipping of the code bits, a H-matrix aided bit-flipping algorithm is designed to enhance the accuracy in identifying erroneous code bits. The simulation results show that the proposed algorithm significantly improves the errorcorrection performance of BPL decoding for medium and long codes. It is more than 0.25 d B better than the state-of-the-art BPL decoding at a block error rate(BLER) of 10^(-5), and outperforms CA-SCL decoding in the low signal-to-noise(SNR) region for(1024, 0.5)polar codes.

Curved Space-Time at the Planck Scale

This paper presents a physically plausible and somewhat illuminating first step in extending the fundamental principles of mechanical stress and strain to space-time. Here the geometry of space-time, encoded in the metric tensor, is considered to be made up of a dynamic lattice of extremely small, localized fields that form a perfectly elastic Lorentz symmetric space-time at the global (macroscopic) scale. This theoretical model of space-time at the Planck scale leads to a somewhat surprising result in which matter waves in curved space-time radiate thermal gravitational energy, as well as an equally intriguing relationship for the anomalous dispersion of light in a gravitational field.

UNIT-RATE COMPLEX ORTHOGONAL SPACE-TIME BLOCK CODE CONCATENATED WITH TURBO CODING

Space-Time Block (STB) code has been an effective transmit diversity technique for combating fading due to its orthogonal design, simple decoding and high diversity gains. In this paper, a unit-rate complex orthogonal STB code for multiple antennas in Time Division Duplex (TDD) mode is proposed. Meanwhile, Turbo Coding (TC) is employed to improve the performance of proposed STB code further by utilizing its good ability to combat the burst error of fading channel. Compared with full-diversity multiple antennas STB codes, the proposed code can implement unit rate and partial diversity; and it has much smaller computational complexity under the same system throughput. Moreover, the application of TC can effectively make up for the performance loss due to partial diversity. Simulation results show that on the condition of same system throughput and concatenation of TC, the proposed code has lower Bit Error Rate (BER) than those full-diversity codes.

REDUCED-COMPLEXITY DECODING ALGORITHMS FOR UNITARY SPACE-TIME CODES

Two reduced-complexity decoding algorithms for unitary space-time codes based on tree-structured constellation are presented. In this letter original unitary space-time constellation is divided into several groups. Each one is treated as the leaf nodes set of a subtree. Choosing the unitary signals that represent each group as the roots of these subtrees generates a tree-structured constellation. The proposed tree search decoder decides to which sub tree the receive signal belongs by searching in the set of subtree roots. The final decision is made after a local search in the leaf nodes set of the se-lected sub tree. The adjacent subtree joint decoder performs joint search in the selected sub tree and its “surrounding” subtrees,which improves the Bit Error Rate (BER) performance of purely tree search method. The exhaustively search in the whole constellation is avoided in our proposed decoding al-gorithms,a lower complexity is obtained compared to that of Maximum Likelihood (ML) decoding. Simulation results have also been provided to demonstrate the feasibility of these new methods.

Performance of Cross-Layer Design with Power Allocation in Space-Time Coded MIMO Systems

A cross-layer design(CLD)scheme with combination of power allocation,adaptive modulation(AM)and automatic repeat request(ARQ)is presented for space-time coded MIMO system under imperfect feedback,and the corresponding system performance is investigated in a Rayleigh fading channel.Based on imperfect feedback information,a suboptimal power allocation(PA)scheme is derived to maximize the average spectral efficiency(SE)of the system.The scheme is based on a so-called compressed SNR criterion,and has a closed-form expression for positive power allocation,thus being computationally efficient.Moreover,it can improve SE of the presented CLD.Besides,due to better approximation,it obtains the performance close to the existing optimal approach which requires numerical search.Simulation results show that the proposed CLD with PA can achieve higher SE than the conventional CLD with equal power allocation scheme,and has almost the same performance as CLD with optimal PA.However,it has lower calculation complexity.

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.

Adaptive OFDM system based on space-time block code

To satisfy the request of wireless communication for new generation communication system, a new scheme consisting of a combination of adaptive technology and space-time code-OFDM is presented. The proposed method, exploits adaptive bit allocation scheme over multipath fading channel. Numerical simulations have shown that the proposed scheme can greatly improve the performance of non-adaptive STBC-OFDM system.

Deep Learning Aided SCL Decoding of Polar Codes with Shifted-Pruning

Recently,a generalized successive cancellation list(SCL)decoder implemented with shiftedpruning(SP)scheme,namely the SCL-SP-ωdecoder,is presented for polar codes,which is able to shift the pruning window at mostωtimes during each SCL re-decoding attempt to prevent the correct path from being eliminated.The candidate positions for applying the SP scheme are selected by a shifting metric based on the probability that the elimination occurs.However,the number of exponential/logarithm operations involved in the SCL-SP-ωdecoder grows linearly with the number of information bits and list size,which leads to high computational complexity.In this paper,we present a detailed analysis of the SCL-SP-ωdecoder in terms of the decoding performance and complexity,which unveils that the choice of the shifting metric is essential for improving the decoding performance and reducing the re-decoding attempts simultaneously.Then,we introduce a simplified metric derived from the path metric(PM)domain,and a custom-tailored deep learning(DL)network is further designed to enhance the efficiency of the proposed simplified metric.The proposed metrics are both free of transcendental functions and hence,are more hardware-friendly than the existing metrics.Simulation results show that the proposed DL-aided metric provides the best error correction performance as comparison with the state of the art.

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.

REAL PALEY-WIENER THEOREMS FOR THE SPACE-TIME FOURIER TRANSFORM

This paper presents an extension of certain forms of the real Paley-Wiener theorems to the Minkowski space-time algebra. Our emphasis is dedicated to determining the space-time valued functions whose space-time Fourier transforms(SFT) have compact support using the partial derivatives operator and the Dirac operator of higher order.