This paper is concerned with the investigation, experiment and design analyses on the application of active magnetic bearings for a 150M 3 turbo oxygen gas expander having 1.16 kg weight and 30 mm diameter rotor, whi...This paper is concerned with the investigation, experiment and design analyses on the application of active magnetic bearings for a 150M 3 turbo oxygen gas expander having 1.16 kg weight and 30 mm diameter rotor, which was supported by two aerostatic bearings formerly. Now, the machine can work steady at a rotation speed of 92,000 r/min, and can be run up to a maximum rotation speed of 104,000 r/min.展开更多
A low-complexity algorithm is proposed in this paper in order to optimize irregular low-density parity-check (LDPC) codes.The algorithm proposed can calculate the noise threshold by means of a one-dimensional densit...A low-complexity algorithm is proposed in this paper in order to optimize irregular low-density parity-check (LDPC) codes.The algorithm proposed can calculate the noise threshold by means of a one-dimensional density evolution and search the optimal degree profiles with fast-convergence differential evolution,so that it has a lower complexity and a faster convergence speed.Simulation resuits show that the irregular LDPC codes optimized by the presented algorithm can also perform better than Turbo codes at moderate block length even with less computation cost.展开更多
文摘This paper is concerned with the investigation, experiment and design analyses on the application of active magnetic bearings for a 150M 3 turbo oxygen gas expander having 1.16 kg weight and 30 mm diameter rotor, which was supported by two aerostatic bearings formerly. Now, the machine can work steady at a rotation speed of 92,000 r/min, and can be run up to a maximum rotation speed of 104,000 r/min.
基金Leading Academic Discipline Project of Shanghai Municipal Education Commission,China(No.J51801)Shanghai Second Polytechnic University Foundation,China(No.QD209008)Leading Academic Discipline Project of Shanghai Second Polytechnic University,China(No.XXKZD1302)
文摘A low-complexity algorithm is proposed in this paper in order to optimize irregular low-density parity-check (LDPC) codes.The algorithm proposed can calculate the noise threshold by means of a one-dimensional density evolution and search the optimal degree profiles with fast-convergence differential evolution,so that it has a lower complexity and a faster convergence speed.Simulation resuits show that the irregular LDPC codes optimized by the presented algorithm can also perform better than Turbo codes at moderate block length even with less computation cost.