Virtually coupled train set control subject to space-time separation:A distributed economic MPC approach with emergency braking configuration

The emerging virtual coupling technology aims to operate multiple train units in a Virtually Coupled Train Set(VCTS)at a minimal but safe distance.To guarantee collision avoidance,the safety distance should be calculated using the state-of-the-art space-time separation principle that separates the Emergency Braking(EB)trajectories of two successive units during the whole EB process.In this case,the minimal safety distance is usually numerically calculated without an analytic formulation.Thus,the constrained VCTS control problem is hard to address with space-time separation,which is still a gap in the existing literature.To solve this problem,we propose a Distributed Economic Model Predictive Control(DEMPC)approach with computation efficiency and theoretical guarantee.Specifically,to alleviate the computation burden,we transform implicit safety constraints into explicitly linear ones,such that the optimal control problem in DEMPC is a quadratic programming problem that can be solved efficiently.For theoretical analysis,sufficient conditions are derived to guarantee the recursive feasibility and stability of DEMPC,employing compatibility constraints,tube techniques and terminal ingredient tuning.Moreover,we extend our approach with globally optimal and distributed online EB configuration methods to shorten the minimal distance among VCTS.Finally,experimental results demonstrate the performance and advantages of the proposed approaches.

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.

Joint DOA and time delay estimation method for space-time coherent distributed signals based on search

Under dense urban fading environment, performance of joint multi-path parameter estimation method based on traditional point signal model degrades seriously. In this paper, a new space and time signal model based on multipath distribution function is given after new space and time manifold is reconstructed. Then joint spacetime signal subspace is obtained by converting acquired channel from time domain to frequency domain .Then space and time spectrum is formulated by the space sub-matrix and time sub-matrix taken out of joint space-time signal subspace, and parameters are estimated by searching the minimum eigenvalues of the space matrix and the time matrix. Lastly, A space and time parameters matching process is performed by using the orthogonal property between joint noise subspace and the space-time manifold. In contrast with tradition MUSIC, the algorithm we present here only need two 1- dimension searching and was not sensitive to different distribution function.

Improved scheme with cooperative diversity based on distributed space-time block coding

An improved scheme with cooperative diversity based on distributed space-time block coding （WCD- DSTBC） is proposed, which effectively achieves diversity gains and improves the performance of the system by sharing some single-antenna users＇ antennas to form a virtual antenna array and combining with distributed spacetime block coding （DSTBC） mode. Then the relation between the system BER and the interuser BER for WCDDSTBC scheme is theoretically derived and the closed-form expression of BER for WCD-DSTBC system is obtained. The simulation results show that the proposed WCD-DSTBC scheme achieves distinct gains over the non-cooperative multi-carrier CDMA （MC-CDMA） system. When system BER is le-3 and interuser BER is le-3, about 2.5 dB gain can be gotten. When interuser channel state information （CSI） outgoes the users＇ individual CSI, about 3 dB gain is also achieved.

Design of super-orthogonal space-time trellis codes based on trace criterion

A design of super-orthogonal space-time trellis codes （SOSTTCs） based on the trace criterion （TC） is proposed for improving the design of SOSTTCs. The shortcomings of the rank and determinant criteria based design and the advantages of the TC-based design are analyzed. The optimization principle of four factors is presented, which includes the space-time block coding （STBC） scheme, set partitioning, trellis structure, and the assignment of signal subsets and STBC schemes in the trellis. According to this principle, systematical and handcrafted design steps are given in detail. By constellation expansion, the code performance can be further improved. The code design results are given, and the new codes outperform others in the simulation.

Hybrid DF and SIR Forwarding Strategy in Conventional and Distributed Alamouti Space-Time Coded Cooperative Networks

In this paper,we propose a hybrid decode-and-forward and soft information relaying(HDFSIR)strategy to mitigate error propagation in coded cooperative communications.In the HDFSIR approach,the relay operates in decode-and-forward(DF)mode when it successfully decodes the received message;otherwise,it switches to soft information relaying(SIR)mode.The benefits of the DF and SIR forwarding strategies are combined to achieve better performance than deploying the DF or SIR strategy alone.Closed-form expressions for the outage probability and symbol error rate(SER)are derived for coded cooperative communication with HDFSIR and energy-harvesting relays.Additionally,we introduce a novel normalized log-likelihood-ratio based soft estimation symbol(NL-SES)mapping technique,which enhances soft symbol accuracy for higher-order modulation,and propose a model characterizing the relationship between the estimated complex soft symbol and the actual high-order modulated symbol.Further-more,the hybrid DF-SIR strategy is extended to a distributed Alamouti space-time-coded cooperative network.To evaluate the~performance of the proposed HDFSIR strategy,we implement extensive Monte Carlo simulations under varying channel conditions.Results demonstrate significant improvements with the hybrid technique outperforming individual DF and SIR strategies in both conventional and distributed Alamouti space-time coded cooperative networks.Moreover,at a SER of 10^(-3),the proposed NL-SES mapping demonstrated a 3.5 dB performance gain over the conventional averaging one,highlighting its superior accuracy in estimating soft symbols for quadrature phase-shift keying modulation.

