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.

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.

On the complete weight distributions of quantum error-correcting codes

In a recent paper, Hu et al. defined the complete weight distributions of quantum codes and proved the Mac Williams identities, and as applications they showed how such weight distributions may be used to obtain the singleton-type and hamming-type bounds for asymmetric quantum codes. In this paper we extend their study much further and obtain several new results concerning the complete weight distributions of quantum codes and applications. In particular, we provide a new proof of the Mac Williams identities of the complete weight distributions of quantum codes. We obtain new information about the weight distributions of quantum MDS codes and the double weight distribution of asymmetric quantum MDS codes. We get new identities involving the complete weight distributions of two different quantum codes. We estimate the complete weight distributions of quantum codes under special conditions and show that quantum BCH codes by the Hermitian construction from primitive, narrow-sense BCH codes satisfy these conditions and hence these estimate applies.

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.

Construction and Weight Distributions of Binary Linear Codes Based on Deep Holes

Deep holes are very important in the decoding of generalized RS codes, and deep holes of RS codes have been widely studied, but there are few works on constructing general linear codes based on deep holes. Therefore, we consider constructing binary linear codes by combining deep holes with binary BCH codes. In this article, we consider the 2-error-correcting binary primitive BCH codes and the extended codes to construct new binary linear codes by combining them with deep holes, respectively. Furthermore, three classes of binary linear codes are constructed, and then we determine the parameters and the weight distributions of these new binary linear codes.

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.

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.

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

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.

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.

Joint channel estimation and symbol detection for space-time block code

The simplified joint channel estimation and symbol detection based on the EM (expectation-maximization) algorithm for space-time block code (STBC) are proposed. By assuming channel to be invariant within only one STBC word and utilizing the orthogonal structure of STBC, the computational complexity and cost of this algorithm are both very low, so it is very suitable to implementation in real systems.

A Design Method of Noncoherent Unitary Space-Time Codes

We generalized an constructing method of noncoherent unitary space time codes (N-USTC) over Rayleigh flat fading channels. A family of N-USTCs with T symbol peroids, M transmit and N receive antennas was constructed by the exponential mapping method based on the tangent subspace of the Grassmann manifold. This exponential mapping method can transform the coherent space time codes (C-STC) into the N-USTC on the Grassmann manifold. We infered an universal framework of constructing a C-STC that is designed by using the algebraic number theory and has full rate and full diversity (FRFD) for t symbol periods and same antennas, where M, N, T, t are general positive integer. We discussed the constraint condition that the exponential mapping has only one solution, from which we presented a approach of searching the optimum adjustive factor αopt that can generate an optimum noncoherent codeword. For different code parameters M, N, T, t and the optimum adjustive factor αopt, we gave the simulation results of the several N-USTCs.

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 Dynamics of Dendroctonus valens Population in China and Spatial Sampling Technique based on Its Spatial Distribution Pattern

Red turpentine beetle （RTB）, Dendroctongs valens LeConte, is a destructive forest invasive species in China, it mainly attacks Pings tabuliformis and P. bungeana. So far it has spread rapidly to the provinces of Shanxi, Hebei, Henan, Shanxi and Beijing since its first outbreak in Shanxi Province in 1998, and has caused extensive tree mortality. Space-time dynamics of D. valens population and spatial sampling technique based on its spatial distribution pattern were ana- lyzed using geostatistical methods in the pure P. tabuliforis forests and mixedwood stands which were at different damage levels. According to the spatial distribu- tion of D. valeas population, the specific spatial sampling technique was also studied, and then was compared with traditional sampling technique. The spatial sam- piing technique combined with sampling theory and the biological characteristics of D. valens population, which not only could calcnlate the error of the sampling, but also could discuss the optimal sampling number and the optimum size of plot according to different damage levels and different stand types. This helps to explain population expansion and colonization mechanism of D. valens, and to provide a good reference for adopting snitable control measures.

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.

Distributed Video Coding Using LDPC Codes for Wireless Video

Popular video coding standards like H.264 and MPEG working on the principle of motion-compensated pre-dictive coding demand much of the computational resources at the encoder increasing its complexity. Such bulky encoders are not suitable for applications like wireless low power surveillance, multimedia sensor networks, wireless PC cameras, mobile camera phones etc. New video coding scheme based on the principle of distributed source coding is looked upon in this paper. This scheme supports a low complexity encoder, at the same time trying to achieve the rate distortion performance of conventional video codecs. Current im-plementation uses LDPC codes for syndrome coding.