The factor having effect on compostie errors of long gage blocks and their control are discussed, and a ba-sis is therefore provided for driprovement of composite accuracy. Calculations and experiments were conduted f...The factor having effect on compostie errors of long gage blocks and their control are discussed, and a ba-sis is therefore provided for driprovement of composite accuracy. Calculations and experiments were conduted for de-formation error resulting for clamp foree and the effect of additional bending moment on parallelism of the measure-ment surfaces. With gage blocks of different length in good conact, clamp force and suppotrs properly chosen, the composite error can be controlled within 0.1μp by reducing or eliminating the effect of additional bending moment on parallelism of measurement surfaces.展开更多
A block representation of the BLU factorization for block tridiagonal matrices is presented. Some properties on the factors obtained in the course of the factorization are studied. Simpler expressions for errors incur...A block representation of the BLU factorization for block tridiagonal matrices is presented. Some properties on the factors obtained in the course of the factorization are studied. Simpler expressions for errors incurred at the process of the factorization for block tridiagonal matrices are considered.展开更多
Based on elementary group theory, the block pivot methods for solving two-dimensional elastic frictional contact problems are presented in this paper. It is proved that the algorithms converge within a finite number o...Based on elementary group theory, the block pivot methods for solving two-dimensional elastic frictional contact problems are presented in this paper. It is proved that the algorithms converge within a finite number of steps when the friction coefficient is ''relative small''. Unlike most mathematical programming methods for contact problems, the block pivot methods permit multiple exchanges of basic and nonbasic variables.展开更多
The definition of good codes for error-detection is given. It is proved that a (n, k) linear block code in GF(q) are the good code for error-detection, if and only if its dual code is also. A series of new results abo...The definition of good codes for error-detection is given. It is proved that a (n, k) linear block code in GF(q) are the good code for error-detection, if and only if its dual code is also. A series of new results about the good codes for error-detection are derived. New lower bounds for undetected error probabilities are obtained, which are relative to n and k only, and not the weight structure of the 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 transmit...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展开更多
最小均方误差(Minimum Mean Square Error,MMSE)检测算法是大规模多输入多输出(massive MIMO)系统中能够实现接近最优检测性能的一种算法,但包含对高维矩阵的求逆运算,复杂度较高,因此不适合应用在实际工程中。针对这一问题,文章基于矩...最小均方误差(Minimum Mean Square Error,MMSE)检测算法是大规模多输入多输出(massive MIMO)系统中能够实现接近最优检测性能的一种算法,但包含对高维矩阵的求逆运算,复杂度较高,因此不适合应用在实际工程中。针对这一问题,文章基于矩阵分块思想和理查德森(Richardson,RI)算法,提出了一种预处理的理查德森(Pretreatment-Richardson,P-RI)迭代算法,该算法首先基于矩阵分块思想构造了一种新形式的线性迭代,然后用此线性迭代对理查德森算法进行预处理,有效提升了算法的收敛速度。实验结果显示,与现有的RI算法相比,该算法的检测性能更好。展开更多
文摘The factor having effect on compostie errors of long gage blocks and their control are discussed, and a ba-sis is therefore provided for driprovement of composite accuracy. Calculations and experiments were conduted for de-formation error resulting for clamp foree and the effect of additional bending moment on parallelism of the measure-ment surfaces. With gage blocks of different length in good conact, clamp force and suppotrs properly chosen, the composite error can be controlled within 0.1μp by reducing or eliminating the effect of additional bending moment on parallelism of measurement surfaces.
文摘A block representation of the BLU factorization for block tridiagonal matrices is presented. Some properties on the factors obtained in the course of the factorization are studied. Simpler expressions for errors incurred at the process of the factorization for block tridiagonal matrices are considered.
基金The project supported by the National Natural Science Foundation of China
文摘Based on elementary group theory, the block pivot methods for solving two-dimensional elastic frictional contact problems are presented in this paper. It is proved that the algorithms converge within a finite number of steps when the friction coefficient is ''relative small''. Unlike most mathematical programming methods for contact problems, the block pivot methods permit multiple exchanges of basic and nonbasic variables.
文摘The definition of good codes for error-detection is given. It is proved that a (n, k) linear block code in GF(q) are the good code for error-detection, if and only if its dual code is also. A series of new results about the good codes for error-detection are derived. New lower bounds for undetected error probabilities are obtained, which are relative to n and k only, and not the weight structure of the codes.
基金This project was supported by the National Natural Science Foundation of China (60172018) .
文摘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
文摘最小均方误差(Minimum Mean Square Error,MMSE)检测算法是大规模多输入多输出(massive MIMO)系统中能够实现接近最优检测性能的一种算法,但包含对高维矩阵的求逆运算,复杂度较高,因此不适合应用在实际工程中。针对这一问题,文章基于矩阵分块思想和理查德森(Richardson,RI)算法,提出了一种预处理的理查德森(Pretreatment-Richardson,P-RI)迭代算法,该算法首先基于矩阵分块思想构造了一种新形式的线性迭代,然后用此线性迭代对理查德森算法进行预处理,有效提升了算法的收敛速度。实验结果显示,与现有的RI算法相比,该算法的检测性能更好。
