In this paper, according to the AR4JA codes in deep space communication, two kinds of iterative decoding including partly parallel decoding and overlapped partly parallel decoding are analyzed, and the advantages and disadvantages of them are listed. A modified overlapped partly parallel decoding that not only inherits the advantages of the two algorithms, but also overcomes the shortcomings of the two algorithms is proposed. The simulation results show that the three kinds of decoding have the same decoding performance; modified overlapped partly parallel decoding improves the iterative convergence rate and the throughput of system.
Digital fountain is applied into deep space communication for its rateless and non-feedback forward error correction.However,the long code length and encoding overhead are confined factors to guarantee a considerable recovery probability as power and buffer-limited equipment in deep space environment.At the same time,the typical fountain decoding is sub-optimum decoding algorithm.We propose a new approach,Dependent Sequences Compensation Algorithm(DSCA),to improve the encoding efficiency by restricting the randomness in fountain encoding.While decoding algorithm is also optimized by redundant information in stopping set.The results show that the optimized method can obtain a 10-4 decoding failure rate with overhead under 0.20 for code length 500,which indicates the usefulness of the proposed approach in deep space communication.
We consider differentiated timecritical task scheduling in a N×N input queued optical packet s w itch to ens ure 100% throughput and meet different delay requirements among various modules of data center. Existing schemes either consider slot-by-slot scheduling with queue depth serving as the delay metric or assume that each input-output connection has the same delay bound in the batch scheduling mode. The former scheme neglects the effect of reconfiguration overhead, which may result in crippled system performance, while the latter cannot satisfy users' differentiated Quality of Service(Qo S) requirements. To make up these deficiencies, we propose a new batch scheduling scheme to meet the various portto-port delay requirements in a best-effort manner. Moreover, a speedup is considered to compensate for both the reconfiguration overhead and the unavoidable slots wastage in the switch fabric. With traffic matrix and delay constraint matrix given, this paper proposes two heuristic algorithms Stringent Delay First(SDF) and m-order SDF(m-SDF) to realize the 100% packet switching, while maximizing the delay constraints satisfaction ratio. The performance of our scheme is verified by extensive numerical simulations.
LI YaofangXIAO JieWU BinWEN HongYU HongfangYANG ShuXIN ShanshanGUO Jianing
One of the issues of mobility management in a low Earth orbit (LEO) satellite network is the high-frequency location binding update initiated by mobile nodes (MNs).To solve this problem,we propose a location management scheme based on dual location area (LA) in an IP/LEO satellite network.The proposed scheme uses two kinds of LA,the fixed Earth station LA and satellite LA,to manage the location of the MNs together.MNs operate the binding update procedures only when they are moving out of both of the two LAs last registered.Geographical location information of MN is used in the binding update procedures,so that the network can page the idle MNs near their last registered location first,to enhance the probability of paging success.A detailed description of the implementation of the scheme is provided.Mathematical analysis shows that the proposed scheme reduces the location management cost and minimizes the influences of the distance between MN and its home agent.Paging cost is also reduced by introducing geographical location information in the binding update procedures.