On analyzing space-time distribution of evaporation duct height over the global ocean

The statistical features of the evaporation duct over the global ocean were comprehensively investigated with reanalysis data sets from the National Centers for Environmental Prediction. These data sets have time and spatial resolutions of 1 h and 0.313°x0.312°, respectively. The efficiency of the analysis was evaluated by processing weather buoy data from the Pacific Ocean and measuring propagation loss in the Yellow Sea of China. The distribution features of evaporation duct height （EDH） and the related meteorological factors for different seas were analyzed. The global EDH is generally high and demonstrates a latitudinal distribution for oceans at low latitudes. The average EDH is approximately 11 m over oceans beside the equator with a latitude of less than 20°. The reasons for the formation of the global EDH features were also analyzed for different sea areas.

Tree-Structured Parallel Regeneration for Multiple Data Losses in Distributed Storage Systems Based on Erasure Codes

To reduce the time required to complete the regeneration process of erasure codes, we propose a Tree-structured Parallel Regeneration (TPR) scheme for multiple data losses in distributed storage systems. Under the scheme, two algorithms are proposed for the construction of multiple regeneration trees, namely the edge-disjoint algorithm and edge-sharing algorithm. The edge-disjoint algorithm constructs multiple independent trees, and is simple and appropriate for environments where newcomers and their providers are distributed over a large area and have few intersections. The edge-sharing algorithm constructs multiple trees that compete to utilize the bandwidth, and make a better utilization of the bandwidth, although it needs to measure the available band-width and deal with the bandwidth changes; it is therefore difficult to implement in practical systems. The parallel regeneration for multiple data losses of TPR primarily includes two optimizations: firstly, transferring the data through the bandwidth optimized-paths in a pipe-line manner; secondly, executing data regeneration over multiple trees in parallel. To evaluate the proposal, we implement an event-based simulator and make a detailed comparison with some popular regeneration methods. The quantitative comparison results show that the use of TPR employing either the edge-disjoint algorithm or edge-sharing algorithm reduces the regeneration time significantly.

Locally Minimum Storage Regenerating Codes in Distributed Cloud Storage Systems

In distributed cloud storage systems, inevitably there exist multiple node failures at the same time. The existing methods of regenerating codes, including minimum storage regenerating(MSR) codes and minimum bandwidth regenerating(MBR) codes, are mainly to repair one single or several failed nodes, unable to meet the repair need of distributed cloud storage systems. In this paper, we present locally minimum storage regenerating(LMSR) codes to recover multiple failed nodes at the same time. Specifically, the nodes in distributed cloud storage systems are divided into multiple local groups, and in each local group(4, 2) or(5, 3) MSR codes are constructed. Moreover, the grouping method of storage nodes and the repairing process of failed nodes in local groups are studied. Theoretical analysis shows that LMSR codes can achieve the same storage overhead as MSR codes. Furthermore, we verify by means of simulation that, compared with MSR codes, LMSR codes can reduce the repair bandwidth and disk I/O overhead effectively.

Low complexity DCT-based distributed source coding with Gray code for hyperspectral images

To compress hyperspectral images, a low complexity discrete cosine transform （DCT）-based distributed source coding （DSC） scheme with Gray code is proposed. Unlike most of the existing DSC schemes, which utilize transform in spatial domain, the proposed algorithm applies transform in spectral domain. Set-partitioning-based approach is applied to reorganize DCT coefficients into waveletlike tree structure and extract the sign, refinement, and significance bitplanes. The extracted refinement bits are Gray encoded. Because of the dependency along the line dimension of hyperspectral images, low density paritycheck-（LDPC）-based Slepian-Wolf coder is adopted to implement the DSC strategy. Experimental results on airborne visible/infrared imaging spectrometer （AVIRIS） dataset show that the proposed paradigm achieves up to 6 dB improvement over DSC-based coders which apply transform in spatial domain, with significantly reduced computational complexity and memory storage.

DESIGN OF EXACT REGENERATING HIERARCHICAL CODE FOR DISTRIBUTED STORAGE SYSTEM

