Forward-backward algorithm, used by watermark decoder for correcting non-binary synchronization errors, requires to traverse a very large scale trellis in order to achieve the proper posterior probability, leading to ...Forward-backward algorithm, used by watermark decoder for correcting non-binary synchronization errors, requires to traverse a very large scale trellis in order to achieve the proper posterior probability, leading to high computational complexity. In order to reduce the number of the states involved in the computation, an adaptive pruning method for the trellis is proposed. In this scheme, we prune the states which have the low forward-backward quantities below a carefully-chosen threshold. Thus, a wandering trellis with much less states is achieved, which contains most of the states with quite high probability. Simulation results reveal that, with the proper scaling factor, significant complexity reduction in the forward-backward algorithm is achieved at the expense of slight performance degradation.展开更多
A proposal for smooth aggressive location restoration by forwarding pointer is given in this paper. A mobile communication system＇s robustness in case of a location-database failure is improved without the need for p...A proposal for smooth aggressive location restoration by forwarding pointer is given in this paper. A mobile communication system＇s robustness in case of a location-database failure is improved without the need for periodic location update operations. Radio resources would be saved at the cost of wire signal and operation of location databases. Meanwhile, a chain of forwarding location pointers has been used during the period of HLR failure. So mobile stations are unconscious of the failure of HLR, and mobile subscribers can always make outgoing call.展开更多
This paper introduces an effective software-based FEC redundant packets generating algorithm. The algorithm is based on Reed-Solomon coding over Galois Field. By operating on words of packets and performing polynomial...This paper introduces an effective software-based FEC redundant packets generating algorithm. The algorithm is based on Reed-Solomon coding over Galois Field. By operating on words of packets and performing polynomial multiplication via lookup tables, software coding efficiency is achieved to satisfy the needs of most of computer network applications. The approach to generate lookup tables is detailed.展开更多
Reflection data in CMP has influenced seriously in static calculations,especially in some highly weathered and structurally altered circumstances. Because of static correction in the existed problems and requests,the ...Reflection data in CMP has influenced seriously in static calculations,especially in some highly weathered and structurally altered circumstances. Because of static correction in the existed problems and requests,the authors studied the angle dependent tomographic static correction,and discussed its basic theory, including the establishment of forward model,the calculation theory of tomography and tomographic static correction. The usage of theoretical models and practical information on the method has been validated. The results show that using these methods to calculate static correction in a complex area,the quality of static correction is greatly improved.展开更多
基金supported in part by National Natural Science Foundation of China (61101114, 61671324) the Program for New Century Excellent Talents in University (NCET-12-0401)
文摘Forward-backward algorithm, used by watermark decoder for correcting non-binary synchronization errors, requires to traverse a very large scale trellis in order to achieve the proper posterior probability, leading to high computational complexity. In order to reduce the number of the states involved in the computation, an adaptive pruning method for the trellis is proposed. In this scheme, we prune the states which have the low forward-backward quantities below a carefully-chosen threshold. Thus, a wandering trellis with much less states is achieved, which contains most of the states with quite high probability. Simulation results reveal that, with the proper scaling factor, significant complexity reduction in the forward-backward algorithm is achieved at the expense of slight performance degradation.
文摘A proposal for smooth aggressive location restoration by forwarding pointer is given in this paper. A mobile communication system＇s robustness in case of a location-database failure is improved without the need for periodic location update operations. Radio resources would be saved at the cost of wire signal and operation of location databases. Meanwhile, a chain of forwarding location pointers has been used during the period of HLR failure. So mobile stations are unconscious of the failure of HLR, and mobile subscribers can always make outgoing call.
文摘This paper introduces an effective software-based FEC redundant packets generating algorithm. The algorithm is based on Reed-Solomon coding over Galois Field. By operating on words of packets and performing polynomial multiplication via lookup tables, software coding efficiency is achieved to satisfy the needs of most of computer network applications. The approach to generate lookup tables is detailed.
文摘Reflection data in CMP has influenced seriously in static calculations,especially in some highly weathered and structurally altered circumstances. Because of static correction in the existed problems and requests,the authors studied the angle dependent tomographic static correction,and discussed its basic theory, including the establishment of forward model,the calculation theory of tomography and tomographic static correction. The usage of theoretical models and practical information on the method has been validated. The results show that using these methods to calculate static correction in a complex area,the quality of static correction is greatly improved.