Erasure code is widely used as the redundancy scheme in distributed storage system. When a storage node fails, the repair process often requires to transfer a large amount of data. Regenerating code and hierarchical code are two classes of codes proposed to reduce the repair bandwidth cost. Regenerating codes reduce the amount of data transferred by each helping node, while hierarchical codes reduce the number of nodes participating in the repair process. In this paper, we propose a "sub-code nesting framework" to combine them together. The resulting regenerating hierarchical code has low repair degree as hierarchical code and lower repair cost than hierarchical code. Our code can achieve exact regeneration of the failed node, and has the additional property of low updating complexity.

Code Design and Latency Analysis of Distributed Matrix Multiplication with Straggling Servers in Fading Channels

This paper exploits coding to speed up computation offloading in a multi-server mobile edge computing(MEC)network with straggling servers and channel fading.The specific task we consider is to compute the product between a user-generated input data matrix and a large-scale model matrix that is stored distributively across the multiple edge nodes.The key idea of coding is to introduce computation redundancy to improve robustness against straggling servers and to create communication redundancy to improve reliability against channel fading.We utilize the hybrid design of maximum distance separable(MDS)coding and repetition coding.Based on the hybrid coding scheme,we conduct theoretical analysis on the average task uploading time,average edge computing time,and average output downloading time,respectively and then obtain the end-to-end task execution time.Numerical results demonstrate that when the task uploading phase or the edge computing phase is the performance bottleneck,the hybrid coding reduces to MDS coding;when the downlink transmission is the bottleneck,the hybrid coding reduces to repetition coding.The hybrid coding also outperforms the entangled polynomial coding that causes higher uplink and downlink communication loads.

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 VERTICAL LAYERED SPACE-TIME CODE AND ITS CLOSED-FORM BLIND SYMBOL DETECTION

Vertical layered space-time codes have demonstrated the enormous potential to accommodate rapid flow data. Thus far, vertical layered space-time codes assumed that perfect estimates of current channel fading conditions are available at the receiver. However, increasing the number of transmit antennas increases the required training interval and reduces the available time in which data may be transmitted before the fading coefficients change. In this paper, a vertical layered space-time code is proposed. By applying the subspace method to the layered space-time code, the symbols can be detected without training symbols and channel estimates at the transmitter or the receiver. Monte Carlo simulations show that performance can approach that of the detection method with the knowledge of the channel.

Simulation and Prediction on Space-Time Distribution of Water Quality in Dianchi Lake

It is very important in pollution treatment to clarify the space-time distribution of water quality in Dianchi Lake. Based on the sample data obtained from 10 observation stations every month from 2008 to 2009, it uses space-time semi-variogram and ordinary kriging method to simulate the space-time variance and distribution of water quality indictors (TN, TP, BOD, CODMn, DO, Chlorophyl-α, etc.). Because the space-time semivariogram also has a certain of ex-trapolation function. From the simulation results, the pollution is mainly concentrated at the North (Caohai) and the Southwest area (Haikou), and water pollution has a increase trend.

WATER-FILLING SPACE-TIME CODE IN CORRELATED FLAT RAYLEIGH FADING MISO CHANNELS

In this paper, STC with water-filling transmit power distribution in MISO system is proposed when the partial channel information feedback is possible, for example, at slow fading scenario. The performances of the water-filling STC including water-filling STTC and water-filling STBC are analyzed. Performance comparison of the Ungerboeck's 2/3 trellis coded 8PSK modulated 2-STBC and 2-STTCs with QPSK is given out in different channel correlation.

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.

Design and implementation of space-time precoded systems with full diversity and lossless capacity

A new space-time(ST)code design is proposed based on the design criteria of space-time codes,which is applied to the MIMO systems with fewer receive antennas than transmit antennas.The space-time codes,referred to as full diversity lossless capacity(FDLLC)ST code,achieve full transmit diversity and lossless equivalent channel capacity for ST precoded systems.Combined FDLLC-ST codes with channel codes,ST bit interleaved coded modulation(ST-BICM)system is constructed and an iterative detector/decoder is employed at the receiver.Simulations are presented.It is proved that the proposed design has good performance compared with other ST precoded MIMO systems.

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

Design of concatenated turbo-SPC coded space-time systems

Multiple antenna wireless systems can provide larger channel capacity and enable spatial diversity to combat fading. In this paper we conduct an investigation into the design of coded space-time system obtained by serially concatenating channel code module and space-time code module with an interleaver in between. As an example, the system is constructed by employing low decoding complexity turbo-SPC （single parity check） code as outer module and linear complex field space-time code as inner module, which achieves full diversity and lossless equivalent channel capacity. Simulation results prove that our designed system performs well and it only loses 0.8 dB from multiple-input multiple-output （MIMO） capacity at BER = 10^-5 in the case of information bit length 6048. Compared with turbo code-based systems, it also has lower error floor.